{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:10:25Z","timestamp":1759666225602,"version":"3.37.3"},"reference-count":65,"publisher":"EDP Sciences","issue":"3","license":[{"start":{"date-parts":[[2021,6,8]],"date-time":"2021-06-08T00:00:00Z","timestamp":1623110400000},"content-version":"vor","delay-in-days":38,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"accepted":{"date-parts":[[2021,3,30]]},"published-print":{"date-parts":[[2021,5]]},"abstract":"<jats:p>This paper develops a new mathematical model to study a location-routing problem with simultaneous pickup and delivery under the risk of disruption. A remarkable number of previous studies have assumed that network components (<jats:italic>e.g.<\/jats:italic>, routes, production factories, depots, etc.) are always available and can permanently serve the customers. This assumption is no longer valid when the network faces disruptions such as flood, earthquake, tsunami, terrorist attacks and workers strike. In case of any disruption in the network, tremendous cost is imposed on the stockholders. Incorporating disruption in the design phase of the network will alleviate the impact of these disasters and let the network resist disruption. In this study, a mixed integer programming (MIP) model is proposed that formulates a reliable capacitated location-routing problem with simultaneous pickup and delivery (RCLRP-SPD) services in supply chain distribution network. The objective function attempts to minimize the sum of location cost of depots, routing cost of vehicles and cost of unfulfilled demand of customers. Since the model is NP-Hard, three meta-heuristics are tailored for large-sized instances and the results show the outperformance of hybrid algorithms comparing to classic genetic algorithm. Finally, the obtained results are discussed and the paper is concluded.<\/jats:p>","DOI":"10.1051\/ro\/2021050","type":"journal-article","created":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T19:21:45Z","timestamp":1617304905000},"page":"1371-1399","source":"Crossref","is-referenced-by-count":11,"title":["Capacitated location routing problem with simultaneous pickup and delivery under the risk of disruption"],"prefix":"10.1051","volume":"55","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2063-003X","authenticated-orcid":false,"given":"Milad","family":"Dehghan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0762-6327","authenticated-orcid":false,"given":"Seyed Reza","family":"Hejazi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2889-5769","authenticated-orcid":false,"given":"Maryam","family":"Karimi-Mamaghan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3726-8356","authenticated-orcid":false,"given":"Mehrdad","family":"Mohammadi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9204-573X","authenticated-orcid":false,"given":"Amir","family":"Pirayesh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2021,6,8]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/j.tre.2013.02.002","volume":"53","author":"Ahmadi-Javid","year":"2013","journal-title":"Transp. Res. Part E: Logistics Transp. Rev."},{"key":"R2","doi-asserted-by":"crossref","first-page":"940","DOI":"10.1016\/j.ejor.2005.04.051","volume":"179","author":"Albareda-Sambola","year":"2007","journal-title":"Eur. J. Oper. Res."},{"key":"R3","doi-asserted-by":"crossref","first-page":"916","DOI":"10.1080\/00207543.2014.942010","volume":"53","author":"Ardjmand","year":"2015","journal-title":"Int. J. Prod. Res."},{"key":"R4","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1016\/j.asoc.2016.03.005","volume":"46","author":"Babaie-Kafaki","year":"2016","journal-title":"Appl. Soft Comput."},{"key":"R5","doi-asserted-by":"crossref","first-page":"1131","DOI":"10.1016\/j.compchemeng.2003.09.014","volume":"28","author":"Chen","year":"2004","journal-title":"Comput. Chem. Eng."},{"key":"R6","doi-asserted-by":"crossref","first-page":"1295","DOI":"10.1051\/ro\/2018024","volume":"52","author":"Chentli","year":"2018","journal-title":"RAIRO:OR"},{"key":"R7","doi-asserted-by":"crossref","unstructured":"Chentli H., Ouafi R. and Cherif-Khettaf W.R., Impact of iterated local search heuristic hybridization on vehicle routing problems: application to the capacitated profitable tour problem. In: Impact of iterated local search heuristic hybridization on vehicle routing problems: application to the capacitated profitable tour problem. Springer, Cham (2018) 80\u2013101.","DOI":"10.1007\/978-3-030-16035-7_5"},{"key":"R8","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1051\/ro\/2014030","volume":"49","author":"Cherif-Khettaf","year":"2015","journal-title":"RAIRO:OR"},{"key":"R9","doi-asserted-by":"crossref","first-page":"998","DOI":"10.1287\/opre.1090.0801","volume":"58","author":"Cui","year":"2010","journal-title":"Oper. Res."},{"key":"R10","doi-asserted-by":"crossref","first-page":"1147","DOI":"10.1051\/ro\/2018012","volume":"52","author":"Dehghani","year":"2018","journal-title":"RAIRO:OR"},{"key":"R11","doi-asserted-by":"crossref","first-page":"2865","DOI":"10.1016\/j.eswa.2011.08.146","volume":"39","author":"Derbel","year":"2012","journal-title":"Expert Syst. App."},{"key":"R12","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/j.ejor.2014.08.030","volume":"241","author":"Drexl","year":"2015","journal-title":"Eur. J. Oper. Res."},{"key":"R13","doi-asserted-by":"crossref","unstructured":"Eiben A.E. and Smith J.E., Introduction to Evolutionary Computing. Springer 53 (2003).","DOI":"10.1007\/978-3-662-05094-1"},{"key":"R14","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/j.cor.2012.05.008","volume":"40","author":"Escobar","year":"2013","journal-title":"Comput. Oper. Res."},{"key":"R15","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1016\/j.trb.2014.05.014","volume":"67","author":"Escobar","year":"2014","journal-title":"Transp. Res. Part B: Methodol."},{"key":"R16","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1016\/j.asoc.2018.05.024","volume":"70","author":"Ferreira","year":"2018","journal-title":"Appl. Soft Comput."},{"key":"R17","doi-asserted-by":"crossref","first-page":"2007","DOI":"10.1007\/s00170-012-4627-9","volume":"67","author":"Ghaffari-Nasab","year":"2013","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"R18","unstructured":"Holland J., Adaptation in natural and artificial systems: an introductory analysis with application to biology. Control Artif. Intell. (1975)."},{"key":"R19","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1016\/j.cie.2015.05.008","volume":"87","author":"Huang","year":"2015","journal-title":"Comput. Ind. Eng."},{"key":"R20","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1016\/j.asoc.2014.11.005","volume":"27","author":"Karakati\u010d","year":"2015","journal-title":"Appl. Soft Comput."},{"key":"R21","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/j.cor.2014.06.009","volume":"55","author":"Karaoglan","year":"2015","journal-title":"Comput. Oper. Res."},{"key":"R22","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1016\/j.ejor.2011.01.003","volume":"211","author":"Karaoglan","year":"2011","journal-title":"Eur. J. Oper. Res."},{"key":"R23","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1016\/j.omega.2011.09.002","volume":"40","author":"Karaoglan","year":"2012","journal-title":"Omega"},{"key":"R24","unstructured":"Karimi-Mamaghan M., Mohammadi M., Pasdeloup B., Billot R. and Meyer P., An online learning-based metaheuristic for solving combinatorial optimization problems. In: 21\u00e8me congr\u00e8s annuel de la soci\u00e9t\u00e9 Fran\u00e7aise de Recherche Op\u00e9rationnelle et d\u2019Aide \u00e0 la D\u00e9cision (ROADEF) (2020)."},{"key":"R25","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1016\/j.ejor.2020.01.061","volume":"285","author":"Karimi-Mamaghan","year":"2020","journal-title":"Eur. J. Oper. Res."},{"key":"R26","doi-asserted-by":"crossref","unstructured":"Karimi-Mamaghan M., Mohammadi M., Pirayesh A., Karimi-Mamaghan A.M. and Irani H., Hub-and-spoke network design under congestion: a learning based metaheuristic. Transp. Res. Part E: Logistics Transp. Rev. 142 (2020).","DOI":"10.1016\/j.tre.2020.102069"},{"key":"R27","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/s10852-015-9274-3","volume":"14","author":"Khalili-Damghani","year":"2015","journal-title":"J. Math. Model. Algorithms Oper. Res."},{"key":"R28","doi-asserted-by":"crossref","first-page":"901","DOI":"10.1016\/j.cor.2012.11.012","volume":"40","author":"Li","year":"2013","journal-title":"Comput. Oper. Res."},{"key":"R29","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/j.cor.2016.01.006","volume":"70","author":"Lopes","year":"2016","journal-title":"Comput. Oper. Res."},{"key":"R30","doi-asserted-by":"crossref","first-page":"1151","DOI":"10.1051\/ro\/2017007","volume":"51","author":"Majidi","year":"2017","journal-title":"RAIRO:OR"},{"key":"R31","doi-asserted-by":"crossref","first-page":"680","DOI":"10.1016\/j.asoc.2015.09.005","volume":"37","author":"Marinakis","year":"2015","journal-title":"Appl. Soft Comput."},{"key":"R32","doi-asserted-by":"crossref","first-page":"6845","DOI":"10.1016\/j.apm.2015.02.027","volume":"39","author":"Mehdizadeh","year":"2015","journal-title":"Appl. Math. Model."},{"key":"R33","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1016\/j.ejor.2008.05.007","volume":"196","author":"Melo","year":"2009","journal-title":"Eur. J. Oper. Res."},{"key":"R34","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/j.asoc.2018.05.026","volume":"70","author":"Miranda","year":"2018","journal-title":"Appl. Soft Comput."},{"key":"R35","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"Mladenovi\u0107","year":"1997","journal-title":"Comput. Oper. Res."},{"key":"R36","doi-asserted-by":"crossref","first-page":"2563","DOI":"10.3233\/IFS-151846","volume":"30","author":"Mohammadi","year":"2016","journal-title":"J. Intell. Fuzzy Syst."},{"key":"R37","first-page":"109","volume":"2","author":"Mohammadi","year":"2010","journal-title":"J. Appl. Oper. Res."},{"key":"R38","doi-asserted-by":"crossref","first-page":"5621","DOI":"10.1016\/j.apm.2016.01.011","volume":"40","author":"Mohammadi","year":"2016","journal-title":"Appl. Math. Model."},{"key":"R39","doi-asserted-by":"crossref","first-page":"792","DOI":"10.1016\/j.ejor.2016.07.054","volume":"257","author":"Mohammadi","year":"2017","journal-title":"Eur. J. Oper. Res."},{"key":"R40","doi-asserted-by":"crossref","first-page":"1432","DOI":"10.1080\/00207543.2017.1363425","volume":"56","author":"Mohammadi","year":"2018","journal-title":"Int. J. Prod. Res."},{"key":"R41","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1016\/j.ejor.2016.05.048","volume":"255","author":"Moshref-Javadi","year":"2016","journal-title":"Eur. J. Oper. Res."},{"key":"R42","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/19427867.2016.1270798","volume":"11","author":"Nadizadeh","year":"2019","journal-title":"Transp. Lett."},{"key":"R43","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1016\/j.ejor.2014.04.012","volume":"238","author":"Nadizadeh","year":"2014","journal-title":"Eur. J. Oper. Res."},{"key":"R44","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1016\/j.ejor.2006.04.004","volume":"177","author":"Nagy","year":"2007","journal-title":"Eur. J. Oper. Res."},{"key":"R45","doi-asserted-by":"crossref","unstructured":"Oudouar F., Lazaar M., Miloud Z.E., A novel approach based on heuristics and a neural network to solve a capacitated location routing problem. Simul. Model. Pract. Theory 100 (2020).","DOI":"10.1016\/j.simpat.2019.102064"},{"key":"R46","doi-asserted-by":"crossref","unstructured":"Pekel E., Soner Kara S., Solving fuzzy capacitated location routing problem using hybrid variable neighborhood search and evolutionary local search. Appl. Soft. Comput. 83 (2019).","DOI":"10.1016\/j.asoc.2019.105665"},{"key":"R47","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/j.cie.2018.05.010","volume":"121","author":"Pichka","year":"2018","journal-title":"Comput. Ind. Eng."},{"key":"R48","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1016\/j.ejor.2014.10.010","volume":"242","author":"Polat","year":"2015","journal-title":"Eur. J. Oper. Res."},{"key":"R49","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2014.01.005","volume":"238","author":"Prodhon","year":"2014","journal-title":"Eur. J. Oper. Res."},{"key":"R50","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1051\/ro\/2017030","volume":"53","author":"Respen","year":"2019","journal-title":"RAIRO:OR"},{"key":"R51","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1016\/0377-2217(89)90188-4","volume":"39","author":"Salhi","year":"1989","journal-title":"Eur. J. Oper. Res."},{"key":"R52","unstructured":"Snyder L.V., Supply chain robustness and reliability: models and algorithms. Ph.D diss.Northwestern University (2003)."},{"key":"R53","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1287\/trsc.1040.0107","volume":"39","author":"Snyder","year":"2005","journal-title":"Transp. Sci."},{"key":"R54","doi-asserted-by":"crossref","first-page":"2483","DOI":"10.1007\/s11277-018-5267-7","volume":"102","author":"Wang","year":"2018","journal-title":"Wireless Pers. Commun."},{"key":"R55","doi-asserted-by":"crossref","first-page":"1128","DOI":"10.1287\/trsc.2015.0630","volume":"50","author":"Xie","year":"2015","journal-title":"Transp. Sci."},{"key":"R56","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1080\/00207543.2015.1085655","volume":"54","author":"Yu","year":"2016","journal-title":"Int. J. Prod. Res."},{"key":"R57","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1016\/j.cie.2009.10.007","volume":"58","author":"Yu","year":"2010","journal-title":"Comput. Ind. Eng."},{"key":"R58","doi-asserted-by":"crossref","unstructured":"Yu X., Zhou Y., Liu X.-F., A novel hybrid genetic algorithm for the location routing problem with tight capacity constraints. Appl. Soft. Comput. 85 (2019).","DOI":"10.1016\/j.asoc.2019.105760"},{"key":"R59","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.cie.2018.05.041","volume":"122","author":"Zahiri","year":"2018","journal-title":"Comput. Ind. Eng."},{"key":"R60","doi-asserted-by":"crossref","first-page":"10075","DOI":"10.1016\/j.eswa.2011.02.006","volume":"38","author":"Zarandi","year":"2011","journal-title":"Expert Syst. App."},{"key":"R61","doi-asserted-by":"crossref","first-page":"480","DOI":"10.1016\/j.knosys.2012.09.007","volume":"37","author":"Zarandi","year":"2013","journal-title":"Knowl.-Based Syst."},{"key":"R62","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.ejor.2013.02.013","volume":"229","author":"Zare Mehrjerdi","year":"2013","journal-title":"Eur. J. Oper. Res."},{"key":"R63","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1016\/j.tre.2016.02.011","volume":"89","author":"Zhalechian","year":"2016","journal-title":"Transp. Res. Part E: Logistics Transp. Rev."},{"key":"R64","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1016\/j.tre.2015.09.001","volume":"83","author":"Zhang","year":"2015","journal-title":"Transp. Res. Part E: Logistics Transp. Rev."},{"key":"R65","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1016\/j.amc.2018.03.071","volume":"333","author":"Zhang","year":"2018","journal-title":"Appl. Math. Comput."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2021050\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T13:50:12Z","timestamp":1698846612000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2021050"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5]]},"references-count":65,"journal-issue":{"issue":"3"},"alternative-id":["ro190142"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2021050","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"type":"print","value":"0399-0559"},{"type":"electronic","value":"1290-3868"}],"subject":[],"published":{"date-parts":[[2021,5]]}}}