An iterated local search algorithm for the vehicle routing problem with convex time penalty functions

Discrete Applied Mathematics

Volumn 156, Issue 11, 2008, Pages 2050-2069

  Ibaraki, Toshihide ^a   Imahori, Shinji ^b   Nonobe, Koji ^c   Sobue, Kensuke ^d   Uno, Takeaki ^e   Yagiura, Mutsunori ^f  

^a KWANSEI GAKUIN UNIVERSITY   (Japan)

^b UNIVERSITY OF TOKYO   (Japan)

^c HOSEI UNIVERSITY   (Japan)

^d TOYOTA MOTOR CORPORATION   (Japan)

^e NATIONAL INSTITUTE OF INFORMATICS   (Japan)

^f NAGOYA UNIVERSITY   (Japan)

Author keywords

Dynamic programming; Metaheuristics; Vehicle routing problem with time windows

Indexed keywords

BOOLEAN FUNCTIONS; CUSTOMER SATISFACTION; DYNAMIC POSITIONING; DYNAMIC PROGRAMMING; EIGENVALUES AND EIGENFUNCTIONS; LEARNING ALGORITHMS; MATHEMATICAL PROGRAMMING; NETWORK ROUTING; PERCOLATION (SOLID STATE); PIECEWISE LINEAR TECHNIQUES; ROUTING ALGORITHMS; SALES; SOLUTIONS; SYSTEMS ENGINEERING; TELECOMMUNICATION NETWORKS; VEHICLES; WINDOWS;

AMORTIZED TIME; COMPUTATIONAL COMPARISONS; DYNAMIC PROGRAMMING (DP); INPUT SIZE; ITERATED LOCAL SEARCH (ILS); LINEAR PIECES; PENALTY FUNCTIONS; PIECE-WISE LINEAR (PWL); TIME WINDOW CONSTRAINTS; VEHICLE ROUTING PROBLEM (VRP);

VEHICLE ROUTING;

EID: 47549094649     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2007.04.022     Document Type: Article

References (31)

1. Ahuja R.K., and Orlin J.B. A fast scaling algorithm for minimizing separable convex functions subject to chain constraints. Oper. Res. 49 (2001) 784-789
2. Bent R., and Van Hentenryck P. A two-stage hybrid local search for the vehicle routing problem with time windows. Transportation Sci. 38 (2004) 515-530
3. Berger J., Barkaoui M., and Bräysy O. A route-directed hybrid genetic approach for the vehicle routing problem with time windows. INFOR 41 (2003) 179-194
4. Bräysy O. A reactive variable neighborhood search for the vehicle routing problem with time windows. INFORMS J. Comput. 15 (2003) 347-368
5. Bräysy O., and Gendreau M. Vehicle routing problem with time windows, Part I: route construction and local search algorithms. Transportation Sci. 39 (2005) 104-118
6. Bräysy O., and Gendreau M. Vehicle routing problem with time windows, Part II: metaheuristics. Transportation Sci. 39 (2005) 119-139
7. Bräysy O., Hasle G., and Dullaert W. A multi-start local search algorithm for the vehicle routing problem with time windows. European J. Oper. Res. 159 (2004) 586-605
8. Davis J.S., and Kanet J.J. Single-machine scheduling with early and tardy completion costs. Naval Res. Logist. 40 (1993) 85-101
9. C. De Jong, G. Kant, A. Van Vliet, On finding minimal route duration in the vehicle routing problem with multiple time windows, Manuscript, Department of Computer Science, Utrecht University, Holland, 1996 (available from the web page 〈http://www.cs.uu.nl/research/projects/alcom/wp4.3.html〉).
10. Garey M.R., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), Freeman, New York
11. Garey M.R., Tarjan R.E., and Wilfong G.T. One-processor scheduling with symmetric earliness and tardiness penalties. Math. Oper. Res. 13 (1988) 330-348
12. H. Gehring, J. Homberger, A parallel hybrid evolutionary metaheuristic for the vehicle routing problem with time windows, in: Proceedings of EUROGEN99.Jyväskylä, University of Jyväskylä, 1999, pp. 57-64.
13. Gehring H., and Homberger J. Parallelization of a two-phase metaheuristic for routing problems with time windows. J. Heuristics 8 (2002) 251-276
14. Glover F., and Laguna M. Tabu Search (1997), Kluwer Academic Publishers, Dordrecht
15. Goetschalckx M., and Jacobs-Blecha C. The vehicle routing problem with backhauls. European J. Oper. Res. 42 (1989) 39-51
16. Hashimoto H., Ibaraki T., Imahori S., and Yagiura M. The vehicle routing problem with flexible time windows and traveling times. Discrete Appl. Math. 154 (2006) 2271-2290
17. Hochbaum D.S., and Queyranne M. Minimizing a convex cost closure set. SIAM J. Discrete Math. 16 (2003) 192-207
18. Homberger J., and Gehring H. Two evolutionary metaheuristics for the vehicle routing problem with time windows. INFOR 37 (1999) 297-318
19. Homberger J., and Gehring H. A two-phase hybrid metaheuristic for the vehicle routing problem with time windows. European J. Oper. Res. 162 (2005) 220-238
20. Ibaraki T., Imahori S., Kubo M., Masuda T., Uno T., and Yagiura M. Effective local search algorithms for routing and scheduling problems with general time window constraints. Transportation Sci. 39 (2005) 206-232
21. D.S. Johnson, Local optimization and the traveling salesman problem, in: M.S. Paterson (Ed.), Automata, Languages and Programming, Lecture Notes in Computer Science, vol. 443, Springer, Berlin, 1990, pp. 446-461.
22. Johnson D.S., and McGeoch L.A. The traveling salesman problem: a case study. In: Aarts E.H.L., and Lenstra J.K. (Eds). Local Search in Combinatorial Optimization (1997), Wiley, Chichester 215-310
23. Koskosidis Y.A., Powell W.B., and Solomon M.M. An optimization-based heuristic for vehicle routing and scheduling with soft time window constraints. Transportation Sci. 26 (1992) 69-85
24. A. Le Bouthillier, T.G. Crainic, A hybrid genetic algorithm for the vehicle routing problem with time windows, Working Paper, Centre for Research on Transportation University of Montreal, Canada, 2003.
25. H. Li, A. Lim, Large scale time-constrained vehicle routing problems: a general metaheuristic framework with extensive experimental results, Working paper, National University of Singapore.
26. Mester D., and Bräysy O. Active guided evolution strategies for the large scale vehicle routing problem with time windows. Comput. Oper. Res. 32 (2005) 1593-1614
27. I. Or, Traveling salesman-type combinatorial problems and their relation to the logistics of regional blood banking, Ph.D. Thesis, Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, IL, 1976.
28. Potvin J.Y., Kervahut T., Garcia B.L., and Rousseau J.M. The vehicle routing problem with time windows, Part 1: tabu search. INFORMS J. Comput. 8 (1996) 158-164
29. Solomon M.M. The vehicle routing and scheduling problems with time window constraints. Oper. Res. 35 (1987) 254-265
30. Solomon M.M., and Desrosiers J. Time window constrained routing and scheduling problems. Transportation Sci. 22 (1988) 1-13
31. Taillard E., Badeau P., Gendreau M., Guertin F., and Potvin J.Y. A tabu search heuristic for the vehicle routing problem with soft time windows. Transportation Sci. 31 (1997) 170-186