Multiple cross-docks scheduling using two meta-heuristic algorithms

This paper considers a truck scheduling problem in a multiple cross docks while there is temporary storage in front of the shipping docks. Receiving and shipping trucks can intermittently move in and out of the docks during the time intervals between their task execution, in which trucks can enter to any of the cross docks. Thus, a mixed-integer programming (MIP) model for multiple cross docks scheduling is developed inspired by models in the body of the respective literature. Its objective is to minimize the total operation time or maximize the throughput of the cross-docking system. Moreover, additional concepts considered in the new method is multiple cross docks with a limited capacity. In this study, there are two types of delay times. The first type occurs when there is a shipping truck change and the second one occurs when the current shipping truck does not load any product from a certain receiving truck or temporary storage and waits until its needed products arrive at the shipping docks. To solve the developed model, two meta-heuristics, namely simulated annealing (SA) and firefly algorithms (FA), are proposed. In addition, a procedure for trucks scheduling in a state of a constant discrete firefly algorithm for the discrete adaptation has been proposed. The experimental design is carried out to tune the parameters of algorithms. Finally, the solutions obtained by the proposed SA and FA are compared.

[1]  Seyed Jafar Sadjadi,et al.  Scheduling Trucks In Cross-Docking Systems: A Robust Meta-Heuristics Approach , 2010 .

[2]  Reza Tavakkoli-Moghaddam,et al.  A possibilistic programming approach for the location problem of multiple cross-docks and vehicle routing scheduling under uncertainty , 2013 .

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

[4]  Douglas L. McWilliams.  A dynamic load-balancing scheme for the parcel hub-scheduling problem , 2009, Comput. Ind. Eng..

[5]  Matthew W. Rohrer.  Simulation and cross docking , 1995, WSC '95.

[6]  James Aaron Cooke.  DO YOU HAVE WHAT IT TAKES TO CROSS DOCK , 1996 .

[7]  Mostafa Zandieh,et al.  Scheduling the truck holdover recurrent dock cross-dock problem using robust meta-heuristics , 2010 .

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

[9]  Reza Tavakkoli-Moghaddam,et al.  Solving a multi-product distribution planning problem in cross docking networks: An imperialist competitive algorithm , 2014 .

[10]  Mihalis M. Golias,et al.  Analysis of different approaches to cross-dock truck scheduling with truck arrival time uncertainty , 2013, Comput. Ind. Eng..

[11]  John J. Bartholdi,et al.  The Best Shape for a Crossdock , 2004, Transp. Sci..

[12]  Vaidyanathan Jayaraman,et al.  An evaluation of new heuristics for the location of cross-docks distribution centers in supply chain network design , 2008, Comput. Ind. Eng..

[13]  Douglas L. McWilliams.  Iterative improvement to solve the parcel hub scheduling problem , 2010, Comput. Ind. Eng..

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

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

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

[17]  Gur Mosheiov,et al.  Vehicle routing with pick-up and delivery: tour-partitioning heuristics , 1998 .

[18]  James Aaron Cooke.  CROSS-DOCKING SOFTWARE: READY OR NOT? , 1997 .

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

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

[21]  Hoong Chuin Lau,et al.  Vehicle routing problem with time windows and a limited number of vehicles , 2003, Eur. J. Oper. Res..

[22]  E. Kinnear.  Is there any magic in cross‐docking? , 1997 .

[23]  Reza Tavakkoli-Moghaddam,et al.  A hybrid simulated annealing algorithm for location and routing scheduling problems with cross-docking in the supply chain , 2013 .

[24]  Wooyeon Yu,et al.  Operational strategies for cross docking systems , 2002 .

[25]  Reza Tavakkoli-Moghaddam,et al.  Location of cross-docking centers and vehicle routing scheduling under uncertainty: A fuzzy possibilistic–stochastic programming model , 2014 .

[26]  Genichi Taguchi,et al.  Introduction to quality engineering.... , 2014 .

[27]  Dirk Cattrysse,et al.  A tabu search approach to the truck scheduling problem with multiple docks and time windows , 2013, Comput. Ind. Eng..

[28]  Kees Jan Roodbergen,et al.  Layout and control policies for cross docking operations , 2011, Comput. Ind. Eng..

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

[30]  Vaidyanathan Jayaraman,et al.  Production , Manufacturing and Logistics A simulated annealing methodology to distribution network design and management , 2002 .

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

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

[33]  Xin-She Yang,et al.  Nature-Inspired Metaheuristic Algorithms , 2008 .

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

[35]  Reza Tavakkoli-Moghaddam,et al.  Scheduling trucks in cross docking systems with temporary storage and dock repeat truck holding pattern using GRASP method , 2012 .