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.
A tabu search heuristic for the heterogeneous vehicle routing problem on a multigraph
2016
Article (Journal)
English
A tabu search heuristic for the vehicle routing problem
TIBKAT | 1992
|A Neural-Tabu Search Heuristic for the Real Time Vehicle Routing Problem
British Library Online Contents | 2008
|A Network Flow-Based Tabu Search Heuristic for the Vehicle Routing Problem
Online Contents | 1996
|