Name
Title | ||
|---|---|---|
A Branch-and-Cut-and-Price algorithm for the Multi-trip Separate Pickup and Delivery Problem with Time Windows at Customers and Facilities. |
Abstract | ||
|---|---|---|
•We study a routing problem arising in city logistics.•It generalizes several variants of the Vehicle Routing Problem.•We propose an exact Branch-and-Cut-and-Price algorithm.•It features effective and problem specific dominance rules and valid inequalities.•It is tested on benchmark instances with up to 200 customers. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1016/j.ejor.2019.06.032 | European Journal of Operational Research |
Keywords | Field | DocType |
Routing,Separate Pickup and Delivery Problem,Branch-and-Cut-and-Price,Bi-directional dynamic programming | Dynamic programming,Column generation,Mathematical optimization,Exact algorithm,Branch and cut,Algorithm,City logistics,Pickup,Mathematics | Journal |
Volume | Issue | ISSN |
279 | 3 | 0377-2217 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Andrea Bettinelli | 1 | 0 | 0.34 |
| Valentina Cacchiani | 2 | 292 | 24.01 |
| Teodor Gabriel Crainic | 3 | 2329 | 137.89 |
| Daniele Vigo | 4 | 2054 | 149.20 |