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 language | Undefined |
---|---|
Pages | 88-99 |
Number of pages | 11 |
Publication status | Published - 2002 |
Event | 3rd International Workshop on Ant Algorithms, ANTS 2002 - Brussels, Belgium Duration: 12 Sept 2002 → 14 Sept 2002 Conference number: 3 |
Workshop
Workshop | 3rd International Workshop on Ant Algorithms, ANTS 2002 |
---|---|
Abbreviated title | ANTS |
Country/Territory | Belgium |
City | Brussels |
Period | 12/09/02 → 14/09/02 |
Keywords
- HMI-CI: Computational Intelligence
- EWI-6652
- IR-63358