Solving the Two-Dimensional Bin-Packing Problem with Variable Bin Sizes by Greedy Randomized Adaptive Search Procedures and Variable Neighborhood Search.
Andreas M. ChwatalSandro PirkwieserPublished in: EUROCAST (1) (2011)
Keyphrases
- variable neighborhood search
- search procedures
- variable neighborhood descent
- variable sized
- metaheuristic
- search procedure
- search algorithm
- routing problem
- tabu search
- search space
- combinatorial optimization
- path relinking
- single machine scheduling problem
- greedy algorithm
- hill climbing
- traveling salesman problem
- hybrid method
- vehicle routing problem
- search strategies
- search methods
- scatter search
- heuristic methods
- benchmark instances
- ant colony optimization
- optimization problems
- precedence constraints
- satisfiability problem
- memetic algorithm
- constraint satisfaction problems
- lower bound
- minimum spanning tree
- simulated annealing
- scheduling problem
- special case