Solving the 3-Staged 2-Dimensional Cutting Stock Problem by Dynamic Programming and Variable Neighborhood Search.
Frederico DusbergerGünther R. RaidlPublished in: Electron. Notes Discret. Math. (2015)
Keyphrases
- variable neighborhood search
- dynamic programming
- metaheuristic
- tabu search
- traveling salesman problem
- minimum spanning tree
- combinatorial optimization
- integer program
- routing problem
- hybrid method
- path relinking
- benchmark instances
- vehicle routing problem
- heuristic methods
- shortest path
- column generation
- linear programming
- constraint propagation
- linear program
- genetic algorithm