Genetic-based scheduling to solve the parcel hub scheduling problem

The parcel hub scheduling problem (PHSP) is scheduling problem that is common in the parcel delivery industry. The PHSP consists of scheduling a set of inbound trailers containing a batch of heterogeneous parcels to a set of unload docks with the objective of minimizing the time span of the transfer operation. The transfer operation involves unloading the inbound trailers and sorting and loading the parcels onto outbound trailers. The unload schedule can have a significant impact on the amount of time required to complete the transfer operation. In this paper, a mathematical model is proposed to solve small-size problems and a genetic algorithm is presented to solve the large-size problems with minimum computational time compared to other competing approaches.

[1]  Louis Y. Tsui,et al.  An optimal solution to a dock door assignment problem , 1992 .

[2]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[3]  Reha Uzsoy,et al.  Decomposition Methods for Complex Factory Scheduling Problems , 1996 .

[4]  Lawrence. Davis,et al.  Handbook Of Genetic Algorithms , 1990 .

[5]  Claudio B. Cunha,et al.  A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil , 2007, Eur. J. Oper. Res..

[6]  Gunar E. Liepins,et al.  Genetic algorithms: Foundations and applications , 1990 .

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

[8]  John C. Fisk,et al.  An algorithm for 0‐1 multiple‐knapsack problems , 1978 .

[9]  John J. Grefenstette,et al.  Optimization of Control Parameters for Genetic Algorithms , 1986, IEEE Transactions on Systems, Man, and Cybernetics.

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

[11]  Nostrand Reinhold,et al.  the utility of using the genetic algorithm approach on the problem of Davis, L. (1991), Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York. , 1991 .

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

[13]  Egon Balas,et al.  The Shifting Bottleneck Procedure for Job Shop Scheduling , 1988 .

[14]  M. O'Kelly,et al.  A quadratic integer program for the location of interacting hub facilities , 1987 .

[15]  George B. Dantzig,et al.  Linear programming and extensions , 1965 .

[16]  Ken E Peck.  Operational analysis of freight terminals handling less than container load shipments , 1983 .

[17]  A. J. Goldman.  Optimal Locations for Centers in a Network , 1969 .

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

[19]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[20]  Ronald W. Wolff,et al.  Stochastic Modeling and the Theory of Queues , 1989 .

[21]  Jyh-Pang Lai,et al.  SURROGATE SEARCH: A SIMULATION OPTIMIZATION METHODOLOGY FOR LARGE-SCALE SYSTEMS , 2006 .

[22]  Carlos Cotta,et al.  A Hybrid Genetic Algorithm for the 0-1 Multiple Knapsack Problem , 1997, ICANNGA.

[23]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[24]  D. Skorin-Kapov,et al.  Tight linear programming relaxations of uncapacitated p-hub median problems , 1996 .

[25]  Carlos F. Daganzo,et al.  The Break-Bulk Role of Terminals in Many-to-Many Logistic Networks , 1987, Oper. Res..

[26]  Kenneth Alan De Jong,et al.  An analysis of the behavior of a class of genetic adaptive systems. , 1975 .

[27]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[28]  Suk Lee,et al.  A dock-door assignment problem for the Korean mail distribution center , 2006, Comput. Ind. Eng..

[29]  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..

[30]  J. F. Benders.  Partitioning procedures for solving mixed-variables programming problems , 1962 .

[31]  S. Martello,et al.  Solution of the zero-one multiple knapsack problem , 1980 .

[32]  Yong-Hyuk Kim,et al.  An evolutionary lagrangian method for the 0/1 multiple knapsack problem , 2005, GECCO '05.

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

[34]  Jakob Krarup,et al.  Reducibility of minimax to minisum 0-1 programming problems , 1981 .

[35]  John J. Bartholdi,et al.  Reducing Labor Costs in an LTL Crossdocking Terminal , 2000, Oper. Res..

[36]  Bryant A. Julstrom,et al.  The quadratic multiple knapsack problem and three heuristic approaches to it , 2006, GECCO.