Iterative improvement to solve the parcel hub scheduling problem

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.

[1]  Ronald L. Graham,et al.  Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.

[2]  I H Osman,et al.  Meta-Heuristics Theory and Applications , 2011 .

[3]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[4]  Adil Baykasoglu,et al.  A simulated annealing algorithm for dynamic layout problem , 2001, Comput. Oper. Res..

[5]  L. M. Douglas,et al.  A GENETIC BASED SCHEDULING ALGORITHM FOR THE PHSP WITH UNEQUAL BATCH SIZE INBOUND TRAILERS , 2010 .

[6]  Michael W. Riley,et al.  A comparison study of customer satisfaction between the UPS and FedEx: An empirical study among university customers , 2006, Ind. Manag. Data Syst..

[7]  Douglas L. McWilliams.  Genetic-based scheduling to solve the parcel hub scheduling problem , 2009, Comput. Ind. Eng..

[8]  A. Dhingra,et al.  Single and multiobjective structural optimization in discrete‐continuous variables using simulated annealing , 1995 .

[9]  Scott Kirkpatrick,et al.  Global Wiring by Simulated Annealing , 1983, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[10]  J. K. Lenstra,et al.  Local Search in Combinatorial Optimisation. , 1997 .

[11]  David Goldsmith,et al.  Using a simulation model to evaluate the configuration of a sortation facility , 1997, WSC '97.

[12]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[13]  Konstantin Kogan,et al.  A time-decomposition method for sequence-dependent setup scheduling under pressing demand conditions , 2000, IEEE Trans. Autom. Control..

[14]  Shen Lin.  Computer solutions of the traveling salesman problem , 1965 .

[15]  Christopher D. Geiger,et al.  The parcel hub scheduling problem: A simulation-based solution approach , 2005, Comput. Ind. Eng..

[16]  Christos Koulamas,et al.  A survey of simulated annealing applications to operations research problems , 1994 .

[17]  James F. Campbell.  Freight consolidation and routing with transportation economies of scale , 1990 .

[18]  Matthew H. Bassett,et al.  Decomposition techniques for the solution of large-scale scheduling problems , 1996 .

[19]  G. Croes.  A Method for Solving Traveling-Salesman Problems , 1958 .

[20]  V. Cerný.  Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm , 1985 .

[21]  Kevin R. Gue,et al.  The Effects of Trailer Scheduling on the Layout of Freight Terminals , 1999, Transp. Sci..

[22]  Christopher D. Geiger,et al.  Minimizing the completion time of the transfer operations in a central parcel consolidation terminal with unequal-batch-size inbound trailers , 2008, Comput. Ind. Eng..

[23]  Christopher C. Skiscim,et al.  Optimization by simulated annealing: A preliminary computational study for the TSP , 1983, WSC '83.