A unified branch-price-and-cut algorithm for multicompartment pickup and delivery problems
Year of publication: |
2024
|
---|---|
Authors: | Aerts-Veenstra, Marjolein ; Cherkesly, Marilène ; Gschwind, Timo |
Published in: |
Transportation science. - Hanover, Md. : INFORMS, ISSN 1526-5447, ZDB-ID 2015901-8. - Vol. 58.2024, 5, p. 1121-1142
|
Subject: | column generation | branch-price-and-cut | flexible capacity | item incompatibility | multiple compartments | vehicle routing with pickup and delivery | Tourenplanung | Vehicle routing problem | Algorithmus | Algorithm | Heuristik | Heuristics | Theorie | Theory | Logistikunternehmen | Logistics provider |
-
A unified branch-price-and-cut algorithm for multi-compartment pickup and delivery problems
Aerts-Veenstra, Marjolein, (2023)
-
Cherkesly, Marilène, (2015)
-
A branch-and-price-and-cut algorithm for a pickup and delivery problem in retailing
Li, Chongshou, (2019)
- More ...
-
A unified branch-price-and-cut algorithm for multi-compartment pickup and delivery problems
Aerts-Veenstra, Marjolein, (2023)
-
The pickup and delivery problem with time windows, multiple stacks, and handling operations
Cherkesly, Marilène, (2022)
-
A comparison of column-generation approaches to the synchronized pickup and delivery problem
Gschwind, Timo, (2015)
- More ...