Abstract
Genetic Algorithms (GA) are a subclass of evolutionary algorithms that use the principle of evolution in order to search for solutions to optimization problems. Evolutionary algorithms are by their nature very good candidates for parallelization, and genetic algorithms do not make an exception. Moreover, researchers have stated that genetic algorithms with larger populations tend to obtain better solutions with faster convergence. These are the main reasons why they can benefit from a MapReduce implementation. However, research in this area is still young, and there are only a few approaches for adapting genetic algorithms to the MapReduce model.
In this article we analyze the use of subpopulations for the GA MapReduce implementations. MapReduce naturally creates subpopulations, and if this characteristic is properly explored, we can find better solutions for genetic algorithm parallelization. In this context, we propose new models for two well know genetic algorithm implementations, namely island and neighborhood model. Our solutions are using the island model, with isolated subpopulations, and the neighborhood model, with overlapping subpopulations. We incorporate these solutions in a framework, that makes the development of Cloud applications using Genetic Algorithm easier.
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
References
Beasley, J.: Or-library: distributing test problems by electronic mail. J. Oper. Res. Soc. 41(11), 1069–1072 (1990)
Jin, R.B.C., Vecchiola, C.: Mrpga: an extension of mapreduce for parallelizing genetic algorithms. In: eScience, pp. 214–221, December 2008
Cantu-Paz, E.: A survey of parallel genetic algorithms. Calculateurs Paralleles, Reseaux et Syst. Repartis 10(2), 141–171 (1998)
Huang, J.L.D.: Scaling populations of a genetic algorithm for job shop scheduling problems using mapreduce. In: Cloud Computing Technology and Science (2010)
Grid5000 home page (2014). Grid5000.Fr
Llorà, X., Verma, A., Campbell, R.H., Goldberg, D.E.: When huge is routine: scaling genetic algorithms and estimation of distribution algorithms via data-intensive computing. In: de Vega, F.F., Cantú-Paz, E. (eds.) Parallel and Distributed Computational Intelligence. SCI, vol. 269, pp. 11–41. Springer, Heidelberg (2010)
Open nebula home page (2014). OpenNebula.Org
The traveling salesman problem official site (2014). TSP.Gatech.Edu
Verma, A.: Scaling simple, compact and extended compact genetic algorithms using mapreduce. Master’s thesis, University of Illinois at Urbana-Champaign, August 2010
Witt, C.: Population size versus runtime of a simple evolutionary algorithm. Theoret. Comput. Sci. 403(1), 104–120 (2008)
Acknowledgments
The research presented in this paper is supported by the following projects: “SideSTEP - Scheduling Methods for Dynamic Distributed Systems: a self-* approach”, (PN-II-CT-RO-FR-2012-1-0084); “; CyberWater grant of the Romanian National Authority for Scientific Research, CNDI-UEFISCDI, project number 47/2012.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Apostol, E., Băluţă, I., Gorgoi, A., Cristea, V. (2014). A Parallel Genetic Algorithm Framework for Cloud Computing Applications. In: Pop, F., Potop-Butucaru, M. (eds) Adaptive Resource Management and Scheduling for Cloud Computing. ARMS-CC 2014. Lecture Notes in Computer Science(), vol 8907. Springer, Cham. https://doi.org/10.1007/978-3-319-13464-2_9
Download citation
DOI: https://doi.org/10.1007/978-3-319-13464-2_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-13463-5
Online ISBN: 978-3-319-13464-2
eBook Packages: Computer ScienceComputer Science (R0)