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.
|Number of pages||21|
|Journal||Transportation Research Part E: Logistics and Transportation Review|
|Publication status||Published - 1 Feb 2016|
- Fixed sequence arc selection
- Heterogeneous fleet
- Tabu search
- Vehicle routing