A sweep-heuristic based formulation for the vehicle routing problem with cross-docking

Abstract Cross-docking is a warehousing strategy in logistics used by process industries making products with high proportions of distribution costs. It is described as the process of moving goods from suppliers to customers through a cross-dock terminal without a long-term storage in this facility. The vehicle routing problem with cross-docking (VRPCD) consists of fulfilling a set of transportation requests using a fleet of homogeneous vehicles to sequentially accomplish the pickup and delivery tasks. Between those operations, there is a consolidation process of incoming shipments at the cross-dock. This work introduces a monolithic formulation for the VRPCD that determines pickup/delivery routes and schedules simultaneously with the truck scheduling at the terminal. To derive a more efficient formulation, a constraint set mimicking the widely known sweep algorithm was incorporated into the rigorous model. The resulting model based on the sweep heuristic can find near-optimal solutions to large problems at very acceptable CPU times.

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

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

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

[4]  Ping Chen,et al.  Multiple crossdocks with inventory and time windows , 2006, Comput. Oper. Res..

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

[6]  Nils Boysen,et al.  Jena Research Papers in Business and Economics Scheduling Inbound and Outbound Trucks at Cross Docking Terminals , 2007 .

[7]  Jaime Cerdá,et al.  The multi-echelon vehicle routing problem with cross docking in supply chain management , 2011, Comput. Chem. Eng..

[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]  Louis Y. Tsui,et al.  An optimal solution to a dock door assignment problem , 1992 .

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

[11]  Ching-Jong Liao,et al.  Vehicle routing with cross-docking in the supply chain , 2010, Expert Syst. Appl..

[12]  Nils Boysen,et al.  Truck scheduling at zero-inventory cross docking terminals , 2010, Comput. Oper. Res..

[13]  Jaime Cerdá,et al.  Managing Distribution in Supply Chain Networks , 2009 .

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

[15]  Billy E. Gillett,et al.  A Heuristic Algorithm for the Vehicle-Dispatch Problem , 1974, Oper. Res..

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

[17]  Ke Fu,et al.  Transshipment service through crossdocks with both soft and hard time windows , 2010, Annals of Operations Research.

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

[19]  Andrew Lim,et al.  Transshipment through crossdocks with inventory and time windows , 2005, COCOON.

[20]  James H. Bookbinder,et al.  Cross-Docking and its Implications in Location-Distribution Systems , 2004 .