Skip to main content
SpringerLink
Log in

Using Dynastic Exploring Recombination to Promote Diversity in Genetic Search

  • Conference paper
Parallel Problem Solving from Nature PPSN VI (PPSN 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1917))

Included in the following conference series:

Abstract

A family of recombination operators is studied in this work. These operators are based on keeping and using certain information about the past evolution of the algorithm to guide the recombination process. Within this framework, several recombination operators are specifically designed to preserve diversity within the population, while avoiding implicit mutations. The empirical evaluation of these operators on instances of two test problems (k-EMP and permutation flowshop) shows an improvement of the results with respect to other classical operators. This improvement seems to related to the increasing degree of epistasis of the problem.

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 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. J.E. Beasley. OR-library: Distributing test problems by electronic mail. Journal of the Operational Research Society, 41(11):1069–1072, 1990.

    Article  Google Scholar 

  2. E. Cantú-Paz. Designing efficient and accurate parallel genetic algorithms. Technical Report 99017, Illinois Genetic Algorithm Laboratory, 1999.

    Google Scholar 

  3. E. Cantú-Paz. Topologies, migration rates and multi-population parallel genetic algorithms. Technical Report 99007, Illinois Genetic Algorithm Laboratory, 1999.

    Google Scholar 

  4. C. Cotta. On resampling in nature-inspired heuristics. In V. Botti, editor, Proceedings of the Seventh Conference of the Spanish Association for Artificial Intelligence, pages 145–154, 1997. In Spanish.

    Google Scholar 

  5. C. Cotta, E. Alba, and J.M. Troya. Utilising dynastically optimal forma recombination in hybrid genetic algorithms. In A.E. Eiben, Th. Bäck, M. Schoenauer, and H.-P. Schwefel, editors, Parallel Problem Solving From Nature V, volume 1498 of Lecture Notes in Computer Science, pages 305–314. Springer-Verlag, Berlin, 1998.

    Chapter  Google Scholar 

  6. C. Cotta and J.M. Troya. Genetic forma recombination in permutation flowshop problems. Evolutionary Computation, 6(1):25–44, 1998.

    Google Scholar 

  7. C. Cotta and J.M. Troya. On the influence of the representation granularity in heuristic forma recombination. In J Carroll, E. Damiani, H. Haddad, and D. Oppenheim, editors, ACM Symposium on Applied Computing 2000, pages 433–439. ACM Press, 2000.

    Google Scholar 

  8. Y. Davidor and O. Ben-Kiki. The interplay among the genetic algorithm operators: Information theory tools used in a holistic way. In R. Manner and B. Manderick, editors, Parallel Problem Solving From Nature II, pages 75–84, Amsterdam, 1992. Elsevier Science Publishers B.V.

    Google Scholar 

  9. L. Eshelman. The CHC adaptive search algorithm. In G.J.E. Rawlins, editor, Foundations of Genetic Algorithms I, pages 265–283, San Mateo CA, 1991. Morgan Kauffman.

    Google Scholar 

  10. T.C. Fogarty. Varying the probability of mutation in the genetic algoritm. In J.D. Schaffer, editor, Proceedings of the Third International Conference on Genetic Algorithms, pages 104–109, San Mateo, CA, 1989. Morgan Kaufmann.

    Google Scholar 

  11. D.E. Goldberg. Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading, MA, 1989.

    MATH  Google Scholar 

  12. F.S. Hillier and G.J. Lieberman. Introduction to Operations Research. Holden-Day, San Francisco CA, 1967.

    MATH  Google Scholar 

  13. B. Manderick, M. de Weger, and P. Spiessens. The genetic algorithm and the structure of the fitness landscape. In R.K. Belew and L.B. Booker, editors, Proceedings of the Fourth International Conference on Genetic Algorithms, pages 143–150, San Mateo CA, 1991. Morgan Kaufmann.

    Google Scholar 

  14. N.J. Radcliffe. Equivalence class analysis of genetic algorithms. Complex Systems, 5:183–205, 1991.

    MATH  Google Scholar 

  15. N.J. Radcliffe. The algebra of genetic algorithms. Annals of Mathematics and Artificial Intelligence, 10:339–384, 1994.

    Article  MATH  Google Scholar 

  16. A. Rosete, A. Ochoa, and M. Sebag. A comparison of schema-processing algorithms. In Proceedings of the Second International Symposium on Artificial Intelligence, pages 22–26, La Habana, 1999.

    Google Scholar 

  17. P. Spiessens and B. Manderick. A massively parallel genetic algorithm. In R.K. Belew and L.B. Booker, editors, Proceedings of the Fourth International Conference on Genetic Algorithms, pages 279–286, San Mateo CA, 1991. Morgan Kauffman.

    Google Scholar 

  18. G. Syswerda. A study of reproduction in generational and steady-state genetic algorithms. In G.J.E. Rawlins, editor, Foundations of Genetic Algorithms I, pages 94–101, San Mateo, CA, 1991. Morgan Kaufmann.

    Google Scholar 

  19. R. Tanese. Distributed genetic algorithms. In J.D. Schaffer, editor, Proceedings of the Third International Conference on Genetic Algorithms, pages 434–439, San Mateo, CA, 1989. Morgan Kaufmann.

    Google Scholar 

  20. D.H. Wolpert and W.G. Macready. No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation, 1(1):67–82, 1997.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dpto. de Lenguajes y Ciencias de la Computatión, Univ. de Málaga, Campus de Teatinos (3.2.49), 29071, Málaga, Spain

    Carlos Cotta & José M. Troya

Authors
  1. Carlos Cotta
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. José M. Troya
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. CMAP, Ecole Polytechnique, 91128, Palaiseau Cedex, France

    Marc Schoenauer

  2. Dept. of Mechanical Engineering Kanpur Genetic Algorithms Laboratory, Indian Institute of Technology Kanpur, Kanpur, Pin, 208 016, India

    Kalyanmoy Deb

  3. Fachbereich Informatik, Lehrstuhl für Systemanalyse, Universität Dortmund, Joseph-von-Fraunhofer-Str. 20, 44221, Dortmund, Germany

    Günther Rudolph  & Hans-Paul Schwefel  & 

  4. School of Computer Science, The University of Birmingham, Edgbaston, Birmingham, B15 2TT, UK

    Xin Yao

  5. Projet Fractales, INRIA Rocquencourt, BP 105, 78153, Le Chesnay Cedex, France

    Evelyne Lutton

  6. Dept. de Arquitectura y Technologa de los Computadores, GeNeura Team, Universidad de Granada, Campus Fuenetenueva, s/n, Granada

    Juan Julian Merelo

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cotta, C., Troya, J.M. (2000). Using Dynastic Exploring Recombination to Promote Diversity in Genetic Search. In: Schoenauer, M., et al. Parallel Problem Solving from Nature PPSN VI. PPSN 2000. Lecture Notes in Computer Science, vol 1917. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45356-3_32

Download citation

  • DOI: https://doi.org/10.1007/3-540-45356-3_32

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41056-0

  • Online ISBN: 978-3-540-45356-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation