Simulated annealing is an optimization method for finding the global optimum of a function. The algorithm is similar to a hill_climbing algorithm.
Simulated annealing, just like hill climbing, has one current solution. In each iteration, that solution takes a random step and either improves, stays the same, or becomes worse.
@article{yaltirakliwikisimulatedannealing, title = "Simulated annealing", author = "Yaltirakli, Gokberk", journal = "gkbrk.com", year = "2024", url = "https://www.gkbrk.com/wiki/simulated-annealing/" }
Gokberk Yaltirakli, "Simulated annealing", November, 2024. [Online]. Available: https://www.gkbrk.com/wiki/simulated-annealing/. [Accessed Nov. 12, 2024].
Yaltirakli, G. (2024, November 12). Simulated annealing. https://www.gkbrk.com/wiki/simulated-annealing/
Gokberk Yaltirakli, Simulated annealing, GKBRK.COM (Nov. 12, 2024), https://www.gkbrk.com/wiki/simulated-annealing/
© 2024 Gokberk Yaltirakli