Access Restriction

Author Stützle, Thomas ♦ Linke, Sebastian
Source CiteSeerX
Content type Text
File Format PDF
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Latter Feature ♦ Salesman Problem ♦ Original Ant System ♦ Integer Pheromone ♦ Computational Result ♦ Many Design Choice ♦ Pheromone Trail ♦ Ant System ♦ First Ant Colony Optimization ♦ Pheromone Evaporation ♦ Different Scheme ♦ Ant Algorithm ♦ Alternative Choice
Description A number of extensions of Ant System, the first ant colony optimization (ACO) algorithm, were proposed in the literature. These extensions typically achieve much improved computational results when compared to the original Ant System. However, many design choices of Ant System are left untouched including the fact that solutions are constructed, that real-numbers are used to simulate pheromone trails, and that explicit pheromone evaporation is used. In this article we experimentally investigate adaptations of ant algorithms to the traveling salesman problem that use alternative choices for these latter features: we consider using pheromones to modify solutions and different schemes for manipulating pheromone trails based on integer pheromone trails without recurring to pheromone evaporation.
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research
Education Level UG and PG ♦ Career/Technical Study
Learning Resource Type Article
Publisher Date 2000-01-01
Publisher Institution Mathware & Soft Computing, this issue