Multi-generation compete genetic algorithms and its application in vehicle routing problem

International Conference on Transportation Engineering 2007, ICTE 2007

Volumn , Issue , 2007, Pages 3184-3189

  Deng, Lianbo ^a   Shi, Feng ^a   Liang, Ting ^a  

^a CENTRAL SOUTH UNIVERSITY   (China)

Author keywords

Genetic algorithm; Multi generation compete; Vehicle routing problem

Indexed keywords

MULTI GENERATION COMPETE; VEHICLE ROUTING PROBLEMS;

ITERATIVE METHODS; PROBLEM SOLVING; VEHICLE ROUTING;

GENETIC ALGORITHMS;

EID: 37749028490     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1061/40932(246)522     Document Type: Conference Paper

References (6)

1. Baker B. M., Ayechew M.A. (2003).A genetic algorithm for the vehicle routing problem. Computers & Operations Research, 30, 787-800.
2. Breedam A.V. (1996). An analysis of the effect of local improvement operators in genetic algorithms and simulated annealing for the vehicle routing problem. RUCA working paper 96/14, University of Antwerp, Belgium.
3. Lenstra J.K., Rinnooy K. (1981). Complexity of vehicle routing and scheduling problem. Networks, (11):221-262.
4. LI J., GUO Y. H. (2001). Logistics Distribution optimal schedules theory and means. China logistics publishing house, Bei Jing, 113-134.
5. Potvin J.Y, Bengio S. (1996). The vehicle routing problem with time windows(II): genetic search. Informs journal on computing, (8): 165-172.
6. Thangiah S.R. (1993). Vehicle routing problem with time windows using genetic algorithms. Technical Report SRU-CpSc-TR-93-23, Slippery Rock University, Slippery Rock, PA.