A sweep-heuristic based formulation for the vehicle routing problem with cross-docking |
| |
Affiliation: | 1. Institut Charles Delaunay/LOSI – UMR CNRS 6281, Université de Technologie de Troyes, CS 42060, 12 rue Marie Curie, 10004 Troyes, France;2. LIMOS – UMR CNRS 6158, Université Blaise Pascal, Campus des Cézeaux, 63177 Aubière Cedex, France;1. School of Mechanical and Aerospace Engineering, Nanyang Technological University, 50 Nanyang Avenue, Singapore 639798, Republic of Singapore;2. Department of Industrial and Systems Engineering, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong |
| |
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. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|