Abstract
Ant Colony Optimization (ACO) differs substantially from other meta-heuristics such as Evolutionary Algorithms (EA). Two of its distinctive features are: (i) it is constructive rather than based on iterative improvements, and (ii) it employs problem knowledge in the construction process via the heuristic function, which is essential for its success. In this paper, we introduce the ACO encoding, which is a self-contained algorithmic component that can be readily used to make available these two particular features of ACO to any search algorithm for continuous spaces based on iterative improvements to solve combinatorial optimization 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.
Similar content being viewed by others
References
Bäck, T., Fogel, D.B., Michalewicz, T. (eds.): Evolutionary Computation 1: Basic Algorithms and Operators. Institute of Physics Publishing (2000)
Blum, C., Blesa Aguilera, M.J., Roli, A., Sampels, M. (eds.): Hybrid Metaheuristics: An Emerging Approach to Optimization. Springer, Heidelberg (2008)
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)
Dorigo, M., Sützle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)
Lee, Z.J., Su, S.F., Chuang, C.C., Liu, K.H.: Genetic algorithm with ant colony optimization (ga-aco) for multiple sequence alignment. Applied Soft Computing 8(1), 55–78 (2008)
Moscato, P.: On evolution, search, optimization, genetic algorithms and martial arts: Towards memetic algorithms. Tech. rep., Caltech Concurrent Computation Program (1989)
Runwei Cheng, M.G., Tsujimura, Y.: A tutorial survey of job-shop scheduling problems using genetic algorithmsi. representation. Computers and Industrial Engineering 30(4), 983–997 (1996)
Snydera, L.V., Daskin, M.S.: A random-key genetic algorithm for the generalized traveling salesman problem. European Journal of Operational Research 171(1), 38–53 (2006)
Stützle, T., Hoos, H.: Improvements on the Ant System: Introducing \(\mathcal{MAX}\)-\(\mathcal{MIN}\) ant system. In: Proc. Int. Conf. Artificial Neural Networks and Genetic Algorithms (1997)
Stützle, T., Hoos, H.: \(\mathcal{MAX}\)-\(\mathcal{MIN}\) ant system. Future Generation Computer Systems 16(8), 889–914 (2000)
Wong, K.Y., See, P.C.: A hybrid ant colony optimization algorithm for solving facility layout problems formulated as quadratic assignment problems. Engineering Computations: Int. J. for Computer-Aided Engineering 27(1), 117–128 (2010)
Xiong, W., Wang, C.: A hybrid improved ant colony optimization and random forests feature selection method for microarray data. In: International Conference on Networked Computing and Advanced Information Management (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Moraglio, A., Otero, F.E.B., Johnson, C.G. (2010). The ACO Encoding. In: Dorigo, M., et al. Swarm Intelligence. ANTS 2010. Lecture Notes in Computer Science, vol 6234. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15461-4_53
Download citation
DOI: https://doi.org/10.1007/978-3-642-15461-4_53
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15460-7
Online ISBN: 978-3-642-15461-4
eBook Packages: Computer ScienceComputer Science (R0)