| dc.contributor.author | Silva, Carlos A. | |
| dc.contributor.author | Runkler, Thomas A. | |
| dc.contributor.editor | Brinkschulte, Uwe | |
| dc.contributor.editor | Becker, Jürgen | |
| dc.contributor.editor | Fey, Dietmar | |
| dc.contributor.editor | Großpietsch, Karl-Erwin | |
| dc.contributor.editor | Hochberger, Christian | |
| dc.contributor.editor | Maehle, Erik | |
| dc.contributor.editor | Runkler, Thomas A. | |
| dc.date.accessioned | 2019-10-30T11:53:38Z | |
| dc.date.available | 2019-10-30T11:53:38Z | |
| dc.date.issued | 2004 | |
| dc.identifier.isbn | 3-88579-370-9 | |
| dc.identifier.issn | 1617-5468 | |
| dc.identifier.uri | http://dl.gi.de/handle/20.500.12116/29374 | |
| dc.description.abstract | 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. | en |
| dc.language.iso | en | |
| dc.publisher | Gesellschaft für Informatik e.V. | |
| dc.relation.ispartof | ARCS 2004 – Organic and pervasive computing | |
| dc.relation.ispartofseries | Lecture Notes in Informatics (LNI) - Proceedings, Volume P-41 | |
| dc.title | Ant colony optimization for dynamic traveling salesman problems | en |
| dc.type | Text/Conference Paper | |
| dc.pubPlace | Bonn | |
| mci.reference.pages | 259-266 | |
| mci.conference.sessiontitle | Regular Research Papers | |
| mci.conference.location | Augsburg | |
| mci.conference.date | March 26, 2004 | |
