Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem.
Kengo KatayamaHiroyuki NarihisaPublished in: Eur. J. Oper. Res. (2001)
Keyphrases
- simulated annealing
- tabu search
- solution quality
- metaheuristic
- combinatorial optimization
- evolutionary algorithm
- genetic algorithm
- hill climbing
- simulated annealing algorithm
- extremal optimization
- hybrid algorithm
- job shop scheduling problem
- search procedure
- particle swarm optimization pso
- global optimum
- neighborhood search
- genetic algorithm ga
- stochastic search
- solution space
- optimal solution
- heuristic methods
- threshold accepting
- optimization method
- hybrid meta heuristic
- exhaustive search
- objective function
- greedy search
- database
- reversible jump mcmc
- non binary
- feasible solution
- computationally efficient
- real time