### Appendix A.3
(2009) [PERSON]; [PERSON]; [PERSON] [PERSON] _Valid Inequalities for the Two-Echelon Capacitated Vehicle Routing Problem_; CIRRELT: Montreal, QC, Canada, 2009. * [PERSON] et al. (2018) [PERSON]; [PERSON]; [PERSON]; [PERSON] A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints. _Eur. J. Oper. Res._**2018**, _266_, 487-497. [CrossRef]
* [PERSON] et al. (2020) [PERSON]; [PERSON]; [PERSON]; [PERSON] An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem. _Comput. Oper. Res._**2020**, _114_, 104833. [CrossRef]
* [PERSON] et al. (2018) [PERSON]; [PERSON]; [PERSON] A genetic-algorithm-based approach to the two-echelon capacitated vehicle routing problem with stochastic demands in logistics service. _J. Oper. Res. Soc._**2018**, _68_, 1409-1421. [CrossRef]
* [PERSON] et al. (2018) [PERSON]; [PERSON]; [PERSON]; [PERSON] A multi-depot two-echelon vehicle routing problem with delivery options arising in the last mile distribution. _Eur. J. Oper. Res._**2018**, _265_, 765-778. [CrossRef]
* [PERSON] (2018) [PERSON]; [PERSON] A multi-objective two-echelon capacitated vehicle routing problem for perishable products. _J. Ind. Syst. Eng._**2018**, _11_, 62-84. * [PERSON] et al. (2019) [PERSON]; [PERSON]; [PERSON] Parallel island based memetic algorithm with lin-kernighan local search for a real-life two-echelon heterogeneous vehicle routing problem based on brazilian wholesale companies. _Appl. Soft Comput._**2019**, _76_, 697-711. [CrossRef]
* [PERSON] et al. (2019) [PERSON]; [PERSON]; [PERSON] Two-echelon vehicle routing problem with recharge stations. _Transp. Telecommun. J._**2019**, _20_, 305-317. [CrossRef]
* [PERSON] and [PERSON] (2019) [PERSON]; [PERSON] The two-echelon multi-trip vehicle routing problem with dynamic satellites for crop harvesting and transportation. _Appl. Soft Comput._**2019**, _77_, 387-398. [CrossRef]
* [PERSON] et al. (2018) [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] Economic and environmental evaluations in the two-echelon collaborative multiple centers vehicle routing optimization. _J. Clean. Prod._**2018**, _197_, 443-461. [CrossRef]
* [PERSON] et al. (2011) [PERSON]; [PERSON]; [PERSON] Multi-start heuristics for the two-echelon vehicle routing problem. In _Evolutionary Computation in Combinatorial Optimization_; Springer: Berlin/Heidelberg, Germany, 2011; pp. 179-190. [CrossRef]
* [PERSON] et al. (2018) [PERSON]; [PERSON]; [PERSON] Two-echelon vehicle routing problem with simultaneous pickup and delivery: Mathematical model and heuristic approach. _Comput. Ind. Eng._**2018**, _115_, 1-16. [CrossRef]
* [PERSON] et al. (2016) [PERSON]; [PERSON]; [PERSON]; [PERSON] Simulation-based optimisation approach for the stochastic two-echelon logistics problem. _Int. J. Prod. Res._**2016**, _55_, 187-201. [CrossRef]
* [PERSON] et al. (2012) [PERSON]; [PERSON]; [PERSON] An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics. _Comput. Oper. Res._**2012**, _39_, 3215-3228. [CrossRef]
* [PERSON] et al. (2018) [PERSON]; [PERSON]; [PERSON] A neighborhood search and set cover hybrid heuristic for the two-echelon vehicle routing problem. In Proceedings of the 18 th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2018), Dagstuhl, Germany, 23-24 August 2018; [PERSON], [PERSON], Eds. ; OpenAccess Series in Informatics (OASICs); Schloss Dagstuhl-Leibniz-Zentrum fur Informatik: Wadern, Germany, 2018; ISBN 978-3-95977-096-5. Available online: [[http://drops.dagstuhl.de/opus/volltextex/2018/9716](http://drops.dagstuhl.de/opus/volltextex/2018/9716)]([http://drops.dagstuhl.de/opus/volltextex/2018/9716](http://drops.dagstuhl.de/opus/volltextex/2018/9716)) (accessed on 10 January 2024). * [PERSON] et al. (2022) [PERSON]; [PERSON] [PERSON]; [PERSON] [PERSON]; [PERSON] [PERSON]; [PERSON]; [PERSON] A sequential approach for a multi-commodity two-echelon distribution problem. _Comput. Ind.