Heuristics for the integer one-dimensional cutting stock problem: A computational study

作者: Gerhard W�scher , Thomas Gau

DOI: 10.1007/BF01539705

关键词:

摘要: In this paper the problem of generating integer solutions to standard one-dimensional cutting stock is treated. particular, we study a specific class heuristic approaches that have been proposed in literature, and some straightforward variants. These methods are compared with respect solution quality computing time. Our evaluation based on having solved 4,000 randomly generated test problems. Not only will it be shown two clearly superior others but also they solve almost any instance an optimum.

参考文章(32)
Harald Dyckhoff, Production Theoretic Foundation of Cutting and Related Processes Springer Berlin Heidelberg. pp. 151- 180 ,(1988) , 10.1007/978-3-642-73748-0_10
Dieter Bartmann, Entwicklung und Einsatz eines DV-Systems zur Auftragsverplanung bei einem Papierhersteller. Angewandte Informatik. ,vol. 28, pp. 524- 532 ,(1986)
Harald Dyckhoff, Hermann-Josef Kruse, Dieter Abel, Tomas Gal, Classification of Real World Trim Loss Problems Springer, Berlin, Heidelberg. pp. 191- 208 ,(1988) , 10.1007/978-3-642-73748-0_12
H. Dyckhoff, Ute Vieth, Ute Finke, Cutting and packing in production and distribution : a typology and bibliography Physica , Springer. ,(1992)
Harald Dyckhoff, A typology of cutting and packing problems European Journal of Operational Research. ,vol. 44, pp. 145- 159 ,(1990) , 10.1016/0377-2217(90)90350-K