Skip to main content
SpringerLink
Log in

Error-Analysis of Heuristic Algorithms by Simulation

  • Conference paper
First European Simulation Congress ESC 83

Part of the book series: Informatik-Fachberichte ((INFORMATIK,volume 71))

  • 102 Accesses

Summary

Approximation-algorithms (heuristics) are important in time-critical ap- plications. The selection of a suitable heuristic depends on the expected error. Theoretical results for approximation-algorithms mainly deal with worst-case-estimations of the error. By simulation of the application-environment information about the error-behaviour of the application data can be obtained. The influence of parameters on the error-behaviour of different heuristics for the Travel ling-Salesman-problem have been analysed by this method.

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. Garey, M.R.; Johnson, D.S.: Computers and Intractability - A Guide to the Theory of NP-Complete- ness. W.H. Freeman and Co., San Francisco (1979).

    Google Scholar 

  2. Grötschel, M.: Approaches to hard combinatorial optimization problems. Modern Applied Mathematics - Optimization and OR (1982)

    Google Scholar 

  3. Hässig, K.: Graphentheoretische Methoden des Operations Research. Teubner Studienbucher Mathematik (1979).

    Google Scholar 

  4. Schnitzler, R.: Greedyalgorithmen als approximierende und exakte Algorithmen. Entwurf einer Diplomarbeit, RWTH Aachen (1983).

    Google Scholar 

  5. Touring-Atlas 1978/79 Mairs Geographischer Verlag, Stuttgart (1978)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Aachen, Technical University, Germany

    R. Schnitzler, R. Gebhardt, W. Ameling & W. Oberschelp

Authors
  1. R. Schnitzler
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. R. Gebhardt
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. W. Ameling
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. W. Oberschelp
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Lehrstuhl für Allgemeine Elektrotechnik und Datenverarbeitungssysteme, Rogowksi Institut für Elektrotechnik, RWTH Aachen, Schinkelstraße 2, D-5100, Aachen, Federal Republic of Germany

    Walter Ameling

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schnitzler, R., Gebhardt, R., Ameling, W., Oberschelp, W. (1983). Error-Analysis of Heuristic Algorithms by Simulation. In: Ameling, W. (eds) First European Simulation Congress ESC 83. Informatik-Fachberichte, vol 71. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-69295-6_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-69295-6_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-12723-9

  • Online ISBN: 978-3-642-69295-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation