## 4 Column Generation for \(Mtvp\)-\(Vw\)-\(Tw\)
### Solving the Pricing Subproblems
* [PERSON] et al. (2002) [PERSON]; [PERSON] [PERSON]; [PERSON] [PERSON] Cooperation entre generation de colonnes avec tournees sans cycle et recherche locale appliquee au routage de vehicules. In Proceedings of the Journees Nationales sur la Resolution Pratique de Problemes NP-Complets, Nice, France, 27-29 May 2002; pp. 83-97. * [PERSON] et al. (2004) [PERSON]; [PERSON]; [PERSON] [PERSON]; [PERSON] An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems. _Netw. Int. J._**2004**, _44_, 216-229. [CrossRef]
* [PERSON] et al. (2004) [PERSON]; [PERSON]; [PERSON] [PERSON]; [PERSON] Solving VRPTWs with constraint programming based column generation. _Ann. Oper. Res._**2004**, _130_, 199-216. [CrossRef]
* [PERSON] (2006) [PERSON] Vehicle routing problem with elementary shortest path based column generation. _Comput. Oper. Res._**2006**, _33_, 2972-2990. [CrossRef]
* [PERSON] (2003) [PERSON]; [PERSON] [PERSON] The shortest path problem with k-cycle elimination (k \(\geqslant\) 3): Improving a branch and price algorithm for the VRPTW. _INFORMS J. Comput._**2003**, _10_, 1-15. * [PERSON] (2005) [PERSON]; [PERSON] Accelerating branch-and-price with local search: A case study on the vehicle routing problem with time windows. In _Column Generation_; [PERSON], [PERSON], [PERSON]; Kluwer Academic Publishers: Amsterdam, The Netherlands, 2005; Charpter 3. * [PERSON] et al. (2007) [PERSON]; [PERSON]; [PERSON] An exact algorithm for a single-vehicle routing problem with time windows and multiple routes. _Eur. J. Oper. Res._**2007**, _178_, 755-766. [CrossRef]
* [PERSON] et al. (2011) [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model. _Eur. J. Oper. Res._**2011**, _214_, 536-545. [CrossRef]
* [PERSON] and [PERSON] (2018) [PERSON]; [PERSON] [PERSON] A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen. _Top_**2018**, _26_, 437-464. [CrossRef]
* [PERSON] et al. (2019) [PERSON]; [PERSON]; [PERSON] A column generation algorithm for vehicle scheduling and routing problems. _Comput. Ind. Eng._**2019**, _130_, 222-236. [CrossRef]
* [PERSON] and [PERSON] (2012) [PERSON]; [PERSON] [PERSON] A branch-and-price approach for a multi-trip vehicle routing problem with time windows and driver work hours. In Proceedings of the Congreso Latino-Iberoamericano de Investigacion Operativa. Simposio Brasileiro de Pesquisa Operacional, Rio de Janeiro, Brazil, 24-28 September 2012; pp. 3469-3480. * [PERSON] et al. (2019) [PERSON]; [PERSON] [PERSON]; [PERSON]; [PERSON] A branch-and-cut-and-price algorithm for the multi-trip separate pickup and delivery problem with time windows at customers and facilities. _Eur. J. Oper. Res._**2019**, _279_, 824-839. [CrossRef]
* [PERSON] et al. (2022) [PERSON]; [PERSON]; [PERSON]; [PERSON] A branch-cut-and-price approach for the single-trip and multi-trip two-echelon vehicle routing problem with time windows. _Transp. Sci._**2022**. [CrossRef]
* [PERSON] et al. (2021) [PERSON]; [PERSON]; [PERSON]; [PERSON] The multi-trip vehicle routing problem with time windows and unloading queue at depot. _Transp. Res. Part E Logist. Transp. Rev._**2021**, _152_, 102370. [CrossRef]
* Solomon's Benchmark Instances. Available online: [[https://www.sintef.no/projectweb/top/vrptw/100-customers/](https://www.sintef.no/projectweb/top/vrptw/100-customers/)]([https://www.sintef.no/projectweb/top/vrptw/100-customers/](https://www.sintef.no/projectweb/top/vrptw/100-customers/)) (accessed on 20 August 2022).