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. Manyheuristics, mainly based on wall-building and layer-building concepts, are presented in literature to solve thisNP-hard problem. The current research presents a two-step novel prioritization-stacking heuristic algorithm forsolving the TLP. The new algorithm primarily aims to improve the truck space utilization and reduce inventorycosts at origin and destination points. In particular, the current work considers developing countries conditionsin which demand is uncertain, cost minimization is prioritized over customer service, and routing optimization iscomplicated by a lot of traffic jams. The performance of the proposed heuristic is evaluated by applying it to areal-life case study from the Jordanian market. Additionally, the stacking part of the proposed heuristic isbenchmarked with a literature data sample. Both implementations have proved the validity of the suggestedheuristic algorithm.

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.