Title
Branch and bound algorithm for a single vehicle routing problem with toll-by-weight scheme
Abstract
Most of previous studies on vehicle routing problems assume that traversal cost of each edge is simply equivalent to a constant number. Unfortunately, the models of this kind can not be applied in China because toll per kilometer of Chinese expressways varies with vehicle's weight. Motivated by rapidly increasing market of expressway transportation in China, we address a new and special vehicle routing problem that takes a single vehicle and its weight into account. To solve this problem practically, we provide a branch-and-bound algorithm with a welldesigned lower bound. This algorithm can deal with any toll scheme in which toll per unit distance monotonically increases with weight. Computational results show that test instances with up to 42 vertices can be solved in reasonable computing time.
Year
Venue
Keywords
2010
IEA/AIE (3)
computational result,chinese expressway,special vehicle,toll-by-weight scheme,previous study,branch-and-bound algorithm,expressway transportation,toll scheme,single vehicle,constant number,reasonable computing time,branch and bound algorithm,lower bound,branch and bound,vehicle routing problem
Field
DocType
Volume
Monotonic function,Vehicle routing problem,Mathematical optimization,Branch and bound,Tree traversal,Vertex (geometry),Computer science,Upper and lower bounds,Toll,Kilometer
Conference
6098
ISSN
ISBN
Citations 
0302-9743
3-642-13032-1
2
PageRank 
References 
Authors
0.41
8
4
Name
Order
Citations
PageRank
Zizhen Zhang110017.27
Hu Qin220116.49
Andrew Lim315013.57
Songshan Guo4466.50