A powerful route minimization heuristic for the vehicle routing problem with time windows

Operations Research Letters

Volumn 37, Issue 5, 2009, Pages 333-338

  Nagata, Yuichi ^a   Bräysy, Olli ^b  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

^b UNIVERSITY OF JYVÄSKYLÄ   (Finland)

Author keywords

Guided local search; Heuristics; Time windows; Vehicle routing

Indexed keywords

GUIDED LOCAL SEARCH; HEURISTICS; TIME WINDOWS; VEHICLE ROUTING PROBLEM WITH TIME WINDOWS;

HEURISTIC METHODS; NETWORK ROUTING; ONLINE SEARCHING; ROUTING ALGORITHMS; VEHICLES; WINDOWS;

VEHICLE ROUTING;

EID: 69549111047     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2009.04.006     Document Type: Article

References (14)

1. Bräysy O., and Gendreau M. Vehicle routing problem with time windows, Part I: Route construction and local search algorithms. Transportation Science 39 (2005) 104-118
2. Bräysy O., and Gendreau M. Vehicle routing problem with time windows, Part II: Metaheuristics. Transportation Science 39 (2005) 119-139
3. Pisinger D., and Ropke S. A general heuristic for vehicle routing problems. Computers & Operations Research 34 (2007) 2403-2435
4. Gehring H., and Homberger J. Parallelization of a two-phase metaheuristic for routing problems with time windows. Asia-Pacific Journal of Operational Research 18 (2001) 35-47
5. Bent R., and Van Hentenryck P. A two-stage hybrid local search for the vehicle routing problem with time windows. Transportation Science 38 (2004) 515-530
6. 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 (2007) 443-457
7. Y. Nagata, Efficient evolutionary algorithm for the vehicle routing problem with time windows: Edge assembly crossover for the VRPTW, in: Proc. of the 2007 Congress on Evolutionary Computation, CD-ROM, 2007, pp. 1175-1182
8. E. Prescott-Gagnon, G. Desaulniers, L.-M. Rousseau, A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows, Working Paper, University of Montreal, Canada, 2007
9. C. Voudouris, E. Tsang, Guided local search, Technical Report CSM-247, Department of Computer Science, University of Essex, UK, August, 1995
10. Voudouris C., and Tsang E. Guided local search. In: Glover F. (Ed). Handbook of Metaheuristics (2003), Kluwer 185-218
11. H. Gehring, J. Homberger, A parallel hybrid evolutionary metaheuristic for the vehicle routing problem with time windows, in: Proc. of EUROGEN, vol. 99, 1999, pp. 57-64
12. 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
13. Kindervater G.A.P., and Savelsbergh M.W.P. Vehicle routing: Handling edge exchanges. Local Search in Combinatorial Optimization (1997), Wiley 337-360
14. Ibaraki T., Imahori S., Nonobe K., Sobue K., Uno T., and Yagiura M. An iterated local search algorithm for the vehicle routing problem with convex time penalty functions. Discrete Applied Mathematics 156 (2008) 2050-2069