Variable neighbourhood search for the variable sized bin packing problem.
Vera C. HemmelmayrVerena SchmidChristian BlumPublished in: Comput. Oper. Res. (2012)
Keyphrases
- variable sized
- variable neighbourhood search
- tabu search
- mathematical programming
- metaheuristic
- combinatorial optimization
- hybrid metaheuristic
- heuristic methods
- feasible solution
- solution quality
- constraint propagation
- simulated annealing
- vehicle routing problem
- candidate list
- scatter search
- search methods
- linear programming
- scheduling problem
- search strategies
- path relinking
- variable neighborhood search
- benchmark instances
- optimization problems
- multi objective
- constructive heuristic
- search space
- search procedure
- combinatorial optimization problems
- memetic algorithm
- job shop scheduling problem
- branch and bound algorithm
- hybrid algorithm
- genetic algorithm
- traveling salesman problem
- search algorithm
- computational efficiency
- ant colony optimization
- mip solver
- special case
- computational complexity
- branch and bound