Skip to main content
SpringerLink
Log in
Book cover

Einführung in Evolutionäre Algorithmen pp 217–236Cite as

EA nah verwandte Optimierungsmethoden

  • Chapter

  • 421 Accesses

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

Zusammenfassung

In diesem Kapitel werden in kurzer Form einige heuristische Optimierungsmethoden vorgestellt, die deutliche Ähnlichkeiten zu EA aufweisen und gleichzeitig wichtige Konkurrenten von EA in der praktischen Optimierung sind. Im einzelnen handelt es sich um: Simulated Annealing (SA), Threshold Accepting (TA), Sintflut-Algorithmus (SI) und Record-to-Record Travel (RR).1

This is a preview of subscription content, 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   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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literatur zum Kapitel 6

  1. Aarts, E.H.L.; Korst, J.: Simulated Annealing and Boltzmann Machines, Chichester: John Wiley and Sons 1989.

    MATH  Google Scholar 

  2. Cerny, V.: Thermodynamical Approach to the Traveling Salesman Problem: An Efficient Simulation Algorithm, in: Journal of Optimisation Theory and Applications 45 (1985), S. 41-51.

    Article  MathSciNet  MATH  Google Scholar 

  3. Collins, N.E.; Eglese, R.W.; Golden, B.L.: Simulated Annealing - An Annotated Bibliography, in: American Journal of Mathematical and Management Sciences 8 (1988), S. 209-307.

    MathSciNet  MATH  Google Scholar 

  4. Dueck, G.; Scheuer, T.: Threshold Accepting: A General Purpose Optimization Algorithm Appearing Superior to Simulated Annealing, in: Journal of Computational Physics 90 (1990), S. 161-175.

    Article  MathSciNet  MATH  Google Scholar 

  5. Dueck, G.: New Optimization Heuristics. The Great Deluge Algorithm and the Record-to-Record Travel, in: Journal of Computational Physics 104 (1993), S. 86-92.

    Article  MATH  Google Scholar 

  6. Dueck, G.; Scheuer, T.; Wallmeier, H.-M.: Toleranzschwelle und Sintflut: neue Ideen zur Optimierung, in: Spektrum der Wissenschaft (1993) 3, S. 42 - 51.

    Google Scholar 

  7. Eglese, R.W.: Simulated Annealing: A Tool for Operational Research, in: European Journal of Operational Research 46 (1990), S. 271-281.

    Article  MathSciNet  MATH  Google Scholar 

  8. Jorgensen, R.M.; Thomsen, H.; Valqui Vidal, R.V.: The Afforestation Problem: A Heuristic Method Based on Simulated Annealing, in: European Journal of Operational Research 56 (1992), S. 184-191.

    Article  Google Scholar 

  9. Kirkpatrick, S.; Gelatt Jr., C.D.; Vecchi, M.P.: Optimization by Simulated Annealing, in: Science 220 (1983), S. 671-680.

    Article  MathSciNet  MATH  Google Scholar 

  10. van Laarhoven, P.J.M.; Aarts, E.H.L.: Simulated Annealing: Theory and Applications, Dordrecht: Reidel 1987.

    MATH  Google Scholar 

  11. Mahfoud, S.W.; Goldberg, D.E.: Parallel Recombinative Simulated Annealing: A Genetic Algorithm, in: Parallel Computing 21 (1995), S. 1-28.

    Article  MathSciNet  MATH  Google Scholar 

  12. Metropolis, N.; Rosenbluth, A.; Rosenbluth, M.; Teller, A.; Teller, E.: Equation of State Calculations by Fast Computing Machines, in: Journal of Chemical Physics 21 (1953), S. 1087-1092.

    Article  Google Scholar 

  13. Nissen, V.; Paul, H.: A Modification of Threshold Accepting and its Application to the Quadratic Assignment Problem, in: OR Spektrum 17 (1995), S. 205-210.

    Article  MATH  Google Scholar 

  14. Romeo, F.; Sangiovelli-Vincentelli, A.: A Theoretical Framework for Simulated Annealing, in: Algorithmica 6 (1991), S. 302-345.

    Article  MathSciNet  MATH  Google Scholar 

  15. Rudolph, G.: Massively Parallel Simulated Annealing and Its Relation to Evolutionary Algorithms, in: Evolutionary Computation 1 (1993), S. 361-383.

    Article  Google Scholar 

  16. Varanelli, J.M.; Cohoon, J.P.: Population-Oriented Simulated Annealing: A Genetic/Thermodynamic Hybrid Approach to Optimization, in: Eshelman, L.J. (Hrsg.): Proceedings of the Sixth International Conference on Genetic Algorithms, San Francisco/CA: Morgan Kaufmann 1995, S. 174 - 181.

    Google Scholar 

  17. Alander, J.T.: An Indexed Bibliography of Genetic Algorithms and Simulated Annealing: Hybrids and Comparisons, Technical Report, University of Vaasa, Vaasa/Finland 1995 ( Internet-Adresse siehe Anhang A).

    Google Scholar 

  18. Baluja, S.: Population-Based Incremental Learning: A Method for Integrating Genetic Search Based Function Optimization and Competitve Learning, Technical Report CMU-CS-94-163, Carnegie Mellon University, School of Computer Science, Pittsburgh/PA 1994.

    Google Scholar 

  19. Baluja, S.; Caruana, R.: Removing the Genetics from the Standard Genetic Algorithm, Technical Report CMU-CS-95-141, Carnegie Mellon University, School of Computer Science, Pittsburgh/PA 1995.

    Google Scholar 

  20. Davis, L. (Hrsg.): Genetic Algorithms and Simulated Annealing, London: Pitman 1987.

    MATH  Google Scholar 

  21. Glover, F.; Greenberg, H.J.: New Approaches for Heuristic Search: A Bilateral Link with Artificial Intelligence, in: European Journal of Operational Research 39 (1989), S. 119-130.

    Article  MathSciNet  MATH  Google Scholar 

  22. Glover, F.: Tabu Search: A Tutorial, in: Interfaces 20 (1990) 4, S. 74-94.

    Article  Google Scholar 

  23. Glover, F.: Scatter Search and Star-Paths: Beyond the Genetic Metaphor, in: OR Spektrum 17 (1995), S. 125-137.

    Article  MATH  Google Scholar 

  24. Greenberg, D.R.: Parallel Simulated Annealing Techniques, in: Physica D 42 (1990), S. 293-306.

    Article  Google Scholar 

  25. Johnson, D.S.; Aragon, C.R.; McGeoch, L.A.; Schevon, C.: Optimization by Simulated Annealing: An Experimental Evaluation. Part I, Graph Partitioning, in: Operations Research 37 (1989), S. 865-892, Part II, Graph Coloring and Number Partitioning, in: Operations Research 39 (1991), S. 378-406.

    MATH  Google Scholar 

  26. Reeves, C. (Hrsg.): Modern Heuristic Techniques for Combinatorial Problems, Oxford: Blackwell Scientific Publications 1993.

    MATH  Google Scholar 

  27. Sinclair, M.: Comparison of the Performance of Modem Heuristics for Combinatorial Optimization on Real Data, in: Computers and Operations Research 20 (1993), S. 687-695.

    Article  MATH  Google Scholar 

  28. Voigt, H.-M.; Ebeling, W.; Rechenberg, I.; Schwefel, H.-P. (Hrsg.): Parallel Pro- blem Solving from Nature - PPSN IV, LNCS 1141, Berlin: Springer 1996.

    Book  Google Scholar 

  29. Voß, S.: Intelligent Search, Berlin: Springer (im Druck).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Göttingen, Deutschland

    Volker Nissen

Authors
  1. Volker Nissen
    View author publications

    You can also search for this author in PubMed Google Scholar

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). EA nah verwandte Optimierungsmethoden. In: Einführung in Evolutionäre Algorithmen. Computational Intelligence. Vieweg+Teubner Verlag. https://doi.org/10.1007/978-3-322-93861-9_6

Download citation

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

  • 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

Search

Navigation