Gesellschaft für Informatik e.V.

Lecture Notes in Informatics

ARCS 2004 - Organic and Pervasive Computing, Workshops Proceedings, March 26, 2004, Augsburg, Germany. P-41, 259-266 (2004).

GI, Gesellschaft für Informatik, Bonn


Uwe Brinkschulte (ed.), Jürgen Becker (ed.), Dietmar Fey (ed.), Karl-Erwin Großpietsch (ed.), Christian Hochberger (ed.), Erik Maehle (ed.), Thomas A. Runkler (ed.)

Copyright © GI, Gesellschaft für Informatik, Bonn


Ant colony optimization for dynamic traveling salesman problems

Carlos A. Silva and Thomas A. Runkler


This paper addresses the optimization of a dynamic Traveling Salesman Problem using the Ant Colony Optimization algorithm. Ants are social insects with limited skills that live in colonies able to solve complex problems. The intelligence of the global society arises from self organization mechanisms, based on the indirect communication between individuals through pheromones. The routing problem here presented is a typical case that requires a self organization type of algorithm, in order to cope with the problem dynamics. The simulation results show how the ant colony optimization is able to solve the different possible routing cases.

Full Text: PDF

GI, Gesellschaft für Informatik, Bonn
ISBN 3-88579-370-9

Last changed 04.10.2013 18:00:30