Scheduling of Inbound Trucks at a Cross-Docking Facility: Bi-Objective VS Bi-Level Modeling Approaches

This paper examines the problem of scheduling of inbound trucks to the inbound doors at a cross-docking facility. The authors optimize for two conflicting objectives: minimize the total service time for all the inbound trucks and minimize the delayed completion of service for a subset of the inbound trucks, which are considered as preferential customers. The problem is formulated as a bi-objective and as a bi-level mixed integer problem. Due to the nature of the former and the complexity of the latter formulation, a genetic algorithm and a k-th best based algorithm are proposed as the solution approaches. Computational examples are used to discuss the advantages and drawbacks of each formulation.

[1]  Young Hae Lee,et al.  Vehicle routing scheduling for cross-docking in the supply chain , 2006, Comput. Ind. Eng..

[2]  Sheldon H. Jacobson,et al.  A Post-Optimality Analysis Algorithm for Multi-Objective Optimization , 2004, Comput. Optim. Appl..

[3]  Peter Värbrand,et al.  A global optimization approach for the linear two-level program , 1993, J. Glob. Optim..

[4]  Christodoulos A. Floudas,et al.  Global Optimization in Design under Uncertainty: Feasibility Test and Flexibility Index Problems , 2001 .

[5]  Yavuz A. Bozer,et al.  Optimizing inbound and outbound door assignments in less-than-truckload crossdocks , 2008 .

[6]  J. Cruz,et al.  On the Stackelberg strategy in nonzero-sum games , 1973 .

[7]  Pierre Hansen,et al.  New Branch-and-Bound Rules for Linear Bilevel Programming , 1989, SIAM J. Sci. Comput..

[8]  Mihalis M. Golias,et al.  A Multi-Objective Decision and Analysis Approach for the Berth Scheduling Problem , 2010, Int. J. Inf. Technol. Proj. Manag..

[9]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[10]  Gilbert Laporte,et al.  Vehicle routing with cross-docking , 2009, J. Oper. Res. Soc..

[11]  Mihalis M. Golias,et al.  A lamda-optimal based heuristic for the berth scheduling problem , 2010 .

[12]  Mehrdad Tamiz,et al.  Multi-objective meta-heuristics: An overview of the current state-of-the-art , 2002, Eur. J. Oper. Res..

[13]  David W. Corne,et al.  Approximating the Nondominated Front Using the Pareto Archived Evolution Strategy , 2000, Evolutionary Computation.

[14]  C. S. Sung,et al.  Integrated service network design for a cross-docking supply chain network , 2003, J. Oper. Res. Soc..

[15]  Jonathan F. Bard,et al.  An Efficient Point Algorithm for a Linear Two-Stage Optimization Problem , 1983, Oper. Res..

[16]  Jie Shen,et al.  A new super-memory gradient method with curve search rule , 2005, Appl. Math. Comput..

[17]  L. N. Vicente,et al.  Discrete linear bilevel programming problem , 1996 .

[18]  Kalyanmoy Deb,et al.  Muiltiobjective Optimization Using Nondominated Sorting in Genetic Algorithms , 1994, Evolutionary Computation.

[19]  Berç Rustem,et al.  Parametric global optimisation for bilevel programming , 2007, J. Glob. Optim..

[20]  E. Galperin.  Pareto Analysis vis-à-vis Balance Space Approach in Multiobjective Global Optimization , 1997 .

[21]  Wilfred Candler,et al.  A linear two-level programming problem, , 1982, Comput. Oper. Res..

[22]  Patrice Marcotte,et al.  Exact and inexact penalty methods for the generalized bilevel programming problem , 1996, Math. Program..

[23]  Hong Zhou,et al.  An extended branch and bound algorithm for linear bilevel programming , 2006, Appl. Math. Comput..

[24]  Heidi A. Taboada,et al.  Data Clustering of Solutions for Multiple Objective System Reliability Optimization Problems , 2007 .

[25]  Y. Li,et al.  Crossdocking—JIT scheduling with time windows , 2004, J. Oper. Res. Soc..

[26]  Jonathan F. Bard,et al.  An investigation of the linear three level programming problem , 1984, IEEE Transactions on Systems, Man, and Cybernetics.

[27]  Jonathan F. Bard,et al.  A Branch and Bound Algorithm for the Bilevel Programming Problem , 1990, SIAM J. Sci. Comput..

[28]  Indraneel Das.  On characterizing the “knee” of the Pareto curve based on Normal-Boundary Intersection , 1999 .

[29]  Marco Laumanns,et al.  An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method , 2006, Eur. J. Oper. Res..

[30]  Jie Lu,et al.  An extended Kuhn-Tucker approach for linear bilevel programming , 2005, Appl. Math. Comput..

[31]  E. Galperin.  Nonscalarized multiobjective global optimization , 1992 .

[32]  Marianthi G. Ierapetritou,et al.  Resolution method for mixed integer bi-level linear problems based on decomposition technique , 2009, J. Glob. Optim..