{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T01:29:45Z","timestamp":1768440585580,"version":"3.49.0"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,11,26]],"date-time":"2021-11-26T00:00:00Z","timestamp":1637884800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,11,26]],"date-time":"2021-11-26T00:00:00Z","timestamp":1637884800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2022,2]]},"DOI":"10.1007\/s00500-021-06463-0","type":"journal-article","created":{"date-parts":[[2021,11,26]],"date-time":"2021-11-26T13:02:35Z","timestamp":1637931755000},"page":"1941-1959","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A modified directional bat algorithm for extensive inverse p-facility maxian location problems on networks"],"prefix":"10.1007","volume":"26","author":[{"given":"Sepideh","family":"Mohammadi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5726-2843","authenticated-orcid":false,"given":"Behrooz","family":"Alizadeh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fahimeh","family":"Baroughi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Esmaeil","family":"Afrashteh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,11,26]]},"reference":[{"key":"6463_CR1","doi-asserted-by":"crossref","unstructured":"Afrashteh E, Alizadeh B, Baroughi F, Nguyen KT (2018) Linear time optimal approaches for max-profit inverse 1-median location problems. Asia-Pac J Oper Res 35:1850030 (22 pages)","DOI":"10.1142\/S0217595918500306"},{"key":"6463_CR2","doi-asserted-by":"publisher","first-page":"1213","DOI":"10.1080\/10556788.2018.1482296","volume":"34","author":"E Afrashteh","year":"2019","unstructured":"Afrashteh E, Alizadeh B, Baroughi F (2019) Optimal algorithms for selective variants of the classical and inverse median location problems on trees. Optim Methods Softw 34:1213\u20131230","journal-title":"Optim Methods Softw"},{"key":"6463_CR3","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/s40305-018-0229-z","volume":"9","author":"E Afrashteh","year":"2021","unstructured":"Afrashteh E, Alizadeh B, Baroughi F (2021) Optimal algorithms for integer inverse undesirable $$p$$-median location problems on weighted extended star networks. Oper Res Soc China 9:99\u2013117","journal-title":"Oper Res Soc China"},{"key":"6463_CR4","first-page":"125078","volume":"375","author":"B Alizadeh","year":"2020","unstructured":"Alizadeh B, Afrashteh E (2020) Budget-constrained inverse median facility location problem on tree networks. Appl Math Comput 375:125078","journal-title":"Appl Math Comput"},{"key":"6463_CR5","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1007\/s12597-016-0296-z","volume":"54","author":"B Alizadeh","year":"2017","unstructured":"Alizadeh B, Bakhteh S (2017) A modified firefly algorithm for general inverse $$p$$-median location problems under different distance norms. Opsearch 54:618\u2013636","journal-title":"Opsearch"},{"key":"6463_CR6","doi-asserted-by":"publisher","first-page":"914","DOI":"10.1007\/s10957-018-1334-1","volume":"178","author":"B Alizadeh","year":"2018","unstructured":"Alizadeh B, Afrashteh E, Baroughi F (2018) Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks. J Optim Theory Appl 178:914\u2013934","journal-title":"J Optim Theory Appl"},{"key":"6463_CR7","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.tcs.2018.11.020","volume":"772","author":"B Alizadeh","year":"2019","unstructured":"Alizadeh B, Afrashteh E, Baroughi F (2019) Inverse obnoxious $$p$$-median location problems on trees with edge length modifications under different norms. Theor Comput Sci 772:73\u201387","journal-title":"Theor Comput Sci"},{"key":"6463_CR8","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s10100-009-0114-2","volume":"18","author":"FB Bonab","year":"2010","unstructured":"Bonab FB, Burkard RE, Alizadeh B (2010) Inverse median location problems with variable coordinates. Cent Eur J Oper Res 18:365\u2013381","journal-title":"Cent Eur J Oper Res"},{"key":"6463_CR9","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s00186-011-0346-5","volume":"73","author":"FB Bonab","year":"2011","unstructured":"Bonab FB, Burkard RE, Gassner E (2011) Inverse $$p$$-median problems with variable edge lengths. Math Methods Oper Res 73:263\u2013280","journal-title":"Math Methods Oper Res"},{"key":"6463_CR10","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.disopt.2004.03.003","volume":"1","author":"RE Burkard","year":"2004","unstructured":"Burkard RE, Pleschiutsching C, Zhang J (2004) Inverse median problems. Discrete Optim 1:23\u201339","journal-title":"Discrete Optim"},{"key":"6463_CR11","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1016\/j.disopt.2006.11.008","volume":"5","author":"RE Burkard","year":"2008","unstructured":"Burkard RE, Pleschiutsching C, Zhang J (2008) The inverse 1-median problem on a cycle. Discrete Optim 5:242\u2013253","journal-title":"Discrete Optim"},{"key":"6463_CR12","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.ejor.2010.01.046","volume":"206","author":"RE Burkard","year":"2010","unstructured":"Burkard RE, Galavii M, Gassner E (2010) The inverse Fermat\u2013Weber problem. Eur J Oper Res 206:11\u201317","journal-title":"Eur J Oper Res"},{"key":"6463_CR13","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.eswa.2016.10.050","volume":"69","author":"A Chakri","year":"2017","unstructured":"Chakri A, Khelif R, Benouaret M, Yang X-S (2017) New directional bat algorithm for continuous optimization problems. Expert Syst Appl 69:159\u2013175","journal-title":"Expert Syst Appl"},{"key":"6463_CR14","doi-asserted-by":"publisher","first-page":"114812","DOI":"10.1016\/j.eswa.2021.114812","volume":"175","author":"MR Chen","year":"2021","unstructured":"Chen MR, Huang YY, Zeng GQ, Lu KD, Yang LQ (2021) An improved bat algorithm hybridized with extremal optimization and Boltzmann selection. Expert Syst Appl 175:114812","journal-title":"Expert Syst Appl"},{"key":"6463_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-7572-0","volume-title":"Foundation of location analysis","author":"HA Eiselt","year":"2011","unstructured":"Eiselt HA, Marianov V (2011) Foundation of location analysis. Springer, New York"},{"key":"6463_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7908-2151-2","volume-title":"Facility location: concepts, models, algorithms and case studies","author":"RZ Farahani","year":"2009","unstructured":"Farahani RZ, Hekmatfar M (2009) Facility location: concepts, models, algorithms and case studies. Physica Verlag, Berlin"},{"key":"6463_CR17","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/s10878-007-9098-9","volume":"16","author":"E Gassner","year":"2008","unstructured":"Gassner E (2008) The inverse 1-maxian problem with edge length modification. J Comb Optim 16:50\u201367","journal-title":"J Comb Optim"},{"key":"6463_CR18","first-page":"137","volume":"9","author":"M Gholami","year":"2021","unstructured":"Gholami M, Fathali J (2021) Mathematical models for the variable weights version of the inverse minimax circle location problem. J Math Model 9:137\u2013144","journal-title":"J Math Model"},{"key":"6463_CR19","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s10898-011-9742-x","volume":"54","author":"XC Guan","year":"2012","unstructured":"Guan XC, Zhang BW (2012) Inverse 1-median problem on trees under weighted Hamming distance. J Glob Optim 54:75\u201382","journal-title":"J Glob Optim"},{"key":"6463_CR20","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.disopt.2012.05.001","volume":"9","author":"J Hatzl","year":"2012","unstructured":"Hatzl J (2012) 2-Balanced flows and the inverse 1-median problem in the Chebyshev space. Discrete Optim 9:137\u2013148","journal-title":"Discrete Optim"},{"key":"6463_CR21","volume-title":"Discrete location theory","author":"PB Mirchandani","year":"1990","unstructured":"Mirchandani PB, Francis RL (1990) Discrete location theory. Wiley, New York"},{"key":"6463_CR22","first-page":"447","volume":"32","author":"I Mirzapolis","year":"2017","unstructured":"Mirzapolis I, Baroughi F, Alizadeh B (2017) A modified firefly algorithm for general inverse p-median location problems under different distance norms. Fact Univ Ser Math Inform 32:447\u2013468","journal-title":"Fact Univ Ser Math Inform"},{"key":"6463_CR23","first-page":"63","volume":"15","author":"M Nazari","year":"2018","unstructured":"Nazari M, Fathali J (2018) Reverse backup 2-median problem with variable coordinate of vertices. J Oper Res Appl 15:63\u201388 (in Persian)","journal-title":"J Oper Res Appl"},{"key":"6463_CR24","doi-asserted-by":"publisher","first-page":"944","DOI":"10.1007\/s10957-015-0829-2","volume":"168","author":"KT Nguyen","year":"2016","unstructured":"Nguyen KT (2016) Inverse 1-median problem on block graphs with variable vertex weights. J Optim Theory Appl 168:944\u2013957","journal-title":"J Optim Theory Appl"},{"key":"6463_CR25","doi-asserted-by":"publisher","first-page":"513","DOI":"10.7494\/OpMath.2016.36.4.513","volume":"36","author":"KT Nguyen","year":"2016","unstructured":"Nguyen KT, Chi NTL (2016) A model for the inverse 1-median problem on trees under uncertain costs. Opusc Math 36:513\u2013523","journal-title":"Opusc Math"},{"key":"6463_CR26","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s10479-020-03651-3","volume":"292","author":"T Nguyen","year":"2020","unstructured":"Nguyen T, Hung NT (2020) The inverse connected $$p$$-median problem on block graphs under various cost functions. Ann Oper Res 292:97-112","journal-title":"Ann Oper Res"},{"key":"6463_CR27","doi-asserted-by":"publisher","first-page":"1437","DOI":"10.11650\/tjm.20.2016.6296","volume":"20","author":"KT Nguyen","year":"2016","unstructured":"Nguyen KT, Vui PT (2016) The inverse $$p$$-maxian problem on trees with variable edge lengths. Taiwan J Math 20:1437\u20131449","journal-title":"Taiwan J Math"},{"key":"6463_CR28","doi-asserted-by":"crossref","first-page":"221","DOI":"10.3934\/jimo.2019108","volume":"17","author":"T Nguyen","year":"2021","unstructured":"Nguyen T, Hieu VNM, Pham VH (2021) Inverse group 1-median problem on trees. J Ind Manag Optim 17:221\u2013232","journal-title":"J Ind Manag Optim"},{"key":"6463_CR29","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.tcs.2019.05.039","volume":"795","author":"VH Phama","year":"2019","unstructured":"Phama VH, Nguyen KT (2019) Inverse 1-median problem on trees under mixed rectilinear and Chebyshev norms. Theor Comput Sci 795:119\u2013127","journal-title":"Theor Comput Sci"},{"key":"6463_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s12597-018-0348-7","volume":"56","author":"AR Sepasian","year":"2019","unstructured":"Sepasian AR (2019) Reverse 1-maxian problem keeping existing 1-median. Opsearch 56:1\u201313","journal-title":"Opsearch"},{"key":"6463_CR31","first-page":"595","volume":"64","author":"AR Sepasian","year":"2015","unstructured":"Sepasian AR, Rahbarnia F (2015) An $$ {\\cal{O}}(n \\log n) $$ algorithm for the inverse 1-median problem on trees with variable vertex weights and edge reductions. Optimization 64:595\u2013602","journal-title":"Optimization"},{"key":"6463_CR32","doi-asserted-by":"publisher","first-page":"7843","DOI":"10.1007\/s00500-018-3416-2","volume":"23","author":"A Soltanpour","year":"2019","unstructured":"Soltanpour A, Baroughi F, Alizadeh B (2019) Intuitionistic fuzzy inverse 1-median location problem on tree networks with value at risk objective. Soft Comput 23:7843\u20137852","journal-title":"Soft Comput"},{"key":"6463_CR33","first-page":"1187","volume":"68","author":"U Wimer","year":"2019","unstructured":"Wimer U, Wimer S (2019) Resource allocation in rooted trees for VLSI applications. Optimization 68:1187\u20131201","journal-title":"Optimization"},{"key":"6463_CR34","first-page":"65","volume":"284","author":"XS Yang","year":"2010","unstructured":"Yang XS (2010) A new metaheuristic bat-inspired algorithm. Nat Inspired Coop Strateg Optim 284:65\u201374","journal-title":"Nat Inspired Coop Strateg Optim"},{"key":"6463_CR35","doi-asserted-by":"publisher","first-page":"112949","DOI":"10.1016\/j.eswa.2019.112949","volume":"141","author":"G Yildizdan","year":"2020","unstructured":"Yildizdan G, Baykan \u00d6K (2020) A novel modified bat algorithm hybridizing by differential evolution algorithm. Expert Syst Appl 141:112949","journal-title":"Expert Syst Appl"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-021-06463-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-021-06463-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-021-06463-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,16]],"date-time":"2023-01-16T11:30:59Z","timestamp":1673868659000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-021-06463-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,26]]},"references-count":35,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,2]]}},"alternative-id":["6463"],"URL":"https:\/\/doi.org\/10.1007\/s00500-021-06463-0","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,11,26]]},"assertion":[{"value":"19 October 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 November 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}