Table 3.
Exact methods used to solve GVRP.
| Reference | Year | Class | Method | Instances |
|---|---|---|---|---|
| [20] | 2011 | Branch-and-cut algorithm | New instances | |
| [23] | 2014 | Flexible Fleet size | Branch-and-cut algorithm | Bektaş, Erdoğan and Røpke [20] |
| [42] | 2014 | Flexible Fleet size | Column generation | Pop, Zelina, Lupşe, Sitar and Chira [46], Araque, Kudva, Morin and Pekny [47], Solomon [48], Bektaş, Erdoğan and Røpke [20], New instances |
| [40] | 2016 | stochastic | L-shaped method | Bektaş, Erdoğan and Røpke [20] |
| [29] | 2017 | time window | Branch-and-price algorithm | Reyes, Savelsbergh and Toriello [28], New instances |
| [43] | 2018 | Branch-and-price algorithm | Modified instances of Augerat, Naddef, Belenguer, Benavent, Corberan and Rinaldi [49], Modified instances of Archetti, Bianchessi and Speranza [44] |
|
| [45] | 2018 | BCP algorithm | Bektaş, Erdoğan and Røpke [20] | |
| [32] | 2019 | time window | Branch-and-price algorithm | Ozbaygin, Karasan, Savelsbergh and Yaman [29] |