Simulated Annealing Beats Metropolis in Combinatorial Optimization
Ingo WegenerPublished in: Electron. Colloquium Comput. Complex. (2004)
Keyphrases
- simulated annealing
- combinatorial optimization
- metaheuristic
- combinatorial optimization problems
- evolutionary algorithm
- tabu search
- traveling salesman problem
- benchmark problems
- simulated annealing algorithm
- branch and bound
- branch and bound algorithm
- genetic algorithm
- combinatorial problems
- solution space
- global minimum
- hybrid algorithm
- hard combinatorial optimization problems
- genetic algorithm ga
- solution quality
- mathematical programming
- global optimum
- hill climbing
- search procedure
- optimization method
- job shop scheduling problem
- path relinking
- graph theory
- ant colony optimization
- vehicle routing problem
- memetic algorithm
- cost function
- exact algorithms
- estimation of distribution algorithms
- computer vision