State-of-the art review:Evolutionary algorithms for vehicle routing

INFORMS Journal on Computing

Volumn 21, Issue 4, 2009, Pages 518-548

  Potvin, Jean Yves ^a  

^a INTERUNIVERSITY RESEARCH CENTRE ON ENTERPRISE NETWORKS   (Canada)

Author keywords

Evolution strategies; Evolutionary algorithms; Genetic algorithms; Particle swarm optimization; Vehicle routing

Indexed keywords

EID: 70449597677     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1080.0312     Document Type: Article

References (194)

1. Alba, E., B. Dorronsoro. 2004. Solving the vehicle routing problem by using cellular genetic algorithms. J. Gottlieb, G. R. Raidl, eds. Evolutionary Computation in Combinatorial Optimization. Lecture Notes in Computer Science, Vol.3004. Springer-Verlag, Berlin, 11-20.
2. Alba, E., B. Dorronsoro. 2006. Computing nine new best-so-far solutions for capacitated VRP with a cellular genetic algorithm. Inform. Processing Lett. 98(6) 225-230.
3. Alvarenga, G. B., G. R. Mateus. 2004a. A two-phase genetic and set partitioning approach for the vehicle routing problem with time windows. M. Ishikawa, S. Hashimoto, M. Paprzycki, E. Barakova, K. Yoshida, M. K̈ ppen, D. W. Corne, A. Abraham, eds. Proc. Fourth Internat. Conf. Hybrid Intelligent Systems, IEEE Computer Society Press, Los Alamitos, CA, 428-433.
4. Alvarenga, G. B., G. R. Mateus. 2004b. Hierarchical tournament selection genetic algorithm for the vehicle routing problem with time windows. M. Ishikawa, S. Hashimoto, M. Paprzycki, E. Barakova, K. Yoshida, M. Kö ppen, D. W. Corne, A. Abraham, eds. Proc. Fourth Internat. Conf. Hybrid Intelligent Systems, IEEE Computer Society Press, Los Alamitos, CA, 410-415.
5. Alvarenga, G. B., R. M. de Abreu Silva, R. M. Sampaio. 2005. A hybrid algorithm for the vehicle routing problem with time window. INFOCOMP J. Comput. Sci. 4(2) 9-16.
6. Alvarenga, G. B., G. R. Mateus, G. de Tomi. 2007. A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows. Comput. Oper. Res. 34(6) 1561-1584.
7. Augerat, P., J. M. Belenguer, E. Benavent, A. Corberá n, D. Naddef, G. Rinaldi. 1995. Computational results with a branch-and- cut code for the capacitated vehicle routing problem. Research Report 949-M, Université Joseph Fourier, Grenoble, France.
8. Baker, B. M., M. A. Ayechew. 2003. A genetic algorithm for the vehicle routing problem. Comput. Oper. Res. 30(5) 787-800.
9. Bean, J. C. 1994. Genetic algorithms and random keys for sequencing and optimization. ORSA J. Comput. 6(2) 154-160.
10. Bent, R., P. Van Hentenryck. 2004. A two-stage hybrid local search for the vehicle routing problem with time windows. Transportation Sci. 38(4) 515-530.
11. Benyahia, I., J.-Y. Potvin. 1995. Generalization and refinement of route construction heuristics using genetic algorithms. IEEE Internat. Conf. Evolutionary Comput., Perth, Australia, Vol.1. IEEE Press, Piscataway, NJ, 39-43.
12. Benyahia, I., J.-Y. Potvin. 1998. Decision support for vehicle dispatching using genetic programming. IEEE Trans. Systems, Man Cybernetics A 28(3) 306-314.
13. Berger, J., M. Barkaoui. 2003a. A hybrid genetic algorithm for the capacitated vehicle routing problem. E. Cantú -Paz, J. A. Foster, K. Deb, L. D. Davis, R. Roy, U.-M. O'Reilly, H. G. Beyer et al., eds. Proc. Genetic and Evolutionary Comput. Conf. Lecture Notes in Computer Science, Vol.2723. Springer-Verlag, Berlin, 646-656.
14. Berger, J., M. Barkaoui. 2003b. A new hybrid genetic algorithm for the capacitated vehicle routing problem. J. Oper. Res. Soc. 54(12) 1254-1262.
15. Berger, J., M. Barkaoui. 2004. A parallel hybrid genetic algorithm for the vehicle routing problem with time windows. Comput. Oper. Res. 31(12) 2037-2053.
16. 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.
17. Berger, J., M. Salois, R. Bé gin. 1998. A hybrid genetic algorithm for the vehicle routing problem with time windows. R. E. Mercer, E. Neufeld, eds. Advances in Artificial Intelligence. Lecture Notes in Computer Science, Vol.1418. Springer-Verlag, London, 114-127.
18. Berger, J., M. Sassi, M. Salois. 1999. A hybrid genetic algorithm for the vehicle routing problem with time windows and itinerary constraints. W. Banhaf, J. M. Daida, A. E. Eiben, M. H. Garzon, V. Honavar, M. J. Jakiela, R. E. Smith, eds. Proc. Genetic and Evolutionary Comput. Conf., Morgan Kaufmann, San Francisco, 44-51.
19. Beyer, H.-G., H.-P. Schwefel. 2002. Evolution strategies: A comprehensive introduction. Natural Comput. 1(1) 3-52.
20. Blanton, J. L., R. L. Wainwright. 1993. Multiple vehicle routing with time and capacity constraints using genetic algorithms. S. Forrest, ed. Proc. Fifth Internat. Conf. Genetic Algorithms, Morgan Kaufmann, San Mateo, CA, 451-459.
21. Blum, C., A. Roli. 2003. Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM Comput. Surveys 35(3) 268-308.
22. Brandao de Oliveira, H. C., J. L. Alexandrino, M. Moreira de Souza. 2006. Memetic and genetic algorithms: A comparison among different approaches to solve vehicle routing problem with time windows. Internat. Conf. Hybrid Intelligent Systems, Auckland, New Zealand, IEEE Computer Society Press, Los Alamitos, CA, 55.
23. Bräysy, O. 2003. A reactive variable neighborhood search for the vehicle routing problem with time windows. INFORMS J. Com-put. 15(4) 347-368. (Pubitemid 39042714)
24. Bräysy, O., W. Dullaert. 2003. A fast evolutionary metaheuristic for the vehicle routing problem with time windows. Internat. J. Artificial Intelligence Tools 12(2) 153-172.
25. Braysy, O., M. Gendreau. 2005. Vehicle routing problem with time windows, Part II: Metaheuristics. Transportation Sci. 39(1) 119-139.
26. Bräysy, O., J. Berger, M. Barkaoui. 2000. A new hybrid evolutionary algorithm for the vehicle routing problem with time windows. Route 2000 Workshop, Skodsborg, Denmark, Technical University of Denmark, Lyngby.
27. Bräysy, O., W. Dullaert, M. Gendreau. 2004a. Evolutionary algorithms for the vehicle routing problem with time windows. J. Heuristics 10(6) 587-611.
28. Bräysy, O., G. Hasle, W. Dullaert. 2004b. A multi-start local search algorithm for the vehicle routing problem with time windows. Eur. J. Oper. Res. 159(3) 586-605.
29. Calégari, P., G. Coray, A. Hertz, D. Kobler, P. Kluonen. 1999. A taxonomy of evolutionary algorithms in combinatorial optimization. J. Heuristics 5(2) 145-158.
30. Chang, Y., L. Chen. 2007. Solve the vehicle routing problem with time windows via a genetic algorithm. Discrete Continuous Dynamical Systems (Supplement) 240-249.
31. Chen, A.-L., G. K. Yang, Z. M. Wu. 2006. Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem. J. Zhejiang Univ. Sci. A 7(4) 607-614.
32. Chin, A. J., H. W. Kit, A. Lim. 1999. A new GA approach for the vehicle routing problem. IEEE Internat. Conf. Tools Artificial Intelligence, Chicago. IEEE Press, Piscataway, NJ, 307-310.
33. Christofides, N., A. Mingozzi, P. Toth. 1979. The vehicle routing problem. N. Christofides, A. Mingozzi, P. Toth, C. Sandi, eds. Combinatorial Optimization. John Wiley & Sons, Chichester, UK, 315-338.
34. Clarke, G., J. W. Wright. 1964. Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res. 12(4) 568-581.
35. Deb, K., S. Agrawa, A. Pratap, T. Meyarivan. 2000. A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II. M. Schoenauer, K. Deb, G. Rudolph, X. Yao, E. Lutton, J. J. Mereb, H. P. Schwefel, eds. Parallel Problem Solving from Nature PPSN VI. Lecture Notes in Computer Science, Vol.1917. Springer-Verlag, Berlin, 849-858.
36. Derigs, U., R. Kaiser. 2007. Applying the attribute based hill climber heuristic to the vehicle routing problem. Eur. J. Oper. Res. 177(2) 719-732.
37. Drummond, L. M. A., L. S. Ochi, D. S. Vianna. 2001. An asynchronous parallel metaheuristic for the period vehicle routing problem. Future Generation Comput. Systems 17(4) 379-386.
38. Dueck, G. 1993. New optimization heuristics: The great deluge algorithm and the record-to-record travel. J. Computational Phys. 104(1) 86-92.
39. Dueck, G., T. Scheurer. 1990. Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing. J. Computational Phys. 90(1) 161-175.
40. Feillet, D., P. Dejax, M. Gendreau. 2005. Traveling salesman problem with profits. Transportation Sci. 39(2) 188-205.
41. Filipec, M., D. Skrlec, S. Krajcar. 1997. Darwin meets computers: New approach to multiple depot capacitated vehicle routing problem. IEEE Internat. Conf. Systems, Man Cybernetics, Orlando, FL, Vol 1. IEEE Press, Piscataway, NJ, 421-426.
42. Filipec, M., D. Skrlec, S. Krajcar. 1998. An efficient implementation of genetic algorithms for constrained vehicle routing problem. IEEE Internat. Conf. Systems, Man Cybernetics, San Diego, Vol.3. IEEE Press, Piscataway, NJ, 2231-2236.
43. Filipec, M., D. Skrlec, S. Krajcar. 2000. Genetic algorithm approach for multiple depot capacitated vehicle routing problem solving with heuristic improvements. Internat. J. Model. Simulation 20(4) 320-328.
44. Fisher, M. L. 1994. Optimal solution of vehicle routing problems using minimum K-trees. Oper. Res. 42(4) 626-642.
45. Fox, B. R., M. B. McMahon. 1991. Genetic operators for sequencing problems. G. J. E. Rawlins, ed. Foundations ofGenetic Algorithms. Morgan Kaufmann, San Mateo, CA, 284-300.
46. Ganesh, K., T. T. Narendran. 2007. CLOVES: A cluster-and-search heuristic to solve the vehicle routing problem with delivery and pick-up. Eur. J. Oper. Res. 178(3) 699-717.
47. Gehring, H., J. Homberger. 1999. A parallel hybrid evolutionary metaheuristic for the vehicle routing problem with time windows. K. Miettinen, M. M. Mäkelä, J. Toivanen, eds. Proc. EUROGEN99-Short Course on Evolutionary Algorithms Engrg. Comput. Sci., Reports of the Department of Mathematical Information Technology, No. A 2/1999, University of Jyväskylä, Jyväskylä, Finland, 57-64.
48. Gehring, H., J. Homberger. 2001. A parallel two-phase metaheuris- tic for routing problems with time windows. Asia-Pacific J. Oper. Res. 18 35-47.
49. Gehring, H., J. Homberger. 2002. Parallelization of a two-phase metaheuristic for routing problems with time windows. J. Heuristics 8(3) 251-276.
50. Gendreau, M., J.-Y. Potvin. 2005. Metaheuristics in combinatorial optimization. Ann. Oper. Res. 140(1) 189-213.
51. Gendreau, M., G. Laporte, J.-Y. Potvin. 1997. Vehicle routing: Modern heuristics. J. K. Lenstra, E. H. L. Aarts, eds. Local Search in Combinatorial Optimization. John Wiley &Sons, Chichester, UK, 311-336.
52. Gendreau, M., G. Laporte, J.-Y. Potvin. 2002. Metaheuristics for the capacitated VRP. P. Toth, D. Vigo, eds. The Vehicle Routing Problem. SIAM Series on Discrete Mathematics and Applications, SIAM, Philadelphia, 129-154.
53. Gendreau, M., G. Laporte, J.-Y. Potvin, F. Semet. 2003. Métaheuris- tiques pour le problème des tournées de véhicules. M. Pirlot, J. Teghem, eds. Résolution de Problèmes de RO par les Métaheuris- tiques. Hermès, Paris, 49-70.
54. Gendreau, M., J.-Y. Potvin, O. Bräysy, G. Hasle, A. Lokketangen. 2008. Metaheuristics for the vehicle routing problem and extensions: A categorized bibliography. B. L. Golden, S. Raghavan, E. Wasil, eds. The Vehicle Routing Problem: Latest Advances and New Challenges. Springer, New York, 143-170.
55. Glover, F. 1996. Ejection chains, reference structures and alternating path methods for traveling salesman problems. Discrete Appl. Math. 65(1-3) 223-253.
56. Glover, F., M. Laguna. 1997. Tabu Search. Kluwer, Boston.
57. Goldberg, D. E., J. Richardson. 1987. Genetic algorithms with sharing for multimodal function optimization. J. J. Grefenstette, ed. Proc. Second Internat. Conf. Genetic Algorithms Their Appl., Lawrence Erlbaum Associates, Hillsdale, NJ, 41-49.
58. Goldberg, D. E., J. Richardson. 1988. Alleles, loci, and the traveling salesman problem. J. J. Grefenstette, ed. Proc. First Internat. Conf. Genetic Algorithms Their Appl., Lawrence Erlbaum Associates, Hillsdale, NJ, 154-159.
59. Goldberg, D. E., B. Korb, K. Deb. 1989. Messy genetic algorithms: Motivation, analysis, and first results. Complex Systems 3 493-530.
60. Golden, B. L., E. A. Wasil, J. P. Kelly, I.-M. Chao. 1998. The impact of metaheuristics on solving the vehicle routing problem: Algorithms, problem sets and computational results. T. G. Crainic, G. Laporte, eds. Fleet Management and Logistics. Kluwer, Norwell, MA, 33-56.
61. Haghani, A., S. Jung. 2005. A dynamic vehicle routing problem with time-dependent travel times. Comput. Oper. Res. 32(11) 2959-2986.
62. Han, S. 2004. A hybrid meta-heuristic algorithm for vehicle scheduling problem: Genetic algorithm and tabu search. NUCB J. Econom. Inform. Sci. 48 343-358.
63. Han, S., Y. Tabata. 2002. A hybrid genetic algorithm for the vehicle routing problem with controlling lethal gene. Internat. J. Asian Pacific Management Rev. 7(3) 287-298.
64. Hanshar, F. T., B. M. Ombuki-Berman. 2007. Dynamic vehicle routing using genetic algorithms. Appl. Intelligence 27(1) 89-99.
65. Ho, W.-K., J. Chin, A. Lim. 2001. A hybrid search algorithm for the vehicle routing problem with time windows. Internat. J. Artificial Intelligence Tools 10(3) 431-449.
66. Holland, J. H. 1975. Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor. [Reprint, MIT Press, Cambridge, MA 1992.]
67. Homberger, J., H. Gehring. 1999. Two evolutionary metaheuristics for the vehicle routing problem with time windows. INFOR 37(August) 297-318.
68. Homberger, J., H. Gehring. 2005. A two-phase hybrid metaheuristic for the vehicle routing problem with time windows. Eur. J. Oper. Res. 162(1) 220-238.
69. Housroum, H., T. Hsu, R. Dupas, G. Goncalves. 2006. A hybrid GA approach for solving the dynamic vehicle routing problem with time windows. IEEE Internat. Conf. Inform. Comm. Technologies, Damascus, Syria, Vol.1. IEEE Press, Piscataway, NJ, 787-792.
70. Hwang, H.-S. 2002. An improved model for vehicle routing problem with time constraint based on a genetic algorithm. Comput. Indust. Engrg. 42(2-4) 361-369.
71. Ibaraki, T., S. Imahori, M. Kubo, T. Masuda, T. Uno, M. Yagiura. 2005. Effective local search algorithms for routing and scheduling problems with general time window constraints. Transportation Sci. 39(2) 206-232.
72. Jaszkiewicz, A., P. Kominek. 2003. Genetic local search with distance preserving recombination operator for a vehicle routing problem. Eur. J. Oper. Res. 151(2) 352-364.
73. Jih, W.-R., J. Yung-Jen Hsu. 1999. Dynamic vehicle routing using hybrid genetic algorithms. IEEE Internat. Conf. Robotics and Automation, Detroit, Vol.1. IEEE Press, Piscataway, NJ, 453-458.
74. Jones, D. R., M. A. Beltramo. 1991. Solving partitioning problems with genetic algorithms. R. K. Belew, L. B. Booker, eds. Proc. Fourth Internat. Conf. Genetic Algorithms, Morgan Kaufmann, San Mateo, CA, 442-449.
75. Jorgensen, R. M., J. Larsen, K. B. Bergvinsdottir. 2007. Solving the dial-a-ride problem using genetic algorithms. J. Oper. Res. Soc. 58(10) 1321-1331.
76. Jozefowiez, N., F. Semet, E. G. Talbi. 2002. Parallel and hybrid models for multi-objective optimization: Application to the vehicle routing problem. J. J. M. Guervòs, P. Adamidis, H.-G. Beyer, J.-L. Fernàndez- Villacanas, H.-P. Schwefel, eds. Parallel Problem Solving from Nature-PPSN VII. Lecture Notes in Computer Science, Vol.2439. Springer-Verlag, Berlin, 271-280.
77. Jozefowiez, N., F. Semet, E. G. Talbi. 2006. Enhancements of NSGA- II and its application to the vehicle routing problem with route balancing. E.-G. Talbi, P. Liardet, P. Collet, E. Lutton, M. Schoenauer, eds. Artificial Evolution. Lecture Notes in Computer Science, Vol.3871. Springer-Verlag, Berlin, 131-142.
78. Jung, S., A. Haghani. 2000. Genetic algorithm for a pickup and delivery problem with time windows. Transportation Res. Record 1733 1-7.
79. Jung, S., A. Haghani. 2001. Genetic algorithm for the time- dependent vehicle routing problem. Transportation Res. Record 1771 164-171.
80. Jung, S., B.-R. Moon. 2000. The natural crossover for the 2D Euclidean TSP. D. Whitley, D. E. Goldberg, E. Cantu-Paz, L. Spector, I. C. Parmee, H.-G. Beyer, eds. Proc. Genetic and Evolutionary Comput. Conf., Morgan Kaufmann, San Francisco, 1003-1010.
81. Jung, S., B.-R. Moon. 2002. A hybrid genetic algorithm for the vehicle routing problem with time windows. W. B. Langdon, E. Cantú-Paz, K. E. Mathias, R. Roy, D. Davis, R. Poli, K. Balakrishnan et al., eds. Proc. Genetic and Evolutionary Com- put. Conf. , Morgan Kaufmann, San Francisco, 1309-1316.
82. Kennedy, J., R. C. Eberhart. 2001. Swarm Intelligence. Morgan Kaufmann, San Francisco. Kirkpatrick, S., C. D. Gelatt, Jr., M. P. Vecchi. 1983. Optimization by simulated annealing. Science 220(4598) 671-680.
83. Koza, J. R. 1992. Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge, MA.
84. Krajcar, S., D. Skrlec, B. Pribicevic, S. Blagajac. 1995. GA approach to solving multiple vehicle routing problem. C. A. Pinto-Ferreira, N. J. Mamede, eds. Progress in Artificial Intelligence. Lecture Notes in Computer Science, Vol.990. Springer-Verlag, Berlin, 473-481.
85. Kubiak, M. 2004. Systematic construction of recombination operators for the vehicle routing problem. Foundations Comput. Decision Sci. 29(3) 205-226.
86. Kubiak, M., P. Wesolek. 2007. Accelerating local search in a memetic algorithm for the capacitated vehicle routing problem. C. Cotta, J. van Hemert, eds. Evolutionary Computation in Combinatorial Optimization. Lecture Notes in Computer Science, Vol.4446. Springer-Verlag, Berlin, 96-107.
87. Laporte, G., M. Gendreau, J.-Y. Potvin, F. Semet. 2000. Classical and modern heuristics for the vehicle routing problem. Internat. Trans. Oper. Res. 7(4-5) 285-300.
88. Lau, H. C., Z. Liang. 2001. Pickup and delivery with time windows: Algorithms and test cases. IEEE Internat. Conf. Tools with Artificial Intelligence, Dallas, IEEE Computer Society, Los Alamitos, CA, 333-340.
89. Le Bouthillier, A. 2007. Recherches coopératives pour la résolution de problèmes d'optimisation combinatoire. Ph.D. thesis, Département d'informatique et de recherche opérationnelle, Université de Montréal, Montréal.
90. Le Bouthillier, A., T. G. Crainic. 2005. A cooperative parallel meta- heuristic for the vehicle routing problem with time windows. Comput. Oper. Res. 32(7) 1685-1708.
91. Le Bouthillier, A., T. G. Crainic, P. Kropf. 2005. A guided cooperative search for the vehicle routing problem with time windows. IEEE Intelligent Systems 20(4) 36-42.
92. Leclerc, F., J.-Y. Potvin. 1997. Genetic algorithms for vehicle dispatching. Internat. Trans. Oper. Res. 4(5-6) 391-400.
93. Li, H., A. Lim. 2001. A metaheuristic for solving the pickup and delivery problem with time windows. IEEE Internat. Conf. Tools with Artificial Intelligence, Dallas, IEEE Computer Society, Los Alamitos, CA, 160-167.
94. Li, F., B. L. Golden, E. A. Wasil. 2005. Very large-scale vehicle routing: New test problems, algorithms and results. Comput. Oper. Res. 32(5) 1165-1179.
95. Lin, S. 1965. Computer solutions of the traveling salesman problem. Bell Systems Tech. J. 44 2245-2269.
96. Louis, S. J., X. Yin, Z. Y. Yuan. 1999. Multiple vehicle routing with time windows using genetic algorithms. IEEE Congress on Evolutionary Comput., Washington, DC, IEEE Press, Piscataway, NJ, 1804-1808.
97. Machado, P., J. Tavares, F. B. Pereira, E. Costa. 2002. Vehicle routing problem: Doing it the evolutionary way. W. B. Langdon, E. Cantú-Paz, K. E. Mathias, R. Roy, D. Davis, R. Poli, K. Balakrishnan et al., eds. Proc. Genetic and Evolutionary Comput. Conf., Morgan Kaufmann, San Francisco, 690.
98. Maeda, O., M. Nakamura, B. Ombuki, K. Onaga. 1999. A genetic algorithm approach to vehicle routing problem with time deadlines in geographical information systems. IEEE Internat. Conf. Systems, Man Cybernetics, Tokyo, IEEE Press, Piscataway, NJ, 595-600.
99. Mester, D., O. Bräysy. 2005. Active guided evolution strategies for large-scale vehicle routing problems with time windows. Com-put. Oper. Res. 32(6) 1593-1614.
100. Mester, D., O. Bräysy. 2007. Active guided evolution strategies for large-scale capacitated vehicle routing problems. Comput. Oper. Res. 34(10) 2964-2975. (Pubitemid 46356733)
101. Mester, D., O. Bräysy, W. Dullaert. 2007. A multi-parametric evolution strategies algorithm for vehicle routing problems. Expert Systems Appl. 32(2) 508-517. (Pubitemid 44647817)
102. Michalewicz, Z. 1996. Genetic Algorithms + Data Structures = Evolution Programs, 3rd ed. Springer-Verlag, Berlin.
103. Mladenović, N., P. Hansen. 1997. Variable neighborhood search. Comput. Oper. Res. 24(11) 1097-1100.
104. Moin, N. H. 2002. Hybrid genetic algorithms for vehicle routing problems with time windows. Internat. J. Comput., Internet Management 10(1) 51-67.
105. Moscato, P. 1989. On evolution, search, optimization, genetic algorithms and martial arts: Towards memetic algorithms. Technical Report Caltech Concurrent Computation Program 826, California Institute of Technology, Pasadena.
106. Moscato, P., C. Cotta. 2003. A gentle introduction to memetic algorithms. F. Glover, G. A. Kochenberger, eds. Handbook of Metaheuristics. Kluwer, Boston, 105-144.
107. Mühlenbein, H., M. Gorges-Schleuter, O. Krämer. 1988. Evolution algorithms in combinatorial optimization. Parallel Comput. 7(1) 65-85.
108. Nagata, Y. 2007a. Edge assembly crossover for the capacitated vehicle routing problem. C. Cotta, J. van Hemert, eds. Evolutionary Computation in Combinatorial Optimization. Lecture Notes in Computer Science, Vol.4446. Springer-Verlag, Berlin, 142-153.
109. Nagata, Y. 2007b. Effective memetic algorithm for the vehicle routing problem with time windows: Edge assembly crossover for the VRPTW. Metaheuristics Internat. Conf., Montréal.
110. Nagata, Y., S. Kobayashi. 1997. Edge assembly crossover: A highpower genetic algorithm for the traveling salesman problem. T. Bäck, ed. Proc. Seventh Internat. Conf. Genetic Algorithms, Morgan Kaufmann, San Francisco, 450-457.
111. Nanry, W. P., J. W. Barnes. 2000. Solving the pickup and delivery problem with time windows using reactive tabu search. Transportation Res. B 34(2) 107-121.
112. Ochi, L. S., D. S. Vianna, L. M. A. Drummond, A. O. Victor. 1998a. A parallel evolutionary algorithm for the vehicle routing problem with heterogeneous fleet. Future Generation Comput. Systems 14(5-6) 285-292.
113. Ochi, L. S., D. S. Vianna, L. M. A. Drummond, A. O. Victor. 1998b. An evolutionary hybrid metaheuristic for solving the vehicle routing problem with heterogeneous fleet. W. Banzhaf, R. Poli, M. Schoenauer, T. C. Fogarty, eds. Genetic Programming: First Eur. Workshop. Lecture Notes in Computer Science, Vol.1391. Springer-Verlag, Berlin, 187-195.
114. Oliver, I. M., D. J. Smith, J. R. C. Holland. 1987. A study of permutation crossover operators on the traveling salesman problem. J. J. Grefenstette, ed. Proc. Second Internat. Conf. Genetic Algorithms Their Appl., Lawrence Erlbaum Associates, Hillsdale, NJ, 224-230.
115. Ombuki, B., M. Nakamura, O. Maeda. 2002. A hybrid search based on genetic algorithms and tabu search for vehicle routing. IASTED Internat. Conf. Artificial Intelligence Soft Comput., Banff, Canada, ACTA Press, Calgary, ON, Canada, 176-181.
116. Ombuki, B., B. J. Ross, F. Hanshar. 2006. Multi-objective genetic algorithms for vehicle routing problem with time windows. Appl. Intelligence 24(1) 17-30.
117. Or, I. 1976. Traveling salesman-type combinatorial problems and their relation to the logistics of blood banking. Ph.D. thesis, Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, IL.
118. Osman, I. H. 1993. Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Ann. Oper. Res. 41(1-4) 421-451.
119. Ozdemir, H. T., C. K. Mohan. 2000. Evolving schedule graphs for the vehicle routing problem with time windows. IEEE Congress on Evolutionary Comput., La Jolla, CA, Vol.2. IEEE Press, Piscat-away, NJ, 888-895.
120. Pankratz, G. 2005a. A grouping genetic algorithm for the pickup and delivery problem with time windows. OR Spectrum 27(1) 21-41.
121. Pankratz, G. 2005b. Dynamic vehicle routing by means of a genetic algorithm. Internat. J. Physical Distribution Logist. 35(5) 362-383.
122. Pedroso, J. P. 1998. Niche search: An application in vehicle routing. IEEE Internat. Conf. Evolutionary Comput., Anchorage, AK, IEEE Press, Piscataway, NJ, 177-182.
123. Pereira, F. B., J. Tavares, P. Machado, E. Costa. 2002. GVR: A new genetic representation for the vehicle routing problem. M. O'Neill, R. F. E. Sutcliffe, C. Ryan, M. Eaton, eds. Artificial Intelligence and Cognitive Science. Lecture Notes in Computer Science, Vol.2464. Springer-Verlag, Berlin, 95-102.
124. Pisinger, D., S. Ropke. 2007. A general heuristic for vehicle routing problems. Comput. Oper. Res. 34(8) 2403-2435.
125. Potter, T., T. Bossomaier. 1995. Solving vehicle routing problems with genetic algorithms. IEEE Internat. Conf. Evolutionary Comput., Perth, Australia, Vol.2. IEEE Press, Piscataway, NJ, 788-793.
126. Potvin, J.-Y. 1996. Genetic algorithms for the traveling salesman problem. Ann. Oper. Res. 63(3) 339-370.
127. Potvin, J.-Y., S. Bengio. 1996. The vehicle routing problem with time windows, Part II: Genetic search. INFORMS J. Comput. 8(2) 165-172.
128. Potvin, J.-Y., D. Dubé. 1994. Improving a vehicle routing heuristic through genetic search. IEEE Internat. Conf. Evolutionary Comput., Orlando, FL, IEEE Press, Piscataway, NJ, 194-199.
129. Potvin, J.-Y., F. Guertin. 1997. Coupling a greedy route construction heuristic with a genetic algorithm for the vehicle routing problem with time windows. R. S. Barr, R. V. Helgason, J. L. Kennington, eds. Advances in Metaheuristics, Optimization and Stochastic Modeling Technologies. Kluwer, Boston, 423-442.
130. Potvin, J.-Y., J.-M. Rousseau. 1993. A parallel route building algorithm for the vehicle routing and scheduling problem with time windows. Eur. J. Oper. Res. 66(3) 331-340.
131. Potvin, J.-Y., J.-M. Rousseau. 1995. An exchange heuristic for routing problems with time windows. J. Oper. Res. Soc. 46(12) 1433-1446.
132. Potvin, J.-Y., S. R. Thangiah. 1999. Vehicle routing through simulation of natural processes. L. C. Jain, N. M. Martin, eds. Fusion of Neural Networks, Fuzzy Sets and Genetic Algorithms: Industrial Applications. CRC Press, Boca Raton, FL, 141-168.
133. Potvin, J.-Y., D. Dubé, C. Robillard. 1996a. A hybrid approach to vehicle routing using neural networks and genetic algorithms. Appl. Intelligence 6(3) 241-252.
134. Potvin, J.-Y., C. Duhamel, F. Guertin. 1996b. A genetic algorithm for vehicle routing with backhauling. Appl. Intelligence 6(4) 345-355.
135. Prescott-Gagnon, E., G. Desaulniers, L.-M. Rousseau. 2007. A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows. Technical Report G-2007-2067, Groupe d'études et de Recherche en Analyse des Décisions, Montréal.
136. Prins, C. 2004. A simple and effective evolutionary algorithm for the vehicle routing problem. Comput. Oper. Res. 31(12) 1985-2002.
137. Prins, C., C. Prodhon, R. W. Calvo. 2006. A memetic algorithm with population management (MA/PM) for the capacitated location-routing problem. J. Gottlieb, G. R. Raidl, eds. Evolutionary Computation in Combinatorial Optimization. Lecture Notes in Computer Science, Vol.3906. Springer-Verlag, Berlin, 183-194.
138. Rahoual, M., B. Kitoun, M.-H. Mabed, V. Bachelet, F. Benameur. 2001. Multicriteria genetic algorithms for the vehicle routing problem with time windows. Metaheuristics Internat. Conf., Porto, Portugal, 527-532.
139. Rochat, Y, é. D. Taillard. 1995. Probabilistic diversification and intensification in local search for vehicle routing. J. Heuristics 1(1) 147-167.
140. Ropke, S., D. Pisinger. 2006. An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation Sci. 40(4) 455-472.
141. Ropke, S., J.-F. Cordeau, G. Laporte. 2007. Models and branch-and- cut algorithms for pickup and delivery problems with time windows. Networks 49(4) 258-272.
142. Russell, R. A. 1995. Hybrid heuristics for the vehicle routing problem with time windows. Transportation Sci. 29(2) 156-166.
143. Russell, M. A., G. B. Lamont. 2005. A genetic algorithm for unmanned aerial vehicle routing. H.-G. Beyer, U.-M. O'Reilly, eds. Proc. Genetic and Evolutionary Comput. Conf., ACM Press, New York, 1523-1530.
144. Salhi, S., S. R. Thangiah, F. Rahman. 1998. A genetic clustering method for the multi-depot vehicle routing problem. G. D. Smith, N. C. Steele, R. F. Albrecht, eds. Artificial Neural Networks and Genetic Algorithms. Springer-Verlag, Vienna, 234-237.
145. Santos, H. G., L. S. Ochi, E. H. Marinho, L. M. A. Drummond. 2006. Combining an evolutionary algorithm with data mining to solve a single-vehicle routing problem. Neurocomputing 70(1-3) 70-77.
146. Schmitt, L. J. 1994. An empirical computational study of genetic algorithms to solve order-based problems: An emphasis on the TSP and VRPTC. Doctoral dissertation, Fogelman College of Business and Economics, University of Memphis, Memphis, TN.
147. Schönberger, J., H. Kopfer. 2003a. A combined approach to solve the pickup and delivery selection problem. U. Leopold Wildburger, F. Rendl, G. Wäscher, eds. Oper. Res. Proc. 2002, Springer-Verlag, Berlin, 150-155.
148. Schönberger, J., H. Kopfer. 2003b. A memetic algorithm for a pickup and delivery selection problem. M. Mohammadian, ed. Proc. Internat. Conf. Computational Intelligence for Modeling, Control and Automation (CIMCA 2003), Vienna, University of Canberra, Canberra, Australia.
149. Schönberger, J., H. Kopfer. 2004. Planning the incorporation of logistics service providers to fulfill precedence and time window-constrained transport requests in a most profitable way B. Fleischmann, A. Klose, eds. Distribution Logistics: Advanced Solutions to Practical Problems. Springer-Verlag, Berlin, 141-158.
150. Schrimpf, G., J. Schneider, H. Stamm-Wilmbrandt, G. Duek. 2000. Record breaking optimization results using the ruin and recreate principle. J. Computational Phys. 159(2) 139-171.
151. Shaw, P. 1998. Using constraint programming and local search methods to solve vehicle routing problems. M. Maher, J.-F. Puget, eds. Principles and Practice of Constraint Programming CP98. Lecture Notes in Computer Science, Vol.1520. SpringerVerlag, New York, 417-431.
152. Skok, M., D. Skrlec, S. Krajcar. 2000a. The genetic algorithm method for multiple depot capacitated vehicle routing problem solving. Internat. Conf. Knowledge-Based Intelligent Engrg. Systems Allied Technologies, Brighton, UK, IEEE Press, Piscataway, NJ, 520-526.
153. Skok, M., D. Skrlec, S. Krajcar. 2000b. The non-fixed destination multiple depot capacitated vehicle routing problem and genetic algorithms. Internat. Conf. Inform. Tech. Interfaces, Zagreb, Croatia, 403-408.
154. Skrlec, D., M. Filipec, S. Krajcar. 1997. A heuristic modification of genetic algorithm used for solving the single depot capacitated vehicle routing problem. Intelligent Inform. Systems, Grand Bahama Island, Bahamas, IEEE Computer Society, Los Alamitos, CA, 184-188.
155. Solomon, M. M. 1987. Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35(2) 254-265.
156. Srinivas, N., K. Deb. 1994. Multi-objective function optimization using non-dominated sorting genetic algorithms. Evolutionary Comput. J. 2(3) 221-248.
157. Syswerda, G. 1989. Uniform crossover in genetic algorithms. J. D. Schaffer, ed. Proc. Third Internat. Conf. Genetic Algorithms, Morgan Kaufmann, San Mateo, CA, 2-9.
158. Taillard, É. D. 1993. Parallel iterative search methods for vehicle routing problems. Networks 23(8) 661-673.
159. Taillard, E. D., 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(2) 170-186. (Pubitemid 127597092)
160. Tan, K. C., Y. H. Chew, L. H. Lee. 2006a. A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems. Eur. J. Oper. Res. 172(3) 855-885.
161. Tan, K. C., Y. H. Chew, L. H. Lee. 2006b. A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows. Computational Optim. Appl. 34(1) 115-151.
162. Tan, K. C., L. H. Lee, K. Ou. 2001a. Artificial intelligence heuristics in solving vehicle routing problems with time window constraints. Engrg. Appl. Artificial Intelligence 14(6) 825-837. (Pubitemid 34715825)
163. Tan, K. C., L. H. Lee, K. Ou. 2001b. Hybrid genetic algorithms in solving vehicle routing problems with time window constraints. Asia-Pacific J. Oper. Res. 18 121-130. (Pubitemid 32618426)
164. Tan, K. C., T. H. Lee, Y. H. Chew, L. H. Lee. 2003a. A hybrid mul-tiobjective evolutionary algorithm for solving truck and trailer vehicle routing problems. IEEE Congress on Evolutionary Computation, Canberra, Australia, Vol.3. IEEE Press, Piscataway, NJ, 2134-2141.
165. Tan, K. C., T. H. Lee, Y. H. Chew, L. H. Lee. 2003b. A multi-objective evolutionary algorithm for solving vehicle routing problem with time windows. IEEE Internat. Conf. Systems, Man Cybernetics, Washington, DC, Vol.1. IEEE Press, Piscataway, NJ, 361-366.
166. Tan, K. C., T. H. Lee, K. Ou, L. H. Lee. 2001c. A messy genetic algorithm for the vehicle routing problem with time window constraints. IEEE Congress on Evolutionary Computation, Seoul, South Korea, Vol.1. IEEE Press, Piscataway, NJ, 679-686.
167. Tan, K. C., L. H. Lee, K. Q. Zhu, K. Ou. 2001d. Heuristic methods for vehicle routing problem with time windows. Artificial Intell gence Engrg. 15(3) 281-295.
168. Tarantilis, C. D. 2005. Solving the vehicle routing problem with adaptive memory programming methodology. Comput. Oper. Res. 32(9) 2309-2327.
169. Tavakkoli-Moghaddam, R., A. R. Saremi, M. S. Ziaee. 2006. A memetic algorithm for a vehicle routing problem with back-hauls. Appl. Math. Comput. 181(2) 1049-1060.
170. Tavares, J., F. B. Pereira, P. Machado, E. Costa. 2002. GVR delivers it on time. Asia-Pacific Conf. Simulated Evolution Learn., Singapore, 745-749.
171. Tavares, J., F. B. Pereira, P. Machado, E. Costa. 2003a. Crossover and diversity: A study about GVR. Analysis and Design ofRepresen tations and Operators: A Bird-of-a-Feather Workshop at the 2003 Genetic and Evolutionary Comput. Conf., Chicago, 27-33.
172. Tavares, J., F. B. Pereira, P. Machado, E. Costa. 2003b. On the influence of GVR in vehicle routing. ACM Sympos. Appl. Comput., Melbourne, FL, 753-758.
173. Thangiah, S. R. 1995a. An adaptive clustering method using a geometric shape for vehicle routing problems with time windows. L. J. Eshelman, ed. Proc. Sixth Internat. Conf. Genetic Algorithms, Morgan Kaufmann, San Francisco, 536-543.
174. Thangiah, S. R. 1995b. Vehicle routing with time windows using genetic algorithms. L. Chambers, ed. Practical Handbook of Genetic Algorithms: New Frontiers, Vol.II. CRC Press, Boca Raton, FL, 253-277.
175. Thangiah, S. R. 1999. A hybrid genetic algorithm, simulated annealing and tabu search heuristic for vehicle routing problems with time windows. L. Chambers, ed. Practical Handbook ofGenetic Algorithms: Complex Coding Systems, Vol.III. CRC Press, Boca Raton, FL, 347-384.
176. Thangiah, S. R., A. V. Gubbi. 1993. Effect of genetic sectoring on vehicle routing problems with time windows. IEEE Internat. Conf. Developing and Managing Intelligent System Projects, Washington, DC, IEEE Computer Society Press, Los Alamitos, CA, 146-153.
177. Thangiah, S. R., K. E. Nygard. 1992. School bus routing using genetic algorithms. G. Biswas, ed. Applications of Artificial Intelligence X: Knowledge-Based Systems. SPIE, Bellingham, WA, 387-398.
178. Thangiah, S. R., P. Petrovic. 1998. Introduction to genetic heuristics and vehicle routing problems with complex constraints. D. L. Woodruff, ed. Advances in Computational and Stochastic Optimization, Logic Programming, and Heuristic Search. Kluwer, Boston, 253-286.
179. Thangiah, S. R., S. Salhi. 2001. Genetic clustering: An adaptive heuristic for the multidepot vehicle routing problem. Appl. Artificial Intelligence 15(4) 361-383.
180. Thangiah, S. R., K. E. Nygard, P. L. Juell. 1991. GIDEON: A genetic algorithm system for vehicle routing with time windows. IEEE Conf. Artificial Intelligence Appl., Miami, FL, IEEE Computer Society Press, Los Alamitos, CA, 322-328.
181. Thangiah, S. R., R. Vinayagamoorthy, A. V. Gubbi. 1993. Vehicle routing with time deadlines using genetic and local algorithms. S. Forrest, ed. Proc. Fifth Internat. Conf. Genetic Algorithms, Morgan Kaufmann, San Mateo, CA, 506-513.
182. Thangiah, S. R., I. H. Osman, R. Vinayagamoorthy, T. Sun. 1995. Algorithms for the vehicle routing problems with time deadlines. Amer. J. Math. Management Sci. 13(3-4) 323-355.
183. Tong, Z., L. Ning, S. Debao. 2004. Genetic algorithm for vehicle routing problem with time window with uncertain vehicle number. World Congress on Intelligent Control and Automation, Hangzhou, China, 2846-2849.
184. Toth, P., D. Vigo. 2003. The granular tabu search and its application to the vehicle-routing problem. INFORMS J. Comput. 15(4) 333-346.
185. Van Breedam, A. 1994. An analysis of the behavior of heuristics for the vehicle routing problem for a selection of problems with vehicle-related, customer-related and time-related constraints. Doctoral dissertation, Faculty of Applied Economics, University of Antwerp, Antwerp, Belgium.
186. Van Breedam, A. 1996. An analysis of the effect of local improvement operators in genetic algorithm and simulated annealing for the vehicle routing problem. RUCA Working Paper 96/14, University of Antwerp, Antwerp, Belgium.
187. Vianna, D. S., L. S. Ochi, L. M. A. Drummond. 1999. A parallel evolutionary metaheuristic for the period vehicle routing problem. J. P. D. Rolim et al., eds. Parallel and Distributed Processing. Lecture Notes in Computer Science, Vol.1586. Springer-Verlag, Berlin, 183-191.
188. Voudouris, C., E. P. K. Tsang. 1995. Guided local search. Technical Report CSM-247, Department of Computer Science, University of Essex, Colchester, UK.
189. Voudouris, C., E. P. K. Tsang. 2003. Guided local search. F. Glover, G. A. Kochenberger, eds. Handbook of Metaheuristics. Kluwer, Boston, 185-218.
190. Whitley, D. 1989. The GENITOR algorithm and selection pressure: Why rank-based allocation of reproductive trials is best. J. D. Schaffer, ed. Proc. Third Internat. Conf. Genetic Algorithms, Morgan Kaufmann, San Mateo, CA, 116-121.
191. Yagiura, M., T. Ibaraki. 2001. On metaheuristic algorithms for combinatorial optimization problems. Systems Comput. Japan 32(3) 33-55.
192. Zhu, K. Q. 2000. A new genetic algorithm for VRPTW. H. R. Arabnia, ed. Proc. Internat. Conf. Artificial Intelligence. CSREA Press, Las Vegas, NV, 1-10.
193. Zhu, K. Q. 2003. A diversity-controlling adaptive genetic algorithm for the vehicle routing problem with time windows. Internat. Conf. Tools Artificial Intelligence, Sacramento, CA, IEEE Computer Society, Los Alamitos, CA, 176-183.
194. Zhu, Q., L. Qian, Y. Li, S. Zhu. 2006. An improved particle swarm optimization algorithm for vehicle routing problem with time windows. IEEE Congress on Evolutionary Comput., Vancouver, IEEE Press, Piscataway, NJ, 1386-1390.