{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,30]],"date-time":"2026-07-30T02:10:39Z","timestamp":1785377439555,"version":"3.55.0"},"reference-count":40,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2020,11,1]],"date-time":"2020-11-01T00:00:00Z","timestamp":1604188800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2020,11,1]],"date-time":"2020-11-01T00:00:00Z","timestamp":1604188800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers &amp; Operations Research"],"published-print":{"date-parts":[[2020,11]]},"DOI":"10.1016\/j.cor.2020.104996","type":"journal-article","created":{"date-parts":[[2020,5,25]],"date-time":"2020-05-25T11:22:56Z","timestamp":1590405776000},"page":"104996","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":26,"special_numbering":"C","title":["A trilevel r-interdiction selective multi-depot vehicle routing problem with depot protection"],"prefix":"10.1016","volume":"123","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6106-4903","authenticated-orcid":false,"given":"Mir Ehsan","family":"Hesam Sadati","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1734-2042","authenticated-orcid":false,"given":"Deniz","family":"Aksen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1485-730X","authenticated-orcid":false,"given":"Necati","family":"Aras","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.cor.2020.104996_b0005","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/j.cie.2017.10.003","article-title":"A tri-level r-interdiction median model for a facility location problem under imminent attack","volume":"114","author":"Akbari-Jafarabadi","year":"2017","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.cor.2020.104996_b0010","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1016\/j.cor.2015.05.016","article-title":"A bi-level programming model for protection of hierarchical facilities under imminent attacks","volume":"64","author":"Aliakbarian","year":"2015","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2020.104996_b0015","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1016\/j.cor.2012.08.013","article-title":"A bilevel partial interdiction problem with capacitated facilities and demand outsourcing","volume":"41","author":"Aksen","year":"2014","journal-title":"Comput. Oper. Res."},{"issue":"7","key":"10.1016\/j.cor.2020.104996_b0020","doi-asserted-by":"crossref","first-page":"1364","DOI":"10.1016\/j.cor.2011.08.006","article-title":"A bilevel fixed charge location model for facilities under imminent attack","volume":"39","author":"Aksen","year":"2012","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2020.104996_b0025","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/s10732-011-9163-5","article-title":"A bilevel p-median model for the planning and protection of critical facilities","volume":"19","author":"Aksen","year":"2013","journal-title":"J. Heuristics"},{"issue":"3","key":"10.1016\/j.cor.2020.104996_b0030","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/s10100-009-0110-6","article-title":"The budget constrained r-interdiction median problem with capacity expansion","volume":"18","author":"Aksen","year":"2010","journal-title":"Cent. Eur. J. Oper Res."},{"key":"10.1016\/j.cor.2020.104996_b0035","unstructured":"Aksen, D., \u00d6ncan, T. and Sadati, M.E.H., 2018. An empirical investigation of four well-known polynomial-size VRP formulations.arXiv preprint arXiv:1810.00199."},{"issue":"5","key":"10.1016\/j.cor.2020.104996_b0040","doi-asserted-by":"crossref","first-page":"866","DOI":"10.1016\/j.trc.2010.08.003","article-title":"Selective multi-depot vehicle routing problem with pricing","volume":"19","author":"Aras","year":"2011","journal-title":"Trans. Res. Part C"},{"issue":"2","key":"10.1016\/j.cor.2020.104996_b0045","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1109\/TPWRS.2005.846198","article-title":"On the solution of the bilevel programming formulation of the terrorist threat problem","volume":"20","author":"Arroyo","year":"2005","journal-title":"IEEE Trans. Power Syst."},{"key":"10.1016\/j.cor.2020.104996_b0050","doi-asserted-by":"crossref","unstructured":"Brown, G. G., Carlyle, W. M., Salmeron, J., and Wood, K., 2005. Analyzing the vulnerability of critical infrastructure to attack and planning defenses. In Emerging Theory, Methods, and Applications (pp. 102-123). INFORMS.","DOI":"10.1287\/educ.1053.0018"},{"key":"10.1016\/j.cor.2020.104996_b0055","doi-asserted-by":"crossref","first-page":"520","DOI":"10.1016\/j.cie.2017.11.019","article-title":"An arc interdiction vehicle routing problem with information asymmetry","volume":"115","author":"Bidgoli","year":"2018","journal-title":"Comput. Ind. Eng."},{"issue":"3","key":"10.1016\/j.cor.2020.104996_b0060","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1111\/j.1467-8306.2004.00410.x","article-title":"Identifying critical infrastructure: the median and covering facility interdiction problems","volume":"94","author":"Church","year":"2004","journal-title":"Ann. Assoc. Am. Geogr."},{"issue":"2","key":"10.1016\/j.cor.2020.104996_b0065","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1111\/j.1538-4632.2007.00698.x","article-title":"Protecting critical assets: the r-interdiction median problem with fortification","volume":"39","author":"Church","year":"2007","journal-title":"Geogr Anal"},{"issue":"4","key":"10.1016\/j.cor.2020.104996_b0070","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1287\/opre.12.4.568","article-title":"Scheduling of vehicles from a central depot to a number of delivery points","volume":"12","author":"Clarke","year":"1964","journal-title":"Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2020.104996_b0075","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1002\/(SICI)1097-0037(199709)30:2<105::AID-NET5>3.0.CO;2-G","article-title":"A tabu search heuristic for periodic and multi-depot vehicle routing problems","volume":"30","author":"Cordeau","year":"1997","journal-title":"Networks"},{"key":"10.1016\/j.cor.2020.104996_b0080","unstructured":"Gavish, B. and Graves, S.C., 1978. The travelling salesman problem and related problems. Working paper GR-078-78, Operations Research Center, Massachusetts Institute of Technology, Boston, 1978."},{"issue":"1","key":"10.1016\/j.cor.2020.104996_b0085","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1002\/net.20192","article-title":"A Tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints","volume":"51","author":"Gendreau","year":"2008","journal-title":"Networks"},{"issue":"5","key":"10.1016\/j.cor.2020.104996_b0090","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","article-title":"Future paths for integer programming and links to artificial intelligence","volume":"13","author":"Glover","year":"1986","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"10.1016\/j.cor.2020.104996_b0095","doi-asserted-by":"crossref","first-page":"610","DOI":"10.1016\/0377-2217(94)00025-8","article-title":"A result on projection for the vehicle routing problem","volume":"85","author":"Gouveia","year":"1995","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2020.104996_b0100","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1002\/net.10039","article-title":"Shortest-path network interdiction","volume":"40","author":"Israeli","year":"2002","journal-title":"Networks"},{"issue":"2","key":"10.1016\/j.cor.2020.104996_b0105","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1080\/00207543.2015.1084061","article-title":"A bi-level network interdiction model for solving the hazmat routing problem","volume":"54","author":"Kheirkhah","year":"2016","journal-title":"Int. J. Prod. Res."},{"issue":"2","key":"10.1016\/j.cor.2020.104996_b0110","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1109\/TEM.2016.2542849","article-title":"An improved benders decomposition algorithm for an arc interdiction vehicle routing problem","volume":"63","author":"Kheirkhah","year":"2016","journal-title":"IEEE Trans. Eng. Manage."},{"issue":"2","key":"10.1016\/j.cor.2020.104996_b0115","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1002\/net.3230110211","article-title":"Complexity of vehicle routing and scheduling problems","volume":"11","author":"Lenstra","year":"1981","journal-title":"Networks"},{"issue":"3","key":"10.1016\/j.cor.2020.104996_b0120","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1016\/j.orl.2017.02.007","article-title":"Solving the traveling salesman problem with interdiction and fortification","volume":"45","author":"Lozano","year":"2017","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/j.cor.2020.104996_b0125","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/j.cie.2016.11.004","article-title":"A tri-level covering fortification model for facility protection against disturbance in r-interdiction median problem","volume":"102","author":"Mahmoodjanloo","year":"2016","journal-title":"Comput. Ind. Eng."},{"issue":"3","key":"10.1016\/j.cor.2020.104996_b0130","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1002\/nav.3800170302","article-title":"Optimal interdiction of a supply network","volume":"17","author":"McMasters","year":"1970","journal-title":"Nav. Res. Logist. Q"},{"issue":"11","key":"10.1016\/j.cor.2020.104996_b0135","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","article-title":"Variable neighborhood search","volume":"24","author":"Mladenovi\u0107","year":"1997","journal-title":"Comput. Oper. Res."},{"issue":"5","key":"10.1016\/j.cor.2020.104996_b0140","doi-asserted-by":"crossref","first-page":"911","DOI":"10.1287\/opre.38.5.911","article-title":"The mixed integer linear bilevel programming problem","volume":"38","author":"Moore","year":"1990","journal-title":"Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2020.104996_b0145","doi-asserted-by":"crossref","first-page":"905","DOI":"10.1109\/TPWRS.2004.825888","article-title":"Analysis of electric grid security under terrorist threat","volume":"19","author":"Salmeron","year":"2004","journal-title":"IEEE Trans. Power Syst."},{"key":"10.1016\/j.cor.2020.104996_b0150","unstructured":"San Martin, P.A., 2007.Tri-level optimization models to defend critical infrastructure. Master\u2019s thesis, Naval Postgraduate School, Monterey, California. https:\/\/apps.dtic.mil\/docs\/citations\/ADA473701 (accessed 28 March 2020)."},{"issue":"2","key":"10.1016\/j.cor.2020.104996_b0155","doi-asserted-by":"crossref","first-page":"835","DOI":"10.1111\/itor.12669","article-title":"The r-interdiction selective multi-depot vehicle routing problem","volume":"27","author":"Sadati","year":"2020","journal-title":"Int. Trans. Oper Res."},{"issue":"6","key":"10.1016\/j.cor.2020.104996_b0160","doi-asserted-by":"crossref","first-page":"1905","DOI":"10.1016\/j.cor.2006.09.019","article-title":"A bilevel mixed-integer program for critical infrastructure protection planning","volume":"35","author":"Scaparra","year":"2008","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2020.104996_b0165","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1177\/0160017611435357","article-title":"Protecting supply systems to mitigate potential disaster: a model to fortify capacitated facilities","volume":"35","author":"Scaparra","year":"2012","journal-title":"Int. Regional Sci. Rev."},{"issue":"1","key":"10.1016\/j.cor.2020.104996_b0170","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1287\/trsc.1110.0396","article-title":"An adaptive variable neighborhood search algorithm for a vehicle routing problem arising in small package shipping","volume":"47","author":"Stenger","year":"2013","journal-title":"Transp. Sci."},{"issue":"1\u20132","key":"10.1016\/j.cor.2020.104996_b0175","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/s13676-013-0022-4","article-title":"The prize-collecting vehicle routing problem with single and multiple depots and non-linear cost","volume":"2","author":"Stenger","year":"2013","journal-title":"EURO J. Transp. Logist."},{"issue":"4","key":"10.1016\/j.cor.2020.104996_b0180","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1287\/ijoc.15.4.333.24890","article-title":"The granular tabu search and its application to the vehicle-routing problem","volume":"15","author":"Toth","year":"2003","journal-title":"INFORMS J. Comput."},{"key":"10.1016\/j.cor.2020.104996_b0185","series-title":"The Theory of The Market Economy","author":"Von Stackelberg","year":"1952"},{"key":"10.1016\/j.cor.2020.104996_b0190","series-title":"Capacitated VRP Instances. Networking and Emerging Optimization","author":"Web","year":"2019"},{"issue":"6","key":"10.1016\/j.cor.2020.104996_b0195","doi-asserted-by":"crossref","first-page":"934","DOI":"10.1287\/opre.12.6.934","article-title":"Removing arcs from a network","volume":"12","author":"Wollmer","year":"1964","journal-title":"Oper. Res."},{"issue":"4","key":"10.1016\/j.cor.2020.104996_b0200","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1109\/TSMCC.2007.897487","article-title":"Trilevel optimization in power network defense","volume":"37","author":"Yao","year":"2007","journal-title":"IEEE Trans. Syst. Man Cy Part C"}],"container-title":["Computers &amp; Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054820301131?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054820301131?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T07:52:59Z","timestamp":1759650779000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054820301131"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11]]},"references-count":40,"alternative-id":["S0305054820301131"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2020.104996","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2020,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A trilevel r-interdiction selective multi-depot vehicle routing problem with depot protection","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cor.2020.104996","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2020 Elsevier Ltd. All rights reserved.","name":"copyright","label":"Copyright"}],"article-number":"104996"}}