Ahmadi-Javid, A., & Seddighi, A. H. (2013). A location-routing problem with disruption risk. Transportation Research Part E: Logistics and Transportation Review, 53, 63-82.
Akpunar, Ö. Ş., & Akpinar, Ş. (2021). A hybrid adaptive large neighbourhood search algorithm for the capacitated loca-tion routing problem. Expert Systems with Applications, 168, 114304.
An, Y., Zeng, B., Zhang, Y., & Zhao, L. (2014). Reliable p-median facility location problem: two-stage robust models and algorithms. Transportation Research Part B: Methodological, 64, 54-72.
Azad, N., Davoudpour, H., Saharidis, G. K., & Shiripour, M. (2014). A new model to mitigating random disruption risks of facility and transportation in supply chain network design. The International Journal of Advanced Manufacturing Technology, 70(9), 1757-1774.
Balcik, B., & Beamon, B. M. (2008). Facility location in humanitarian relief. International Journal of logistics, 11(2), 101-121.
Barreto, S., Ferreira, C., Paixao, J., & Santos, B. S. (2007). Using clustering analysis in a capacitated location-routing problem. European Journal of Operational Research, 179(3), 968-977.
Bent, R. W., & Van Hentenryck, P. (2004). Scenario-based planning for partially dynamic vehicle routing with stochas-tic customers. Operations Research, 52(6), 977-987.
Bozorgi-Amiri, A., Jabalameli, M. S., & Mirzapour Al-e-Hashem, S. M. J. (2013). A multi-objective robust stochastic programming model for disaster relief logistics under uncertainty. OR spectrum, 35(4), 905-933.
Cao, E., Lai, M., & Yang, H. (2014). Open vehicle routing problem with demand uncertainty and its robust strate-gies. Expert Systems with Applications, 41(7), 3569-3575.
Cardona-Valdés, Y., Álvarez, A., & Ozdemir, D. (2011). A bi-objective supply chain design problem with uncertain-ty. Transportation Research Part C: Emerging Technologies, 19(5), 821-832.
Cardoso, S. R., Barbosa-Póvoa, A. P. F., & Relvas, S. (2013). Design and planning of supply chains with integration of reverse logistics activities under demand uncertainty. European journal of operational research, 226(3), 436-451.
Chang, K., Zhou, H., Chen, G., & Chen, H. (2017). Multiobjective location routing problem considering uncertain data after disasters. Discrete Dynamics in Nature and Society, 2017.
Chen, D. S., Batson, R. G., & Dang, Y. (2011). Applied integer programming: modeling and solution. John Wiley & Sons.
Duhamel, C., Lacomme, P., Prins, C., & Prodhon, C. (2010). A GRASP× ELS approach for the capacitated location-routing problem. Computers & Operations Research, 37(11), 1912-1923.
Contardo, C., Hemmelmayr, V., & Crainic, T. G. (2012). Lower and upper bounds for the two-echelon capacitated loca-tion-routing problem. Computers & operations research, 39(12), 3185-3199.
Cui, T., Ouyang, Y., & Shen, Z. J. M. (2010). Reliable facility location design under the risk of disruptions. Operations research, 58(4-part-1), 998-1011.
Queiroz, T. A. D., Oliveira, J. F., Carravilla, M. A., & Miyazawa, F. K. (2016). Demand uncertainty for the location-routing problem with two-dimensional loading constraints. In Computational Management Science (pp. 47-53). Springer, Cham.
Deb, K., Pratap, A., Agarwal, S., & Meyarivan, T. A. M. T. (2002). A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE transactions on evolutionary computation, 6(2), 182-197.‏
Drexl, M., & Schneider, M. (2015). A survey of variants and extensions of the location-routing problem. European Journal of Operational Research, 241(2), 283-308.
Escobar, J. W., Linfati, R., & Toth, P. (2013). A two-phase hybrid heuristic algorithm for the capacitated location-routing problem. Computers & Operations Research, 40(1), 70-79.
Fan, J., & Wang, G. (2018). Joint optimization of dynamic lot and warehouse sizing problems. European Journal of Op-erational Research, 267(3), 849-854.
Farham, M. S., Süral, H., & Iyigun, C. (2018). A column generation approach for the location-routing problem with time windows. Computers & Operations Research, 90, 249-263.
Fazayeli, S., Eydi, A., & Kamalabadi, I. N. (2018). Location-routing problem in multimodal transportation network with time windows and fuzzy demands: Presenting a two-part genetic algorithm. Computers & Industrial Engineer-ing, 119, 233-246.
Ghaderi, A. (2018). A Robust Optimization Model for the Single-Depot Capacitated Location-Routing Prob-lem. International Journal of Computer and Information Engineering, 12(7), 504-508.
Ghaffari-Nasab, N., Jabalameli, M. S., Aryanezhad, M. B., & Makui, A. (2013). Modeling and solving the bi-objective capacitated location-routing problem with probabilistic travel times. The International Journal of Advanced Manu-facturing Technology, 67(9), 2007-2019.
Goldschmidt, K. H., & Kumar, S. (2016). Humanitarian operations and crisis/disaster management: A retrospective re-view of the literature and framework for development. International Journal of Disaster Risk Reduction, 20, 1-13.
Golozari, F., Jafari, A., & Amiri, M. (2013). Application of a hybrid simulated annealing-mutation operator to solve fuzzy capacitated location-routing problem. The International Journal of Advanced Manufacturing Technolo-gy, 67(5), 1791-1807.
Gounaris, C. E., Wiesemann, W., & Floudas, C. A. (2013). The robust capacitated vehicle routing problem under de-mand uncertainty. Operations Research, 61(3), 677-693.
Haimes, Y. (1971). On a bicriterion formulation of the problems of integrated system identification and system optimi-zation. IEEE transactions on systems, man, and cybernetics, 1(3), 296-297.
Hiassat, A., Diabat, A., & Rahwan, I. (2017). A genetic algorithm approach for location-inventory-routing problem with perishable products. Journal of manufacturing systems, 42, 93-103.
Hosseini, M. B., Dehghanian, F., & Salari, M. (2019). Selective capacitated location-routing problem with incentive-dependent returns in designing used products collection network. European Journal of Operational Re-search, 272(2), 655-673.
Huang, S. H. (2015). Solving the multi-compartment capacitated location routing problem with pickup–delivery routes and stochastic demands. Computers & Industrial Engineering, 87, 104-113.
Jokar, A., & Sahraeian, R. (2012). A heuristic based approach to solve a capacitated location-routing problem. J. Mgmt. & Sustainability, 2, 219.
Karaoglan, I., & Altiparmak, F. (2015). A memetic algorithm for the capacitated location-routing problem with mixed backhauls. Computers & Operations Research, 55, 200-216.
Kleindorfer, P. R., & Saad, G. H. (2005). Managing disruption risks in supply chains. Production and operations man-agement, 14(1), 53-68.
Klibi, W., Martel, A., & Guitouni, A. (2010). The design of robust value-creating supply chain networks: a critical re-view. European Journal of Operational Research, 203(2), 283-293.
Li, X., & Ouyang, Y. (2010). A continuum approximation approach to reliable facility location design under correlated probabilistic disruptions. Transportation research part B: methodological, 44(4), 535-548.
Lopes, R. B., Ferreira, C., Santos, B. S., & Barreto, S. (2013). A taxonomical analysis, current methods and objectives on location‐routing problems. International Transactions in Operational Research, 20(6), 795-822.
Lopes, R. B., Ferreira, C., & Santos, B. S. (2016). A simple and effective evolutionary algorithm for the capacitated lo-cation–routing problem. Computers & Operations Research, 70, 155-162.
Lopez-Garcia, P., Onieva, E., Osaba, E., Masegosa, A. D., & Perallos, A. (2016). GACE: A meta-heuristic based in the hybridization of Genetic Algorithms and Cross Entropy methods for continuous optimization. Expert Systems with Applications, 55, 508-519.
Lopez-Garcia, P., Onieva, E., Osaba, E., Masegosa, A. D., & Perallos, A. (2016). GACE: A meta-heuristic based in the hybridization of Genetic Algorithms and Cross Entropy methods for continuous optimization. Expert Systems with Applications, 55, 508-519.
Madani, S. R., Nookabadi, A. S., & Hejazi, S. R. (2018). A bi-objective, reliable single allocation p-hub maximal cover-ing location problem: Mathematical formulation and solution approach. Journal of Air Transport Management, 68, 118-136.
Marinakis, Y. (2015). An improved particle swarm optimization algorithm for the capacitated location routing problem and for the location routing problem with stochastic demands. Applied Soft Computing, 37, 680-701.
Mavrotas, G., & Florios, K. (2013). AUGMECON2: A novel version of the ε-constraint method for finding the exact Pa-reto set in Multi-Objective Integer Programming problems. Applied Mathematics and Computation, 219(18), 9652-9669.
Mehrjerdi, Y. Z., & Nadizadeh, A. (2013). Using greedy clustering method to solve capacitated location-routing prob-lem with fuzzy demands. European Journal of Operational Research, 229(1), 75-84.
Mohamed, I. B., Klibi, W., Sadykov, R., Şen, H., & Vanderbeck, F. (2022). The two-echelon stochastic multi-period ca-pacitated location-routing problem. European Journal of Operational Research.
Mulvey, J. M., & Ruszczyński, A. (1995). A new scenario decomposition method for large-scale stochastic optimiza-tion. Operations research, 43(3), 477-490.
Nadizadeh, A., & Nasab, H. H. (2014). Solving the dynamic capacitated location-routing problem with fuzzy demands by hybrid heuristic algorithm. European Journal of Operational Research, 238(2), 458-470.
Nagy, G., & Salhi, S. (2007). Location-routing: Issues, models and methods. European journal of operational re-search, 177(2), 649-672.
Negrotto, D., & Loiseau, I. (2021). A Branch & Cut algorithm for the prize-collecting capacitated location routing prob-lem. Top, 29(1), 34-57.
Oudouar, F., Lazaar, M., & El Miloud, Z. (2020). A novel approach based on heuristics and a neural network to solve a capacitated location routing problem. Simulation Modelling Practice and Theory, 100, 102064.
Pan, F., & Nagi, R. (2010). Robust supply chain design under uncertain demand in agile manufacturing. Computers & operations research, 37(4), 668-683.
Pekel, E., & Kara, S. S. (2019). Solving fuzzy capacitated location routing problem using hybrid variable neighborhood search and evolutionary local search. Applied Soft Computing, 83, 105665.
Peng, P., Snyder, L. V., Lim, A., & Liu, Z. (2011). Reliable logistics networks design with facility disrup-tions. Transportation Research Part B: Methodological, 45(8), 1190-1211.
Peng, Z., Manier, H., & Manier, M. A. (2017). Particle swarm optimization for capacitated location-routing prob-lem. IFAC-PapersOnLine, 50(1), 14668-14673.
Ponboon, S., Qureshi, A. G., & Taniguchi, E. (2016). Branch-and-price algorithm for the location-routing problem with time windows. Transportation Research Part E: Logistics and Transportation Review, 86, 1-19.
Prins, C., Prodhon, C., & Calvo, R. W. (2006). Solving the capacitated location-routing problem by a GRASP comple-mented by a learning process and a path relinking. 4OR, 4(3), 221-238.
Prodhon, C., & Prins, C. (2014). A survey of recent research on location-routing problems. European Journal of Opera-tional Research, 238(1), 1-17.
Quintero‐Araujo, C. L., Caballero‐Villalobos, J. P., Juan, A. A., & Montoya‐Torres, J. R. (2017). A biased‐randomized metaheuristic for the capacitated location routing problem. International Transactions in Operational Re-search, 24(5), 1079-1098.
Rabbani, M., Heidari, R., & Yazdanparast, R. (2019). A stochastic multi-period industrial hazardous waste location-routing problem: Integrating NSGA-II and Monte Carlo simulation. European Journal of Operational Re-search, 272(3), 945-961.
Rand, G. K. (1976). Methodological choices in depot location studies. Journal of the Operational Research Society, 27(1), 241-249.
Rayat, F., Musavi, M., & Bozorgi-Amiri, A. (2017). Bi-objective reliable location-inventory-routing problem with partial backordering under disruption risks: A modified AMOSA approach. Applied Soft Computing, 59, 622-643.
Rennemo, S. J., Rø, K. F., Hvattum, L. M., & Tirado, G. (2014). A three-stage stochastic facility routing model for disaster response planning. Transportation research part E: logistics and transportation review, 62, 116-135.
Ruiz, E., Soto-Mendoza, V., Barbosa, A. E. R., & Reyes, R. (2019). Solving the open vehicle routing problem with capacity and distance constraints with a biased random key genetic algorithm. Computers & Industrial Engineering, 133, 207-219.
Sadegheih, A. (2017). A Hybrid Heuristic Algorithm to Solve Capacitated Location-routing Problem With Fuzzy‎ Demands‎. International Journal of Industrial Mathematics, 9(1), 1-20.
Saif-Eddine, A. S., El-Beheiry, M. M., & El-Kharbotly, A. K. (2019). An improved genetic algorithm for optimizing total supply chain cost in inventory location routing problem. Ain Shams Engineering Journal, 10(1), 63-76.
Shiripour, S., Mahdavi-Amiri, N., & Mahdavi, I. (2017). A transportation network model with intelligent probabilistic travel times and two hybrid algorithms. Transportation Letters, 9(2), 90-122.
Simchi-Levi, D., Kaminsky, P., & Simchi-Levi, E. (2004). Managing the supply chain: definitive guide. Tata McGraw-Hill Education.
Tang, L., Zhu, C., Lin, Z., Shi, J., & Zhang, W. (2016). Reliable facility location problem with facility protection. PloS one, 11(9), e0161532.
Tirkolaee, E. B., Mahmoodkhani, J., Bourani, M. R., & Tavakkoli-Moghaddam, R. (2019). A self-learning particle swarm optimization for robust multi-echelon capacitated location–allocation–inventory problem. Journal of Advanced Manufacturing Systems, 18(04), 677-694.
Toro, E. M., Franco, J. F., Echeverri, M. G., & Guimarães, F. G. (2017). A multi-objective model for the green capacitated location-routing problem considering environmental impact. Computers & Industrial Engineering, 110, 114-125.
Vincent, F. Y., Lin, S. W., Lee, W., & Ting, C. J. (2010). A simulated annealing heuristic for the capacitated location routing problem. Computers & Industrial Engineering, 58(2), 288-299.
Vincent, F. Y., Normasari, N. M. E., & Chen, W. H. (2021). Location-routing problem with time-dependent demands. Computers & Industrial Engineering, 151, 106936.
Wang, M., Bell, M. G., & Miao, L. (2020). A Branch-and-Price Algorithm for a Green Two-Echelon Capacitated Location Routing Problem.
Wu, W., Zhou, W., Lin, Y., Xie, Y., & Jin, W. (2021). A hybrid metaheuristic algorithm for location inventory routing problem with time windows and fuel consumption. Expert systems with applications, 166, 114034.
Yu, C. S., & Li, H. L. (2000). A robust optimization model for stochastic logistic problems. International journal of production economics, 64(1-3), 385-397.
Yu, X., Zhou, Y., & Liu, X. F. (2019). A novel hybrid genetic algorithm for the location routing problem with tight ca-pacity constraints. Applied Soft Computing, 85, 105760.
Zahedi-Seresht, M., Jahanshahloo, G. R., & Jablonsky, J. (2017). A robust data envelopment analysis model with differ-ent scenarios. Applied mathematical modelling, 52, 306-319.
Zarandi, M. H. F., Hemmati, A., Davari, S., & Turksen, I. B. (2013). Capacitated location-routing problem with time windows under uncertainty. Knowledge-Based Systems, 37, 480-489.
Zhang, Y., Qi, M., Lin, W. H., & Miao, L. (2015). A metaheuristic approach to the reliable location routing problem un-der disruptions. Transportation Research Part E: Logistics and Transportation Review, 83, 90-110.
Zhang, B., Li, H., Li, S., & Peng, J. (2018). Sustainable multi-depot emergency facilities location-routing problem with uncertain information. Applied Mathematics and Computation, 333, 506-520.
Zhang, H., Liu, F., Ma, L., & Zhang, Z. (2020). A hybrid heuristic based on a particle swarm algorithm to solve the ca-pacitated location-routing problem with fuzzy demands. IEEE Access, 8, 153671-153691.
Zhao, Q., Wang, W., & De Souza, R. (2018). A heterogeneous fleet two-echelon capacitated location-routing model for joint delivery arising in city logistics. International Journal of Production Research, 56(15), 5062-5080.
Zhou, L., Lin, Y., Wang, X., & Zhou, F. (2019). Model and algorithm for bilevel multisized terminal location‐routing problem for the last mile delivery. International Transactions in Operational Research, 26(1), 131-156.
Ziaei, Z., & Jabbarzadeh, A. (2021). A multi-objective robust optimization approach for green location-routing planning of multi-modal transportation systems under uncertainty. Journal of Cleaner Production, 291, 125293.