TY - JOUR
T1 - A tabu search heuristic for the heterogeneous vehicle routing problem on a multigraph
AU - Lai, David S.W.
AU - Caliskan Demirag, Ozgun
AU - Leung, Janny M.Y.
N1 - Funding Information:
The authors thank Editor Prof. Jiuh-Biing Sheu and four anonymous referees for their constructive suggestions, which helped improve the content and presentation of this article. They also thank Prof. W.E.H. Dullaert for his valuable comments and feedback. The work of the third author is partially supported by GRF grant CUHK414313 from the Hong Kong Research Grants Council.
PY - 2016/2/1
Y1 - 2016/2/1
N2 - We study a time-constrained heterogeneous vehicle routing problem on a multigraph where parallel arcs between pairs of vertices represent different travel options based on criteria such as time, cost, and distance. We formulate the problem as a mixed-integer linear programming model and develop a tabu search heuristic that efficiently addresses computational challenges due to parallel arcs. Numerical experiments show that the heuristic is highly effective and that freight operators can achieve advantages in cost and customer service by considering alternative paths, especially when route duration limits are restrictive and/or when vehicles of smaller capacity are dispatched to serve remote customers.
AB - We study a time-constrained heterogeneous vehicle routing problem on a multigraph where parallel arcs between pairs of vertices represent different travel options based on criteria such as time, cost, and distance. We formulate the problem as a mixed-integer linear programming model and develop a tabu search heuristic that efficiently addresses computational challenges due to parallel arcs. Numerical experiments show that the heuristic is highly effective and that freight operators can achieve advantages in cost and customer service by considering alternative paths, especially when route duration limits are restrictive and/or when vehicles of smaller capacity are dispatched to serve remote customers.
UR - http://www.scopus.com/inward/record.url?scp=84953807312&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84953807312&partnerID=8YFLogxK
U2 - 10.1016/j.tre.2015.12.001
DO - 10.1016/j.tre.2015.12.001
M3 - Article
AN - SCOPUS:84953807312
VL - 86
SP - 32
EP - 52
JO - Transportation Research, Part E: Logistics and Transportation Review
JF - Transportation Research, Part E: Logistics and Transportation Review
SN - 1366-5545
ER -