Arc-guided evolutionary algorithm for the vehicle routing problem with time windows

IEEE Transactions on Evolutionary Computation

Volumn 13, Issue 3, 2009, Pages 624-647

  Repoussis, Panagiotis P ^a   Tarantilis, Christos D ^a   Ioannou, George ^a  

^a ATHENS UNIVERSITY OF ECONOMICS AND BUSINESS   (Greece)

Author keywords

Evolution strategies; Guided local search; Tabu search; Vehicle routing; Vehicle scheduling

Indexed keywords

BENCHMARK DATASETS; BINARY VECTORS; CAPACITATED VEHICLES; COMBINATORIAL OPTIMIZATION PROBLEMS; EVOLUTION STRATEGIES; FIXED TIME INTERVAL; FLEET SIZES; FREQUENCY OF APPEARANCE; GUIDED LOCAL SEARCH; LOCAL SEARCH ALGORITHM; MINIMUM DISTANCE; MULTIPARENT RECOMBINATION; SELF ADAPTATION; SET OF CUSTOMERS; VEHICLE ROUTING PROBLEM WITH TIME WINDOWS; VEHICLE SCHEDULING;

CAVITY RESONATORS; COMBINATORIAL OPTIMIZATION; COMPETITION; EVOLUTIONARY ALGORITHMS; FLEET OPERATIONS; HEURISTIC METHODS; LEARNING ALGORITHMS; ONLINE SEARCHING; ROUTING ALGORITHMS; TABU SEARCH; VEHICLES; WINDOWS;

VEHICLE ROUTING;

EID: 67650128137     PISSN: 1089778X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TEVC.2008.2011740     Document Type: Article

References (70)

1. J.-F. Cordeau, G. Desaulniers, J. Desrosiers, M. M. Solomon, and F. Soumis, "The vehicle routing problem with time windows," in The Vehicle Routing Problem, Philadelphia, PA: SIAM Monographs on Discrete Mathematics and Applications, 2002, pp. 157-193.
2. V. Lambert, G. Laporte, and F. Louveaux, "Designing collection routes through bank branches," Comput. Oper. Res., vol. 20, no. 7, pp. 783-791, 1993.
3. B.-I. Kim, S. Kim, and S. Sahoo, "Waste collection vehicle routing problem with time windows," Comput. Oper. Res., vol. 33, no. 12, pp. 3624-3642, 2006.
4. B. L. Golden, A. A. Assad, and E. A. Wasil, "Routing vehicles in the real world: Applications in the solid waste, beverage, food, dairy, and newspaper industries," in The Vehicle Routing Problem, Philadelphia, PA: SIAM Monographs on Discrete Mathematics and Applications, 2002, pp. 245-286.
5. J. Bracca, J. Bramel, and D. Simchi-Levi, "A computerized approach to the New York city school bus routing problem," IIE Trans., vol. 29, no. 8, pp. 693-702, 1994.
6. B. S. Vaidyanathan, J. O. Matson, D. M. Miller, and J. E. Matson, "A capacitated vehicle routing problem for just-in-time delivery," IIE Trans., vol. 31, no. 11, pp. 1083-1092, 1999.
7. M. W. Carter, J. M. Farvolden, G. Laporte, and J. Xu, "Solving an integrated logistics problem arising in grocery distribution," in Proc. INFOR, vol. 34. 1996, pp. 290-306.
8. D. Weigel, and B. Cao, "Applying GIS and OR techniques to solve sears technician-dispatching and home-delivery problems," Interfaces, vol. 29, no. 1, pp. 112-130, 1999.
9. J. Desrosiers, Y. Dumas, M. M. Solomon, and F. Soumis, "Time constrained routing and scheduling," in Network Routing (Handbooks Operations Research and Manage. Sci. Ser. 8). Amsterdam, Netherlands: Elsevier, 1995, pp. 35-139.
10. O. Bräysy, W. Dullaert, and M. Gendreau, "Evolutionary algorithms for the vehicle routing problem with time windows," J. Heuristics vol. 10, no. 6, pp. 587-611, 2004.
11. O. Bräysy and M. Gendreau, "Vehicle routing problem with time windows part I: Route construction and local search algorithms," Transport Sci., vol. 39, no. 1, pp. 104-118, 2005.
12. O. Bräysy and M. Gendreau, "Vehicle routing problem with time windows part II: Metaheuristics," Transport Sci., vol. 39, no. 1, pp. 119-139, 2005.
13. I. Rechenberg, Evolutionsstrategie. Stuttgart, Germany: Fromman-Holzboog, 1973.
14. F. Glover, "Future paths for integer programming and links to artificial intelligence," Comput. Oper. Res., vol. 13, no. 5, pp. 533-549, 1986.
15. C. Voudouris and E. Tsang, "Guided local search and its application to the traveling salesman problem," Eur. J. Oper. Res., vol. 113, no. 2, pp. 469-499, 1999.
16. M. M. Solomon, "Algorithms for the vehicle routing and scheduling problems with time window constraints," Oper. Res., vol. 35, no. 2, pp. 254-265, 1987.
17. H. Gehring and J. Homberger, "A parallel hybrid evolutionary metaheuristic for the vehicle routing problem with time windows," in Proc. EUROGEN 99, Jyväskylä, Finland: University of Jyväskylä, pp. 57-64.
18. O. Bräysy, G. Hasle, and W. Dullaert, "A multistart local search algorithm for the vehicle routing problem with time windows," Eur. J. Oper. Res., vol. 159, no. 3, pp. 586-605, 2004.
19. G. Dueck and T. Scheurer, "Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing," J. Comput. Phys., vol. 90, no. 1, pp. 161-175, 1990.
20. E. D. Taillard, P. Badeau, M. Gendreau, F. Guertin, and J.-Y. Potvin, "A tabu search heuristic for the vehicle routing problem with soft time windows," Transport Sci., vol. 31, pp. 170-186, May 1997.
21. O. Bräysy, "A reactive variable neighborhood search for the vehicle routing problem with time windows," INFORMS J. Comput., vol. 15, pp. 347-368, Fall 2003.
22. N. Mladenović and P. Hansen, "Variable neighborhood search," Comput. Oper. Res., vol. 24, no. 11, pp. 1097-1100, 1997.
23. F. Glover, "Ejection chains, reference structures and alternating path methods for traveling salesman problems," Discrete Appl. Math., vol. 65, no. 1-3, pp. 223-253, 1996.
24. D. Pisinger and S. Ropke, "A general heuristic for vehicle routing problems," Comput. Oper. Res., vol. 34, no. 8, pp. 2403-2435, 2006.
25. S. Kirkpatrick, C. D. Gelatt, and P. M. Vecchi, "Optimization by simulated annealing," Sci., vol. 220, no. 4598, pp. 671-680, 1983.
26. R. Bent, and P. van Hentenryck, "A two-stage hybrid local search for the vehicle routing problem with time windows," Transport Sci., vol. 38, pp. 515-530, Nov. 2004.
27. P. Shaw, "Using constraint programming and local search methods to solve vehicle routing problems," in Principles Practice Constraint Programming - CP 98, LNCS vol. 1520. Berlin, Germany: Springer-Verlag, 1998, pp. 417-431.
28. J. Homberger and H. Gehring, "Two evolutionary meta-heuristics for the vehicle routing problem with time windows," in Proc. INFOR, vol. 37. 1999, pp. 297-318.
29. T. Ibaraki, S. Imahori, M. Kudo, T. Masuda, T. Uno, and M. Yagiura, "Effective local search algorithms for routing and scheduling problems with general time window constraints," Transport Sci., vol. 39, pp. 206-232, May 2005.
30. T. Ibaraki, S. Imahori, K. Nonobe, K. Sobue, T. Uno, and M. Yagiura, "An iterated local search algorithm for the vehicle routing problem with convex time penalty functions," Department of Mathematical Informatics, Univ. Tokyo, Tokyo, Japan, Math. Eng. Tech. Report, METR 2006-36, 2006.
31. A. Lim, and X. Zhang, "A two-stage heuristic with ejection pools and generalized ejection chains for the vehicle routing problem with time windows," INFORMS J. Comput., vol. 19, no. 3, pp. 443-457, 2007.
32. D. E. Joslin, and D. P. Clememnts, "'Squeaky wheel' optimization," J. Artificial Intell. Res., vol. 10, pp. 353-373, 1999.
33. R. K. Ahuja, J. B. Orlin, and D. Sharma, "Very large-scale neighborhood search," Int. Trans. Operations Res. vol. 7, pp. 301-317, 2000.
34. J. Berger, M. Barkaoui, and O. Braysy, "A route directed hybrid genetic approach for the vehicle routing problem with time windows," in Proc. INFOR, vol. 41. 2003, pp. 179-194.
35. F.-H. Liu and S.-Y. Shen, "A route-neighborhood-based metaheuristic for vehicle routing problem with time windows," Eur. J. Oper. Res., vol. 118, no. 3, pp. 485-504, 1999.
36. H. Gehring, and J. Homberger, "Parallelization of a two-phase metaheuristic for routing problems with time windows," Asia-Pacific J. Oper. Res., vol. 18, no. 1, pp. 35-47, 2001.
37. H. Gehring, and J. Homberger, "Parallelization of a two-phase metaheuristic for routing problems with time windows," J. Heuristics vol. 8, no. 3, pp. 251-276, 2002.
38. J. Homberger, and H. Gehring, "A two-phase hybrid metaheuristic for the vehicle routing problem with time windows," Eur. J. Oper. Res., vol. 162, no. 1, pp. 220-238, 2005.
39. D. Mester, O. Bräysy, and W. Dullaert, "A multi-parametric evolution strategies algorithm for vehicle routing problems," Expert. Syst. Appl., vol. 32, no. 2, pp. 508-517, 2006.
40. D. Mester, and O. Bräysy, "Active guided evolution strategies for large scale vehicle routing problems with time windows," Comput. Operations Res. vol. 32, no. 6, pp. 1593-1614, 2005.
41. R. A. Russell, and W.-C. Chiang, "Scatter search for the vehicle routing problem with time windows," Eur. J. Oper. Res., vol. 169, no. 2, pp. 606-622, 2006.
42. W.-C. Chiang, and R. A. Russell, "A reactive tabu search metaheuristic for the vehicle routing problem with time windows," INFORMS J. Comput., vol. 9, pp. 417-430, Fall 1997.
43. A. Le Bouthillier, and T. G. Crainic, "Co-operative parallel metaheuristic for vehicle routing with time windows," Comput. Oper. Res., vol. 32, no. 7, pp. 1685-1708, 2005.
44. J.-F. Cordeau, G. Laporte, and A. Mercier, "A unified tabu search heuristic for vehicle routing problems with time windows," J. Oper. Res. Soc., vol. 52, pp. 928-936, 2001.
45. M. Gendreau, A. Hertz, and G. Laporte, "A tabu search heuristic for the vehicle routing problem," Manage. Sci., vol. 40, no. 10, pp. 1276-1290, 1994.
46. A. Le Bouthillier, T. G. Crainic, and P. Kropf, "A guided cooperative search for the vehicle routing problem with time windows," IEEE Intell. Syst., vol. 20, no. 4, pp. 36-42, Jul.-Aug. 2005.
47. P. P. Repoussis, D. C. Paraskevopoulos, C. D. Tarantilis, and G. Ioannou, "A reactive greedy randomized variable neighborhood tabu search for the vehicle routing problem with time windows," in Workshop Hybrid Metaheuristics 2006, LNCS vol. 4030. New York: Springer-Verlag, 2006, pp. 124-138.
48. T. Feo and M. G. C. Resende, "Greedy randomized adaptive search procedures," J. Global. Optim., vol. 6, no. 2, pp. 109-154, 1995.
49. G. Kontoravdis and J. F. Bard, "A GRASP for the vehicle routing problem with time windows," ORSA J. Comput., vol. 7, no. 1, pp. 10-23, 1995.
50. E. Prescott-Gagnon, G. Desaulniers, and L.-M. Rousseau, "A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows," University of Montreal, Montreal, Canada, Tech. Report G-2007-67, 2007.
51. L.-M. Rousseau, M. Gendreau, and G. Pesant, "Using constraint-based operators to solve the vehicle routing problem with time windows," J. Heuristics, vol. 8, no. 1, pp. 43-58, 2002.
52. J. H. Holland, Adaptations in Natural and Artificial Systems. Michigan Press, 1975.
53. B. Ombuki, B. J. Ross, and F. Hanshar, "Multiobjective genetic algorithms for the vehicle routing problem with time windows," Appl. Intell., vol. 24, no. 1, pp. 17-30, 2006.
54. N. Jozefowiez, F. Semet, and E.-G. Talbi, "Multiobjective vehicle routing problems," Eur. J. Oper. Res., vol. 189, no. 2, pp. 293-309, 2008.
55. D. B. Fogel, Evolutionary Computation: The Fossil Record. Piscataway, NJ: IEEE Press, 1998.
56. T. Bäck, U. Hammel, and H.-P. Schwefel, "Evolutionary computation: Comments on the history and current state," IEEE T Evolut. Comput. vol. 1, no. 1, pp. 3-17, Apr. 1997.
57. C. D. Tarantilis and C. T. Kiranoudis, "BoneRoute: An adaptive memory-based method for effective fleet management," Ann. Oper. Res. vol. 115, no. 1, pp. 227-241, 2002.
58. C. D. Tarantilis, "Solving the vehicle routing problem with adaptive memory programming methodology," Comput. Oper. Res., vol. 32, no. 9, pp. 2309-2327, 2005.
59. F. Glover, "Tabu search and adaptive memory programming advances, applications and challenges," in Interfaces in Computer Science Operation Research: Advances in Metaheuristics. (Optimization Stochastic Modelling Technologies), Boston, MA: Kluwer, 1997, pp. 1-75.
60. E. D. Taillard, L. M. Gambardella, M. Gendreau, and J.-Y. Potvin, "Adaptive memory programming: A unfied view of metaheuristics," Eur. J. Oper. Res., vol. 135, no. 9, pp. 1-16, 2001.
61. P. P. Repoussis, C. D. Tarantilis, and G. Ioannou, "The open vehicle routing problem with time windows," J. Oper. Res. Soc., vol. 58, no. 3, pp. 355-367, 2007.
62. D. C. Paraskevopoulos, P. P. Repoussis, C. D. Tarantilis, G. Ioannou, and G. P. Prastacos, "A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows," J. Heuristics, vol. 14, no. 5, pp. 425-455, 2007.
63. G. Ioannou, M. Kritikos, and G. P. Prastacos, "A greedy look-ahead heuristic for the vehicle routing problem with time windows," J. Oper. Res. Soc., vol. 52, no. 6, pp. 523-537, 2001.
64. S. C. Ho and M. Gendreau, "Path relinking for the vehicle routing problem," J. Heuristics, vol. 12, no. 1-2, pp. 55-72, 2006.
65. G. A. P. Kindervater and M. W. P. Savelsbergh, "Vehicle routing: Handling edge exchanges," in Local Search Combinatorial Optimization London, U.K.: Wiley, 1998, pp. 337-360.
66. C. D. Tarantilis, E. E. Zachariadis, and C. T. Kiranoudis, "A hybrid guided local search for the vehicle routing problem with intermediate replenishment facilities," INFORMS J. Comput. vol. 20, pp. 154-168, Winter 2008.
67. M. Gendreau and J.-Y. Potvin, "Metaheuristics in combinatorial optimization," Anns. Oper. Res., vol. 140, no. 1, pp. 189-213, 2005.
68. I. H. Osman, "Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem," Anns. Oper. Res., vol. 41, no. 1-4, pp. 421-452, 1993.
69. P. Ross, "Hyper-heuristics," in Search Methodologies: Introductory Tutorials Optimization Decision Support Methodologies. New York: Springer-Verlag, 2005, pp. 529-556.
70. J. J. Dongarra, "Performance various comput. using standard linear equations software," Comput. Sci. Dept., Univ. Tennessee, Knoxville, TN, Tech. Report UT-CS-04-526, UT-CS-89-95, 2006.