A Variable Neighborhood Search Using Very Large Neighborhood Structures for the 3-Staged 2-Dimensional Cutting Stock Problem.
Frederico DusbergerGünther R. RaidlPublished in: Hybrid Metaheuristics (2014)
Keyphrases
- variable neighborhood search
- metaheuristic
- tabu search
- traveling salesman problem
- heuristic methods
- routing problem
- single machine scheduling problem
- hybrid method
- minimum spanning tree
- vehicle routing problem
- integer programming
- column generation
- path relinking
- benchmark instances
- ant colony optimization
- simulated annealing
- integer program
- single machine
- optimal solution
- search procedure
- optimization problems
- scheduling problem
- search space
- scatter search
- special case
- support vector machine
- hybrid algorithm
- linear programming