A direct search variant of the simulated annealing algorithm for optimization involving continuous variables.
M. Montaz AliAimo A. TörnSami ViitanenPublished in: Comput. Oper. Res. (2002)
Keyphrases
- direct search
- simulated annealing algorithm
- continuous variables
- simulated annealing
- hill climbing
- genetic algorithm
- differential evolution
- premature convergence
- mutation operator
- dynamic systems
- optimization method
- search algorithm
- evolutionary algorithm
- optimization algorithm
- random variables
- stationary points
- combinatorial optimization
- structure learning
- tabu search
- bayesian networks
- global optimization
- convex hull
- optimization problems
- mathematical programming
- optimization methods
- global search
- np hard
- traveling salesman problem
- reinforcement learning
- computationally expensive
- neural network