A Branch-and-Cut-and-Price algorithm for the Multi-trip Separate Pickup and Delivery Problem with Time Windows at Customers and Facilities
Year of publication: |
2019
|
---|---|
Authors: | Bettinelli, Andrea ; Cacchiani, Valentina ; Crainic, Teodor Gabriel ; Vigo, Daniele |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 279.2019, 3 (16.12.), p. 824-839
|
Subject: | Routing | Separate Pickup and Delivery Problem | Branch-and-Cut-and-Price | Bi-directional dynamic programming | Tourenplanung | Vehicle routing problem | Dynamische Optimierung | Dynamic programming | Heuristik | Heuristics | Theorie | Theory | Algorithmus | Algorithm | Logistikunternehmen | Logistics provider |
-
A competitive heuristic algorithm for vehicle routing problems with drones
Ren, Xuan, (2024)
-
Ranjbaran, Farivar, (2020)
-
A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem
Lysgaard, Jens, (2014)
- More ...
-
A branch-and-bound algorithm for the knapsack problem with conflict graph
Bettinelli, Andrea, (2017)
-
An overview of curriculum-based course timetabling
Bettinelli, Andrea, (2015)
-
Comments on: an overview of curriculum-based course timetabling
Asín, Roberto, (2015)
- More ...