A New Prioritizing-Stacking Heuristic Algorithm for the Inner-City Truck Loading Problem

Safwan Altarazi

Abstract


Efficiently solving the truck loading problem (TLP) is crucial for achieving urban logistics objectives. Many
heuristics, mainly based on wall-building and layer-building concepts, are presented in literature to solve this
NP-hard problem. The current research presents a two-step novel prioritization-stacking heuristic algorithm for
solving the TLP. The new algorithm primarily aims to improve the truck space utilization and reduce inventory
costs at origin and destination points. In particular, the current work considers developing countries conditions
in which demand is uncertain, cost minimization is prioritized over customer service, and routing optimization is
complicated by a lot of traffic jams. The performance of the proposed heuristic is evaluated by applying it to a
real-life case study from the Jordanian market. Additionally, the stacking part of the proposed heuristic is
benchmarked with a literature data sample. Both implementations have proved the validity of the suggested
heuristic algorithm.


Full Text: PDF DOI: 10.5539/ijbm.v8n13p137

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.

International Journal of Business and Management   ISSN 1833-3850 (Print)   ISSN 1833-8119 (Online)

Copyright © Canadian Center of Science and Education

To make sure that you can receive messages from us, please add the 'ccsenet.org' domain to your e-mail 'safe list'. If you do not receive e-mail in your 'inbox', check your 'bulk mail' or 'junk mail' folders.