Skip to main content

Part of the book series: Computational Intelligence ((CI))

  • 416 Accesses

Zusammenfassung

In diesem Kapitel wird in kurzer Form die interessante Frage aufgegriffen, wie gut die Mechanismen der Evolution in EA abgebildet sind bzw. wie genau man sie abbilden sollte.1 Eine Auflistung der methodischen Unterschiede zwischen GA, GP, ES und EP ergänzt die Darstellungen (s. Tabelle 7-1).

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 49.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 44.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.

Literatur zum Kapitel 7

  1. Bäck, T.; Schwefel, H.-P.: An Overview of Evolutionary Algorithms for Parameter Optimization, in: Evolutionary Computation 1 (1993) 1, S. 123.

    Google Scholar 

  2. Baluja, S.: Structure and Performance of Fine-Grain Parallelism in Genetic Search, in: [FORR93], S. 155–162.

    Google Scholar 

  3. Battiti, R; Tecchiolli, G.: Local Search with Memory: Benchmarking RTS, in: OR Spektrum 17 (1995) 2/3, S. 67–86.

    Google Scholar 

  4. Belew, R.D.; Booker, L.B.: Proceedings of the Fourth International Conference on Genetic Algorithms, San Mateo: Morgan Kaufmann 1991.

    Google Scholar 

  5. Biethahn, J.; Nissen, V. (Hrsg.): Evolutionary Algorithms in Management Applications, Berlin: Springer 1995.

    MATH  Google Scholar 

  6. Brandeau, M.L.; Chiu, S.S.: An Overview of Representative Problems in Location Research, in: Management Science (1989), S. 645–674.

    Google Scholar 

  7. Caldwell, C.; Johnston, V. S.: Tracking a Criminal Suspect Through „Face-Space“ with a Genetic Algorithm, in: [BELE91], S. 416–421.

    Google Scholar 

  8. Cantú-Paz, E.: A Summary of Research on Parallel Genetic Algorithms, I11iGAL Report 95007, Illinois Genetic Algorithms Laboratory, University of Illinois, Urbana-Champaign 1995.

    Google Scholar 

  9. Davis, L.: A Genetic Algorithms Tutorial, in: Davis, L.(Hrsg.): Handbook of Genetic Algorithms. New York: Van Nostrand Reinhold 1991, S. 1101.

    Google Scholar 

  10. Davidor, Y.; Schwefel, H.-P.; Männer, R. (Hrsg.): Parallel Problem Solving from Nature - PPSN III, Berlin: Springer 1994.

    Book  MATH  Google Scholar 

  11. Duncan, B. S.: Parallel Evolutionary Programming, in: Fogel, D. B.; Atmar, W. (Hrsg.): Proceedings of the Second Annual Conference on Evolutionary Programming, San Diego/CA: Evolutionary Programming Society 1993, S. 202–208.

    Google Scholar 

  12. Eshelman, L.J.: Proceedings of the Sixth International Conference on Genetic Algorithms, San Francisco: Morgan Kaufmann 1995.

    Google Scholar 

  13. Fogel, D.B.: On the Philosophical Differences between Evolutionary Algorithms and Genetic Algorithms, in: Fogel, D.B.; Atmar, W. (Hrsg.): Proceedings of the Second Annual Conference on Evolutionary Programming, San Diego/CA: Evolutionary Programming Society 1993, S. 23–29.

    Google Scholar 

  14. Fogel, D.B.: Evolutionary Computation. Toward a New Philosophy of Machine Intelligence, New York: IEEE Press 1995.

    Google Scholar 

  15. Forrest, S. (Hrsg.): Proceedings of the Fifth International Conference on Genetic Algorithms, San Mateo/CA: Morgan Kaufmann 1993.

    Google Scholar 

  16. GORD93] Gordon, V.S.; Whitley, D.: Serial and Parallel Genetic Algorithms as Function Optimizers, in: [FORR93], S. 177–183.

    Google Scholar 

  17. Grefenstette, J.J.; Fitzpatrick, J.M.: Genetic Search with Approximate Function Evaluations, in: Grefenstette, J.J. (Hrsg.): Proceedings of an International Conference on Genetic Algorithms and Their Applications, Hillsdale/NJ: Lawrence Erlbaum 1985, S. 112–120.

    Google Scholar 

  18. Hauser, R.; Männer, R.: Implementation of Standard Genetic Algorithm on MIMD Machines, in: [DAVI94], S. 503–513.

    Google Scholar 

  19. Hinton, G.E.; Nowlan, S.J.: How Learning can Guide Evolution, in: Complex Systems (1987) 1, S. 495–502.

    Google Scholar 

  20. Hoffmeister, F.: Scalable Parallelism by Evolutionary Algorithms, in: Grauer, M.; Pressmar, D. B. (Hrsg.): Parallel Computing and Mathematical Optimization, Berlin: Springer 1991, S. 177–198.

    Chapter  Google Scholar 

  21. Koza, J.R.: Genetic Programming II, Cambridge/MA: MIT Press 1994.

    MATH  Google Scholar 

  22. Koza, J.R.; Andre, D.: Parallel Genetic Programming on a Network of Transputers, Technical Report, Stanford University, Computer Science Department, Stanford 1995.

    Google Scholar 

  23. Macfarlane, D.; East, I.: An Investigation of Several Parallel Genetic Algorithms, in: Turner, S.J. (Hrsg.): Proceedings of the OCCAM User Group Technical Meeting 12, Tools and Techniques for Transputer Applications, Amsterdam: IOS Press 1990, S. 60–67.

    Google Scholar 

  24. Manderick, B.; de Weger, M.; Spiessens, P.: The Genetic Algorithm and the Structure of the Fitness Landscape, in: [BELE91], S. 143–150.

    Google Scholar 

  25. Mühlenbein, H.: Parallel Genetic Algorithms, Population Genetics and Combinatorial Optimization, in: [SCHA891, S. 416–421.

    Google Scholar 

  26. Nissen, V.: Evolutionäre Algorithmen. Darstellung, Beispiele, be- triebswirtschaftliche Anwendungsmöglichkeiten, Wiesbaden: DUV 1994.

    Google Scholar 

  27. Nissen, V.: An Overview of Evolutionary Algorithms in Management Applications, in [BIET95], S. 44–97.

    Google Scholar 

  28. Nissen, V.; Biethahn, J.: Determining a Good Inventory Policy with a Genetic Algorithm, in [BIET95], S. 240–249.

    Google Scholar 

  29. Nissen, V.: Management Applications and Other Classical Optimization Problems, in: Bäck, T.; Fogel, D.; Michalewicz, Z. (Hrsg.): Handbook of Evolutionary Computation, New York: Oxford University Press (erscheint 1997 ).

    Google Scholar 

  30. Nordin, P.; Banzhaf, W.: Evolving Turing-Complete Programs for a Register Machine with Self-modifying Code, in: [ESHE95], S. 318–325.

    Google Scholar 

  31. Rechenberg, I.: Evolutionsstrategie. Optimierung technischer Systeme nach Prinzipien der biologischen Evolution, Stuttgart: FrommannHolzboog 1973.

    Google Scholar 

  32. Rudolph, G.: Global Optimization by Means of Distributed Evolution Strategies, in: [SCHW911, S. 209–213.

    Google Scholar 

  33. Sarma, J.; De Jong, K.: An Analysis of the Effects of Neighborhood Size and Shape on Local Selection Algorithms, in: Voigt, H.-M.; Ebeling, W.; Rechenberg, I.; Schwefel, H.-P. (Hrsg.): Parallel Problem Solving from Nature–PPSN IV, LNCS 1141, Berlin: Springer 1996, S. 236–244.

    Chapter  Google Scholar 

  34. SCHA89]Schaffer, J. D. (Hrsg.): Proceedings of the Third International Conference on Genetic Algorithms, San Mateo/CA: Morgan Kaufmann 1989.

    Google Scholar 

  35. Schwefel, H.-P.; Männer, R. (Hrsg.): Parallel Problem Solving from Nature, Berlin: Springer 1991.

    Google Scholar 

  36. Sprave, J.: Linear Neighborhood Evolution Strategy, in: Sebald, A.V., Fogel, L.J. (Hrsg.): Proceedings of the Third Annual Conference on Evolutionary Programming, Singapur: World Scientific 1994, S. 42–51.

    Google Scholar 

  37. Tanese, R.: Distributed Genetic Algorithms, in: [SCHA89], S. 434–439.

    Google Scholar 

  38. Wolpert, D.H.; Macready, W.G.: No Free Lunch Theorems for Search, Arbeitsbericht SFI–TR–95–02–010 (eingereicht beim Journal of Operations Research), Santa Fe Institute 1995 (FTP://ftp.santafe.edu im Verzeichnis: /pub/wgm/nfl.ps).

    Google Scholar 

  39. Csányi, V.: Evolutionary Systems and Society. A General Theory of Life, Mind, and Culture, Durham: Duke University Press 1989.

    Google Scholar 

  40. De Jong, K.; Sarma, J.: On Decentralizing Selection Algorithms, in: [ESHE95], S. 17–23.

    Google Scholar 

  41. Hoffmeister, F.: Scalable Parallelism by Evolutionary Algorithms, in: Grauer, M.; Pressmar, D.B. (Hrsg.): Parallel Computing and Mathematical Optimization, Berlin: Springer 1991, S. 177–198.

    Chapter  Google Scholar 

  42. Mcllhagga, M.; Husbands, P.; Ives, R.: A Comparison of Search Techniques on a Wing-Box Optimisation Problem, in: Voigt, H.-M.; Ebeling, W.; Rechenberg, I.; Schwefel, H.-P. (Hrsg.): Parallel Problem Solving from Nature–PPSN IV, LNCS 1141, Berlin: Springer 1996, S. 614–623.

    Chapter  Google Scholar 

  43. Radcliffe, N.J.; Surry, P.D.: Fundamental Limitations on Search Algorithms: Evolutionary Computing in Perspective, in: Leeuwen, J.v. (Hrsg.): Computer Science Today, LNCS 1000, Berlin: Springer 1995, S. 275–291.

    Chapter  Google Scholar 

  44. Schwehm, M.: Implementation of Genetic Algorithms on Various Interconnection Networks, in: Valero, M.; Onate, E.; Jane, M.; Larriba, J.L.; Suarez, B. (Hrsg.): Parallel Computing and Transputer Applications 5, Amsterdam: IOS Press 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Friedr. Vieweg & Sohn Verlagsgesellschaft mbH, Braunschweig/Wiesbaden

About this chapter

Cite this chapter

Nissen, V. (1997). Vergleich und Beurteilung von EA. In: Einführung in Evolutionäre Algorithmen. Computational Intelligence. Vieweg+Teubner Verlag. https://doi.org/10.1007/978-3-322-93861-9_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-322-93861-9_7

  • Publisher Name: Vieweg+Teubner Verlag

  • Print ISBN: 978-3-528-05499-1

  • Online ISBN: 978-3-322-93861-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics