![]() 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. For certain problems, simulated annealing may be more efficient 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. It is often used when the search space is discrete (e.g., all tours that visit a given set of cities). Simulated annealing (SA) is a generic probabilistic metaheuristic for the global optimization problem of locating a good approximation to the global optimum of a given function in a large search space. Unsourced material may be challenged and removed. Please help improve this article by adding citations to reliable sources. ![]() ![]() This article needs additional citations for verification. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |