Questions tagged [local-search]

For questions related to local search algorithms used in AI (e.g. 2-opt or hill climbing).

Filter by
Sorted by
Tagged with
2
votes
2answers
60 views

Why is a mix of greedy and random usually “best” for stochastic local search?

I read that a mix of "greedy" and "random" are ideal for stochastic local search (SLS), but I'm not sure why. It mentioned that the greedy finds the local minima and the randomness avoids getting ...
3
votes
1answer
85 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?
4
votes
1answer
1k views

What is the difference between local search and global search algorithms?

What is the difference between local search and global (or complete) search algorithms?
7
votes
2answers
103 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 ...