Show simple item record

dc.contributor.authorZhang, Defu
dc.contributor.author张德福
dc.contributor.authorPeng, Yu
dc.contributor.authorLeung, Stephen C. H.
dc.date.accessioned2013-01-16T09:05:09Z
dc.date.available2013-01-16T09:05:09Z
dc.date.issued2012-10
dc.identifier.citationCOMPUTERS & OPERATIONS RESEARCH,2012,39(10):2267-3376zh_CN
dc.identifier.issn0305-0548
dc.identifier.urihttp://dx.doi.org/10.1016/j.cor.2011.10.019
dc.identifier.uriWOS:000301313900001
dc.identifier.urihttps://dspace.xmu.edu.cn/handle/2288/14567
dc.description.abstractThis paper presents an efficient heuristic block-loading algorithm based on multi-layer search for the three-dimensional container loading problem. First, a basic heuristic block-loading algorithm is introduced. This algorithm loads one block, determined by a block selecting algorithm, in one packing phase, according to a fixed strategy, until no blocks are available. Second, the concept of composite block is introduced, the difference between traditional block and composite block being that composite block can contain multiple types of boxes in one block under some restrictions. Third, based on the depth-first search algorithm, a multi-layer search algorithm is developed for determining the selected block in each packing phase, and making this result closer to the optimal solution. Computational results on a classic data set show that the proposed algorithm outperforms the best known algorithm in almost all the test data. (C) 2011 Elsevier Ltd. All rights reserved.zh_CN
dc.description.sponsorshipNational Nature Science Foundation of China [60773126]zh_CN
dc.language.isoenzh_CN
dc.publisherPERGAMON-ELSEVIER SCIENCE LTDzh_CN
dc.subjectContainer loading problemzh_CN
dc.subjectHeuristic algorithmzh_CN
dc.subjectDepth-first searchzh_CN
dc.titleA heuristic block-loading algorithm based on multi-layer search for the container loading problemzh_CN
dc.typeArticlezh_CN


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record