Zur Hauptnavigation wechseln Zur Suche wechseln Zum Hauptinhalt wechseln

SavingsAnts for the vehicle routing problem

Veröffentlichungen: 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.
OriginalspracheEnglisch
ErscheinungsortWien
Herausgeber*inSFB Adaptive Information Systems and Modelling in Economics and Management Science, WU Vienna University of Economics and Business, Vienna.
Band63
PublikationsstatusVeröffentlicht - Dez. 2001

ÖFOS 2012

  • 101015 Operations Research

Fingerprint

Untersuchen Sie die Forschungsthemen von „SavingsAnts for the vehicle routing problem“. Zusammen bilden sie einen einzigartigen Fingerprint.
  • 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. (Hrsg.). Berlin: Springer-Verlag Berlin, S. 11-20 9 S. (Lecture Notes in Computer Science, Band 2279).

    Veröffentlichungen: Beitrag in Buch › Beitrag in Konferenzband › Peer Reviewed

Zitationsweisen