Optimization: Simulated Annealing

Patrick Bangert
Additional contact information
Patrick Bangert: algorithmica technologies GmbH

Chapter Chapter 7 in Optimization for Industrial Problems, 2012, pp 165-200 from Springer

Abstract: Abstract There are many optimization approaches. Most are exact algorithms that definitely compute the true global optimum for their input. Unfortunately such methods are usually intended for a very specific problem only. There exists only one general strategy that always finds the global optimum. This method is called enumeration and consists of listing all options and choosing the best one. This method is not realistic as in most problems the number of options is so large that they cannot be practically listed.

Keywords: Markov Chain; Simulated Annealing; Solution Quality; Travel Salesman Problem; Recurrent Neural Network (search for similar items in EconPapers)
Date: 2012
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-24974-7_7

Ordering information: This item can be ordered from
http://www.springer.com/9783642249747

DOI: 10.1007/978-3-642-24974-7_7

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().