Multiple vehicle routing with time windows using genetic algorithms

Proceedings of the 1999 Congress on Evolutionary Computation, CEC 1999

Volumn 3, Issue , 1999, Pages 1804-1808

  Louis, Sushi J ^a   Yin, Xiangying ^b   Yuan, Zhen Ya ^b  

^a University of Nevada   (United States)

^b University of Nevada   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GENETIC ALGORITHMS;

BENCH-MARK PROBLEMS; BETTER PERFORMANCE; CROSSOVER OPERATOR; VEHICLE ROUTING PROBLEM WITH TIME WINDOWS; VEHICLE ROUTING WITH TIME WINDOWS;

VEHICLE ROUTING;

EID: 84901405468     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.1999.785493     Document Type: Conference Paper

References (7)

1. Blanton (Jr), J. L. and Wainwright, R. L. (1991). Multiple vehicle routing with time and capacity constraints using genetic algorithms. In Proceedings of the Fourth International Conference on Genetic Algorithm., pages 452-459.
2. Desrochers, M., Desrosiers, J., and Solomon, M. (1992). A new optimization algorithm for the vehicle routing problem with time windows. Operations Research, 40(2):342-354.
3. Goldberg, D. E. (1989). Genetic Algorithms in Search, Optimization, and Machine Learning. Addision-Wesley Publishing Company, Inc., New York.
4. Holland, J. (1975). Adaptation In Natural and Artificial Systems. The University of Michigan Press, Ann Arbor.
5. Savelsbergh, M. W. P. (1985). Local search for routing problems with time windows. Ann. of Operations Research, 4:285-305.
6. Solomon (1998). Ultimate list of vehicle routing reference, http://www.imm.dtu.dk/~orgroup/vrp.
7. Thangiah, S. R. and Nygard, K. E. (1991). Gideon: A genetic algorithm system for vehicle routing with time windows. In Applications Handbook of Genetic Algorithms: New Frontiers, Volume II, pages 322-328. L. Chambers, CRC Press, Florida.