-Atasoy, B., T. Ikeda, and M.E. Ben-Akiva, (2016). Optimizing a Flexible Mobility on Demand System. Transportation Research Record, 2563(1): 76-85.
-Archetti, C., E. Fernández, and D.L.
Huerta-Muñoz, (2017). The Flexible Periodic Vehicle Routing Problem. Computers & Operations Research, 85: 58-70.
-Archetti, C., E. Fernández, and D.L.Huerta-Muñoz, (2018). A two-phase solution algorithm for the Flexible Periodic Vehicle Routing Problem. Computers & Operations Research, 99: 27-37.
-Al Theeb, N. and C. Murray, (2017). Vehicle routing and resource distribution in postdisaster humanitarian relief operations. International Transactions in Operational Research, 24(6): 1253-1284.
-Dantzig, G.B. and J.H. Ramser, (1959).The truck dispatching problem. Management Science, 6(1): 80-91.
-Defryn, C., K. Sörensen, and T. Cornelissens, (2016). The selective vehicle routing problem in a collaborative environment. European Journal of Operational Research, 250(2): 400-411.
-Darvish, M., et al., (2019). Flexible two-echelon location routing problem. European Journal of Operational Research, 277(3):1124-1136.
-Estrada‐Moreno, A., et al., (2019).Biased‐randomized iterated local search for a multiperiod vehicle routing problem with price discounts for delivery flexibility. International Transactions in Operational Research, 26(4): 1293-1314.
-Farahbakhsh, A. and M.A. Forghani, (2019). Sustainable location and route planning with GIS for waste sorting centers, case study: Kerman, Iran. Waste Management & Research, 37(3): 287-300.
-Huang, Y., et al., (2017). Time-dependent vehicle routing problem with path flexibility. Transportation Research Part B: Methodological, 95: 169-195.
-Henke, T., M.G. Speranza, and G. Wäscher, (2015). The multi-compartment vehicle routing problem with flexible compartment sizes. European Journal of Operational Research, 246(3): 730-743.
-Henke, T., M.G. Speranza, and G. Wäscher, A. (2019). branch-and-cut algorithm for the
multi-compartment vehicle routing problem with flexible compartment sizes. Annals of Operations Research, 275(2): 321-338.
-Li, J., Y. Li, and P.M. Pardalos, (2016).Multi-depot vehicle routing problem with time windows under shared depot resources. Journal of Combinatorial Optimization, 31(2): 515-532.
-Rothenbächer, A. K., (2019). Branch-and-price-and-cut for the periodic vehicle routing problem with flexible schedule structures. Transportation Science, 2019. 53(3): 850-866.
-Popović, D., M. Vidović, and G. Radivojević, (2012). Variable neighborhood search heuristic for the inventory routing problem in fuel delivery. Expert Systems with Applications, 39(18):13390-13398.
-Toth, P. and D. Vigo, (2002). The vehicle routing problem. SIAM.
-Taş, D., O. Jabali, and T. Van Woensel, (2014). A vehicle routing problem with flexible time windows. Computers & Operations Research, 52: 39-54.