Two-phase genetic-annealing algorithm for vehicle routing problem with multiple constraints

Hsi-An Chiao Tung Ta Hsueh/Journal of Xi'an Jiaotong University

Volumn 39, Issue 12, 2005, Pages 1299-1302

  Lu, Jun ^a   Feng, Boqin ^a   Li, Bo ^a  

^a XI'AN JIAOTONG UNIVERSITY   (China)

Author keywords

Genetics annealing algorithm; Greedy algorithm; Vehicle routing

Indexed keywords

CONSTRAINT THEORY; GENETIC ALGORITHMS; SIMULATED ANNEALING;

GENETICS-ANNEALING ALGORITHM; GREEDY ALGORITHM; VEHICLE ROUTING;

TRAFFIC CONTROL;

EID: 31844438906     PISSN: 0253987X     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (5)

1. Dantzig G B, Ramser R H. The truck dispatching problem[J]. Management Science, 1959, 6(1): 80-91.
2. Bräysy O, Berger J, Barkaoui M. A new hybrid evolutionary algorithm for the vehicle routing problem with time windows[A]. The Route 2000 Workshop, Skodsborg, Denmark, 2000.
3. Zou T, Li N, Sun D B. Genetic algorithm for vehicle routing problem with time window with uncertain vehicle number[A]. Fifth World Congress on Intelligent Control and Automation, Hangzhou, China, 2004.
4. Louis S J, Yin X Y, Zhen Y Y. Multiple vehicle routing with time windows using genetic algorithms[A]. Congress on Evolutionary Computation, Washington DC, 1999.
5. Mak K L, Guo Z G. A genetic algorithm for vehicle routing problems with stochastic demand and soft time windows[A]. IEEE Systems and Information Engineering Design Symposium, Charlottesville, USA, 2004.