File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: A heuristic algorithm for the inner-city multi-drop container loading problem

TitleA heuristic algorithm for the inner-city multi-drop container loading problem
Authors
KeywordsCity Logistics
Container Carriers
Multi-Drop Constraints
Space Amalgamation
Tree-Based Heuristic Algorithm
Issue Date2011
PublisherIGI Global. The Journal's web site is located at http://www.igi-global.com/journals/details.asp?id=33359
Citation
International Journal of Operations Research and Information Systems, 2011, v. 2 n. 3, p. 1-19 How to Cite?
AbstractEconomic globalization, increasing fuel cost, and environmental problems provide a strong stimulation for inner-city container carriers to utilize container space more efficiently in transporting goods for multiple clients during a single round trip. A wall-building heuristic algorithm based on the binary tree data structure is proposed to solve the container loading problem with multi-drop constraints. A dynamic space decomposition approach, together with a repacking and space amalgamation strategy, permits an efficient and effective loading plan to pack containers, illustrated by numerical experiments.
Persistent Identifierhttp://hdl.handle.net/10722/135157
ISSN

 

DC FieldValueLanguage
dc.contributor.authorPan, Len_US
dc.contributor.authorChu, SCKen_US
dc.contributor.authorHan, Gen_US
dc.contributor.authorHuang, JZen_US
dc.date.accessioned2011-07-27T01:29:09Z-
dc.date.available2011-07-27T01:29:09Z-
dc.date.issued2011en_US
dc.identifier.citationInternational Journal of Operations Research and Information Systems, 2011, v. 2 n. 3, p. 1-19en_US
dc.identifier.issn1947-9328-
dc.identifier.urihttp://hdl.handle.net/10722/135157-
dc.description.abstractEconomic globalization, increasing fuel cost, and environmental problems provide a strong stimulation for inner-city container carriers to utilize container space more efficiently in transporting goods for multiple clients during a single round trip. A wall-building heuristic algorithm based on the binary tree data structure is proposed to solve the container loading problem with multi-drop constraints. A dynamic space decomposition approach, together with a repacking and space amalgamation strategy, permits an efficient and effective loading plan to pack containers, illustrated by numerical experiments.-
dc.languageengen_US
dc.publisherIGI Global. The Journal's web site is located at http://www.igi-global.com/journals/details.asp?id=33359-
dc.relation.ispartofInternational Journal of Operations Research and Information Systemsen_US
dc.subjectCity Logistics-
dc.subjectContainer Carriers-
dc.subjectMulti-Drop Constraints-
dc.subjectSpace Amalgamation-
dc.subjectTree-Based Heuristic Algorithm-
dc.titleA heuristic algorithm for the inner-city multi-drop container loading problemen_US
dc.typeArticleen_US
dc.identifier.emailChu, SCK: schu@hku.hken_US
dc.identifier.emailHan, G: ghan@hku.hken_US
dc.identifier.emailHuang, JZ: jhuang@eti.hku.hken_US
dc.identifier.authorityChu, SCK=rp00685en_US
dc.identifier.authorityHan, G=rp00702en_US
dc.identifier.doi10.4018/joris.2011070101-
dc.identifier.hkuros187723en_US
dc.identifier.volume2en_US
dc.identifier.issue3-
dc.identifier.spage1en_US
dc.identifier.epage19en_US
dc.identifier.eissn1947-9336-
dc.publisher.placeUnited States-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats