Variable neighborhood search based algorithms for crossdock truck assignment

To operate a cross-dock successfully, an efficient assignment of trucks to docks is one of the key decisions. In this paper, we are interested in the cross-dock assignment of trucks to docks problem, where the number of trucks exceeds the number of docks. The objective is to minimize the cost of transferring goods within the cross-dock while avoiding delivery penalties. This problem being NP-hard, we use Variable Neighborhood Search metaheurisitc (VNS) to solve it approximately. More specifically, we conduct a structured empirical study to compare several VNS configurations and to find which is/are the most effective for this cross-dock problem. In this work, first we analyze the way the search strategy and the neighborhood operators can be combined in a VNS framework according to their efficiency within a local search. Then the best configurations are tested within three VNS variants, namely Basic VNS (BVNS), General VNS (GVNS) using Basic VND (B-VND) and GVNS using Union VND (U-VND) according to the number of used operators and the order of applying these operators. Finally we evaluate the influence of the stopping criterion within these variants. Some significant differences among these configurations are shown and illustrated by conducting the Friedman test.

[1]  Takashi Obata,et al.  Quadratic assignment problem: evaluation of exact and heuristic algorithms , 1979 .

[2]  Pierre Hansen,et al.  Variable neighborhood search: basics and variants , 2017, EURO J. Comput. Optim..

[3]  Mostafa Zandieh,et al.  Meta-heuristics implementation for scheduling of trucks in a cross-docking system with temporary storage , 2011, Expert Syst. Appl..

[4]  Andrew Lim,et al.  Truck dock assignment problem with operational time constraint within crossdocks , 2006, Eur. J. Oper. Res..

[5]  Yi Zhu,et al.  Airport Gate Scheduling with Time Windows , 2005, Artificial Intelligence Review.

[6]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[7]  Ali Mohtashami,et al.  Scheduling trucks in cross docking systems with temporary storage and repetitive pattern for shipping trucks , 2015, Appl. Soft Comput..

[8]  Pierre Hansen,et al.  Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem , 2015, Int. Trans. Oper. Res..

[9]  Iván A. Contreras,et al.  A mixed-integer programming formulation and Lagrangean relaxation for the cross-dock door assignment problem , 2016 .

[10]  Nils Boysen,et al.  Cross dock scheduling: Classification, literature review and research agenda , 2010 .

[11]  Brigitte Jaumard,et al.  A comparison of formulations and relaxations for cross-dock door assignment problems , 2018, Comput. Oper. Res..

[12]  Jie Zhang,et al.  A Two-Stage Genetic Algorithm for the Truck-Door Assignment Problem with Limited Capacity Vehicles and Storage Area , 2019, Journal of Systems Science and Systems Engineering.

[13]  Sumit Sandal.  Staging approaches to reduce overall cost in a crossdock environment , 2005 .

[14]  Mostafa Zandieh,et al.  Scheduling trucks in cross-docking systems: Robust meta-heuristics , 2010, Comput. Ind. Eng..

[15]  Jaime Cerdá,et al.  The heterogeneous vehicle routing and truck scheduling problem in a multi-door cross-dock system , 2015, Comput. Chem. Eng..

[16]  S. Ashcroft,et al.  The Friedman test , 2003 .

[17]  Uday M. Apte,et al.  Effective Cross Docking for Improving Distribution Efficiencies , 2000 .

[18]  Yi Zhu,et al.  New heuristics for over-constrained flight to gate assignments , 2004, J. Oper. Res. Soc..

[19]  Martín Gómez Ravetti,et al.  A hybrid Lagrangian metaheuristic for the cross-docking flow shop scheduling problem , 2019, Eur. J. Oper. Res..

[20]  Dirk Cattrysse,et al.  Cross-docking: State of the art , 2012 .

[21]  Dušan Teodorović,et al.  Aircraft Stand Assignment to Minimize Walking , 1984 .

[22]  G. Fitzgerald,et al.  'I. , 2019, Australian journal of primary health.

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

[24]  Shahin Gelareh,et al.  A branch-and-cut algorithm for the truck dock assignment problem with operational time constraints , 2016, Eur. J. Oper. Res..

[25]  Bernard Penz,et al.  A bounded dynamic programming approach to schedule operations in a cross docking platform , 2011, Comput. Ind. Eng..

[26]  Chung-Yee Lee,et al.  Minimizing the makespan in a two-machine cross-docking flow shop problem , 2009, Eur. J. Oper. Res..

[27]  Madjid Tavana,et al.  A novel multi-objective meta-heuristic model for solving cross-docking scheduling problems , 2015, Appl. Soft Comput..

[28]  Bernard Penz,et al.  Heuristic solutions for transshipment problems in a multiple door cross docking warehouse , 2011, Comput. Ind. Eng..

[29]  Gülgün Alpan,et al.  Cross-docking operations: Current research versus industry practice , 2016 .

[30]  Pius J. Egbelu,et al.  Scheduling of inbound and outbound trucks in cross docking systems with temporary storage , 2008, Eur. J. Oper. Res..

[31]  Kees Jan Roodbergen,et al.  Positioning of goods in a cross-docking environment , 2008, Comput. Ind. Eng..

[32]  Yi Zhu,et al.  The over-constrained airport gate assignment problem , 2005, Comput. Oper. Res..

[33]  Iris F. A. Vis,et al.  Synchronization in cross-docking networks: A research classification and framework , 2014, Eur. J. Oper. Res..

[34]  Yuval Cohen,et al.  Trailer to door assignment in a synchronous cross-dock operation , 2009 .

[35]  Shun Cai,et al.  Applying an adaptive tabu search algorithm to optimize truck-dock assignment in the crossdock management system , 2014, Expert Syst. Appl..

[36]  Hong Ma,et al.  Truck Dock Assignment Problem with Time Windows and Capacity Constraint in Transshipment Network Through Crossdocks , 2006, ICCSA.