{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,15]],"date-time":"2026-06-15T23:13:52Z","timestamp":1781565232128,"version":"3.54.5"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,9,4]],"date-time":"2022-09-04T00:00:00Z","timestamp":1662249600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,9,4]],"date-time":"2022-09-04T00:00:00Z","timestamp":1662249600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"DST-PURSE"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2023,2]]},"DOI":"10.1007\/s00500-022-07448-3","type":"journal-article","created":{"date-parts":[[2022,9,4]],"date-time":"2022-09-04T06:03:24Z","timestamp":1662271404000},"page":"1493-1509","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["An improved genetic algorithm with local refinement for solving hierarchical single-allocation hub median facility location problem"],"prefix":"10.1007","volume":"27","author":[{"given":"Arup Kumar","family":"Bhattacharjee","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8128-3521","authenticated-orcid":false,"given":"Anirban","family":"Mukhopadhyay","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,9,4]]},"reference":[{"issue":"1","key":"7448_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2007.06.008","volume":"190","author":"S Alumur","year":"2008","unstructured":"Alumur S, Kara BY (2008) Network hub location problems: the state of the art. Eur J Oper Res 190(1):1\u201321","journal-title":"Eur J Oper Res"},{"issue":"6","key":"7448_CR2","doi-asserted-by":"publisher","first-page":"1107","DOI":"10.1016\/j.tre.2012.04.001","volume":"48","author":"SA Alumur","year":"2012","unstructured":"Alumur SA, Yaman H, Kara BY (2012) Hierarchical multimodal hub location problem with time-definite deliveries. Transport Res Part E Logist Transport Rev 48(6):1107\u20131120","journal-title":"Transport Res Part E Logist Transport Rev"},{"key":"7448_CR3","doi-asserted-by":"crossref","unstructured":"Atta S, Sinha Mahapatra PR, Mukhopadhyay A (2018) Deterministic and randomized heuristic algorithms for uncapacitated facility location problem. In: Information and decision sciences, pp 205\u2013216. Springer","DOI":"10.1007\/978-981-10-7563-6_22"},{"issue":"12","key":"7448_CR4","doi-asserted-by":"publisher","first-page":"3891","DOI":"10.1007\/s00500-017-2598-3","volume":"22","author":"S Atta","year":"2018","unstructured":"Atta S, Mahapatra PRS, Mukhopadhyay A (2018) Solving maximal covering location problem using genetic algorithm with local refinement. Soft Comput 22(12):3891\u20133906","journal-title":"Soft Comput"},{"issue":"2","key":"7448_CR5","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1016\/0377-2217(94)90318-2","volume":"72","author":"JF Campbell","year":"1994","unstructured":"Campbell JF (1994) Integer programming formulations of discrete hub location problems. Eur J Oper Res 72(2):387\u2013405","journal-title":"Eur J Oper Res"},{"issue":"1","key":"7448_CR6","first-page":"347","volume":"6","author":"S Davari","year":"2012","unstructured":"Davari S, Zar MHF et al (2012) The single-allocation hierarchical hub median location problem with fuzzy demands. Afr J Bus Manage 6(1):347\u2013360","journal-title":"Afr J Bus Manage"},{"key":"7448_CR7","volume-title":"Facility location: applications and theory","author":"Z Drezner","year":"2001","unstructured":"Drezner Z, Hamacher HW (2001) Facility location: applications and theory. Springer, Cham"},{"key":"7448_CR8","unstructured":"Goldberg DE, Holland JH (1988) Genetic algorithms and machine learning"},{"issue":"4","key":"7448_CR9","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1287\/trsc.3.4.352","volume":"3","author":"AJ Goldman","year":"1969","unstructured":"Goldman AJ (1969) Optimal locations for centers in a network. Transp Sci 3(4):352\u2013360","journal-title":"Transp Sci"},{"issue":"12","key":"7448_CR10","doi-asserted-by":"publisher","first-page":"3087","DOI":"10.1016\/j.cor.2009.03.015","volume":"36","author":"HW Hamacher","year":"2009","unstructured":"Hamacher HW, Meyer T (2009) New developments on hub location. Comput Oper Res 36(12):3087","journal-title":"Comput Oper Res"},{"issue":"6","key":"7448_CR11","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1016\/S0305-0548(01)00021-1","volume":"29","author":"JH Jaramillo","year":"2002","unstructured":"Jaramillo JH, Bhadury J, Batta R (2002) On the use of genetic algorithms to solve location problems. Comput Oper Res 29(6):761\u2013779","journal-title":"Comput Oper Res"},{"key":"7448_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21341-5","volume-title":"Modeling discrete competitive facility location","author":"A Karakitsiou","year":"2015","unstructured":"Karakitsiou A (2015) Modeling discrete competitive facility location. Springer, Cham"},{"issue":"10","key":"7448_CR13","doi-asserted-by":"publisher","first-page":"941","DOI":"10.1057\/jors.1989.163","volume":"40","author":"GK Rand","year":"1989","unstructured":"Rand GK (1989) Facilities location: models and methods. J Oper Res Soc 40(10):941\u2013942","journal-title":"J Oper Res Soc"},{"issue":"8","key":"7448_CR14","doi-asserted-by":"publisher","first-page":"5330","DOI":"10.1016\/j.asoc.2011.05.026","volume":"11","author":"M Rezaei","year":"2011","unstructured":"Rezaei M, Zarandi MHF (2011) Facility location via fuzzy modeling and simulation. Appl Soft Comput 11(8):5330\u20135340","journal-title":"Appl Soft Comput"},{"issue":"8","key":"7448_CR15","doi-asserted-by":"publisher","first-page":"2310","DOI":"10.1016\/j.cor.2005.09.005","volume":"34","author":"G \u015eahin","year":"2007","unstructured":"\u015eahin G, S\u00fcral H (2007) A review of hierarchical facility location models. Comput Oper Res 34(8):2310\u20132331","journal-title":"Comput Oper Res"},{"issue":"3","key":"7448_CR16","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1016\/0377-2217(95)00100-X","volume":"94","author":"D Skorin-Kapov","year":"1996","unstructured":"Skorin-Kapov D, Skorin-Kapov J, O\u2019Kelly M (1996) Tight linear programming relaxations of uncapacitated p-hub median problems. Eur J Oper Res 94(3):582\u2013593","journal-title":"Eur J Oper Res"},{"issue":"6","key":"7448_CR17","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1016\/j.trb.2009.01.005","volume":"43","author":"H Yaman","year":"2009","unstructured":"Yaman H (2009) The hierarchical hub median problem with single assignment. Transport Res Part B Methodol 43(6):643\u2013658","journal-title":"Transport Res Part B Methodol"},{"issue":"3","key":"7448_CR18","first-page":"1203","volume":"22","author":"MHF Zarandi","year":"2015","unstructured":"Zarandi MHF, Davari S, Sisakht SAH (2015) An empirical comparison of simulated annealing and iterated local search for the hierarchical single allocation hub median location problem. Scientia Iranica Trans E Ind Eng 22(3):1203","journal-title":"Scientia Iranica Trans E Ind Eng"},{"issue":"6","key":"7448_CR19","doi-asserted-by":"publisher","first-page":"1564","DOI":"10.1016\/j.scient.2011.11.008","volume":"18","author":"MHF Zarandi","year":"2011","unstructured":"Zarandi MHF, Davari S, Sisakht SAH (2011) The large scale maximal covering location problem. Scientia Iranica 18(6):1564\u20131570","journal-title":"Scientia Iranica"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-022-07448-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-022-07448-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-022-07448-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T07:10:02Z","timestamp":1674803402000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-022-07448-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,4]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,2]]}},"alternative-id":["7448"],"URL":"https:\/\/doi.org\/10.1007\/s00500-022-07448-3","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9,4]]},"assertion":[{"value":"25 July 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 September 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}