An improved Ant System algorithm for theVehicle Routing Problem

B. Bullnheimer, R.F. Hartl and Christine Strauss

Annals of Operations Research, 1999, vol. 89, issue 0, 319-328

Abstract: The Ant System is a distributed metaheuristic that combines an adaptive memory with alocal heuristic function to repeatedly construct solutions of hard combinatorial optimizationproblems. In this paper, we present an improved ant system algorithm for the Vehicle RoutingProblem with one central depot and identical vehicles. Computational results on fourteenbenchmark problems from the literature are reported and a comparison with five othermetaheuristic approaches for solving Vehicle Routing Problems is given. Copyright Kluwer Academic Publishers 1999

Date: 1999
References: Add references at CitEc
Citations: View citations in EconPapers (28)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018940026670 (text/html)
Access to full text is restricted to subscribers.

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:spr:annopr:v:89:y:1999:i:0:p:319-328:10.1023/a:1018940026670

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1018940026670

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().