Simulated annealing with thresheld convergence
Stochastic search techniques for multi-modal search spaces require the ability to balance exploration with exploitation. Exploration is required to find the best region, and exploitation is required to find the best solution (i.e. the local optimum) within this region. Compared to hill climbing which is purely exploitative, simulated annealing probabilistically allows "backward" steps which facilitate exploration. However, the balance between exploration and exploitation in simulated annealing...[Show more]
|Collections||ANU Research Publications|
|Source:||2012 IEEE Congress on Evolutionary Computation Proceedings|
|Chen_Simulated2012.pdf||189.96 kB||Adobe PDF|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.