Abstract
Many distributed systems (task scheduling,moving priorities,mobile environments, ...) can be linked as Dynamic Optimization Problems (DOPs), since they require to pursue an optimal value that changes over time. We have focused on the utilization of Distributed Genetic Algorithms (dGAs), one of the domains still to be investigated for DOPs. A dGA essentially decentralizes the population in islands which cooperate through migrations of individuals. In this article, we analyze the effect of the migrants selection and replacement on the performance of dGAs for DOPs. Quality and distance based criteria are tested using a comprehensive set of benchmarks. Results show the benefits and drawbacks of each setting for DOPs.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Alba, E., Troya, J.M.: Influence of the migration policy in parallel distributed GAs with structured and panmictic populations. Appl. Intelligence 12, 163–181 (2000)
Branke, J., Kaussler, T., Schmidt, C., Schmeck, H.: A multi-population approach to dynamic optimization problems. In: 4th International Conference on Adaptive Computing in Design and Manufacture, pp. 299–308. Springer (2000)
Cantú-Paz, E.: Migration policies and takeover times in parallel genetic algorithms. In: Proc. of the GECCO. Morgan Kaufman (1999)
Homayounfar, H., Areibi, S., Wang, F.: An Island based GA for static/dynamic optimization problems. In: 3rd International DCDIS Conference on Engineering Applications and Computational Algorithms (2003)
Luque, G., Alba, E.: Parallel Genetic Algorithms. SCI, vol. 367. Springer, Heidelberg (2011)
Nguyen, T.T., Yang, S., Branke, J.: Evolutionary dynamic optimization: A survey of the state of the art. Swarm and Evolutionary Computation 6, 1–24 (2012)
Oppacher, F., Wineberg, M.: The shifting balance genetic algorithm: Improving the GA in a dynamic environment. In: Proc. of the Genetic and Evolutionary Computation Conference (GECCO), pp. 504–510. Morgan Kaufman (1999)
Park, T., Choe, R., Ryu, K.R.: Dual-population genetic algorithm for nonstationary optimization. In: Proc. of the GECCO, pp. 1025–1032. ACM (2008)
Ursem, R.K.: Multinational GAs: Multimodal optimization techniques in dynamic environments. In: Whitley, D., et al. (eds.) Proc. of the GECCO, pp. 19–26. Morgan Kaufmann (2000)
Yang, S., Yao, X.: Experimental study on population-based incremental learning algorithms for dynamic optimization problems. Soft. Computing 9(11), 815–834 (2005)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer International Publishing Switzerland
About this paper
Cite this paper
Bravo, Y., Luque, G., Alba, E. (2013). Migrants Selection and Replacement in Distributed Evolutionary Algorithms for Dynamic Optimization. In: Omatu, S., Neves, J., Rodriguez, J., Paz Santana, J., Gonzalez, S. (eds) Distributed Computing and Artificial Intelligence. Advances in Intelligent Systems and Computing, vol 217. Springer, Cham. https://doi.org/10.1007/978-3-319-00551-5_19
Download citation
DOI: https://doi.org/10.1007/978-3-319-00551-5_19
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-00550-8
Online ISBN: 978-3-319-00551-5
eBook Packages: EngineeringEngineering (R0)