A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen
Year of publication: |
October 2018
|
---|---|
Authors: | Munari, Pedro ; Morabito, Reinaldo |
Published in: |
Top : transactions in operations research. - [Berlin] : Springer, ISSN 1134-5764, ZDB-ID 1205918-3. - Vol. 26.2018, 3, p. 437-464
|
Subject: | vehicle routing | Multiple deliverymen | Time windows | Branch-price-and-cut | Interior point | Tourenplanung | Vehicle routing problem | Theorie | Theory | Algorithmus | Algorithm | Terminplanung | Time scheduling |
-
New enhancements for the exact solution of the vehicle routing problem with time windows
Pecin, Diego, (2017)
-
An exact method for a first-mile ridesharing problem
Wang, Sihan, (2023)
-
Wang, Dujuan, (2019)
- More ...
-
Iterated local search and simulated annealing algorithms for the inventory routing problem
Alvarez, Aldair, (2018)
-
Martin, Mateus, (2019)
-
An exact method for a last-mile delivery routing problem with multiple deliverymen
Senna, Fernando, (2023)
- More ...