{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T05:33:53Z","timestamp":1777095233462,"version":"3.51.4"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T00:00:00Z","timestamp":1771286400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T00:00:00Z","timestamp":1771286400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Evol. Intel."],"published-print":{"date-parts":[[2026,4]]},"DOI":"10.1007\/s12065-026-01142-1","type":"journal-article","created":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T10:52:23Z","timestamp":1771325543000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Bi-objective location of a semi-desirable line facility and evolutionary solution algorithms"],"prefix":"10.1007","volume":"19","author":[{"given":"Mehdi","family":"Golpayegani","sequence":"first","affiliation":[]},{"given":"Jafar","family":"Fathali","sequence":"additional","affiliation":[]},{"given":"Haleh","family":"Moradi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,2,17]]},"reference":[{"key":"1142_CR1","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1068\/a070163","volume":"7","author":"G Wesolowsky","year":"1975","unstructured":"Wesolowsky G (1975) Location of the median line for weighted points. Environ Plann 7:163\u2013170","journal-title":"Environ Plann"},{"key":"1142_CR2","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/0377-2217(83)90183-2","volume":"12","author":"J Morris","year":"1983","unstructured":"Morris J, Norback J (1983) Linear facility location-solving extensions on the basic problems. Eur J Oper Res 12:90\u201394","journal-title":"Eur J Oper Res"},{"key":"1142_CR3","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/s00521-012-1262-1","volume":"24","author":"M Golpayegani","year":"2014","unstructured":"Golpayegani M, Fathali J, Khosravian E (2014) Median line location problem with positive and negative weights and Euclidean norm. Neural Comput Appl 24:613\u2013619","journal-title":"Neural Comput Appl"},{"key":"1142_CR4","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.cie.2017.04.044","volume":"109","author":"M Golpayegani","year":"2017","unstructured":"Golpayegani M, Fathali J, Moradi H (2017) A particle swarm optimization method for semi-obnoxious line location problem with rectilinear norm. Computers Industrial Eng 109:71\u201378","journal-title":"Computers Industrial Eng"},{"key":"1142_CR5","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0020-0190(85)90015-8","volume":"21","author":"D Lee","year":"1985","unstructured":"Lee D, Cheng Y (1985) The power of geometric duality revisited. Inform Process Lett 21:117\u2013122","journal-title":"Inform Process Lett"},{"key":"1142_CR6","unstructured":"Brimberg J, Juel H, Schoebel A (1999) Properties of three-dimensional median line location models, (2003) Schoebel A, Locating lines and hyperplanes: Theory and algorithms. Springer, Boston."},{"key":"1142_CR38","doi-asserted-by":"crossref","unstructured":"Schoebel A (1999) Locating lines and hyperplanes: theory and algorithms. Springer, Boston.","DOI":"10.1007\/978-1-4615-5321-2"},{"key":"1142_CR7","doi-asserted-by":"publisher","first-page":"1011","DOI":"10.1057\/jors.1989.174","volume":"40","author":"Z Drezner","year":"1989","unstructured":"Drezner Z, Wesolowsky G (1989) Location of an obnoxious route. J Oper Res Soc 40:1011\u20131018","journal-title":"J Oper Res Soc"},{"key":"1142_CR8","doi-asserted-by":"crossref","unstructured":"Chen D, Wang H (2009) Locating an obnoxious line among planar objects. In: International Symposium on Algorithms and Computation, Hawaii.","DOI":"10.1007\/978-3-642-10631-6_75"},{"key":"1142_CR9","unstructured":"Follert F (1995) Maximum location of an Anchored Ray in 3-Space and related problems. In: 7th Canadian Conference on Computational Geometry, Quebec City."},{"key":"1142_CR10","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1142\/S0218195997000351","volume":"7","author":"F Follert","year":"1997","unstructured":"Follert F, Sch\u00f6mer E, Sellen J, Smid M, Thiel C (1997) Computing a largest empty anchored cylinder and related problems. Int J Comput Geom Appl 7:563\u2013580","journal-title":"Int J Comput Geom Appl"},{"key":"1142_CR11","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1287\/trsc.12.3.217","volume":"12","author":"L McGinnis","year":"1978","unstructured":"McGinnis L, White J (1978) A single facility rectilinear location problem with multiple criteria. Transportaion Sci 12:217\u2013231","journal-title":"Transportaion Sci"},{"key":"1142_CR12","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1016\/S0360-8352(00)00022-X","volume":"37","author":"E Melachrinoudis","year":"1999","unstructured":"Melachrinoudis E (1999) Bicriteria location of a semi-obnoxious facility. Computers Industrial Eng 37:581\u2013593","journal-title":"Computers Industrial Eng"},{"key":"1142_CR13","doi-asserted-by":"publisher","first-page":"2191","DOI":"10.1016\/S0305-0548(02)00140-5","volume":"30","author":"E Melachrinoudis","year":"2003","unstructured":"Melachrinoudis E, Xanthopulos Z (2003) Semi-obnoxious single facility location in Euclidean space. Comput Oper Res 30:2191\u20132209","journal-title":"Computers Oper Res"},{"key":"1142_CR14","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/s10479-019-03421-w","volume":"296","author":"R Monemi","year":"2021","unstructured":"Monemi R, Gelareh S, Nagih A, Dylan J (2021) Bi-objective load balancing multiple allocation hub location: a compromise programming approach. Ann Oper Res 296:363\u2013406","journal-title":"Ann Oper Res"},{"key":"1142_CR15","doi-asserted-by":"crossref","unstructured":"S\u00e1nchez-Oro J, L\u00f3pez-S\u00e1nchez A, Colmenar J (2021) A multi-objective parallel variable neighborhood search for the bi-objective obnoxious p-median problem. Optimiz Lett. pp. 1\u201331","DOI":"10.1007\/s11590-020-01690-0"},{"key":"1142_CR16","first-page":"268","volume":"35","author":"C Blum","year":"2003","unstructured":"Blum C, Roli A (2003) Metaheuristics in combinatorial optimization: overview and conceptual comparison. ACM-CSUR 35:268\u2013308","journal-title":"ACM-CSUR"},{"issue":"1","key":"1142_CR17","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1111\/j.1475-3995.2000.tb00182.x","volume":"7","author":"M Ehrgott","year":"2000","unstructured":"Ehrgott M (2000) Approximation algorithms for combinatorial multicriteria optimization problems. Int Trans Oper Res 7(1):5\u201331","journal-title":"Int Trans Oper Res"},{"issue":"1","key":"1142_CR18","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.ejor.2019.10.043","volume":"283","author":"J Alcaraz","year":"2020","unstructured":"Alcaraz J, Landete M, Monge JF, Sainz-Pardo JL (2020) Multi-objective evolutionary algorithms for a reliability location problem. Eur J Oper Res 283(1):83\u201393","journal-title":"Eur J Oper Res"},{"issue":"23","key":"1142_CR19","doi-asserted-by":"publisher","first-page":"12347","DOI":"10.1007\/s00500-019-03774-1","volume":"23","author":"S Atta","year":"2019","unstructured":"Atta S, Sinha Mahapatra PR, Mukhopadhyay A (2019) Multi-objective uncapacitated facility location problem with customers\u2019 preferences: Pareto-based and weighted sum GA-based approaches. Soft Comput 23(23):12347\u201312362","journal-title":"Soft Comput"},{"key":"1142_CR20","doi-asserted-by":"publisher","first-page":"57757","DOI":"10.1109\/ACCESS.2021.3070634","volume":"9","author":"S Verma","year":"2021","unstructured":"Verma S, Pant M, Snasel V (2021) A comprehensive review on NSGA-II for multi-objective combinatorial optimization problems. IEEE Access 9:57757\u201357791","journal-title":"IEEE Access"},{"key":"1142_CR21","doi-asserted-by":"crossref","unstructured":"Maliki F, Dahane M, Souier M, Abdelaziz FB (2021) A Multi-objective based AMOSA approach to the dynamic location of bloodmobiles problem. In: 1st International Conference On Cyber Management And Engineering (CyMaEn). IEEE.","DOI":"10.1109\/CyMaEn50288.2021.9497276"},{"issue":"2","key":"1142_CR22","first-page":"239","volume":"10","author":"D Singh","year":"2019","unstructured":"Singh D, Ingole S (2019) Multi-objective facility layout problems using BBO, NSBBO and NSGA-II metaheuristic algorithms. Int J Ind Eng Comput 10(2):239\u2013262","journal-title":"Int J Ind Eng Comput"},{"key":"1142_CR23","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/j.eswa.2018.02.035","volume":"102","author":"J Liu","year":"2018","unstructured":"Liu J, Zhang H, He K, Jiang S (2018) Multi-objective particle swarm optimization algorithm based on objective space division for the unequal-area facility layout problem. Expert Syst Appl 102:179\u2013192","journal-title":"Expert Syst Appl"},{"key":"1142_CR24","doi-asserted-by":"publisher","first-page":"38870","DOI":"10.1109\/ACCESS.2022.3163287","volume":"10","author":"H Tang","year":"2022","unstructured":"Tang H, Ren S, Jiang W, Chen Q (2022) Optimization of multi-objective unequal area facility layout. IEEE Access 10:38870\u201338884","journal-title":"IEEE Access"},{"issue":"2","key":"1142_CR25","first-page":"99","volume":"14","author":"F Maadanpour Safari","year":"2021","unstructured":"Maadanpour Safari F, Etebari F, Pourghader Chobar A (2021) Modelling and optimization of a tri-objective transportation-location-routing problem considering route reliability: using MOGWO, MOPSO, MOWCA and NSGA-II. J Optim Industrial Eng 14(2):99\u2013114","journal-title":"J Optim Industrial Eng"},{"key":"1142_CR26","doi-asserted-by":"crossref","unstructured":"Gupta H, Amir M, Zaheeruddin F, Ahmad IGM, Alblushi, Khalid HM (2024) Smart transportation solutions for faster emergency medical services response using an enhanced Whale optimization algorithm. IET Intel Transport Syst 18(12):2775\u20132792","DOI":"10.1049\/itr2.12555"},{"key":"1142_CR27","doi-asserted-by":"publisher","first-page":"120590","DOI":"10.1016\/j.renene.2024.120590","volume":"227","author":"AU Rehman","year":"2024","unstructured":"Rehman AU, Ullah Z, Qazi HS, Hasanien HM, Khalid HM (2024) Reinforcement learning-driven proximal policy optimization-based voltage control for PV and WT integrated power system. Renewable Energy 227:120590","journal-title":"Renewable Energy"},{"key":"1142_CR28","doi-asserted-by":"publisher","first-page":"108694","DOI":"10.1016\/j.est.2023.108694","volume":"72","author":"M Amir","year":"2023","unstructured":"Amir M, Deshmukh RG, Khalid HM, Said Z, Raza A, Muyeen SM, Nizami AS, Elavarasan RM, Saidur R, Sopian K (2023) Energy storage technologies: an integrated survey of developments, global economical\/environmental effects, optimal scheduling model, and sustainable adaption policies. J Energy Storage 72:108694","journal-title":"J Energy Storage"},{"key":"1142_CR29","unstructured":"Gandibleux X (2006) Multiple criteria optimization: state of the art annotated bibliographic surveys. Kluwer Academic Publishers, New York."},{"key":"1142_CR30","unstructured":"Eberhart R, Kennedy J (1995) A new optimizer using particle swarm theory. In: Proceedings of the Sixth International Symposium on Micro Machine and Human Science, Nagoya."},{"key":"1142_CR31","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s11721-007-0002-0","volume":"1","author":"R Poli","year":"2007","unstructured":"Poli R, Kennedy J, Blackwell T (2007) Particle swarm optimization: an overview. Swarm Intell 1:33\u201357","journal-title":"Swarm Intell"},{"key":"1142_CR32","doi-asserted-by":"crossref","unstructured":"Ceollo C, Pulido G, Lechuga M (2004) Handling multiple objectives with particle swarm optimization. In: IEEE Trans Evol Comput.","DOI":"10.1109\/TEVC.2004.826067"},{"key":"1142_CR33","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1162\/evco.1994.2.3.221","volume":"2","author":"N Srinivas","year":"1994","unstructured":"Srinivas N, Deb K (1994) Muiltiobjective optimization using nondominated sorting in genetic algorithms. Evolution Comput 2:221\u2013248","journal-title":"Evolution Comput"},{"key":"1142_CR34","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multi-objective genetic algorithm:NSGA-II. IEEE Trans Evol Comput 6:182\u2013197","journal-title":"IEEE Trans Evol Comput"},{"key":"1142_CR35","unstructured":"Van Veldhuizen D (1998) and L. G.B, Evolutionary computation and convergence to a Pareto front. In: Proceeding at the Genetic Programming Conference, Stanford University, California"},{"key":"1142_CR36","unstructured":"Schott J (1995) Fault tolerant design using single and multicriteria genetic algorithm optimization. Master\u2019s Thesis, Department of Aeronautics and Astronautics, Cambridge."},{"key":"1142_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1111\/j.2517-6161.1951.tb00067.x","volume":"13","author":"G Box","year":"1951","unstructured":"Box G, Wilson K (1951) On the experimental attainment of optimum conditions. J Roy Stat Soc B 13:1\u201345","journal-title":"J Roy Stat Soc B"}],"container-title":["Evolutionary Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-026-01142-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12065-026-01142-1","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-026-01142-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T04:34:38Z","timestamp":1777091678000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12065-026-01142-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,17]]},"references-count":38,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,4]]}},"alternative-id":["1142"],"URL":"https:\/\/doi.org\/10.1007\/s12065-026-01142-1","relation":{},"ISSN":["1864-5909","1864-5917"],"issn-type":[{"value":"1864-5909","type":"print"},{"value":"1864-5917","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,17]]},"assertion":[{"value":"22 April 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 June 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 January 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 February 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"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 performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"Informed consent was obtained from all individual participants included in the study.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Informed consent"}}],"article-number":"33"}}