A Matheuristic Algorithm for Solving the Vehicle Routing Problem with Cross-Docking.

This paper studies the integration of the vehicle routingproblem with cross-docking, namely VRPCD. The aim is to nd a setof routes to deliver single products from a set of suppliers to a set ofcustomers through a cross-dock facility, such that the operational andtransportation costs are minimized, without violating the vehicle capac-ity and time horizon constraints. A two-phase matheuristic approachthat uses the routes of the local optima of an adaptive large neighbor-hood search (ALNS) as columns in a set-partitioning formulation of theVRPCD is designed. This matheuristic outperforms the state-of-the-artalgorithms in solving a subset of benchmark instances.

ISBN:978-3-030-53551-3

Publication year:2020

Accessibility:Closed