4.5 Article

Adaptive memory programming for the vehicle routing problem with multiple trips

Journal

COMPUTERS & OPERATIONS RESEARCH
Volume 34, Issue 1, Pages 28-47

Publisher

PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2005.02.044

Keywords

vehicle routing; multiple trips; adaptive memory procedure

Ask authors/readers for more resources

The Vehicle Routing Problem with Multiple Trips is an extension of the classical Vehicle Routing Problem in which each vehicle may perform several routes in the same planning period. In this paper, an adaptive memory algorithm to solve this problem is proposed. Computational experience is reported over a set of benchmark problem instances. (c) 2005 Elsevier Ltd. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.5
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available