A tabu search heuristic for the heterogeneous vehicle routing problem on a multigraph |
| |
Institution: | 1. Department of Mathematics and Systems Analysis, Aalto University School of Science, P.O. Box 11100, Aalto FI-00076, Finland;2. Deutsche Post Chair - Optimization of Distribution Networks, School of Business and Economics, RWTH Aachen University, Kackertstr. 7 B, Aachen 52072, Germany;1. Business Information Systems, Freie Universität Berlin, Garystr. 21, D-14195, Berlin, Germany;2. Department of Management Sciences, The University of Iowa, 52240 Iowa City, USA |
| |
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. |
| |
Keywords: | HVRP Multigraph Vehicle routing Heterogeneous fleet Fixed sequence arc selection Tabu search |
本文献已被 ScienceDirect 等数据库收录! |
|