An Ant Colony Optimization Approach to Dynamic TSP (2001)
by
Michael Guntsch
,
Martin Middendorf
,
Hartmut Schmeck
| Citations: | 17 - 2 self |
BibTeX
@MISC{Guntsch01anant,
author = {Michael Guntsch and Martin Middendorf and Hartmut Schmeck},
title = {An Ant Colony Optimization Approach to Dynamic TSP},
year = {2001}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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...
