Ant Systems for a Dynamic TSP - Ants Caught in a Traffic Jam

C.J. Eyckelhof, M. Dorigo (Editor), G. Caro Di (Editor), M. Snoek, M. Sampels (Editor)

    Research output: Contribution to conferencePaper

    92 Citations (Scopus)

    Abstract

    In this paper we present a new Ants System approach to a dynamic Travelling Salesman Problem. Here the travel times between the cities are subject to change. To handle this dynamism several ways of adapting the pheromone matrix both locally and globally are considered. We show that the strategy of smoothing pheromone values only in the area containing a change leads to improved results.
    Original languageUndefined
    Pages88-99
    Number of pages11
    Publication statusPublished - 2002
    EventAnt Algorithms - Third International Workshop, ANTS 2002 - Brussels, Belgium
    Duration: 12 Sep 200214 Sep 2002

    Workshop

    WorkshopAnt Algorithms - Third International Workshop, ANTS 2002
    Period12/09/0214/09/02
    OtherSeptember 12-14, 2002

    Keywords

    • HMI-CI: Computational Intelligence
    • EWI-6652
    • IR-63358

    Cite this