An Ant Colony Optimization approach to dynamic TSP
Michael Guntsch, Martin Middendorf, Hartmut Schmeck · 2001
An Ant Colony Optimization (ACO) approach for a dynamic Traveling Salesperson Problem (TSP) is studied in this paper. In the dynamic version of the TSP cities can be deleted or inserted over time. Specifically, we consider replacing a certain number of cities with new ones at different frequencies. The aim of the ACO algorithm...