Anzeige
Erschienen in:
2013 | OriginalPaper | Buchkapitel
Multi-caste Ant Colony Algorithm for the Dynamic Traveling Salesperson Problem
verfasst von : Leonor Melo, Francisco Pereira, Ernesto Costa
Erschienen in: Adaptive and Natural Computing Algorithms
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
In this paper we apply a multi-caste ant colony system to the dynamic traveling salesperson problem. Each caste inside the colony contains its own set of parameters, leading to the coexistence of different exploration behaviors. Two multi-caste variants are proposed and analyzed. Results obtained with different dynamic scenarios reveal that the adoption of a multi-caste architecture enhances the robustness of the algorithm. A detailed analysis of the outcomes suggests guidelines to select the best multi-caste variant, given the magnitude and severity of changes occurring in the dynamic environment.