Solving the Vehicle Routing Problem by Using Cellular Genetic Algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3004, Issue , 2004, Pages 11-20

  Alba, Enrique ^a   Dorronsoro, Bernabé ^a  

^a UNIVERSITY OF MÁLAGA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; GENETIC ALGORITHMS; LOCAL SEARCH (OPTIMIZATION); NETWORK ROUTING; OPTIMIZATION; ROUTING ALGORITHMS; STRUCTURED PROGRAMMING;

CELLULAR GENETIC ALGORITHMS; COMPLEX PROBLEMS; GENETIC ALGORITHM (GAS); LOCAL SEARCH OPERATORS; LOCAL SEARCH TECHNIQUES; POPULATION DIVERSITY; VEHICLE ROUTING PROBLEM; VEHICLE ROUTING PROBLEMS;

ALGORITHMS;

EID: 33646079146     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24652-7_2     Document Type: Article

References (21)

1. Toth, P., Vigo, D.: The Vehicle Routing Problem. Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia (2001)
2. Dantzing, G., Ramster, R.: The truck dispatching problem. Management Science 6 (1959) 80-91
3. Christofides, N., Mingozzi, A., Toth, P.: The Vehicle Routing Problem. In: Combinatorial Optimization. John Wiley (1979) 315-338
4. Manderick, B., Spiessens, P.: Fine-grained parallel genetic algorithm. In Schaffer, J., ed.: 3rd ICGA, Morgan - Kaufmann (1989) 428-433
5. Lenstra, J., Kan, A.R.: Complexity of vehicle routing and scheduling problems. Networks 11 (1981) 221-227
6. Whitley, D.: Cellular genetic algorithms. In Forrest, S., ed.: Proceedings of the 5th ICGA, Morgan - Kaufmann, CA (1993) 658
7. Whitley, D., Starkweather, T., Fuquay, D.: Scheduling problems and traveling salesman: The genetic edge recombination operator. In Schaffer, J., ed.: 3rd ICGA, Morgan - Kaufmann (1989) 133-140
8. Fogel, D.: An evolutionary approach to the traveling salesman problem. Biological Cybernetics 60 (1988) 139-144
9. Banzhaf, W.: The "molecular" traveling salesman. Biological Cybernetics 64 (1990) 7-14
10. Holland, J.: Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor, MI (1975)
11. Rochat, Y., Taillard, E.: Probabilistic diversification and intensification in local search for vehicle routing. J. of Heuristics 1 (1995) 147-167
12. Berger, J., Barkaoui, M.: A hybrid genetic algorithm for the capacitated vehicle routing problem. In Cantú-Paz, E., ed.: GECCO03. LNCS 2723, Illinois, Chicago, USA, Springer - Verlag (2003) 646-656
13. Croes, G.: A method for solving traveling salesman problems. Operations Research 6 (1958) 791-812
14. Osman, I.: Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problems. Annals of Operations Research 41 (1993) 421-451
15. Beasley, J.: OR-library: Distributing test problems by electronic mail. J. of the Operational Research Society 11 (1990) 1069-1072
16. Clarke, G., Wright, J.: Scheduling of vehicles from a central depot to a number of delivery points. Operations Research 12 (1964) 568-581
17. Wren, A., Holliday, A.: Computer scheduling of vehicles from one or more depots to a number of delivery points. Operational Research Quarterly 23 (1972) 333-344
18. Ryan, D., Hjorring, C., Glover, F.: Extensions of the petal method for vehicle routing. J. of the Operational Research Society 44 (1993) 289-296
19. Prins, C.: A simple and effective evolutionary algorithm for the vehicle routing problem. Computers and Operations Research (2003) In Press, Corrected Proof.
20. Bullnheimer, B., Hartl, R., Strauss, C.: An improved ant system algorithm for the vehicle routing problem. Annals of Operations Research 89 (1999) 319-328
21. Reimann, M., Doerner, K., Hartl, R.: D-ants: Savings based ants divide and conquer the vehicle routing problem. Computers & Operations Res. 31 (2004) 563-591