Abstract
When solving a combinatorial optimization problem with the Ant Colony Optimization (ACO) metaheuristic, one usually has to find a compromise between guiding or diversifying the search. Indeed, ACO uses pheromone to attract ants. When increasing the sensibility of ants to pheromone, they converge quicker towards a solution but, as a counterpart, they usually find worse solutions. In this paper, we first study the influence of ACO parameters on the exploratory ability of ants. We then study the evolution of the impact of pheromone during the solution process with respect to its cost’s management. We finally propose to introduce a preprocessing step that actually favors a larger exploration of the search space at the beginning of the search at low cost. We illustrate our approach on Ant-Solver, an ACO algorithm that has been designed to solve Constraint Satisfaction Problems, and we show on random binary problems that it allows to find better solutions more than twice quicker.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
M. Dorigo and G. Di Caro. the Ant Colony Optimization Meta-Heuristic. In New Ideas in Optimization, McGraw Hill, pages 245–260, 1999.
P. Merz and B. Freisleben. Fitness landscapes and memetic algorithm design. In New Ideas in Optimization, McGraw Hill, pages 245–260, 1999.
T. Stutzle and H.H. Hoos. MAX-MIN Ant System. In Journal of Future Generation Computer Systems, 16:889–914, 2000.
A. Colorni, M. Dorigo and V. Maniezzo. An investigation of some properties of an “Ant algorithm”. In PPSN’92, pages 509–520, Elsevier, 1992.
H. M. Botee and E. Bonabeau. Evolving Ant Colony Optimization. In Advanced complex systems, 1:149–159, 1998.
E.P.K. Tsang. Foundations of Constraint Satisfaction. Academic Press, 1993.
E. MacIntyre, P. Prosser, B. Smith and T. Walsh. Random Constraints Satisfaction: theory meets practice. In CP’98, volume 1520 of LNCS, Springer-Verlag, pages 325–339, 1998.
C. Solnon. Ants can solve Constraint Satisfaction Problems. Research report, 2001.
S. Minton, M.D. Johnston, A.B. Philips and P. Laird. Minimizing Conflicts: a Heuristic Repair Method for Constraint Satistaction and Scheduling Problems. In Artificial Intelligence, 58:161–205, 1992.
M. Dorigo, V. Maniezzo and A. Colorni. The Ant System: Optimization by a Colony of Cooperating Agents. In IEEE Transactions on Systems, Man, and Cybernetics-Part B, 26(1):29–41, 1996.
A. Stuber and C. Solnon. Boosting ACO algorithms with data mining technics (in french). In JNPC’01, pages 271–282, 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Solnon, C. (2002). Boosting ACO with a Preprocessing Step. In: Cagnoni, S., Gottlieb, J., Hart, E., Middendorf, M., Raidl, G.R. (eds) Applications of Evolutionary Computing. EvoWorkshops 2002. Lecture Notes in Computer Science, vol 2279. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46004-7_17
Download citation
DOI: https://doi.org/10.1007/3-540-46004-7_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43432-0
Online ISBN: 978-3-540-46004-6
eBook Packages: Springer Book Archive