Simulated Annealing

Rex K. Kincaid () and Anh Ninh ()
Additional contact information
Rex K. Kincaid: William & Mary
Anh Ninh: William & Mary

Chapter Chapter 10 in Discrete Diversity and Dispersion Maximization, 2023, pp 221-249 from Springer

Abstract: Abstract Simulated annealing (SA) is a well-known local search metaheuristic for finding high-quality solutions to both discrete and continuous optimization problems. The algorithm was first proposed and used in statistical mechanics by Metropolis et al. (J Chem Phys 21:1087-1092, 1953). Yet, not until Kirkpatrick et al. (Science 220:671-680, 1983) and Cerny (J Optim Theory Appl 45:41–52, 1985) was SA implemented as a heuristic for a notoriously hard combinatorial optimization problem – the traveling salesman problem. Since then, SA has been successfully applied across a broad range of application areas such as finance, machine learning, operations research, etc., where the associated optimization problems can be computationally intractable for large problem instances. In these situations, SA is a serious contender as a convenient, yet effective, optimization tool as it requires no knowledge of the problem structure. Indeed, the key advantage of SA is in its simplicity, which facilitates quick implementation for solving many real-life applications.

Date: 2023
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:spochp:978-3-031-38310-6_10

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

DOI: 10.1007/978-3-031-38310-6_10

Access Statistics for this chapter

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