A New Rank Based Version of the Ant System: A Computational Study

Bernd Bullnheimer, Richard Hartl, Christine Strauss

Veröffentlichungen: Beitrag in FachzeitschriftArtikelPeer Reviewed

Abstract

The ant system is a new meta-heuristic for hard combinatorial optimization problems. It is a population-based approach that uses exploitation of positive feedback as well as greedy search. It was first proposed for tackling the well known Traveling Salesman Problem (TSP), but has been also successfully applied to problems such as quadratic assignment, job-shop scheduling, vehicle routing and graph colouring.
In this paper we introduce a new rank based version of the ant system and present results of a computational study, where we compare the ant system with simulated annealing and a genetic algorithm on several TSP instances. It turns out that our rank based ant system can compete with the other methods in terms of average behavior, and shows even better worst case behavior.
OriginalspracheEnglisch
Seiten (von - bis)25-38
FachzeitschriftCentral European Journal of Operations Research
Jahrgang7
Ausgabenummer1
PublikationsstatusVeröffentlicht - 1999

ÖFOS 2012

  • 502052 Betriebswirtschaftslehre
  • 101015 Operations Research
  • 502028 Produktionswirtschaft

Zitationsweisen