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

Autor(en)

Bernd Bullnheimer, Richard Hartl, Christine Strauss

Abstrakt

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.

Organisation(en)

Institut für Rechnungswesen, Innovation und Strategie

Band

1

Anzahl der Seiten

14

Publikationsdatum

04-1997

ÖFOS 2012

101015 Operations Research, 102009 Computersimulation

Link zum Portal

https://ucrisportal.univie.ac.at/de/publications/f8143e2c-a5f8-4649-a5e1-3760bba4b6bd