A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows

Computers and Operations Research

Volumn 37, Issue 4, 2010, Pages 724-737

  Nagata, Yuichi ^a   Bräysy, Olli ^b   Dullaert, Wout ^c,d  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

^b UNIVERSITY OF JYVÄSKYLÄ   (Finland)

^c UNIVERSITY OF ANTWERP   (Belgium)

^d ANTWERP MARITIME ACADEMY   (Belgium)

Author keywords

Memetic algorithm; Penalty function; Time windows; Vehicle routing

Indexed keywords

CAPACITY CONSTRAINTS; MEMETIC ALGORITHM; MEMETIC ALGORITHMS; PENALTY FUNCTION; TIME WINDOW CONSTRAINT; TIME WINDOWS; VEHICLE ROUTING PROBLEM WITH TIME WINDOWS;

MATHEMATICAL OPERATORS; ROUTING ALGORITHMS; VEHICLES; WINDOWS;

VEHICLE ROUTING;

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

References (35)

1. Cordeau JF, Desaulniers G, Desrosiers J, Solomon MM, Soumis F. VRP with time windows. In: Toth P, Vigo D, editors. The vehicle routing problem. SIAM monographs on discrete mathematics and applications, vol. 9. Philadelphia, PA, 2002. p. 157-93.
2. Bräysy O., and Gendreau M. Vehicle routing problem with time windows, part I: route construction and local search algorithms. Transportation Science 39 1 (2005) 104-118
3. Bräysy O., and Gendreau M. Vehicle routing problem with time windows, part II: metaheuristics. Transportation Science 39 1 (2005) 119-139
4. Golden B, Raghavan S, Wasil E, editors. The vehicle routing problem, latest advances and new challenges. In: Operations research/computer science interfaces series, vol. 43. Berlin: Springer; 2008.
5. Jepsen M, Spoorendonk S, Petersen B, Pisinger D. A non-robust branch-and-cut-and-price algorithm for the vehicle routing problem with time windows. Technical Report no. 06/03 ISSN: 0107-8283. Department of Computer Science, University of Copenhagen; 2006.
6. Jepsen M., Spoorendonk S., Petersen B., and Pisinger D. Subset-row inequalities applied to the vehicle-routing problem with time windows. INFORMS Journal on Operations Research 56 2 (2008) 479-511
7. Chabrier A. Vehicle routing problem with elementary shortest path based column generation. Computers & Operations Research 33 10 (2006) 2972-2990
8. Irnich S., and Villeneuve D. The shortest path problem with resource constraints and k-cycle elimination. INFORMS Journal on Computing 18 3 (2006) 391-406
9. Kallehaugea B., Larsenb J., and Madsena O.B.G. Lagrangian duality applied to the vehicle routing problem with time windows. Computers & Operations Research 33 5 (2006) 1464-1487
10. Solomon M.M. Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research 35 2 (1987) 254-265
11. Gehring H, Homberger J. A parallel hybrid evolutionary metaheuristic for the vehicle routing problem with time windows. In: Proceedings of EUROGEN99, 1999. p. 57-64.
12. Mester D., and Bräysy O. Active guided evolution strategies for large scale vehicle routing problems with time windows. Computers & Operations Research 32 6 (2005) 1593-1614
13. Homberger J., and Gehring H. Two-phase hybrid metaheuristic for the vehicle routing problem with time windows. European Journal of Operational Research 162 (2005) 220-238
14. Bent R., and Hentenryck P. A two-stage hybrid local search for the vehicle routing problem with time windows. Transportation Science 38 4 (2004) 515-530
15. Pisinger D., and Ropke S. A general heuristic for vehicle routing problems. Computers & Operations Research 34 8 (2007) 2403-2435
16. Prescott-Gagnon E, Desaulniers G, Rousseau L-M. A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows. Working paper, University of Montreal, Canada; 2007.
17. Ibaraki T., Kubo M., Masuda T., Uno T., and Yagiura M. Effective local search algorithms for the vehicle routing problem with general time window constraints. Transportation Science 39 2 (2005) 206-232
18. Ibaraki T, Imahori S, Nonobe K, Sobue K, Uno T, Yagiura M. An iterated local search algorithm for the vehicle routing problem with convex time penalty functions. Discrete Applied Mathematics 2008; 156(11):2050-69.
19. Lim A., and Zhang X. A two-stage heuristic with ejection pools and generalized ejection chains for the vehicle routing problem with time windows. INFORMS Journal on Computing 19 3 (2007) 443-457
20. Nagata Y. Edge assembly crossover for the capacitated vehicle routing problem. In: Proceedings of the 7th European conference on evolutionary computation in combinatorial optimization, 2007. p. 124-53.
21. Moscato P. On evolution, search, optimization, genetic algorithms and martial arts towards memetic algorithms. C3P Report 826, California Institute of Technology; 1989.
22. Nagata Y, Bräysy O. A powerful route minimization heuristic for the vehicle routing problem with time windows, Operations Research Letters, in press.
23. Nagata Y, Kobayashi S. Edge assembly crossover: a high-power genetic algorithm for the traveling salesman problem. In: Proceedings of the 7th international conference on genetic algorithms, 1997. p. 450-7.
24. Nagata Y. Fast EAX algorithm considering population diversity for traveling salesman problems. In: Proceedings of the 6th international conference on EvoCOP2006, 2006. p. 171-82.
25. Nagata Y. New EAX crossover for large TSP instances. In: Proceedings of the 9th international conference on parallel problem solving from nature, 2006. p. 372-81.
26. Gendreau M., Hertz A., and Laporte G. A tabu search heuristic for the vehicle routing problem. Management Science 40 10 (1994) 1276-1290
27. Toth P., and Vigo D. The granular tabu search and its application to the vehicle routing problem. INFORMS Journal on Computing 15 4 (2003) 333-348
28. Badeau P., Guertin F., Gendreau M., Potvin J.-Y., and Taillard E.D. A parallel tabu search heuristic for the vehicle routing problem with time windows. Transportation Research C-5 5 2 (1997) 109-122
29. Berger J., and Barkoui M. A parallel hybrid genetic algorithm for the vehicle routing problem with time windows. Computers & Operations Research 31 12 (2004) 2037-2053
30. Bouthillier A., and Crainic T. A cooperative parallel meta-heuristic for the vehicle routing problem with time windows. Computers & Operations Research 32 7 (2005) 1685-1708
31. Nagata Y, Bräysy O. Efficient local search limitation strategies for vehicle routing problems. In: Proceedings of the 8th European conference on evolutionary computation in combinatorial optimization, 2008. p. 48-60.
32. Homberger J., and Gehring H. Two evolutionary meta-heuristics for the vehicle routing problem with time windows. INFORMS Journal on Computing 37 3 (1999) 297-318
33. Voudouris C., and Tsang E. Guided local search. In: Glover F. (Ed). Handbook of metaheuristics (2003), Kluwer, Dordrecht 185-218
34. Kindervater G., and Savelsbergh M. Vehicle routing: handling edge exchanges. In: Aarts E., and Lenstra J.K. (Eds). Local search in combinatorial optimization (1997), Wiley, New York 337-360
35. Potvin J.-Y., and Rousseau J.-M. An exchange heuristic for routing problems with time windows. Journal of the Operational Research Society 46 (1995) 1433-1446