Adaptive memory programming for the vehicle routing problem with multiple trips

Computers and Operations Research

Volumn 34, Issue 1, 2007, Pages 28-47

  Olivera, Alfredo ^a   Viera, Omar ^a  

^a UNIVERSIDAD DE LA REPÚBLICA   (Uruguay)

Author keywords

Adaptive memory procedure; Multiple trips; Vehicle routing

Indexed keywords

ADAPTIVE SYSTEMS; BENCHMARKING; COMPUTATIONAL METHODS; COMPUTER PROGRAMMING; PROBLEM SOLVING;

ADAPTIVE MEMORY PROCEDURE; ADAPTIVE MEMORY PROGRAMMING; MULTIPLE TRIPS; VEHICLE ROUTING;

DATA STORAGE EQUIPMENT;

EID: 33746267205     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2005.02.044     Document Type: Article

References (29)

1. Toth P, Vigo D. The vehicle routing problem. SIAM Monographs on Discrete Mathematics and Applications, 2002.
2. Rochat Y., and Taillard E. Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics 1 (1995) 147-167
3. Lenstra J., and Rinnooy Kan A. Complexity of vehicle routing and scheduling problems. Networks 11 (1981) 221-227
4. Fleischmann B. The vehicle routing problem with multiple use of vehicles. Working paper, Fachbereich Wirtschaftswissenschaften, Universität Hamburg, 1990.
5. Clarke G., and Wright W. Scheduling of vehicles from a central depot to a number of delivery points. Operations Research 12 (1964) 568-581
6. Martello S., and Toth P. Knapsack problems (1990), Wiley, Chichester
7. Taillard E., Laporte G., and Gendreau M. The vehicle routing problem with multiple use of vehicles. Journal of the Operational Research Society 47 (1996) 1065-1070
8. Brandão J., and Mercer A. A tabu search algorithm for the multi-trip vehicle routing and scheduling problem. European Journal of Operational Research 100 (1997) 180-191
9. Brandão J., and Mercer A. The multi-trip vehicle routing problem. Journal of the Operational Research Society 49 (1998) 799-805
10. Gendreau M., Hertz A., and Laporte G. New insertion and post optimization procedures for the travelling salesman problem. Operations Research 40 (1992) 1086-1094
11. Petch R., and Salhi S. A multi-phase constructive heuristic for the vehicle routing problem with multiple trips. Discrete Applied Mathematics 133 (2004) 69-92
12. Yellow P. A computational modification to the savings method of vehicle scheduling. Operational Research Quarterly 21 (1970) 281-283
13. Balinsky M., and Quandt R. On an integer program for a delivery problem. Operations Research 12 (1964) 300-304
14. Christofides N., Mingozzi A., and Toth P. The vehicle routing problem. Combinatorial optimization (1979), Wiley, Chichester 315-338
15. Glover F. Heuristics for integer programming using surrogate constraints. Decision Sciences 8 (1977) 156-166
16. Tarantilis C., and Kiranoudis C. BoneRoute. an adaptive memory-based method for effective fleet management. Annals of Operations Research 114 (2002) 227-241
17. Tarantilis C. Solving the vehicle routing problem with adaptive memory programming methodology. Computers and Operations Research 2005;32:2309-27.
18. Gendreau M., Laporte G., Musaraganyi C., and Taillard E. A tabu search heuristic for the heterogeneous fleet vehicle routing problem. Computers and Operations Research 26 (1999) 1153-1173
19. Crevier B, Cordeau J-F, Taillard E. The multi-depot vehicle routing problem with inter-depot routes. Technical Report CRT-2004-10, Centre de recherche sur les transports, Montreal, 2004.
20. Hvattum L., Løkketangen A., and Glover F. Adaptive memory search for boolean optimization problems. Discrete Applied Mathematics 142 (2004) 99-109
21. Bozkaya B., Erkut E., and Laporte G. A tabu search heuristic and adaptive memory procedure for political districting. European Journal of Operational Research 144 (2003) 12-26
22. Tang H., and Miller-Hooks E. A TABU search heuristic for the team orienteering problem. Computers and Operations Research 32 (2005) 1379-1407
23. Ahmadi S., and Osman I. Greedy random adaptive memory programming search for the capacitated clustering problem. European Journal of Operational Research 162 (2005) 30-44
24. Taillard E., Gambardella L., and Potvin M.G.J.-Y. Adaptive memory programming: a unified view of metaheuristics. European Journal of Operational Research 135 (2001) 1-16
25. Gillett B., and Miller L. A heuristic algorithm for the vehicle-dispatch problem. Operations Research 22 (1974) 340-349
26. Taillard E. Parallel iterative search methods for vehicle routing problems. Networks 23 (1993) 661-676
27. Gendreau M., Hertz A., and Laporte G. A tabu search heuristic for the vehicle routing problem. Management Science 40 (1994) 1276-1290
28. Fisher M. Optimal solution of vehicle routing problems using minimum k-trees. Operations Research 42 (1994) 626-642
29. Foster B., and Ryan D. An integer programming approach to the vehicle scheduling problem. Operational Research Quarterly 27 (1976) 367-384