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

    112 Citations (Scopus)


    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
    Number of pages11
    Publication statusPublished - 2002
    Event3rd International Workshop on Ant Algorithms, ANTS 2002 - Brussels, Belgium
    Duration: 12 Sept 200214 Sept 2002
    Conference number: 3


    Workshop3rd International Workshop on Ant Algorithms, ANTS 2002
    Abbreviated titleANTS


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

    Cite this