Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and last-in-first-out loading
Year of publication: |
2015
|
---|---|
Authors: | Cherkesly, Marilène ; Desaulniers, Guy ; Laporte, Gilbert |
Published in: |
Transportation science : a journal of the Institute for Operations Research and the Management Sciences. - Catonsville, MD : Transportation Science & Logistics Society of the Institute for Operations Research and the Management Sciences, ISSN 0041-1655, ZDB-ID 160958-0. - Vol. 49.2015, 4, p. 752-766
|
Subject: | vehicle routing with pickup and delivery | last-in-first-out loading | column generation | branch-price-and-cut | valid inequalities | Tourenplanung | Vehicle routing problem | Heuristik | Heuristics | Theorie | Theory | Algorithmus | Algorithm |
-
A unified branch-price-and-cut algorithm for multi-compartment pickup and delivery problems
Aerts-Veenstra, Marjolein, (2023)
-
A unified branch-price-and-cut algorithm for multicompartment pickup and delivery problems
Aerts-Veenstra, Marjolein, (2024)
-
Cherkesly, Marilène, (2016)
- More ...
-
Cherkesly, Marilène, (2016)
-
Cherkesly, Marilène, (2015)
-
The pickup and delivery problem with time windows and handling operations
Veenstra, Marjolein, (2017)
- More ...