Garrett, Yevette (2012) Optimization algorithms handbook. University Publications, Delhi, India. ISBN 9788132336426
Preview |
Text
Optimizationalgorithms_Yevette.pdf - Published Version Download (2MB) | Preview |
Abstract
Simulated annealing (SA) is a generic probabilistic metaheuristic for the global optimization problem of applied mathematics, namely locating a good approximation to the global optimum of a given function in a large search space. It is often used when the search space is discrete (e.g., all tours that visit a given set of cities). For certain problems, simulated annealing may be more effective than exhaustive enumeration provided that the goal is merely to find an acceptably good solution in a fixed amount of time, rather than the best possible solution. The name and inspiration come from annealing in metallurgy, a technique involving heating and controlled cooling of a material to increase the size of its crystals and reduce their defects. The heat causes the atoms to become unstuck from their initial positions (a local minimum of the internal energy) and wander randomly through states of higher energy; the slow cooling gives them more chances of finding configurations with lower internal energy than the initial one.
| Item Type: | Book |
|---|---|
| Subjects: | Q Science > QA Mathematics |
| Divisions: | Electronic Books |
| Depositing User: | Esam @ Hisham Muhammad |
| Date Deposited: | 06 Dec 2022 09:04 |
| Last Modified: | 06 Dec 2022 09:04 |
| URI: | http://odlsystem2.utm.my/id/eprint/3695 |
Actions (login required)
 |
View Item |