A Heuristic Algorithm for the Inner-City Multi-Drop: Container Loading Problem

Li Pan, Sydney C. K. Chu, Guangyue Han and Joshua Zhexue Huang
Additional contact information
Li Pan: The University of Hong Kong, China
Sydney C. K. Chu: The University of Hong Kong, China
Guangyue Han: The University of Hong Kong, China
Joshua Zhexue Huang: Shenzhen Institutes of Advanced Technology, China

International Journal of Operations Research and Information Systems (IJORIS), 2011, vol. 2, issue 3, 1-19

Abstract: Economic 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.

Date: 2011
References: Add references at CitEc
Citations:

Downloads: (external link)
http://services.igi-global.com/resolvedoi/resolve. ... 018/joris.2011070101 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:igg:joris0:v:2:y:2011:i:3:p:1-19

Access Statistics for this article

International Journal of Operations Research and Information Systems (IJORIS) is currently edited by John Wang

More articles in International Journal of Operations Research and Information Systems (IJORIS) from IGI Global
Bibliographic data for series maintained by Journal Editor ().