Skip to main content
SpringerLink
Log in

The Introduction of Asymmetry on Traditional 2-Parent Crossover Operators for Crowding and Its Effects

  • Conference paper
Simulated Evolution and Learning (SEAL 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8886))

Included in the following conference series:

  • 2811 Accesses

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).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. De Jong, K.A.: An Analysis of the behavior of a class of genetic adaptive systems. Ph.D. Dissertation, University of Michigan (1975)

    Google Scholar 

  2. Mahfoud, S.W.: Niching methods for genetic Algorithms. PhD Dissertation, Department of General Engineering, University of Illinois at Urbana-Champaign (1995)

    Google Scholar 

  3. Mengshoel, O.J., Goldberg, D.E.: Probabilistic crowding: Deterministic crowding with probabilistic replacement. In: Genetic and Evolutionary Computation Conference, pp. 409–416 (1999)

    Google Scholar 

  4. Mengshoel, O.J., Goldberg, D.E.: The crowding approach to niching in genetic algorithms. Evolutionary Computation 16(3), 315–354 (2008)

    Article  Google Scholar 

  5. Galan, S.F., Mengshoel, O.J.: Generalized crowding for genetic algorithms. In: Genetic and Evolutionary Computation Conference, pp. 775–782. ACM (2010)

    Google Scholar 

  6. Goldberg, D.E.: Genetic algorithms in search, optimization and machine learning. Addison-Wesley publishing company (1989)

    Google Scholar 

  7. 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)

    Chapter  Google Scholar 

  8. Pisinger, D.: A minimal algorithm for the 0-1 Knapsack Problem. Operations Research 45, 758–767 (1994)

    Article  MathSciNet  Google Scholar 

  9. Goldberg, D.E., Korb, B., Deb, K.: Messy genetic algorithms: motivation, analysis, and first results. Complex Systems, 493–530 (1989)

    Google Scholar 

  10. Grefenstette, J.J., Davis, L., Cerys, D.: GENESIS and OOGA: Two GA Systems. TSP Publication, Melrose (1991)

    Google Scholar 

  11. Tsutsui, S., Fujimoto, Y., Ghosh, A.: Forking GAs: GAs with search space division schemes. Evolutionary Computation 5(1), 61–80 (1997)

    Article  Google Scholar 

  12. Burkard, R.E., Çela, E., Karisch, S.E., Rendl, F.: QAPLIB - a quadratic assignment problem library (2009), http://www.seas.upenn.edu/qaplib

  13. Taillard, É.D.: Comparison of iterative searches for the quadratic assignment problem. Location Science 3(2), 87–105 (1995)

    Article  MATH  Google Scholar 

  14. Stützle, T., Hoos, H.: Max-Min Ant System. Future Generation Computer Systems 16(9), 889–914 (2000)

    Article  Google Scholar 

  15. 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)

    Google Scholar 

  16. Eshelman, L.J., Schaffer, J.D.: Real-coded genetic algorithms and interval-schema. Foundations of Genetic Algorithms 2, 187–202 (1993)

    Article  Google Scholar 

  17. 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)

    Google Scholar 

  18. Ono, I., Kobayashi, S.: A real coded genetic algorithm for function optimization using unimodal normal distributed crossover. In: ICGA, pp. 246–253 (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Hannan University, Matsubara, Osaka, 580-8502, Japan

    Shigeyoshi Tsutsui

Authors
  1. Shigeyoshi Tsutsui
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Otago University, Dunedin, New Zealand

    Grant Dick

  2. Victoria University of Welling, New Zealand

    Will N. Browne

  3. University of Otago, Dunedin, New Zealand

    Peter Whigham

  4. Unitec Institute of Technology, Victoria University of Wellington, New Zealand

    Mengjie Zhang

  5. Le Quy Don Technical University, Hanoi, Vietnam

    Lam Thu Bui

  6. Department of Computer Science and Intelligent Systems, Graduate School of Engineering, Osaka Prefecture University, 1-1 Gakuen-cho, Naka-ku, 599-8531, Sakai, Osaka, Japan

    Hisao Ishibuchi

  7. Department of Computing, University of Surrey, GU2 7XH, Guildford, Surrey, UK

    Yaochu Jin

  8. RMIT University, Melbourne, Australia

    Xiaodong Li

  9. Department of Electrical & Electronic Engineering, Xi’an Jiaotong-Liverpool University, Suzhou, China

    Yuhui Shi

  10. Indian Institute of Information Technology and Management, Gwalior, India

    Pramod Singh

  11. Department of Electrical and Computer Engineering, National University of Singapore, 4 Engineering Drive 3, 117576, Singapore, Singapore

    Kay Chen Tan

  12. USTC-Birmingham Joint Research Institute in Intelligent Computation and Its Applications (UBRI), School of Computer Science and Technology, University of Science and Technology of China, 230027, Hefei, China

    Ke Tang

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation