Iterative improvement to solve the parcel hub scheduling problem

Authors:
Douglas L. McWilliams
Affiliations:
Mississippi State University, Division of Business, 1000 Highway 19 North, Meridian, MS 39307-5799, United States
Venue:
Computers and Industrial Engineering
Year:
2010

Citing 7
Cited 3

Using a simulation model to evaluate the configuration of a sortation facility

Proceedings of the 29th conference on Winter simulation
A simulated annealing algorithm for dynamic layout problem

Computers and Operations Research
Meta-Heuristics: Theory and Applications

Meta-Heuristics: Theory and Applications
Minimizing the completion time of the transfer operations in a central parcel consolidation terminal with unequal-batch-size inbound trailers

Computers and Industrial Engineering
Genetic-based scheduling to solve the parcel hub scheduling problem

Computers and Industrial Engineering
The parcel hub scheduling problem: A simulation-based solution approach

Computers and Industrial Engineering
Global Wiring by Simulated Annealing

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Two hybrid differential evolution algorithms for optimal inbound and outbound truck sequencing in cross docking operations

Applied Soft Computing
Robust door assignment in less-than-truckload terminals

Computers and Industrial Engineering
A tabu search approach to the truck scheduling problem with multiple docks and time windows

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents iterative improvement algorithms to solve the parcel hub scheduling problem (PHSP). The PHSP is combinatorial optimization problem that consists of scheduling a set of inbound trailers to a small number of unload docks. At the unload docks, the inbound trailers must be unloaded and the parcel sorted and loaded onto outbound trailers. Because the transfer operation is labor intensive, the transfer of parcels must be done in such a way as to minimize the timespan of the transfer operation. Local search (LS) and simulated annealing (SA) algorithms are developed and evaluated to solve the problem. The performances of the algorithms are compared to the performance of an existing genetic algorithm (GA). The computational results show that the LS and SA algorithms offer solutions that are superior to those offered by the GA.