A simulated annealing driven multi-start algorithm for bound constrained global optimization.
M. Montaz AliM. N. GaberePublished in: J. Comput. Appl. Math. (2010)
Keyphrases
- simulated annealing
- constrained global optimization
- multi start
- worst case
- dynamic programming
- genetic algorithm
- cost function
- learning algorithm
- stochastic approximation
- optimal solution
- computational complexity
- np hard
- particle swarm optimization
- optimization algorithm
- tabu search
- lower bound
- convex hull
- benchmark problems
- search procedure
- global optimization
- objective function
- global search
- hill climbing
- exhaustive search
- knapsack problem
- pso algorithm
- metaheuristic
- genetic programming
- evolutionary algorithm
- upper bound