Iterated Tabu Search and Variable Neighborhood Descent for packing unequal circles into a circular container.
Zhizhong ZengXinguo YuKun HeWenqi HuangZhanghua FuPublished in: Eur. J. Oper. Res. (2016)
Keyphrases
- tabu search
- variable neighborhood descent
- packing problem
- iterated local search
- path relinking
- multi start
- metaheuristic
- simulated annealing
- variable neighborhood search
- feasible solution
- scatter search
- scheduling problem
- memetic algorithm
- vehicle routing problem
- search procedure
- job shop scheduling problem
- genetic algorithm
- hybrid algorithm
- heuristic methods
- search algorithm
- integer programming
- benchmark instances
- flowshop
- optimization problems
- vehicle routing problem with time windows
- test problems
- search heuristics
- max sat
- combinatorial optimization
- max min
- combinatorial problems
- combinatorial optimization problems
- search space
- computational complexity
- objective function