Abstract
Nowadays, there is an increasing interest in the application of Collective Intelligence and Evolutive optimization algorithms for solving NP-complete problems. This is because the solution or optimization process of these type of problems requires a huge amount of resources (such as computational effort or time). Some examples of these types of problems are scheduling problems, constrained satisfaction problems, or routing problems. Collective strategies are heuristics that allow to look for new solutions in real complex problems using concepts extracted from a metaphor of social behavior of ants, bees, bacteria, flocks of birds and/or schools of fish. In this paper we propose a practical comparison between a classical Genetic-based approach and a Swarm-based strategy applied to the detection of maximal component in graphs. This work describes how these two different optimization strategies can be adapted and used to extract the different sub-graphs that contains the maximum number of nodes. Experimental results show the best results are obtained using ACO algorithm, but new strategies must be taken into account in order to improve the results.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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
Colorni, A., Dorigo, M., Maniezzo, V.: Distributed optimization by ant colonies. In: European Conference on Artificial Life, pp. 134–142 (1991)
Das, S., Biswas, A., Dasgupta, S., Abraham, A.: Bacterial Foraging Optimization Algorithm: Theoretical Foundations, Analysis, and Applications. In: Abraham, A., Hassanien, A.-E., Siarry, P., Engelbrecht, A. (eds.) Foundations of Computational Intelligence Volume 3. SCI, vol. 203, pp. 23–55. Springer, Heidelberg (2009)
Dorigo, M.: Ant colony optimization: A new meta-heuristic. In: Proceedings of the Congress on Evolutionary Computation, pp. 1470–1477. IEEE Press (1999)
Eiben, A.E., Smith, J.E.: Introduction to Evolutionary Computing. Springer (2009)
Fogel, D.B.: Evolutionary computation: toward a new philosophy of machine intelligence. IEEE Press (1995)
Jong, K.A.D.: Evolutionary computation a unified approach. MIT Press (2006)
Karaboga, D., Basturk, B.: A powerful and efficient algorithm for numerical function optimization: artificial bee colony (abc) algorithm. J. of Global Optimization 39, 459–471 (2007)
Ridge, E., Curry, E.: A roadmap of nature-inspired systems research and development. Multiagent Grid Syst. 3, 3–8 (2007)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
González-Pardo, A., Camacho, D. (2013). Maximal Component Detection in Graphs Using Swarm-Based and Genetic Algorithms. In: Fortino, G., Badica, C., Malgeri, M., Unland, R. (eds) Intelligent Distributed Computing VI. Studies in Computational Intelligence, vol 446. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32524-3_31
Download citation
DOI: https://doi.org/10.1007/978-3-642-32524-3_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32523-6
Online ISBN: 978-3-642-32524-3
eBook Packages: EngineeringEngineering (R0)