A multi-commodity two-Echelon capacitated vehicle routing problem with time windows: Model formulations and solution approach

•The MC-2E-VRPTW model formulations involve a combined arc-path based model.•We obtain better lower bound estimates and new capacity constraints in the 2-path formulation.•The numerical evaluation demonstrates the power of the developed models and solution methods. This paper studies the multi-commo...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Computers & operations research Ročník 127; s. 105154
Hlavní autoři: Dellaert, Nico, Van Woensel, Tom, Crainic, Teodor Gabriel, Dashty Saridarq, Fardin
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Elsevier Ltd 01.03.2021
Pergamon Press Inc
Témata:
Capacitated vehicle routing problem
Commodities
Decomposition
Distribution
Exact solution algorithm
Exact solutions
Model formulations
Multi-commodity
Operations research
Route planning
Synchronism
Two-echelon
Vehicle routing
Windows (intervals)
Two-echelon
Capacitated vehicle routing problem
Model formulations
Multi-commodity
Exact solution algorithm
Distribution
ISSN:0305-0548, 1873-765X, 0305-0548
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:•The MC-2E-VRPTW model formulations involve a combined arc-path based model.•We obtain better lower bound estimates and new capacity constraints in the 2-path formulation.•The numerical evaluation demonstrates the power of the developed models and solution methods. 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.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0305-0548
1873-765X
0305-0548
DOI:10.1016/j.cor.2020.105154