Title :
A Cooperative Algorithm for Constrained Two-staged 2D Cutting Problems
Author :
Hifi, Mhand ; Saadi, Toufik
Author_Institution :
Univ. of Picardie Jules Verne, Amiens
Abstract :
In this paper, we propose a cooperative solution procedure for the two-staged two-dimensional cutting stock problem (2TDC). We solve 2TDC by considering two key features: a search strategy and a fast filling procedure. The search strategy uses a beam-search method and the second strategy uses a local filling procedure for improving the quality of the obtained solutions
Keywords :
bin packing; cutting; dynamic programming; search problems; beam-search method; cooperative algorithm; dynamic programming; local filling procedure; search strategy; two-staged 2D stock cutting problem; Algorithm design and analysis; Dynamic programming; Filling; Integer linear programming; Strips; Upper bound; Combinatorial optimization; cutting problem; dynamic programming; knapsack;
Conference_Titel :
Service Systems and Service Management, 2006 International Conference on
Conference_Location :
Troyes
Print_ISBN :
1-4244-0450-9
Electronic_ISBN :
1-4244-0451-7
DOI :
10.1109/ICSSSM.2006.320756
