A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem

Computers and Operations Research

Volumn 35, Issue 5, 2008, Pages 1725-1741

  El fallahi, Abdellah ^a   Prins, Christian ^a   Wolfler Calvo, Roberto ^a  

^a UNIVERSITÉ DE TECHNOLOGIE DE TROYES   (France)

Author keywords

Memetic algorithm; Path relinking; Tabu search; Vehicle routing problem

Indexed keywords

COMPUTATIONAL EFFICIENCY; ROUTING ALGORITHMS; TABU SEARCH; TRAVELING SALESMAN PROBLEM;

MEMETIC ALGORITHM; PATH RELINKING; VEHICLE ROUTING PROBLEM;

PROBLEM SOLVING;

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

References (20)

1. Toth P., and Vigo D. The vehicle routing problem. SIAM monographs on discrete mathematics and application (2002), SIAM, Philadelphia, PA
2. Dror M., and Trudeau P. Saving by split delivery routing. Transportation Science 23 (1989) 141-145
3. Avella P., Boccia M., and Sforza A. Solving a fuel delivery problem by heuristic and exact approaches. European Journal of Operational Research 152 (2004) 170-179
4. Brown G.G., and Graves W.G. Real-time dispatch of petroleum tank trucks. Management Science 27 (1981) 19-31
5. Brown G.G., Ellis C.J., Graves W.G., and Ronen D. Real-time, wide area dispatch of mobil tank trucks. Interfaces 17 (1987) 107-120
6. Van der Brugen L., Gruson R., and Salomon M. Reconsidering the distribution of gasoline products for a large oil company. European Journal of Operation Research 81 (1995) 460-473
7. Moscato P. Memetic algorithms: a short introduction. In: Corne D., Dorigo M., and Glover F. (Eds). New ideas in optimization (1999), McGraw-Hill, New York 219-234
8. Prins C. A simple and effective evolutionary algorithm for the vehicle routing problem. Computers and Operations Research 31 12 (2004) 1985-2002
9. Beasley J.E. Route-first cluster-second methods for vehicle routing. Omega 11 (1983) 403-408
10. Clarke G., and Wright J.W. Scheduling of vehicles from a central depot to a number of delivery points. Operations Research 12 (1964) 568-581
11. Campos V., Laguna M., and Marti R. Context-independent scatter search and tabu search for permutation problems. INFORMS Journal on Computing 17 (2005) 111-122
12. Oliver I.M., Smith D.J., and Holland J.R.C. A study of permutation crossover operators on the traveling salesman problem. In: Grefenstette J.J. (Ed). Proceedings of the second international conference on genetic algorithms (1987), Lawrence Erlbaum, Hillsdale, NJ 224-230
13. Croes G.A. A method for solving traveling salesman problems. Operations Research 6 (1958) 791-812
14. Osman I.H. Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Annals of Operations Research 41 (1993) 421-451
15. Glover F., and Laguna M. Tabu search (1997), Kluwer Academic Publishers, Boston
16. Glover F., Laguna M., and Marti R. Fundamentals of scatter search and path relinking. Control and Cybernetics 39 3 (2000) 653-684
17. Gendreau M., Hertz A., and Laporte G. A tabu search heuristic for the vehicle routing problem. Management Science 40 (1994) 1276-1290
18. Dell'Amico M., Lodi A., and Maffioli F. Solution of the cumulative assignment problem with a well-structured tabu search method. Journal of Heuristics 5 2 (1999) 123-143
19. 〈http://people.brunel.ac.uk/∼mastjjb/jeb/info.html〉.
20. Laporte G., Gendreau M., Potvin J.Y., and Semet F. Classical and modern heuristics for the vehicle routing problem. International Transactions in Operational Research 7 (2000) 285-300