Abstract
In most of distributed evolutionary algorithms (DEAs), migration interval is used to decide the frequent of migration. Nevertheless, a predetermined interval cannot match the dynamic situation of evolution. Consequently, migration may happen at a wrong moment and just exert a negative influence to evolution. In this paper, a scheme of setting the success rate of migration based on subpopulation diversity is proposed. In the scheme, migration still happens at intervals, but the probability of immigrants entering the target subpopulation will be decided by the diversity of this subpopulation. An analysis shows that the extra time consumption for our scheme in a DEA is acceptable. In our experiments, outcomes of the DEA based on the proposed scheme are compared with those of a traditional DEA on six benchmark instances of the Traveling Salesman Problem. The results show that the former performs better than its peer. Moreover, the DEA based on our scheme shows an advantage in stability.
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
Preview
Unable to display preview. Download preview PDF.
References
Alba, E., Tomassini, M.: Parallelism and Evolutionary Algorithms. IEEE Trans. Evolutionary Computation. 5, 443–462 (2002)
Bossert, W.: Mathematical Optimization: Are There Abstract Limits on Natural Selection? In: Moorhead, P.S., Kaplan, M.M. (eds.) Mathematical Challenges to the Neo-Darwinian Interpretation of Evolution. Wistar Institute, Philadelphia (1967)
Bulnes, F.G., Usamentiaga, R., Garcia, D.F., Molleda, J.: A Parallel Genetic Algorithm for Optimizing an Industrial Inspection System. IEEE Latin America Trans. 12, 1338–1343 (2013)
Cai, Z.H., Peng, J.G., Gao, W., Wei, W., Kang, L.S.: An Improved Evolutionary Algorithm for the Traveling Salesman Problem. Chinese J. Computers 5, 823–828 (2005)
Cant-Paz, E.: A Survey of Parallel Genetic Algorithms. Calculateurs Parallles. Reseaux et Systems Repartis 10 (1998)
Chang, P.C., Huang, W.H., Ting, C.J.: Dynamic Diversity Control in Genetic Algorithm for Mining Unsearched Solution Space in TSP Problems. Expert Systems with Applications 3, 1863–1878 (2010)
Chang, J.F., Chu, S.C., Roddick, J.F., Pan, J.S.: A Parallel Particle Swarm Optimization Algorithm with Communication Strategies. J. Information Science and Engineering 7, 809–818 (2005)
Chu, S.C., Roddick, J.F., Pan, J.S.: Ant Colony System with Communication Strategies. Information Sciences 12, 63–76 (2004)
Cohoon, J.P., Hegde, S.U., Martin, W.N., Richards, D.: Punctuated Equilibria: A Parallel Genetic Algorithm. In: The Proceeding of the 1987 International Conference on Genetic Algorithms and Their Application, pp. 148–154. L. Erlbaum Associates Inc., Hillsdale (1987)
Denzinger, J., Kidney, J.: Improving Migration by Diversity. In: The Proceeding of the 2003 IEEE Congress Evolutionary Computation, pp. 700–707. IEEE, New York (2003)
Devos, O., Downey, G., Duponchel, L.: Simultaneous Data Pre-processing and SVM Classification Model Selection Based on a Parallel Genetic Algorithm Applied to Spectroscopic Data of Olive Oils. Food Chemistry 4, 124–130 (2014)
Goldberg, D.E., Lingle, R.: Alleles, Loci and the TSP. In: The Proceeding of the First International Conference on Genetic Algorithms. ACM, New York (1985)
Tao, G., Michalewicz, Z.: Inver-over Operator for the TSP. In: Eiben, A.E., Bäck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol. 1498, pp. 803–812. Springer, Heidelberg (1998)
Herrera, F., Lozano, M., Moraga, C.: Hierarchical Distributed Genetic Algorithms. Int. J. Intelligent Systems, 1099–1121 (1997)
Li, C.J., Hu, G.D.: Global Migration Strategy with Moving Colony for Hierarchical Distributed Evolutionary Algorithms. Soft Computing 11, 2161–2176 (2014)
Lin, S., Kernighan, B.W.: An Effective Heuristic Algorithm for the Traveling-Salesman Problem. Operations Research 1, 498–516 (1973)
Power, D.: Promoting Diversity Using Migration Strategies in Distributed Genetic Algorithms. In: The Proceeding of the 2005 IEEE Congress Evolutionary Computation, pp. 1831–1838. IEEE, New York (2005)
Rocha, I.B.C.M., Parente, E., Melo, A.M.C.: A Hybrid Shared/Distributed Memory Parallel Genetic Algorithm for Optimization of Laminate Composites. Composite Structures 1, 288–297 (2014)
Skolicki, Z., De Jong, K.: The Influence of Migration Sizes and Intervals on Island Models. In: The Proceeding of the 2005 ACM Conference on Genetic and Evolutionary Computation, pp. 1295–1302. ACM, New York (2005)
Tosun, U., Dokeroglu, T., Cosar, A.: A Robust Island Parallel Genetic Algorithm for the Quadratic Assignment Problem. International Journal of Production Research 7, 1–11 (2013)
Wei, X.T., Yang, X.H., Deng, Y.L.: Maintain Gene Diversity with Set Pair Analysis in Parallel Genetic Programming. In: The Proceeding of the 8th International Symposium on Distributed Computing and Applications to Business, Engineering and Science, pp. 76–79. Publishing House Electronics Industry, Beijing (2009)
Zidi, K., Mguis, F., Ghedira, K., Borne, P.: Distributed Genetic Algorithm for Disaster Relief Planning. Int. J. of Computers Communications & Control 10, 769–783 (2013)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Li, C., Chen, Z., Gu, S., Li, M., Shan, H., Hu, G. (2014). Subpopulation Diversity Based Setting Success Rate of Migration for Distributed Evolutionary Algorithms. In: Pham, DN., Park, SB. (eds) PRICAI 2014: Trends in Artificial Intelligence. PRICAI 2014. Lecture Notes in Computer Science(), vol 8862. Springer, Cham. https://doi.org/10.1007/978-3-319-13560-1_1
Download citation
DOI: https://doi.org/10.1007/978-3-319-13560-1_1
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-13559-5
Online ISBN: 978-3-319-13560-1
eBook Packages: Computer ScienceComputer Science (R0)