- 相關(guān)推薦
Layer-layout-based heuristics for loading homogeneous items into a single container
Abstract：The container loading problem (CLP) is a well-known NP-hard problem. Due to the computation complexity, heuristics is an often-sought approach. This article proposes two heuristics to pack homogeneous rectangular boxes into a single container. Both algorithms adopt the concept of building layers on one face of the container, but the first heuristic determines the layer face once for all, while the second treats the remaining container space as a reduced-sized container after one layer is loaded and, hence, selects the layer face dynamically. To handle the layout design problem at a layers level, a block-based 2D packing procedure is also developed. Numerical studies demonstrate the efficiency of the heuristics. 作者： Author： WANG Zhou-jing[1] LI Kevin W.[2] 作者單位： Department of Automation, Xiamen University, Xiamen 361005, ChinaOdette School of Business, University of Windsor, Windsor, Ontario N9B 3P4, Canada 期 刊： 浙江大學(xué)學(xué)報(bào)A（英文版） ISTICEISCI Journal： JOURNAL OF ZHEJIANG UNIVERSITY SCIENCE A 年，卷(期)： 2007, 8(12) 分類號(hào)： N949 O22 TP3 Keywords： Container loading problem (CLP) Heuristic Layer Packing Optimization 機(jī)標(biāo)分類號(hào)： TN9 TH1 機(jī)標(biāo)關(guān)鍵詞： computation complexity layout design 基金項(xiàng)目： Natural Sciences and Engineering Research Council of Canada (NSERC) under the Discovery Grant Program Layer-layout-based heuristics for loading homogeneous items into a single container[期刊論文] 浙江大學(xué)學(xué)報(bào)A（英文版） --2007, 8(12)The container loading problem (CLP) is a well-known NP-hard problem. Due to the computation complexity, heuristics is an often-sought approach. This article proposes two heuristics to pack homogeneous ...【Layer-layout-based heuristics for lo】相關(guān)文章：