File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: A tree-based wall-building algorithm for solving container loading problem with multi-drop constraints

TitleA tree-based wall-building algorithm for solving container loading problem with multi-drop constraints
Authors
KeywordsCity Logistics
Container Loading
Multi-Drop Constraints
Tree-Based Heuristic Algorithm
Issue Date2009
Citation
Ieem 2009 - Ieee International Conference On Industrial Engineering And Engineering Management, 2009, p. 538-542 How to Cite?
AbstractThis paper presents a container loading algorithm for generating a container truck loading plan for a set of goods to be distributed to different retail outlets in one trip. This is a problem of container loading with multi-drop constraints. According to the destinations and travel plan of the truck, the set of goods items is divided into groups, one for each destination, and the groups are ordered according to the unloading order at the destinations. A general container loading algorithm is revised by replacing the layer loading strategy with a wall-building loading strategy in order to deal with the order of unloading destinations in the travel plan. The numerical analysis results have shown that the algorithm achieved satisfactory loading results in utilization of container space in comparison with the space utilization by human loading. ©2009 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/158871
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorPan, Len_US
dc.contributor.authorChu, SCKen_US
dc.contributor.authorHan, Gen_US
dc.contributor.authorHuang, JZen_US
dc.date.accessioned2012-08-08T09:04:01Z-
dc.date.available2012-08-08T09:04:01Z-
dc.date.issued2009en_US
dc.identifier.citationIeem 2009 - Ieee International Conference On Industrial Engineering And Engineering Management, 2009, p. 538-542en_US
dc.identifier.urihttp://hdl.handle.net/10722/158871-
dc.description.abstractThis paper presents a container loading algorithm for generating a container truck loading plan for a set of goods to be distributed to different retail outlets in one trip. This is a problem of container loading with multi-drop constraints. According to the destinations and travel plan of the truck, the set of goods items is divided into groups, one for each destination, and the groups are ordered according to the unloading order at the destinations. A general container loading algorithm is revised by replacing the layer loading strategy with a wall-building loading strategy in order to deal with the order of unloading destinations in the travel plan. The numerical analysis results have shown that the algorithm achieved satisfactory loading results in utilization of container space in comparison with the space utilization by human loading. ©2009 IEEE.en_US
dc.languageengen_US
dc.relation.ispartofIEEM 2009 - IEEE International Conference on Industrial Engineering and Engineering Managementen_US
dc.subjectCity Logisticsen_US
dc.subjectContainer Loadingen_US
dc.subjectMulti-Drop Constraintsen_US
dc.subjectTree-Based Heuristic Algorithmen_US
dc.titleA tree-based wall-building algorithm for solving container loading problem with multi-drop constraintsen_US
dc.typeConference_Paperen_US
dc.identifier.emailChu, SCK:schu@hkucc.hku.hken_US
dc.identifier.emailHan, G:ghan@hku.hken_US
dc.identifier.authorityChu, SCK=rp00685en_US
dc.identifier.authorityHan, G=rp00702en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.doi10.1109/IEEM.2009.5373282en_US
dc.identifier.scopuseid_2-s2.0-77949493307en_US
dc.identifier.hkuros170472-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-77949493307&selection=ref&src=s&origin=recordpageen_US
dc.identifier.spage538en_US
dc.identifier.epage542en_US
dc.identifier.isiWOS:000280236600109-
dc.identifier.scopusauthoridPan, L=35749044800en_US
dc.identifier.scopusauthoridChu, SCK=7403619384en_US
dc.identifier.scopusauthoridHan, G=8640067800en_US
dc.identifier.scopusauthoridHuang, JZ=36107803800en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats