Questions tagged [hill-climbing]
For questions related to the family of algorithms called "hill climbing" (in the context of AI).
13
questions
0
votes
1answer
63 views
How could we solve the TSP using an hill-climbing approach?
How could we solve the TSP using an hill-climbing approach?
0
votes
0answers
21 views
In which situation hill climbing searching will be more appropriate?
There are various heuristic search algorithms, like hill climbing, greedy search, A* algorithm, but when it is best preferred to use hill climbing?
3
votes
1answer
127 views
Why does hill climbing algorithm only produce a local maximum?
Apparently, the hill climbing algorithm just produces a local maximum, and not necessarily a global optimum. It's stuck on a local maximum. Why does hill climbing algorithm only produce a local ...
4
votes
1answer
89 views
What is the basic purpose of local search methods?
I read about the hill climbing algorithms, the simulating annealing algorithm, but I am confused. What is the basic purpose of local search methods?
9
votes
2answers
6k views
What are the limitations of the hill climbing algorithm and how to overcome them?
What are the limitations of the hill climbing algorithm? How can we overcome these limitations?
2
votes
1answer
1k views
How is simulated annealing better than hill climbing methods?
In hill climbing methods, at each step, the current solution is replaced with the best neighbour (that is, the neighbour with highest/smallest value). In simulated annealing, "downhills" moves are ...
4
votes
2answers
1k views
How can I formulate the map colouring problem as a hill climbing search problem?
I have a map. I need to colour it with $k$ colours, such that two adjacent regions do not share a colour.
How can I formulate the map colouring problem as a hill climbing search problem?
1
vote
1answer
54 views
Should the mutation be applied with the hill climbing algorithm?
As far as I understand, the hill climbing algorithm is a local search algorithm that selects any random solution as an initial solution to start the search. Then, should we apply an operation (i.e., ...
0
votes
1answer
542 views
What should I do when the new generated state has bigger distance to the goal than the parent state?
I have implemented the hill climbing algorithm, with side away steps, which can increase the rate of success, because, when you don't have new generated states, you can go back to previous level and ...
6
votes
2answers
559 views
Why is the larger value, as opposed to the smaller one, chosen, in the hill climbing algorithm?
In the hill climbing algorithm, the greater value, compared to the current value, is selected, but I cannot understand why it takes the larger value instead of the smaller one. Why is that?
I greatly ...
9
votes
4answers
2k views
When to choose Stochastic Hill Climbing over Steepest Hill Climbing?
Stochastic Hill Climbing generally performs worse than Steepest Hill Climbing, but what are the cases in which the former performs better?
4
votes
1answer
1k views
How do I solve the knapsack problem using the hill climbing algorithm?
I need to solve the knapsack problem using hill climbing algorithm (I need to write a program). But I'm clueless about how to do it.
My code should contain a method called ...
8
votes
2answers
106 views
Memory intensive local search methods
I have been studying local search algorithms such as greedy hill climbing, stochastic hill climbing, simulated annealing etc. I have noticed that most of these methods take up very little memory as ...
