A simple, deterministic, and efficient knowledge-driven heuristic for the vehicle routing problem

Florian Arnold and Kenneth Sörensen

Working Papers from University of Antwerp, Faculty of Business and Economics

Abstract: In this paper we develop a heuristic for the capacitated vehicle routing problem that revolves around three complementary local search operators, embedded in a guided local search framework. The efficiency of the operators is guaranteed by using knowledge, obtained through data mining, on the attributes of undesirable edges. In spite of its straightforward design and the fact that it is completely deterministic, the heuristic is competitive with the best heuristics in the literature in terms of accuracy and speed. Moreover, it can be readily extended to solve a wide range of vehicle routing problems, which we demonstrate by applying it to the multi-depot vehicle routing problem.

Keywords: Vehicle routing problems; Heuristics; Metaheuristics (search for similar items in EconPapers)
Pages: 31 pages
Date: 2017-12
New Economics Papers: this item is included in nep-cmp, nep-tre and nep-ure
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://repository.uantwerpen.be/docman/irua/2c5812/147947.pdf (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ant:wpaper:2017012

Access Statistics for this paper

More papers in Working Papers from University of Antwerp, Faculty of Business and Economics Contact information at EDIRC.
Bibliographic data for series maintained by Joeri Nys (joeri.nys@uantwerpen.be).