Abstract
The aim of adding explicit intensification/diversification measures to ant colony optimisation is so that it better samples the search space. A new and novel method of achieving this is based on the idea of search space reduction in which solution components are fixed during an intensification stage and certain values for some components are excluded during diversification. These phases are triggered as required throughout the search process. In comparison to an existing intensification/diversification scheme and a control ant colony solver, the results using the travelling salesman problem reveal that the new scheme offers a substantial improvement. It often achieves optimal results for benchmark problem instances. Additionally, this scheme requires few extra computational resources and is applicable to a range of combinatorial problems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Blum, C.: ACO applied to group shop scheduling: A case study on intensification and diversification. In: Dorigo, M., Di Caro, G.A., Sampels, M. (eds.) Ant Algorithms 2002. LNCS, vol. 2463, pp. 14–27. Springer, Heidelberg (2002)
Dorigo, M.: Optimization, Learning and Natural Algorithms. Ph.D. thesis, Politecnico di Milano (1992)
Dorigo, M., Di Caro, G.: The ant colony optimization meta-heuristic. In: Corne, D., Dorigo, M., Glover, F. (eds.) New Ideas in Optimization, pp. 11–32. McGraw-Hill, London (1999)
Dorigo, M., Gambardella, L.: Ant colonies for the traveling salesman problem. BioSystems 43, 73–81 (1997)
Dorigo, M., Gambardella, L.: Ant Colony System: A cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation 1(1), 53–66 (1997)
Gambardella, L., Taillard, E., Dorigo, M.: Ant colonies for the quadratic assignment problem. Journal of the Operational Research Society 50, 167–176 (1999)
Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Boston (1997)
Meyer, B.: On the convergence behaviour of ant colony search. In: Proceedings of the 7th Asia-Pacific Conference on Complex Systems, pp. 153–167 (2004)
Randall, M.: A systematic strategy to incorporate intensification and diversification into ant colony optimisation. In: Abbass, H., Wiles, J. (eds.) Proceedings of the Australian Conference on Artificial Life, Canberra, Australia, pp. 199–208 (2003)
Randall, M.: Maintaining diversity within individual ant colonies. In: Abbass, H., Bossamaier, T., Wiles, J. (eds.) Recent Advances in Artificial Life. Advances in Natural Computation, vol. 3, pp. 227–238. World Scientific, New Jersey (2005)
Randall, M., Tonkes, E.: Intensification and diversification strategies in ant colony optimisation. Complexity International 9 (2002)
Reinelt, G.: TSPLIB - A traveling salesman problem library. ORSA Journal on Computing 3, 376–384 (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Randall, M. (2006). Search Space Reduction as a Tool for Achieving Intensification and Diversification in Ant Colony Optimisation. In: Ali, M., Dapoigny, R. (eds) Advances in Applied Artificial Intelligence. IEA/AIE 2006. Lecture Notes in Computer Science(), vol 4031. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11779568_29
Download citation
DOI: https://doi.org/10.1007/11779568_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35453-6
Online ISBN: 978-3-540-35454-3
eBook Packages: Computer ScienceComputer Science (R0)