Questions tagged [simulated-annealing]

For questions related to the simulated annealing algorithm (SA), which is a probabilistic algorithm that attempts to find the global optimum of a function. SA can e.g. be used to solve the travelling salesman problem (TSP).

Filter by
Sorted by
Tagged with
8 votes
2 answers
257 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 ...
user avatar