A tabu search heuristic for the heterogeneous vehicle routing problem on a multigraph

David S.W. Lai, Ozgun Caliskan Demirag*, Janny M.Y. Leung

*Corresponding author for this work

Research output: Contribution to JournalArticleAcademicpeer-review

Abstract

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.

Original languageEnglish
Pages (from-to)32-52
Number of pages21
JournalTransportation Research. Part E, Logistics and Transportation Review
Volume86
DOIs
Publication statusPublished - 2016

Keywords

  • Fixed sequence arc selection
  • Heterogeneous fleet
  • HVRP
  • Multigraph
  • Tabu search
  • Vehicle routing

Fingerprint Dive into the research topics of 'A tabu search heuristic for the heterogeneous vehicle routing problem on a multigraph'. Together they form a unique fingerprint.

Cite this