DocumentCode :
459048
Title :
Solving the Multi-vehicle Pick-up and Delivery Problem with Time Widows by New Construction Heuristic
Author :
Zhou, Changfeng ; Tan, Yuejin ; Liao, Liangcai ; Liu, Yan
Author_Institution :
Sch. of Inf. Syst. & Manage., Nat. Univ. of Defense Technol., Changsha
Volume :
2
fYear :
2006
fDate :
16-18 Oct. 2006
Firstpage :
1035
Lastpage :
1042
Abstract :
A new insertion-based construction heuristic is presented to solve the multi-vehicle pickup and delivery problem with time windows. A non-standard measure, crossing length percentage, is presented in the insertion evaluation criteria to quantify the visual attractiveness of the solution. The heuristic is compared with a sequential and a parallel insertion heuristic on different benchmarking problems, and the computational results show that the proposed heuristic performs better with respect to both the standard and non-standard measures
Keywords :
computational complexity; transportation; crossing length percentage; insertion-based construction heuristic; multivehicle delivery problem; multivehicle pick-up problem; time windows; Clustering algorithms; Concurrent computing; Costs; Information management; Length measurement; Management information systems; Routing; Technology management; Time factors; Vehicles;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Intelligent Systems Design and Applications, 2006. ISDA '06. Sixth International Conference on
Conference_Location :
Jinan
Print_ISBN :
0-7695-2528-8
Type :
conf
DOI :
10.1109/ISDA.2006.253754
Filename :
4021806
Link To Document :
بازگشت