Show simple item record

dc.contributor.authorWu, Yongen_US
dc.contributor.authorLi, Wenkaien_US
dc.contributor.authorGoh, Marken_US
dc.contributor.authorSouza, Roberten_US
dc.date.accessioned2017-05-03T15:54:48Z
dc.date.available2017-05-03T15:54:48Z
dc.date.issued2010en_US
dc.date.modified2011-05-11T07:21:37Z
dc.identifier.issn03772217en_US
dc.identifier.doi10.1016/j.ejor.2009.05.040en_AU
dc.identifier.urihttp://hdl.handle.net/10072/34843
dc.description.abstractThis paper studies a variant of the three-dimensional bin packing problem (3D-BPP), where the bin height can be adjusted to the cartons it packs. The bins and cartons to be packed are assumed rectangular in shape. The cartons are allowed to be rotated into any one of the six positions that keep the carton edges parallel to the bin edges. This greatly increases the difficulty of finding a good solution since the search space expands significantly comparing to the 3D-BPP where the cartons have fixed orientations. A mathematical (mixed integer programming) approach is modified based on [Chen, C. S., Lee, S. M., Shen, Q. S., 1995. An analytical model for the container loading problem. European Journal of Operational Research 80 (1), 68-76] and numerical experiments indicate that the mathematical approach is not suitable for the variable bin height 3D-BPP. A special bin packing algorithm based on packing index is designed to utilize the special problem feature and is used as a building block for a genetic algorithm designed for the 3D-BPP. The paper also investigates the situation where more than one type of bin are used and provides a heuristic for packing a batch of cartons using the genetic algorithm. Numerical experiments show that our proposed method yields quick and satisfactory results when benchmarked against the actual packing practice and the MIP model with the latest version of CPLEX.en_US
dc.description.peerreviewedYesen_US
dc.description.publicationstatusYesen_AU
dc.format.extent237284 bytes
dc.format.mimetypeapplication/pdf
dc.languageEnglishen_US
dc.language.isoen_AU
dc.publisherElsevieren_US
dc.publisher.placeNetherlandsen_US
dc.relation.ispartofstudentpublicationNen_AU
dc.relation.ispartofpagefrom347en_US
dc.relation.ispartofpageto355en_US
dc.relation.ispartofissue2en_US
dc.relation.ispartofjournalEuropean Journal of Operational Researchen_US
dc.relation.ispartofvolume202en_US
dc.rights.retentionYen_AU
dc.subject.fieldofresearchCombinatorics and Discrete Mathematics (excl. Physical Combinatorics)en_US
dc.subject.fieldofresearchOptimisationen_US
dc.subject.fieldofresearchcode010104en_US
dc.subject.fieldofresearchcode010303en_US
dc.titleThree-dimensional bin packing problem with variable bin heighten_US
dc.typeJournal articleen_US
dc.type.descriptionC1 - Peer Reviewed (HERDC)en_US
dc.type.codeC - Journal Articlesen_US
gro.rights.copyrightCopyright 2010 Elsevier. This is the author-manuscript version of this paper. Reproduced in accordance with the copyright policy of the publisher. Please refer to the journal's website for access to the definitive, published version.en_AU
gro.date.issued2010
gro.hasfulltextFull Text


Files in this item

This item appears in the following Collection(s)

  • Journal articles
    Contains articles published by Griffith authors in scholarly journals.

Show simple item record