Skip to main content

A Coevolutionary Algorithm with Spieces as Varying Contexts

  • Conference paper
Knowledge-Based Intelligent Information and Engineering Systems (KES 2005)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3684))

Abstract

A coevolutionary algorithm is an extension of the conventional genetic algorithm that incorporates the strategy of divide and conquer in developing a complex solution in the form of interacting co-adapted subcomponents. It takes advantage of the reduced search space by evolving species associated with subsets of variables independently but cooperatively. In this paper we propose an efficient coevolutionary algorithm combining species splitting and merging together. Our algorithm conducts efficient local search in the reduced search space by splitting species for independent variables while it conducts global search by merging species for interdependent variables. We have experimented the proposed algorithm with several benchmarking function optimization and have shown that the algorithm outperforms existing coevolutionary algorithms

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Potter, M.A., DeJong, K.A.: A cooperative coevolutionary approach to function optimization. In: Proc. of the Third Conference on Parallel Problem Solving from Nature, pp. 249–257. Springer, Heidelberg (1994)

    Google Scholar 

  2. Potter, M.A., DeJong, K.A.: Cooperative Coevolution: An Architecture for Evolving Coadapted Subcomponents. Evolutionary Computation 8(1), 1–29 (2000)

    Article  Google Scholar 

  3. Mundhe, M., Sen, S.: Evolving agent societies that avoid social dilemmas. In: Proc. Of GECCO 2000, Las Vegas, Nevada, July 2000, pp. 809–816 (2000)

    Google Scholar 

  4. Pagie, L., Mitchell, M.: A Comparison of Evolutionry and Coevolutionary Search. Journal of Computational Intelligence and Applications 2(1), 53–69 (2002)

    Article  Google Scholar 

  5. Weicker, K., Weicker, N.: On the improvement of coevolutionary optimizers by learning variable interdependencies. In: Congress on Evolutionary Computation (CEC 1999), pp. 1627–1632 (1999)

    Google Scholar 

  6. Nash, J.: Non-cooperative games. Annals of Mathematics 5(2), 286–295 (1951)

    Article  MathSciNet  Google Scholar 

  7. Salomon, R.: Reevaluating genetic algorithm performance under coordinate rotation of benchmark functions. BioSystems 39, 210–229 (1996)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kim, M.W., Ryu, J.W., Kim, E.J. (2005). A Coevolutionary Algorithm with Spieces as Varying Contexts. In: Khosla, R., Howlett, R.J., Jain, L.C. (eds) Knowledge-Based Intelligent Information and Engineering Systems. KES 2005. Lecture Notes in Computer Science(), vol 3684. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11554028_26

Download citation

  • DOI: https://doi.org/10.1007/11554028_26

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28897-8

  • Online ISBN: 978-3-540-31997-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics