DocumentCode :
2964482
Title :
Modeling of a Time Dependent Alternative Vehicle Routing Problem with Time Windows
Author :
Wang, Hsiao-Fan ; Lee, Yen-Yi
Author_Institution :
Dept. of IEEM, Nat. Tsing Hua Univ., Hsinchu, Taiwan
fYear :
2011
fDate :
12-14 Aug. 2011
Firstpage :
1
Lastpage :
4
Abstract :
In this study, we consider congested situation and edge choosing problem simultaneously in the VRP transportation planning and this problem is called the Time Dependent Alternative Vehicle Routing Problem with Time Windows (TDAVRPTW). Given a multi- graph, the problem can be formulated into a mixed integer programming model with continuous dependent travel time functions. Numerical example shows the applicability of the model.
Keywords :
graph theory; integer programming; transportation; vehicles; VRP; alternative vehicle routing problem; congested situation problem; edge choosing problem; mixed integer programming; multigraph; time dependent problem; time windows; transportation planning; Companies; Planning; Routing; Silicon; Time factors; Vehicles;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Management and Service Science (MASS), 2011 International Conference on
Conference_Location :
Wuhan
Print_ISBN :
978-1-4244-6579-8
Type :
conf
DOI :
10.1109/ICMSS.2011.5998240
Filename :
5998240
Link To Document :
بازگشت