Comparing descent heuristics and metaheuristics for the vehicle routing problem

Alex van Breedam

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

Abstract: Three improvement heuristics for the vehicle routing problem are considered: a descent heuristic and two metaheuristics Simulated Annealing and Tabu Search. In order to make an in-depth comparison of the performance of these improvement heuristics, their behavior is analysed on a heuristic, time-sensitive level as well as on a parametric level. The design and the results of the experiments are outlined. The external validity of the conclusions is discussed.

Pages: 28 pages
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://repository.uantwerpen.be/docman/irua/3c49bb/329abd71.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:2000002

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 ().