Minimizing the completion time of the transfer operations in a central parcel consolidation terminal with unequal-batch-size inbound trailers

Minimizing the completion time of the transfer operations in a central parcel consolidation terminal with unequal-batch-size inbound trailers

0.00 Avg rating0 Votes
Article ID: iaor20091279
Country: Netherlands
Volume: 54
Issue: 4
Start Page Number: 709
End Page Number: 720
Publication Date: May 2008
Journal: Computers & Industrial Engineering
Authors: , ,
Keywords: vehicle routing & scheduling, heuristics: genetic algorithms
Abstract:

This paper addresses the scheduling of inbound trailers to unload docks at central parcel consolidation terminals in the parcel delivery industry, an industry that operates in a time-critical environment. The scheduling function can have a significant impact on the amount of time required to unload the inbound trailers and sort and load the parcels to the outbound trailers. This problem is known as the parcel hub scheduling problem (PHSP). To solve the PHSP, a simulation-based scheduling approach with an embedded genetic algorithm is proposed. The results show that the proposed scheduling approach is able to reduce the amount of time required to unload the inbound trailers by approximately 3.5 percent compared to a previously developed algorithm and about 16.1 percent compared to an approach that is representative of current industry practice.

Reviews

Required fields are marked *. Your email address will not be published.