Hill Climbing
192
浏览
0
关注

In computer science, hill climbing is a Optimization_(mathematics)|mathematical optimization technique which belongs to the family of Local search (optimization)|local search. It is an iterative algorithm that starts with an arbitrary solution to a problem, then attempts to find a better solution by incremental heuristic search|incrementally changing a single element of the solution. If the change produces a better solution, an incremental change is made to the new solution, repeating until no further improvements can be found. For example, hill climbing can be applied to the travelling salesman problem. It is easy to find an initial solution that visits all the cities but will be very poor compared to the optimal solution. The algorithm starts with such a solution and makes small improvements to it, such as switching the order in which two cities are visited. Eventually, a much shorter route is likely to be obtained. Hill climbing is good for finding a local optimum (a solution that...
[展开]
相关概念
Genetics    
Search Space    
Local Search    
主要的会议/期刊
演化趋势
Chart will load here
Hill Climbing文章数量变化趋势

Feedback
Feedback
Feedback
我想反馈:
排行榜