Branch and bound algorithm for a single vehicle routing problem with toll-by-weight scheme

Authors:
Zizhen Zhang;Hu Qin;Andrew Lim;Songshan Guo
Affiliations:
Department of Management Sciences, City University of Hong Kong, Hong Kong;Department of Management Sciences, City University of Hong Kong, Hong Kong;Department of Management Sciences, City University of Hong Kong, Hong Kong;Department of Computer Science, School of Information Science and Technology, Sun Yat-Sen University, Guangzhou, Guangdong, PR China
Venue:
IEA/AIE'10 Proceedings of the 23rd international conference on Industrial engineering and other applications of applied intelligent systems - Volume Part III
Year:
2010

Citing 9
Cited 0

The delivery man problem on a tree network

Annals of Operations Research
The delivery man problem and cumulative matroids

Operations Research
The minimum latency problem

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
The vehicle routing problem

The vehicle routing problem
Approximation Schemes for Minimum Latency Problems

SIAM Journal on Computing
Graph Theory and Its Applications, Second Edition (Discrete Mathematics and Its Applications)

Graph Theory and Its Applications, Second Edition (Discrete Mathematics and Its Applications)
A Faster, Better Approximation Algorithm for the Minimum Latency Problem

SIAM Journal on Computing
A new formulation for the Traveling Deliveryman Problem

Discrete Applied Mathematics
Exact algorithms for the minimum latency problem

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

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.