A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem.
Stephen C. H. LeungDefu ZhangChangle ZhouTao WuPublished in: Comput. Oper. Res. (2012)
Keyphrases
- packing problem
- simulated annealing
- metaheuristic
- optimal solution
- combinatorial optimization
- tabu search
- simulated annealing algorithm
- ant colony optimization
- dynamic programming
- benchmark problems
- genetic algorithm
- search space
- arbitrary shaped
- combinatorial optimization problems
- harmony search
- cost function
- integer programming
- threshold accepting
- hybrid algorithm
- scatter search
- solution quality
- greedy randomized adaptive search procedure
- optimization algorithm
- upper bound
- computational complexity
- optimization method
- search procedure
- linear programming
- solution space
- feasible solution
- job shop scheduling problem
- particle swarm optimization
- path relinking
- multi objective
- continuous optimization
- iterated local search
- decision trees
- neural network