The heterogeneous vehicle routing and truck scheduling problem in a multi-door cross-dock system. (8th May 2015)

• Record Type: Journal Article
• Authors: Dondo, Rodolfo; Cerdá, Jaime
• Is Part Of: Computers & chemical engineering. Volume 76(2015)
• Page Start: 42
• Page End: 62
• Publication Date: 2015-05-08
• Subjects: Vehicle routing -- Cross-docking -- Truck scheduling -- Logistics; Chemical engineering -- Data processing -- Periodicals; 660.0285
• DOI: 10.1016/j.compchemeng.2015.02.003
• Languages: English
• ISSNs: 0098-1354

Abstract

Highlights: A rigorous model for the vehicle routing problem with cross-docking is presented. It selects the vehicle routing dock assignment and truck scheduling all at once. It handles fleet of vehicles with different capacities and costs. To improve the computational efficiency, sweep-heuristic based-models are developed. A large number of heterogeneous VRPCD examples are successfully solved. Abstract: Cross-docking is a logistics technique applied by many industrial firms to get substantial savings in two warehousing costly functions like storage and order picking. Incoming shipments are unloaded from inbound trucks on a cross-dock terminal with minimal storage space and directly transferred to outbound vehicles that carry them to their destinations. The major decisions at the operational level are the vehicle routing and scheduling, the dock door assignment and the truck scheduling at the cross-dock. Because such decisions are interdependent, all of them are simultaneously considered in the so-called vehicle routing problem with cross-docking (VRPCD). Previous contributions on VRPCD assume that pickup and delivery tasks are accomplished by a homogeneous vehicle fleet, and they mostly ignore the internal transportation of goods through the cross-dock. This work introduces a new rigorous mixed-integer linear programming (MILP) formulation for the VRPCD problem to determine the routing and scheduling of a mixed vehicle fleet, the dock door assignment, the truck docking sequence and the travel time required to move the goods to the assigned stack door all at once. To improve the computational efficiency of the branch-and-cut search, an approximate sweep-based model is developed by also considering a set of constraints mimicking the sweep algorithm for allocating nodes to vehicles. Numerous heterogeneous VRPCD examples involving up to 50 transportation requests and a heterogeneous fleet of 10 vehicles with three different capacities were successfully solved using the proposed approaches in acceptable CPU times.