Abstract
This paper proposes a novel crowding method, which we call “Crowding with Asymmetric Crossover (CAX)” that can be applied to traditional 2-parent crossover operators. The asymmetric crossover operator begins with two parents. Then two offspring individuals are created, each offspring taking more characteristics from one of the two parents. This is an easy method to perform replacement between parents and offspring individuals. Experimental results showed that CAX can increases the performance of traditional 2-parent crossover operators in finding global optimal solutions. CAX is also useful to find multiple solutions (niching).
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
De Jong, K.A.: An Analysis of the behavior of a class of genetic adaptive systems. Ph.D. Dissertation, University of Michigan (1975)
Mahfoud, S.W.: Niching methods for genetic Algorithms. PhD Dissertation, Department of General Engineering, University of Illinois at Urbana-Champaign (1995)
Mengshoel, O.J., Goldberg, D.E.: Probabilistic crowding: Deterministic crowding with probabilistic replacement. In: Genetic and Evolutionary Computation Conference, pp. 409–416 (1999)
Mengshoel, O.J., Goldberg, D.E.: The crowding approach to niching in genetic algorithms. Evolutionary Computation 16(3), 315–354 (2008)
Galan, S.F., Mengshoel, O.J.: Generalized crowding for genetic algorithms. In: Genetic and Evolutionary Computation Conference, pp. 775–782. ACM (2010)
Goldberg, D.E.: Genetic algorithms in search, optimization and machine learning. Addison-Wesley publishing company (1989)
Tsutsui, S.: cAS: Ant colony optimization with cunning ants. In: Runarsson, T.P., Beyer, H.-G., Burke, E.K., Merelo-Guervós, J.J., Whitley, L.D., Yao, X. (eds.) PPSN IX. LNCS, vol. 4193, pp. 162–171. Springer, Heidelberg (2006)
Pisinger, D.: A minimal algorithm for the 0-1 Knapsack Problem. Operations Research 45, 758–767 (1994)
Goldberg, D.E., Korb, B., Deb, K.: Messy genetic algorithms: motivation, analysis, and first results. Complex Systems, 493–530 (1989)
Grefenstette, J.J., Davis, L., Cerys, D.: GENESIS and OOGA: Two GA Systems. TSP Publication, Melrose (1991)
Tsutsui, S., Fujimoto, Y., Ghosh, A.: Forking GAs: GAs with search space division schemes. Evolutionary Computation 5(1), 61–80 (1997)
Burkard, R.E., Çela, E., Karisch, S.E., Rendl, F.: QAPLIB - a quadratic assignment problem library (2009), http://www.seas.upenn.edu/qaplib
Taillard, É.D.: Comparison of iterative searches for the quadratic assignment problem. Location Science 3(2), 87–105 (1995)
Stützle, T., Hoos, H.: Max-Min Ant System. Future Generation Computer Systems 16(9), 889–914 (2000)
Tsutsui, S., Fujimoto, N.: ACO with tabu search on a GPU for solving QAPs using move-cost adjusted thread assignment. In: Genetic and Evolutionary Computation Conference, pp. 1547–1554. ACM (2011)
Eshelman, L.J., Schaffer, J.D.: Real-coded genetic algorithms and interval-schema. Foundations of Genetic Algorithms 2, 187–202 (1993)
Goldberg, D.E., Richardson, J.: Genetic algorithms with sharing for multimodal function optimization. In: Proceedings of the 2nd Inter. Conf. on Genetic Algorithms and their Application, pp. 41–49 (1987)
Ono, I., Kobayashi, S.: A real coded genetic algorithm for function optimization using unimodal normal distributed crossover. In: ICGA, pp. 246–253 (1997)
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
Tsutsui, S. (2014). The Introduction of Asymmetry on Traditional 2-Parent Crossover Operators for Crowding and Its Effects. In: Dick, G., et al. Simulated Evolution and Learning. SEAL 2014. Lecture Notes in Computer Science, vol 8886. Springer, Cham. https://doi.org/10.1007/978-3-319-13563-2_7
Download citation
DOI: https://doi.org/10.1007/978-3-319-13563-2_7
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-13562-5
Online ISBN: 978-3-319-13563-2
eBook Packages: Computer ScienceComputer Science (R0)