Skip to main content

Heterogeneous Co-evolving Parasites

  • Conference paper
Artificial Neural Nets and Genetic Algorithms

Abstract

This paper investigates a development of Hillis’ co-evolving parasites scheme and looks at how it might be used for job-shop scheduling problems. It suggests that a problem defined by orthogonal constraints may be solved using multiple types of co-evolving parasite.

Areas of specialisation permit the development of solutions specialised for certain constraints; overlaps of these areas create hybrids which combat multiple kinds of parasite and therefore provide solutions.

The main advantage of such a technique is that it permits the use of an evolutionary approach without requiring the specification of a fitness function, which is problematic for many real-world problems.

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 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. DAVIDOR, Y. (1991) A naturally occurring niche and species phenomenon: the model and first results, in R.K. Belew and L.B. Booker (eds.), Proceedings of the Fourth International Conference on Genetic Algorithms. Morgan Kaufman.

    Google Scholar 

  2. DAVIS, L. (1985) Job shop scheduling with genetic algorithms. In J.J. Grefenstette (ed.), Proceedings of the First International Conference on Genetic Algorithms and their Applications, Lawrence Erlbaum Associates.

    Google Scholar 

  3. FANG, H.L., ROSS, P., and CORNE, D. (1993) A promising genetic algorithm approach to job-shop scheduling, rescheduling, and open-shop scheduling problems. In S. Forrest (ed.), Proceedings of the Fifth International Conference on Genetic Algorithms. Morgan Kaufmann.

    Google Scholar 

  4. HILLIS, W. D. (1990) Co-evolving parasites improve simulated evolution as an optimisation procedure. In S. Forrest (ed.), Emergent Computation: Self-Organising, Collective, and Cooperative Phenomena in Natural and Artificial Computing Networks, 228–234, MIT Press.

    Google Scholar 

  5. HOLLAND, J. (1992) Adaptation in Natural and Artificial Systems, MIT Press.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag/Wien

About this paper

Cite this paper

Holmes, J., Routen, T.W., Czarnecki, C.A. (1995). Heterogeneous Co-evolving Parasites. In: Artificial Neural Nets and Genetic Algorithms. Springer, Vienna. https://doi.org/10.1007/978-3-7091-7535-4_42

Download citation

  • DOI: https://doi.org/10.1007/978-3-7091-7535-4_42

  • Publisher Name: Springer, Vienna

  • Print ISBN: 978-3-211-82692-8

  • Online ISBN: 978-3-7091-7535-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics