OPTIMAL DESIGN OF THE CROSS-DOCKING IN DISTRIBUTION NETWORKS: HEURISTIC SOLUTION APPROACH

Cross-docking plays an importation role in distribution networks. In the recent years, a cross-docking design network problem is addressed as a new research area in logistics management. This paper presents a new mathematical model for the location of cross-docking facilities and vehicle routing scheduling problems in the distribution networks. For this purpose, a two-phase mixed-integer programming (MIP) is formulated. Then, a new heuristic-based simulated annealing (SA) is developed for solving the proposed MIP model. Finally, the presented heuristic algorithm is subsequently tested on a number of small and large-scale instances. The computational results for different-sized instances illustrate that the proposed algorithm performs effectively in a reasonable time.

[1]  Reza Tavakkoli-Moghaddam,et al.  A Hybrid Simulated Annealing Algorithm for Location of Cross-Docking Centers in a Supply Chain , 2013, Hybrid Metaheuristics.

[2]  G. Clarke,et al.  Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .

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

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

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

[6]  Bruce Hajek,et al.  A tutorial survey of theory and applications of simulated annealing , 1985, 1985 24th IEEE Conference on Decision and Control.

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

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

[9]  Hosang Jung,et al.  Ant colony optimization algorithm to solve for the transportation problem of cross-docking network , 2010, Comput. Ind. Eng..

[10]  Zhi-Hua Hu,et al.  Vehicle Routing Problem for Fashion Supply Chains with Cross-Docking , 2013 .

[11]  G. Reinelt.  The traveling salesman: computational solutions for TSP applications , 1994 .

[12]  Ali Yalcin,et al.  Robust door assignment in less-than-truckload terminals , 2012, Comput. Ind. Eng..

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

[14]  Pei-Chann Chang,et al.  Simultaneous dock assignment and sequencing of inbound trucks under a fixed outbound truck schedule in multi-door cross docking operations , 2013 .

[15]  Dincer Konur,et al.  Cost-stable truck scheduling at a cross-dock facility with unknown truck arrivals: A meta-heuristic approach , 2013 .

[16]  Stephen John Turner,et al.  A robust two-phase heuristic algorithm for the truck scheduling problem in a resource-constrained crossdock , 2012, Comput. Oper. Res..

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