Talks and Poster Presentations (with Proceedings-Entry):
F. Dusberger, G. Raidl:
"Solving the 3-staged 2-dimensional cutting stock problem by dynamic programming and variable neighborhood search.";
Talk: VNS 2014 - 3rd Int. Conference on Variable Neighborhood Search,
- 2014-10-11; in: "Proceedings of the 3rd International Conference on Variable Neighborhood Search",
B. Jarboui, A. Sifaleras, A. Rebai (ed.);
Elsevier Electronic Notes in Discrete Mathematics,
We present a variable neighborhood search (VNS) for the 3-st
aged 2-dimensional cutting stock problem employing "ruin-and-recreate"-based very large neighborhood search in which parts of the incumbent solution are destroyed and rebuilt using construction heuristics and dynamic programming. Experimental results show that
for instances where the sizes of the elements are not too small compared to the sheet size the hybridization of VNS with dynamic programming significantly outperforms a VNS relying solely on construction heuristics.
cutting stock, variable neighborhood search, dynamic prog ramming
"Official" electronic version of the publication (accessed through its Digital Object Identifier - DOI)
Created from the Publication Database of the Vienna University of Technology.