A guided tabu search for the heterogeneous vehicle routeing problem

A guided tabu search for the heterogeneous vehicle routeing problem

0.00 Avg rating0 Votes
Article ID: iaor20097325
Country: United Kingdom
Volume: 59
Issue: 12
Start Page Number: 1659
End Page Number: 1673
Publication Date: Dec 2008
Journal: Journal of the Operational Research Society
Authors: , ,
Keywords: heuristics: tabu search
Abstract:

The aim of this paper is to present a new algorithmic methodology for the heterogeneous fixed fleet vehicle routeing problem (HFFVRP). HFFVRP consists of determining the minimum cost routes for a fleet of vehicles in order to satisfy the demand of the customer population. The fleet composition is fixed and consists of various types of vehicles that differ with respect to their maximum carrying load and variable cost per distance unit. Our proposed algorithm called guided tabu search (GTS) is based on tabu search controlled by a continuous guiding mechanism that modifies the objective function of the problem. The role of this guiding strategy is to diversify the conducted search and help it overcome local optima encountered. The GTS method was applied successfully on HFFVRP benchmark problems producing best–known and new best–known solutions in short computational times.

Reviews

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