Abstract
Years after being firstly introduced by Fraser and remodeled for modern application by Bremermann, genetic algorithm (GA) has a significant progression to solve many kinds of optimization problems. GA also thrives into many variations of models and approaches. Multi-population or island model GA (IMGA) is one of the commonly used GA models. IMGA is a multi-population GA model objected to getting a better result (aimed to get global optimum) by intrinsically preserve its diversity. Localization strategy of IMGA is a new approach which sees an island as a single living environment for its individuals. An island’s characteristic must be different compared to other islands. Operator parameter configuration or even its core engine (algorithm) represents the nature of an island. These differences will incline into different evolution tracks which can be its speed or pattern. Localization strategy for IMGA uses three kinds of single GA core: standard GA, pseudo GA, and informed GA. Localization strategy implements migration protocol and the bias value to control the movement. The experiment results showed that localization strategy for IMGA succeeds to solve 3-SAT with an excellent performance. This brand new approach is also proven to have a high consistency and durability.
This is a preview of subscription content, log in via an institution.
References
Bhuvaneswari, M.: Application of Evolutionary Algorithms for Multi-objective Optimization in VLSI and Embedded Systems. SpringerLink: Bcher. Springer India. https://books.google.co.jp/books?id=ybVTBAAAQBAJ (2014)
Bremermann, H.J.: The evolution of intelligence: the nervous system as a model of its environment. Techreport 1, Deparment of Mathematics, University of Washington, Seattle (1958). Contract No. 477(17)
Cheeseman, P., Kanefsky, B., Taylor, W.M.: Where the really hard problems are. In: Proceedings of the 12th International Joint Conference on Artificial Intelligence, IJCAI’91, vol. 1, pp. 331–337. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA. http://dl.acm.org/citation.cfm?id=1631171.1631221 (1991)
Chen, Q., Zhong, Y., Zhang, X.: A pseudo genetic algorithm. Neural Comput. Appl. 19(1), 77–83 (2010). https://doi.org/10.1007/s00521-009-0237-3
Cowling, P., Kendall, G., Han, L.: An investigation of a hyperheuristic genetic algorithm applied to a trainer scheduling problem. In: Proceedings of the 2002 Congress on Evolutionary Computation, CEC 2002, vol. 2, pp. 1185–1190 (2002). https://doi.org/10.1109/CEC.2002.1004411
Fraser, A.: Simulation of genetic systems by automatic digital computers. Aust. J. Biol. Sci. 10(2), 492–499 (1957)
Garcia, A.J., Pindolia, D.K., Lopiano, K.K., Tatem, A.J.: Modeling internal migration flows in sub-saharan africa using census microdata. Migr. Stud. 3(1), 89 (2014). https://doi.org/10.1093/migration/mnu036
Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning, 1st edn. Addison-Wesley Longman Publishing Co., Inc, Boston, MA, USA (1989)
Gozali, A.A., Tirtawangsa, J., Basuki, T.A.: Asynchronous island model genetic algorithm for university course timetabling. In: Proceedings of the 10th International Conference on the Practice and Theory of Automated Timetabling, pp. 179–187. PATAT, York (2014)
Hoos, H.H., Sttzle, T.: Satlib: an online resource for research on sat. In: SAT 2000, pp. 283–292. IOS Press (2000)
Li, J., Wang, H., Liu, J., Jiao, L.: Solving sat problem with a multiagent evolutionary algorithm. In: 2007 IEEE Congress on Evolutionary Computation, pp. 1416–1422 (2007). https://doi.org/10.1109/CEC.2007.4424637
Li, Q.J., Szeto, K.Y.: Efficiency of adaptive genetic algorithm with mutation matrix in the solution of the knapsack problem of increasing complexity. In: 2015 IEEE Congress on Evolutionary Computation (CEC), pp. 31–38 (2015). https://doi.org/10.1109/CEC.2015.7256871
Li, W., Zcan, E., John, R.: Multi-objective evolutionary algorithms and hyper-heuristics for wind farm layout optimisation. Renew. Energy 105, 473–482 (2017). https://doi.org/10.1016/j.renene.2016.12.022. http://www.sciencedirect.com/science/article/pii/S0960148116310709
Masel, J.: Genetic drift. Curr. Biol. 21(20), R837–R838 (2011). https://doi.org/10.1016/j.cub.2011.08.007. http://www.sciencedirect.com/science/article/pii/S0960982211008827
Mousbah Zeed Mohammed, S., Tajudin Khader, A., Azmi Al-Betar, M.: 3-SAT using island-based genetic algorithm. IEEJ Trans. Electron. Inf. Syst. 136(12), 1694–1698 (2016). https://doi.org/10.1541/ieejeiss.136.1694. https://www.jstage.jst.go.jp/article/ieejeiss/136/12/136_1694/_article
Raghavjee, R., Pillay, N.: A genetic algorithm selection perturbative hyper-heuristic for solving the school timetabling problem. ORiON 31(1), 39–60 (2015)
Ray, T.S.: An evolutionary approach to synthetic biology: Zen in the art of creating life. Artif. Life 1(1), 179–209 (1993)
Rogers, A., Prugel-Bennett, A.: Genetic drift in genetic algorithm selection schemes. IEEE Trans. Evol. Comput. 3(4), 298–303 (1999). https://doi.org/10.1109/4235.797972
Rosanne Els, N.P.: An evolutionary algorithm hyper-heuristic for producing feasible timetables for the curriculum based university course timetabling problem. In: 2010 Second World Congress on Nature and Biologically Inspired Computing. Kitakyushu (2010)
Schnell, P., Azzolini, D.: The academic achievements of immigrant youths in new destination countries: evidence from southern europe. Migr. Stud. 3(2), 217 (2014). https://doi.org/10.1093/migration/mnu040
Segredo, E., Lalla-Ruiz, E., Hart, E., Paechter, B., Voss, S.: Hybridisation of Evolutionary Algorithms Through Hyper-heuristics for Global Continuous Optimisation, pp. 296–305. Springer International Publishing, Cham (2016)
Stauffer, M., Hanne, T., Dornberger, R.: Uniform and non-uniform pseudorandom number generators in a genetic algorithm applied to an order picking problem. In: 2016 IEEE Congress on Evolutionary Computation (CEC), pp. 143–151 (2016). https://doi.org/10.1109/CEC.2016.7743789
Suyanto, S.: An informed genetic algorithm for university course and student timetabling problems. In: Artificial Intelligence Soft Computing. Lecture Notes of Computer Science, vol. 6114, pp. 229–236. Springer, Berlin (2010)
Tsutsui, S., Fujimoto, Y., Ghosh, A.: Forking genetic algorithms: gas with search space division schemes. Evol. Comput. 5(1), 61–80 (1997). https://doi.org/10.1162/evco.1997.5.1.61
Vardanis, Y., ke Nilsson, J., Klaassen, R.H., Strandberg, R., Alerstam, T.: Consistency in long-distance bird migration: contrasting patterns in time and space for two raptors. Anim. Behav. 113, 177–187 (2016). https://doi.org/10.1016/j.anbehav.2015.12.014. http://www.sciencedirect.com/science/article/pii/S0003347215004558
Acknowledgements
This work was supported by Indonesia Endowment Fund for Education (LPDP), a scholarship from Ministry of Finance, Republic of Indonesia. This work was conducted while at Graduate School of Information, Production, and Systems, Waseda University, Japan.
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this chapter
Cite this chapter
Gozali, A.A., Fujimura, S. (2018). Localization Strategy for Island Model Genetic Algorithm to Preserve Population Diversity. In: Lee, R. (eds) Computer and Information Science. ICIS 2017. Studies in Computational Intelligence, vol 719. Springer, Cham. https://doi.org/10.1007/978-3-319-60170-0_11
Download citation
DOI: https://doi.org/10.1007/978-3-319-60170-0_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-60169-4
Online ISBN: 978-3-319-60170-0
eBook Packages: EngineeringEngineering (R0)