Solving the open vehicle routing problem via a single parameter metaheuristic algorithm

Solving the open vehicle routing problem via a single parameter metaheuristic algorithm

0.00 Avg rating0 Votes
Article ID: iaor20062103
Country: United Kingdom
Volume: 56
Issue: 5
Start Page Number: 588
End Page Number: 596
Publication Date: May 2005
Journal: Journal of the Operational Research Society
Authors: , , ,
Keywords: heuristics
Abstract:

In this paper, we consider the open vehicle routing problem (OVRP), in which routes are not sequences of locations starting and ending at the depot but open paths. The problem is of particular importance for planning fleets of hired vehicles, a common practice in the distribution and service industry. In such cases, the travelling cost is a function of the vehicle open paths. To solve the problem, we employ a single-parameter metaheuristic method that exploits a list of threshold values to guide intelligently an advanced local search. Computational results on a set of benchmark problems show that the proposed method consistently outperforms previous approaches for the OVRP. A real-world example demonstrates the applicability of the method in practice, demonstrating that the approach can be used to solve actual problems of routing large vehicle fleets.

Reviews

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