Branch-and-cut-and-price for the vehicle routing problem with time windows and convex node costs
Year of publication: |
2019
|
---|---|
Authors: | He, Qie ; Irnich, Stefan ; Song, Yongjia |
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. 53.2019, 5, p. 1409-1426
|
Subject: | vehicle routing problem | branch-and-cut-and-price | labeling algorithm | convex node costs | integrated routing and scheduling | Tourenplanung | Vehicle routing problem | Theorie | Theory | Algorithmus | Algorithm |
-
A comparison of column-generation approaches to the synchronized pickup and delivery problem
Gschwind, Timo, (2015)
-
Bettinelli, Andrea, (2019)
-
A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem
Lysgaard, Jens, (2014)
- More ...
-
A joint vehicle routing and speed optimization problem
Fukasawa, Ricardo, (2018)
-
A branch-cut-and-price algorithm for the energy minimization vehicle routing problem
Fukasawa, Ricardo, (2016)
-
Sell or Hold: A simple two-stage stochastic combinatorial optimization problem
He, Qie, (2012)
- More ...