DocumentCode :
3510020
Title :
Study on Multi-depot Vehicle Scheduling Problem Based on Milk-Run Model
Author :
Dai Ying ; Xia Wen-hui ; Ge Xian-long
Author_Institution :
Coll. of Bus. Adm., Chongqing Univ. of Technol., Chongqing, China
Volume :
2
fYear :
2010
fDate :
11-12 Nov. 2010
Firstpage :
444
Lastpage :
448
Abstract :
After analyzing the multi-depot vehicle scheduling problem, a mathematical model which takes the shortest single distribution as the target function was built. First of all, the paper make it to be the different single distribution center vehicle scheduling problem by dividing all the suppliers, then use genetic algorithm to solve the single distribution center VSP problem. Finally, verify the effectiveness of the model and the algorithm with examples based on the Maple soft.
Keywords :
facility location; genetic algorithms; scheduling; transportation; vehicles; Maple soft; VSP problem; genetic algorithm; mathematical model; milk run model; multidepot vehicle scheduling problem; single distribution center vehicle scheduling; target function; Genetic Algorithm; Milk-run; VSP;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Optoelectronics and Image Processing (ICOIP), 2010 International Conference on
Conference_Location :
Haiko
Print_ISBN :
978-1-4244-8683-0
Type :
conf
DOI :
10.1109/ICOIP.2010.12
Filename :
5662894
Link To Document :
بازگشت