Abstract
Ant System is a general purpose algorithm inspired by the study of the behavior of ant colonies. It is based on a cooperative search paradigm that is applicable to the solution of combinatorial optimization problems. We introduce MAX-MIN Ant System, an improved version of basic Ant System, and report our results for its application to symmetric and asymmetric instances of the well known traveling salesman problem. We show how MAX-MIN Ant System can be significantly improved, extending it with local search heuristics. Our results clearly show that MAX-MIN Ant System has the property of effectively guiding the local search heuristics towards promising regions of the search space by generating good initial tours.
Keywords
Travelling salesman problemHeuristicsExtremal optimizationAnt colony optimization algorithmsLocal search (optimization)Mathematical optimizationAnt colonyComputer scienceMetaheuristicCombinatorial optimizationANT2-optArtificial intelligenceMathematicsMeta-optimization
Affiliated Institutions
Related Publications
Performance evaluation of genetic algorithms for flowshop scheduling problems
The aim of this paper is to evaluate the performance of genetic algorithms for the flowshop scheduling problem with an objective of minimizing the makespan. First we examine var...
Handbook of Genetic Algorithms
This book sets out to explain what genetic algorithms are and how they can be used to solve real-world problems. The first objective is tackled by the editor, Lawrence Davis. Th...
The Generalized A* Architecture
We consider the problem of computing a lightest derivation of a global structure using a set of weighted rules. A large variety of inference problems in AI can be formulated in ...
Optuna
The purpose of this study is to introduce new design-criteria for next-generation hyperparameter optimization software. The criteria we propose include (1) define-by-run API tha...
Distributed Kalman Filter with Embedded Consensus Filters
The problem of distributed Kalman filtering (DKF) for sensor networks is one of the most fundamental distributed estimation problems for scalable sensor fusion. This paper addre...
Publication Info
- Year
- 2002
- Type
- article
- Pages
- 309-314
- Citations
- 824
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
824
OpenAlex
Cite This
Thomas Stützle,
Holger H. Hoos
(2002).
MAX-MIN Ant System and local search for the traveling salesman problem.
, 309-314.
https://doi.org/10.1109/icec.1997.592327
Identifiers
- DOI
- 10.1109/icec.1997.592327