![]() ![]() ![]() It is easy to find an initial solution that visits all the cities but will likely be very poor compared to the optimal solution. If the change produces a better solution, another incremental change is made to the new solution, and so on until no further improvements can be found.įor example, hill climbing can be applied to the travelling salesman problem. It is an iterative algorithm that starts with an arbitrary solution to a problem, then attempts to find a better solution by making an incremental change to the solution. In numerical analysis, hill climbing is a mathematical optimization technique which belongs to the family of local search. Hill-climbing techniques are well-suited for optimizing over such surfaces, and will converge to the global maximum. JSTOR ( April 2017) ( Learn how and when to remove this template message)Ī surface with only one maximum.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. |
Details
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |