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 language | English (US) |
|---|---|
| Pages (from-to) | 32-52 |
| Number of pages | 21 |
| Journal | Transportation Research Part E: Logistics and Transportation Review |
| Volume | 86 |
| DOIs | |
| State | Published - Feb 1 2016 |
All Science Journal Classification (ASJC) codes
- Business and International Management
- Civil and Structural Engineering
- Transportation
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
Lai, D. S. W., Caliskan Demirag, O., & Leung, J. M. Y. (2016). A tabu search heuristic for the heterogeneous vehicle routing problem on a multigraph. Transportation Research Part E: Logistics and Transportation Review, 86, 32-52. https://doi.org/10.1016/j.tre.2015.12.001