A Problem-Specific Convergence Bound for Simulated Annealing-Based Local Search.
Andreas Alexander AlbrechtPublished in: ICCSA (3) (2004)
Keyphrases
- simulated annealing
- tabu search
- genetic algorithm
- global search
- simulated annealing algorithm
- upper bound
- global optimum
- hill climbing
- evolutionary algorithm
- combinatorial optimization
- metaheuristic
- stochastic search
- lower bound
- high level
- solution space
- convergence speed
- global convergence
- genetic algorithm ga
- neighborhood search
- search procedure
- continuous optimization
- error bounds
- optimization methods
- particle swarm optimization pso
- case study
- hybrid algorithm
- real time
- global minimum
- higher level
- search space
- search algorithm
- systematic search
- reversible jump mcmc