Effective local search algorithms for routing and scheduling problems with general time-window constraints

Transportation Science

Volumn 39, Issue 2, 2005, Pages 206-232

  Ibaraki, T ^a   Imahori, S ^b   Kubo, M ^c   Masuda, Tomoyasu ^d   Uno, T ^e   Yagiura, M ^f  

^a KWANSEI GAKUIN UNIVERSITY   (Japan)

^b UNIVERSITY OF TOKYO   (Japan)

^c TOKYO UNIVERSITY OF MARINE SCIENCE AND TECHNOLOGY   (Japan)

^d ACCENTURE   (United States)

^e NATIONAL INSTITUTE OF INFORMATICS   (Japan)

^f KYOTO UNIVERSITY   (Japan)

Author keywords

Adaptive multistart local search; Dynamic programming; Metaheuristics; Time window contraints; Vehicle routing; Very large scale neighborhood

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; DYNAMIC PROGRAMMING; HEURISTIC METHODS; OPTIMIZATION; SCHEDULING;

ADAPTIVE MULTISTART LOCAL SEARCH; METAHEURISTICS; TIME-WINDOW CONSTRAINTS; VEHICLE ROUTING;

OPERATIONS RESEARCH;

EID: 19944391610     PISSN: 00411655     EISSN: None     Source Type: Journal    
DOI: 10.1287/trsc.1030.0085     Document Type: Article

References (48)

1. Ahuja, R. K., J. B. Orlin. 2001. A fast scaling algorithm for minimizing separable convex functions subject to chain constraints. Oper. Res. 49 784-789.
2. Ahuja, R. K., J. B. Orlin, D. Sharma. 2000. Very large-scale neighborhood search. Internat. Trans. Oper. Res. 7 301-317.
3. Ahuja, R. K., O. Ergun, J. B. Orlin, A. P. Punnen. 2002. A survey of very large-scale neighborhood search techniques. Discrete Appl. Math. 123 75-102.
4. Bent, R., P. Van Hentenryck. 2001. A two-stage hybrid local search for the vehicle routing problem with time windows. Technical Report CS-01-06, Department of Computer Science, Brown University, Providence, RI.
5. Berger, J., M. Barkaoui, O. Bräysy. 2003. A route-directed hybrid genetic approach for the vehicle routing problem with time windows. INFOR 41(2) 179-194.
6. Bertsekas, D. P. 1995. Nonlinear Programming. Athena Scientific, Belmont, MA.
7. Boese, K. D., A. B. Kahng, S. Muddu. 1994. A new adaptive multi-start technique for combinatorial global optimizations. Oper. Res. Lett. 16 101-113.
8. Bräysy, O. 2003. A reactive variable neighborhood search for the vehicle-routing problem with time windows. INFORMS J. Comput 15 347-368.
9. Bräysy, O., M. Gendreau. 2005a. Vehicle routing problem with time windows, Part I: Route construction and local search algorithms. Transportation Sci. 39(1) 104-118.
10. Bräysy, O., M. Gendreau. 2005b. Vehicle routing problem with time windows, Part II: Metaheuristics. Transportation Sci. 39(1) 119-139.
11. Chvátal, V. 1983. Linear Programming. Freeman, New York.
12. Davis, J. S., J. J. Kanet. 1993. Single-machine scheduling with early and tardy completion costs. Naval Res. Logist. 40 85-101.
13. De Jong, C., G. Kant, A. Van Vliet. 1996. On finding minimal route duration in the vehicle routing problem with multiple time windows. Manuscript, Department of Computer Science, Utrecht University, The Netherlands (http://www.cs.uu.nl/research/projects/alcom/wp4.3.html).
14. Desrochers, M., J. K. Lenstra, M. W. P. Savelsbergh, F. Soumis. 1988. Vehicle routing with time windows: Optimization and approximation. B. L. Golden, A. A. Assad, eds. Vehicle Routing: Methods and Studies. North-Holland, Amsterdam, The Netherlands.
15. Desrosiers, J., Y. Dumas, M. M. Solomon, F. Soumis. 1995. Time constrained routing and scheduling. M. O. Ball, T. L. Magnanti, C. L. Monma, G. L. Nemhauser, eds. Handbooks in Operations Research and Management Science, Vol. 8. Network Routing. North-Holland, Amsterdam, The Netherlands, 35-139.
16. Dongarra, J. J. 2002. Performance of various computers using standard linear equations software. Technical Report CS-89-85, Computer Science Department, University of Tennessee, Knoxville, TN (http://www.netlib.org/ benchmark/performance.ps).
17. Garey, M. R., D. S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York.
18. Garey, M. R., R. E. Tarjan, G. T. Wilfong. 1988. One-processor scheduling with symmetric earliness and tardiness penalties. Math. Oper. Res. 13 330-348.
19. Gehring, H., J. Homberger. 2002. Parallelization of a two-phase metaheuristic for routing problems with time windows. J. Heuristics 8 251-276.
20. Glover, F. 1996. Ejection chains, reference structures and alternating path methods for traveling salesman problems. Discrete Appl. Math. 65 223-253.
21. Hochbaum, D. S. 1997. Approximating covering and packing problems: Set cover, vertex cover, independent set, and related problems. D. S. Hochbaum, ed. Approximation Algorithms for NP-Hard Problems. PWS Pub. Co., Boston, MA, 94-143.
22. Hochbaum, D. S. 2002a. Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations. Eur. J. Oper. Res. 140 291-321.
23. Hochbaum, D. S. 2002b. Private communication.
24. Hochbaum, D. S., J. Naor. 1994. Simple and fast algorithms for linear and integer programs with two variables per inequality. SIAM J. Comput. 23 1179-1192.
25. Hochbaum, D. S., M. Queyranne. 2003. Minimizing a convex cost closure ser.SIAM J. Discrete Math. 16 192-207.
26. Homberger, J., H. Gehring. 1999. Two evolutionary metaheuristics for the vehicle routing problem with time windows. INFOR 37 297-318.
27. Homberger, J., H. Gehring. 2004. A two-phase hybrid metaheuristic for the vehicle routing problem with time windows. Eur. I. Oper. Res. Forthcoming.
28. Johnson, D. S. 1990. Local optimization and the traveling salesman problem. M. S. Paterson, ed. Automata, Languages and Programming, Vol. 443. Lecture Notes Comp. Sci. Springer-Verlag, Berlin, Germany, 446-461.
29. Johnson, D. S., L. A. McGeoch. 1997. The traveling salesman problem: A case study. E. H. L. Aarts, J. K. Lenstra, eds. Local Search in Combinatorial Optimization. John Wiley & Sons, Chichester, UK, 215-310.
30. Koskosidis, Y. A., W. B. Powell, M. M. Solomon. 1992. An optimization-based heuristic for vehicle routing and scheduling with soft time window constraints. Transportation Sci. 26 69-85.
31. Lin, S. 1965. Computer solutions of the traveling salesman problem. Bell System Tech. J. 44 2245-2269.
32. Lin, S., B. W. Kernighan. 1973. An effective heuristic algorithm for the traveling salesman problem. Oper. Res. 21 498-516.
33. Martin, O., S. W. Otto, E. W. Felten. 1991. Large-step Markov chains for the traveling salesman problem. Complex Systems 5 299-326.
34. Martin, O., S. W. Otto, E. W. Felten. 1992. Large-step Markov chains for the TSP incorporating local search heuristic. Oper. Res. Lett. 11 219-224.
35. Or, I. 1976. Traveling salesman-type combinatorial problems and their relation to the logistics of regional blood banking. Unpublished doctoral dissertation, Department of Industrial Engineering and Management Science, Northwestern University, Evanston, IL.
36. Park, N., H. Okano, H. Imai. 2000. A path-exchange-type local search algorithm for vehicle routing and its efficient search strategy. J. Oper. Res. Soc. Japan 43 197-208.
37. Potvin, J. Y., T. Kervahut, B. L. Garcia, J. M. Rousseau. 1996. The vehicle routing problem with time windows, Part 1: Tabu search. INFORMS J. Comput. 8 158-164.
38. Reiter, S., G. Sherman. 1965. Discrete optimizing. J. Soc. Indust. Appl. Math. 13 864-889.
39. Rousseau, L.-M., M. Gendreau, G. Pesant. 2002. Using constraint-based operators to solve the vehicle routing problem with time windows. J. Heuristics 8 43-58.
40. Savelsbergh, M. W. P. 1992. The vehicle routing problem with time windows: Minimizing route duration. ORSA J. Comput. 4 146-154.
41. Solomon, M. M. 1987. The vehicle routing and scheduling problems with time window constraints. Oper. Res. 35 254-265.
42. Solomon, M. M., J. Desrosiers. 1988. Time window constrained routing and scheduling problems. Transportation Sci. 22 1-13.
43. Taillard, E., P. Badeau, M. Gendreau, F. Guertin, J. Y. Potvin. 1997. A tabu search heuristic for the vehicle routing problem with soft time windows. Transportation Sci. 31 170-186.
44. Tamaki, H., T. Komori, S. Abe. 1999a. A heuristic approach to parallel machine scheduling with earliness and tardiness penalties. Proc. 7th IEEE Internat. Conf. Emerging Tech. Factory Automation (ETFA'99), Barcelona, Catalonia, Spain, 1367-1370.
45. Tamaki, H., T. Sugimoto, M. Araki. 1999b. Parallel machine scheduling problem with a non-regular objective function - Minimizing the sum of earliness and tardiness penalties (in Japanese). Trans. Soc. Instrument Control Engineers 35 1176-1182.
46. Thangiah, S. R., I. H. Osman, T. Sun. 1994. Hybrid genetic algorithm, simulated annealing and tabu search methods for vehicle routing problems with time windows. Working Paper UKC/IMS/OR94/4, Institute of Mathematics and Statistics, University of Kent, Canterbury, UK.
47. Thompson, P. M., J. B. Orlin. 1989. The theory of cyclic transfers. Working Paper OR200-89, Operations Research Center, MIT, Cambridge, MA.
48. Thompson, P. M., H. N. Psaraftis. 1993. Cyclic transfer algorithms for multivehicle routing and scheduling problems. Oper. Res. 41 935-946.