Abstract
Maintaining population diversity is a challenge for the success of genetic algorithm. A numerous approaches have been proposed by researchers for adding diversity to the population. Dual-population genetic algorithm (DPGA) is one of them which is an effective optimization algorithm and provides diversity to the main population. Problems in GA such as premature convergence and population diversity is well addressed by DPGA. The aim of writing this review paper is to study how DPGA has been evolved. DPGA is inherently parallelizable, and hence, it can be port to parallel programming architecture for large-scale or large-dimension 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
References
Tang, K., Mang, K., et al.: Genetic algorithm and their applications. IEEE Signal Process. Mag. 13(6), 22–37 (1996). doi:10.1109/79.543973
Park, T., Ruy, K.: A dual-population genetic algorithm for adaptive diversity control. IEEE Trans. Evol. Comput. 14(6), 865–883 (2010). doi:10.1109/TEVC.2010.2043362
Park, T., Ruy, K.: A Dual-Population Genetic Algorithm for Balance Exploration and Exploitation. Acta Press Computational Intelligence (2006)
Park, T., Ruy, K.: A dual population genetic algorithm with evolving diversity. In: Proceedings of IEEE Congress on Evolutionary Computing, pp. 3516–3522 (2007). doi:10.1109/CEC.2007.4424928
Park, T., Ruy, K.: Adjusting population distance for dual-population genetic algorithm. In: Proceedings of Australian Joint Conference on Artificial Intelligence, pp. 171–180 (2007). doi:10.1109/TEVC.2010.2043362
Park, T., Choe, R., Ruy, K.: Dual-population genetic algorithm for nonstationary optimization. In: Proceedings of GECCO’08 ACM, pp. 1025–1032 (2008). doi:10.1145/1389095.1389286
Yao, X., Liu, Y., Lin, G.: Evolutionary programming made faster. IEEE Trans. Evol. Comput., 82–102 (1999). doi:10.1109/4235.771163
Lee, C., Yao, X.: Evolutionary programming using mutations based on the Lévy probability distribution. IEEE Trans. Evol. Comput. 8, 1–13 (2004). doi:10.1109/TEVC.2003.816583
Bäck, T., Fogel, D., Michalewicz, Z., et al.: Handbook on Evolutionary Computation. IOP Publishing Ltd./Oxford University Press, Oxford (1997)
Harick, G.: Finding multimodal solutions using restricted tournament selection. In: Proceedings of 6th International Conference on Genetic Algorithms (ICGA), pp. 24–31 (1995)
Lozano, M., Herrera, F., Krasnogor, N., Molina, D.: Real-coded memetic algorithms with crossover hill-climbing. Evol. Comput. 12(3), 273–302 (2004). doi:10.1162/1063656041774983
Liang, J., Qin, A., Suganthan, P., Baskar, S.: Comprehensive learning particle swarm optimizer for global optimization of multimodal functions. IEEE Trans. Evol. Comput. 10, 281–295 (2006). doi:10.1109/TEVC.2005.857610
Molina, D., Herrera, F., Lozano, M.: Adaptive local search parameters for real coded memetic algorithms. In: Proceedings of IEEE Congress Evolutionary Computation (CEC 2005), pp. 888–895 (2005). doi:10.1109/CEC.2005.1554777
Yang, Z., He, J., Yao, Z.: Making a difference to differential evolution. In: Michalewicz, Z., Siarry, P. (eds.) Advances in Metaheuristics for Hard Optimization, pp. 397–414, Springer (2007). doi:10.1007/978-3-540-72960-0_19
Hansen, N., Muller, S.D., Koumoutsakos, P.: Reducing the time complexity of the de-randomized evolution strategy with covariance matrix adaptation (CMAES). Evol. Comput. 11, 1–18 (2003). doi:10.1162/106365603321828970
Alama, M.S., Islama, M.M., Yaob, X., Murased, K.: Diversity guided evolutionary programming: a novel approach for continuous optimization. Applied soft computing, 12, pp. 1693–1707 Elseiver, London (2012). doi:10.1016/j.asoc.2012.02.002
Cheng, J., Zhang, G.: Improved differential evolutions using a dynamic differential factor and population diversity. In: Proceedings of International Conference on Artificial Intelligence and Computational Intelligence, pp. 402–406 (2009). doi:10.1109/AICI.2009.151
Qu, B., Suganthan, P.: Constrained multi-objective optimization algorithm with diversity enhanced differential evolution. In: IEEE Conference on Evolutionary Computation (CEC 2010) (2010). doi:10.1109/CEC.2010.5585947
Worasucheep, C.: A particle swarm optimization with diversity-guided convergence acceleration and stagnation avoidance, In: Proceedings of 8th International Conference on Natural Computation (ICNC 2012), pp. 733–738 (2012). doi:10.1109/ICNC.2012.6234647
Sels, V., Vanhoucke, M.: A hybrid dual population genetic algorithm for the single machine maximum lateness problem. In: Evolutionary COP 2011, LNCS 6622, pp. 14–25 (2011). doi:10.1007/978-3-642-20364-0_2
Umbarkar, A., Joshi, M.: Dual population genetic algorithm (GA) versus OpenMP GA for multimodal function optimization. Inter. J. Comput. Appl. 64(19), 29–36 (2013). doi:10.5120/10744-5516
Umbarkar, A., Joshi, M., Hong, W.: Multithreaded parallel dual population genetic algorithm (MPDPGA) for unconstrained function optimizations on multi-core system. Appl. Math. Comput. 243, 936–949 (2014). doi:10.1016/j.amc.2014.06.033
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer India
About this paper
Cite this paper
Umbarkar, A.J., Joshi, M.S., Sheth, P.D. (2015). Diversity-Based Dual-Population Genetic Algorithm (DPGA): A Review. In: Das, K., Deep, K., Pant, M., Bansal, J., Nagar, A. (eds) Proceedings of Fourth International Conference on Soft Computing for Problem Solving. Advances in Intelligent Systems and Computing, vol 335. Springer, New Delhi. https://doi.org/10.1007/978-81-322-2217-0_19
Download citation
DOI: https://doi.org/10.1007/978-81-322-2217-0_19
Published:
Publisher Name: Springer, New Delhi
Print ISBN: 978-81-322-2216-3
Online ISBN: 978-81-322-2217-0
eBook Packages: EngineeringEngineering (R0)