[1]Dantzig, G.B., and Ramser, J.H., “The truck dispatching problem”, Management science, Vol. 6, pp. 80-91, 1959.
[2]Toth, P., and Vigo, D., Vehicle routing: problems, methods, and applications, SIAM, 2014.
[3]Ghiani, G., and Improta, G., “An efficient transformation of the generalized vehicle routing problem”, European Journal of Operational Research, Vol. 122, pp. 11-17, 2000.
[4]Pop, P.C., Kara, I., and Marc, A.H., “New mathematical models of the generalized vehicle routing problem and extensions”, Applied Mathematical Modelling, Vol. 36, pp. 97-107, 2012.
[5]Reyes, D., Savelsbergh, M., and Toriello, A., “Vehicle routing with roaming delivery locations”, Transportation Research Part C: Emerging Technologies, Vol. 80, pp. 71-91, 2017.
[6]Kara, I., and Bektas, T., “Integer linear programming formulation of the generalized vehicle routing problem,” Proceeding of. EURO/INFORMS Joint International Meeting, Istanbul, July, pp. 06-10, 2003.
[7]Pop, P.C., Matei, O., Sitar, C.P., and Chira, C., “A genetic algorithm for solving the generalized vehicle routing problem,” Proceeding of. International Conference on Hybrid Artificial Intelligence Systems, Springer, pp. 119-126, 2010.
[8]Bektaş, T., Erdoğan, G., and Røpke, S., “Formulations and branch-and-cut algorithms for the generalized vehicle routing problem”, Transportation Science, Vol. 45, pp. 299-316, 2011.
[9]Pop, P., and Pop-Sitar, C., “A new efficient transformation of the generalized vehicle routing problem into the classical vehicle routing problem”, Yugoslav Journal of Operations Research, Vol. 21, pp. 187-198, 2011.
[10]Moumou, M., Rhofir, K., and Allaoui, R., “Multi-split delivery for the vehicle routing problem with clustering: Mathematical formulation and algorithm,” Proceeding of. 2019 International Colloquium on Logistics and Supply Chain Management (LOGISTIQUA), IEEE, pp. 1-4, 2019.
[11]Los, J., Spaan, M.T., and Negenborn, R.R., “Fleet Management for Pickup and Delivery Problems with Multiple Locations and Preferences,” Proceeding of. International Conference on Dynamics in Logistics, Springer, pp. 86-94, 2018.
[12]Zhou, L., Baldacci, R., Vigo, D., and Wang, X., “A multi-depot two-echelon vehicle routing problem with delivery options arising in the last mile distribution”, European Journal of Operational Research, Vol. 265, pp. 765-778, 2018.
[13]Biesinger, B., Hu, B., and Raidl, G.R., “A variable neighborhood search for the generalized vehicle routing problem with stochastic demands,” Proceeding of. European Conference on Evolutionary Computation in Combinatorial Optimization, Springer, pp. 48-60, 2015.
[14]He, Y., Qi, M., Zhou, F., and Su, J., “An effective metaheuristic for the last mile delivery with roaming delivery locations and stochastic travel times”, Computers & Industrial Engineering, Vol., pp. 106513, 2020.
[15]Hà, M.H., Bostel, N., Langevin, A., and Rousseau, L.-M., “An exact algorithm and a metaheuristic for the generalized vehicle routing problem with flexible fleet size”, Computers & Operations Research, Vol. 43, pp. 9-19, 2014.
[16]Moccia, L., Cordeau, J.-F., and Laporte, G., “An incremental tabu search heuristic for the generalized vehicle routing problem with time windows”, Journal of the Operational Research Society, Vol. 63, pp. 232-244, 2012.
[17]Ozbaygin, G., and Savelsbergh, M., “An iterative re-optimization framework for the dynamic vehicle routing problem with roaming delivery locations”, Transportation Research Part B: Methodological, Vol. 128, pp. 207-235, 2019.
[18]Orenstein, I., Raviv, T., and Sadan, E., “Flexible parcel delivery to automated parcel lockers: models, solution methods and analysis”, EURO Journal on Transportation and Logistics, Vol. 8, pp. 683-711, 2019.
[19]Dumez, D., Lehuédé, F., and Péton, O., “A large neighborhood search approach to the vehicle routing problem with delivery options”, Transportation Research Part B: Methodological, Vol. 144, pp. 103-132, 2021.
[20]Lenstra, J.K., and Kan, A.R., “Complexity of vehicle routing and scheduling problems”, Networks, Vol. 11, pp. 221-227, 1981.
[21]Solomon, M.M., “Algorithms for the vehicle routing and scheduling problems with time window constraints”, Operations research, Vol. 35, pp. 254-265, 1987.
[22]Clarke, G., and Wright, J.W.J.O.r., “Scheduling of vehicles from a central depot to a number of delivery points”, Vol. 12, pp. 568-581, 1964.
)
