SavingsAnts for the vehicle routing problem

Karl Franz Dörner, Manfred Gronalt, Richard Hartl, Marc Reimann, Christine Strauss, Michael Stummer

Publications: Working paper

Abstract

In this paper we propose a hybrid approach for solving vehicle routing problems. The main idea is to combine an Ant System (AS) with a problem specific constructive heuristic, namely the well known Savings algorithm. This differs from previous approaches, where the subordinate heuristic was the Nearest Neighbor algorithm initially proposed for the TSP. We compare our approach with some other classic, powerful meta-heuristics and show that our results are competitive.
Original languageEnglish
Place of PublicationWien
PublisherSFB Adaptive Information Systems and Modelling in Economics and Management Science, WU Vienna University of Economics and Business, Vienna.
Volume63
Publication statusPublished - Dec 2001

Austrian Fields of Science 2012

  • 101015 Operations research
  • SavingsAnts for the Vehicle Routing Problem

    Dörner, K., Gronalt, M., Hartl, R., Reimann, M., Strauss, C. & Stummer, M., 2002, Applications of evolutionary computing: Evo Workshops 2002: EvoCOP, EvoIASP, EvoSTIM/EvoPLAN, Kinsale, Ireland, April 3-4, 2002 : proceedings. Stefano, C., Gottlieb, J., Hart, E., Middendorf, M. & Raidl, G. R. (eds.). Berlin: Springer-Verlag Berlin, p. 11-20 9 p. (Lecture Notes in Computer Science, Vol. 2279).

    Publications: Contribution to bookContribution to proceedingsPeer Reviewed

Cite this