Tabu search variants for the mix fleet vehicle routing problem

Tabu search variants for the mix fleet vehicle routing problem

0.00 Avg rating0 Votes
Article ID: iaor2003973
Country: United Kingdom
Volume: 53
Issue: 7
Start Page Number: 768
End Page Number: 782
Publication Date: Jul 2002
Journal: Journal of the Operational Research Society
Authors: ,
Keywords: heuristics
Abstract:

The Mix Fleet Vehicle Routing Problem (MFVRP) involves the design of a set of minimum cost routes, originating and terminating at a central depot, for a fleet of heterogeneous vehicles with various capacities, fixed costs and variable costs to service a set of customers with known demands. This paper develops new variants of a tabu search meta-heuristic for the MFVRP. These variants use a mix of different components, including reactive tabu search concepts; variable neighbourhoods, special data memory structures and hashing functions. The reactive concept is used in a new way to trigger the switch between simple moves for intensification and more complex ones for diversification of the search strategies. The special data structures are newly introduced to efficiently search the various neighbourhood spaces. The combination of data structures and strategic balance between intensification and diversification generates an efficient and robust implementation, which is very competitive with other algorithms in the literature on a set of benchmark instances for which some new best-known solutions are provided.

Reviews

Required fields are marked *. Your email address will not be published.