On the local performance of simulated annealing and the (1+1) evolutionary algorithm

Simulated annealing and the (1+1) EA, a simple evolutionary algorithm, are both general randomized search heuristics that optimize any objective function with probability

• Type: Conference
• Year: 2006
• Where: GECCO
• Authors: Thomas Jansen, Ingo Wegener
• Keywords: GECCO 2006, General Randomized Search, Optimization, Simple Evolutionary Algorithm, Simulated Annealing