This paper studies the integration of the vehicle routing problem with cross-docking, namely VRPCD. The aim is to find a set of routes to deliver single products from a set of suppliers to a set of customers through a cross-dock facility, such that the operational and transportation costs are minimized, without violating the vehicle capacity and time horizon constraints. A two-phase matheuristic approach that uses the routes of the local optima of an adaptive large neighborhood search (ALNS) as columns in a set-partitioning formulation of the VRPCD is designed. This matheuristic outperforms the state-of-the-art algorithms in solving a subset of benchmark instances.
CITATION STYLE
Gunawan, A., Widjaja, A. T., Vansteenwegen, P., & Yu, V. F. (2020). A matheuristic algorithm for solving the vehicle routing problem with cross-docking. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12096 LNCS, pp. 9–15). Springer. https://doi.org/10.1007/978-3-030-53552-0_2
Mendeley helps you to discover research relevant for your work.