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

C. D. Tarantilis, G. Ioannou, C. T. Kiranoudis, G. P. Prastacos

Research output: Contribution to journalArticlepeer-review

93 Scopus citations

Abstract

In this paper, we consider the open vehicle routeing 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.

Original languageEnglish
Pages (from-to)588-596
Number of pages9
JournalJournal of the Operational Research Society
Volume56
Issue number5
DOIs
StatePublished - May 2005

Keywords

  • Distribution
  • Logistics
  • Transportation
  • Vehicle routeing

Fingerprint

Dive into the research topics of 'Solving the open vehicle routeing problem via a single parameter metaheuristic algorithm'. Together they form a unique fingerprint.

Cite this