Skip to main content

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
8 votes
2 answers
415 views

Are there local search algorithms that make use of memory to give better solutions?

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 ...
quantumcoder's user avatar
7 votes
1 answer
16k views

What is an objective function?

Local search algorithms are useful for solving pure optimization problems, in which the aim is to find the best state according to an objective function. My question is what is the objective function?
Abbas Ali's user avatar
  • 566