Journal
COMPUTERS & OPERATIONS RESEARCH
Volume 127, Issue -, Pages -Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2020.105154
Keywords
Distribution; Multi-commodity; Two-echelon; Capacitated vehicle routing problem; Model formulations; Exact solution algorithm
Categories
Funding
- Dutch Institute for Advanced Logistics (DINALOG)
- Natural Sciences and Engineering Council of Canada (NSERC)
- Fonds de recherche du Quebec
Ask authors/readers for more resources
This paper studies the multi-commodity two-echelon capacitated vehicle routing problem with time windows and proposes a decomposition scheme to solve the problem effectively. By decoupling and re-coupling the first and second echelon routing problems, the study shows effectiveness in terms of computational effort and solution quality.
This paper studies the multi-commodity two-echelon capacitated vehicle routing problem with time windows. Specifically, we take customer-specific origin to destination, non-substitutable demands into account. The main components are: (i) first echelon tours, (ii) second echelon tours and (iii) movement of commodities from first echelon to second echelon, considering route connection and synchronization. Exploiting the structure of the problem, we propose a decomposition scheme which decouples the first and second echelon routing problems, by deleting the third component, and re-couples them by using constraints ensuring movement of commodities between the two echelons. Based on this decomposition, we present (i) a number of model formulations for the MC-2E-VRPTW, and (ii) develop an exact solution approach for this real-life problem. A computational study on a comprehensive set of instances shows the effectiveness in terms of computational effort and solution quality. (C) 2020 The Author(s). Published by Elsevier Ltd.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available