Abstract
Cellular Genetic Algorithm (cGA) and Particle Swam Optimization (PSO) are two powerful metaheuristics being used successfully since their creation for the resolution of optimization problems. In this work we present two hybrid algorithms based on a cGA with the insertion of components from PSO. We aim to achieve significant numerical improvements in the results obtained by a cGA in combinatorial optimization problems. We here analyze the performance of our hybrids using a set of different problems. The results obtained are quite satisfactory in efficacy and efficiency.
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
Alba, E., Dorronsoro, B.: Cellular Genetic Algorithms. Springer (2008)
Alba, E., Tomassini, M.: Parallelism and evolutionary algorithms. IEEE Transactions on Evolutionary Computation 6(5), 443–462 (2002)
Alba, E., Villagra, A.: Inserting active components of particle swarm optimization in cellular genetic algorithms. In: EVOLVE A Bridge between Probability, Set Oriented Numerics and Evolutionary Computation (2011)
Bäck, T.: Evolutionary Algorithms in Theory and Practice: Evolution Strategies, Evolutionary Programming, Genetic Algorithms. Oxford University Press (1996)
Bäck, T., Fogel, D.B., Michalewicz, Z. (eds.): Handbook of Evolutionary Computation. Oxford University Press (1997)
Cantú-Paz, E.: Eficient and Accurate Parallel Genetic Algorithms, 2nd edn. Book Series on Genetic Algorithms and Evolutionary Computation, vol. 1. Kluwer Academic (2000)
Droste, S., Jansen, T., Wegener, I.: A natural and simple function which is hard for all evolutionary algorithms. In: 3rd SEAL, pp. 2704–2709 (2000)
Goldberg, D., Deb, K., Horn, J.: Massive multimodality, deception, and genetic algorithms. In: Männer, R., Manderick, B. (eds.) Int. Conf. Parallel Prob. Solving from Nature, PPSN II, pp. 37–46 (1992)
Hart, W., Krasnogor, N., Smith, J.: Recent Advances in Memetic Algorithms. Springer (2005)
De Jong, K., Potter, M., Spears, W.: Using problem generators to explore the effects of epistasis. In: 7th Int. Conf. Genetic Algorithms, pp. 338–345. Morgan Kaufmann (1997)
Kennedy, J., Eberhart, R.: Particle Swarm Optimization. In: IEEE Int. Conf. Neural Netw., vol. 4, pp. 1942–1948 (1995)
Kennedy, J., Eberhart, R.: A Discrete Binary Version of the Particle Swarm Algorithm. A discrete binary version of the particle swarm algorithm (1997)
Khuri, S., Bäck, T., Heitkötter, J.: An evolutionary approach to combinatorial optimization problems. In: 22nd Annual ACM C.S. Conf., pp. 66–73 (1994)
MacWilliams, F., Sloane, N.: The Theory of Error-Correcting Codes. North-Holland (1977)
Manderick, B., Spiessens, P.: Fine-grained parallel genetic algorithm. In: Schaffer, J.D. (ed.) 3rd ICGA, pp. 428–433. Morgan Kaufmann (1989)
Papadimitriou, C.: Computational Complexity. Adison-Wesley (1994)
Schaffer, J.D., Eshelman, L.J.: On Crossover as an Evolutionary Viable Strategy. In: Belew, R.K., Booker, L.B. (eds.) Proceedings of the 4th ICGA, pp. 61–68. Morgan Kaufmann (1991)
Stinson, D.: An Introduction to the Design and Analysis of Algorithms. The Charles Babbage Research Centre, St. Pierre (1985)
Tomassimi, M.: The parallel genetic cellular automata: Application to global function optimization. In: Albrecht, R.F., Reeves, C.R., Steele, N.C. (eds.) International Conference on Artificial Neural Networks and Genetic Algorithms, pp. 385–391. Springer, Heidelberg (1993)
Tsutsui, S., Fujimoto, Y.: Forking genetic algorithm with blocking and shrinking modes. In: Forrest, S. (ed.) 5th ICGA, pp. 206–213 (1993)
Whitley, D.: Cellular genetic algorithms. In: Forrest, S. (ed.) 5th ICGA, p. 658. Morgan Kaufmann (1993)
Wilson, E.O.: Sociobiology: The New Systhesis. Belknap Press (1975)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Alba, E., Villagra, A. (2013). Hybridizing Cellular GAs with Active Components of Bio-inspired Algorithms. In: Talbi, EG. (eds) Hybrid Metaheuristics. Studies in Computational Intelligence, vol 434. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30671-6_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-30671-6_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-30670-9
Online ISBN: 978-3-642-30671-6
eBook Packages: EngineeringEngineering (R0)