An effective placement method for the single container loading problem

Huang, YH; Hwang, FJ; Lu, HC

An effective placement method for the single container loading problem

Huang, YH Hwang, FJ

Lu, HC

Permalink

Publication Type:: Journal Article
Citation:: Computers and Industrial Engineering, 2016, 97 pp. 212 - 221
Issue Date:: 2016-07-01

Open Access

Copyright Clearance Process

Recently Added
In Progress
Open Access

This item is open access.

Adobe PDF

Download Accepted Manuscript VersionAdobe PDF (792.71 kB)

View on publisher's site

View statistics

Full metadata record

Field	Value	Language
dc.contributor.author	Huang, YH	en_US
dc.contributor.author	Hwang, FJ https://orcid.org/0000-0002-1741-5590	en_US
dc.contributor.author	Lu, HC	en_US
dc.date.available	2020-05-25T19:03:11Z
dc.date.issued	2016-07-01	en_US
dc.identifier.citation	Computers and Industrial Engineering, 2016, 97 pp. 212 - 221	en_US
dc.identifier.issn	0360-8352	en_US
dc.identifier.uri	http://hdl.handle.net/10453/43744
dc.description.abstract	© 2016 Elsevier Ltd. All rights reserved. This study investigates a three-dimensional single container loading problem, which aims to pack a given set of unequal-size rectangular boxes into a single container such that the length of the occupied space in the container is minimized. Motivated by the practical logistics instances in literature, the problem under study is formulated as a zero-one mixed integer linear programming model. Due to the NP-hardness of the studied problem, a simple but effective loading placement heuristic is proposed for solving large-size instances. The experimental results demonstrate that the developed heuristic is capable of solving the instances with more than two hundred boxes and more efficient than the state-of-the-art mixed integer linear program and existing heuristic methods.	en_US
dc.relation.ispartof	Computers and Industrial Engineering	en_US
dc.relation.isbasedon	10.1016/j.cie.2016.05.008	en_US
dc.subject.classification	Industrial Engineering & Automation	en_US
dc.title	An effective placement method for the single container loading problem	en_US
dc.type	Journal Article
utslib.citation.volume	97	en_US
utslib.for	010206 Operations Research	en_US
utslib.for	01 Mathematical Sciences	en_US
utslib.for	08 Information and Computing Sciences	en_US
utslib.for	09 Engineering	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Science
pubs.organisational-group	/University of Technology Sydney/Faculty of Science/School of Mathematical and Physical Sciences
utslib.copyright.status	open_access
pubs.publication-status	Published	en_US
pubs.volume	97	en_US

Abstract:

© 2016 Elsevier Ltd. All rights reserved. This study investigates a three-dimensional single container loading problem, which aims to pack a given set of unequal-size rectangular boxes into a single container such that the length of the occupied space in the container is minimized. Motivated by the practical logistics instances in literature, the problem under study is formulated as a zero-one mixed integer linear programming model. Due to the NP-hardness of the studied problem, a simple but effective loading placement heuristic is proposed for solving large-size instances. The experimental results demonstrate that the developed heuristic is capable of solving the instances with more than two hundred boxes and more efficient than the state-of-the-art mixed integer linear program and existing heuristic methods.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/43744