{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T21:27:46Z","timestamp":1775597266261,"version":"3.50.1"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"5-6","license":[{"start":{"date-parts":[[2024,8,31]],"date-time":"2024-08-31T00:00:00Z","timestamp":1725062400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,8,31]],"date-time":"2024-08-31T00:00:00Z","timestamp":1725062400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Ministry of Education and Training in Viet Nam","award":["B2024-TCT-22"],"award-info":[{"award-number":["B2024-TCT-22"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Evol. Intel."],"published-print":{"date-parts":[[2024,10]]},"DOI":"10.1007\/s12065-024-00975-y","type":"journal-article","created":{"date-parts":[[2024,8,31]],"date-time":"2024-08-31T03:44:15Z","timestamp":1725075855000},"page":"4115-4132","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Swarm optimization approaches for the minmax regret Fermat\u2013Weber problem with budgeted-constrained uncertain point weights"],"prefix":"10.1007","volume":"17","author":[{"given":"Huong","family":"Nguyen-Thu","sequence":"first","affiliation":[]},{"given":"Nguyen Thanh","family":"Hung","sequence":"additional","affiliation":[]},{"given":"Nguyen Ngoc Dang","family":"Duy","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,8,31]]},"reference":[{"key":"975_CR1","first-page":"917","volume":"2017","author":"P Anjaly","year":"2017","unstructured":"Anjaly P, Ratnoo A (2017) Fermat-Weber location based multi-agent formation generation using bearings-only information. Am Control Conf (ACC) 2017:917\u2013922","journal-title":"Am Control Conf (ACC)"},{"issue":"1","key":"975_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.disopt.2004.12.001","volume":"2","author":"I Averbakh","year":"2005","unstructured":"Averbakh I, Bereg S (2005) Facility location problems with uncertainty on the plane. Discret Optim 2(1):3\u201334","journal-title":"Discret Optim"},{"key":"975_CR3","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/S0966-8349(98)00033-3","volume":"5","author":"I Averbakh","year":"1997","unstructured":"Averbakh I, Berman O (1997) Minimax regret $$p$$-center location on a network with demand uncertainty. Locat Sci 5:247\u2013254","journal-title":"Locat Sci"},{"key":"975_CR4","doi-asserted-by":"publisher","first-page":"1130","DOI":"10.1287\/opre.28.5.1130","volume":"28","author":"E Balas","year":"1980","unstructured":"Balas E, Zemel E (1980) An algorithm for large zero-one knapsack problems. Oper Res 28:1130\u20131154","journal-title":"Oper Res"},{"key":"975_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10957-014-0586-7","volume":"164","author":"A Beck","year":"2015","unstructured":"Beck A, Sabach S (2015) Weiszfeld\u2019s method: old and new results. J Optim Theory Appl 164:1\u201340","journal-title":"J Optim Theory Appl"},{"key":"975_CR6","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/s101070100286","volume":"92","author":"A Ben-Tal","year":"2002","unstructured":"Ben-Tal A, Arkadi N (2002) Robust optimization - methodology and applications. Math Program 92:453\u2013480","journal-title":"Math Program"},{"key":"975_CR7","doi-asserted-by":"publisher","first-page":"3190","DOI":"10.1016\/j.cma.2007.03.003","volume":"196","author":"HG Beyer","year":"2007","unstructured":"Beyer HG, Sendhoff B (2007) Robust optimization - A comprehensive survey. Comput Methods Appl Mech Eng 196:3190\u20133218","journal-title":"Comput Methods Appl Mech Eng"},{"key":"975_CR8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optim","author":"S Boyd","year":"2004","unstructured":"Boyd S, Vandenberghe L (2004) Convex Optim. Cambridge University Press"},{"key":"975_CR9","doi-asserted-by":"publisher","first-page":"1153","DOI":"10.1287\/opre.41.6.1153","volume":"41","author":"J Brimberg","year":"1993","unstructured":"Brimberg J, Love RF (1993) Global convergence of a generalized iterative procedure for the minisum location problem with $$l_p$$ distances. Oper Res 41:1153\u20131163","journal-title":"Oper Res"},{"key":"975_CR10","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/S0377-2217(96)00066-5","volume":"97","author":"E Carrizosa","year":"1997","unstructured":"Carrizosa E, Rodr\u00edguez-Ch\u00eda AM (1997) Weber problems with alternative transportation systems. Eur J Oper Res 97:87\u201393","journal-title":"Eur J Oper Res"},{"key":"975_CR11","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1016\/0377-2217(85)90006-2","volume":"20","author":"R Durier","year":"1985","unstructured":"Durier R, Michelot C (1985) Geometrical properties of the Fermat-Weber problem. Eur J Oper Res 20:332\u2013343","journal-title":"Eur J Oper Res"},{"key":"975_CR12","unstructured":"Eberhart R, Shi Y (2001) Tracking and optimizing dynamic systems with particle swarms, Proc. Congress on Evolutionary Computation, Seoul, Korea"},{"key":"975_CR13","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1016\/j.camwa.2009.07.007","volume":"59","author":"IN Katz","year":"2010","unstructured":"Katz IN, Vogl SR (2010) A Weiszfeld algorithm for the solution of an asymmetric extension of the generalized Fermat location problem. Comput Math Appl 59:399\u2013410","journal-title":"Comput Math Appl"},{"key":"975_CR14","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1111\/j.1467-9787.1962.tb00902.x","volume":"4","author":"HW Kuhn","year":"1962","unstructured":"Kuhn HW, Kuenne RE (1962) An efficient algorithm for the numerical solution of the generalized weber problem in spatial economics. J Reg Sci 4:21\u201334","journal-title":"J Reg Sci"},{"key":"975_CR15","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1023\/A:1018333422414","volume":"10","author":"Y Li","year":"1998","unstructured":"Li Y (1998) A newton acceleration of the Weiszfeld algorithm for minimizing the sum of euclidean distances. Comput Optim Appl 10:219\u2013242","journal-title":"Comput Optim Appl"},{"key":"975_CR16","unstructured":"Higashikawa Y et al (2013) Minimax regret 1-sink location problems in dynamic path networks. In: Chan TH.H., Lau L.C., Trevisan L. (eds) Theory and Applications of Models of Computation. TAMC 2013. Lecture Notes in Computer Science, vol 7876. Springer, Berlin, Heidelberg"},{"key":"975_CR17","doi-asserted-by":"crossref","unstructured":"Inuiguchi M, Kume Y (1994) Minimax regret in linear programming problems with an interval objective function. In: G.H. Tzeng and H.F. Wang and U.P. Wen and P.L. Yu (eds) Multiple Criteria Decision Making. Springer, New York, NY","DOI":"10.1007\/978-1-4612-2666-6_8"},{"key":"975_CR18","doi-asserted-by":"publisher","unstructured":"Garc\u00eda J, Pe\u00f1a A (2018) Robust optimization: concepts and applications, nature-inspired methods for stochastic, robust and dynamic optimization. Javier Del Ser and Eneko Osaba, IntechOpen, https:\/\/doi.org\/10.5772\/intechopen.75381","DOI":"10.5772\/intechopen.75381"},{"key":"975_CR19","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s10957-016-0946-6","volume":"170","author":"S G\u00f6rner","year":"2016","unstructured":"G\u00f6rner S, Kanzow C (2016) On Newton\u2019s method for the Fermat-Weber location problem. J Optim Theory Appl 170:107\u2013118","journal-title":"J Optim Theory Appl"},{"key":"975_CR20","unstructured":"Kennedy J, Eberhart R(1995) Particle swarm optimization. Proc. IEEE International Conf. on Neural Networks (Perth, Australia), IEEE Service Center,Piscataway, NJ"},{"key":"975_CR21","doi-asserted-by":"crossref","unstructured":"Liu X et al (2009) Particle swarm optimization with dynamic inertia weight and mutation. In Third International Conference on Genetic and Evolutionary Computing, Guilin, 620-623","DOI":"10.1109\/WGEC.2009.99"},{"key":"975_CR22","volume":"407","author":"KT Nguyen","year":"2021","unstructured":"Nguyen KT, Hung NT (2021) The minmax regret inverse maximum weight problem. Appl Math Comput 407:126328","journal-title":"Appl Math Comput"},{"key":"975_CR23","doi-asserted-by":"crossref","unstructured":"Pant M, Thangaraj T, Singh VP (2007) Particle swarm optimization using Gaussian inertia weight. In International Conference on Computational Intelligence and Multimedia Applications, Sivakasi, Tamil Nadu, 97-102","DOI":"10.1109\/ICCIMA.2007.96"},{"key":"975_CR24","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1002\/net.20453","volume":"58","author":"J Puerto","year":"2011","unstructured":"Puerto J, Riccaa F, Scozzari A (2011) Minimax regret path location on trees. Networks 58:147\u2013158","journal-title":"Networks"},{"key":"975_CR25","first-page":"49","volume":"97","author":"R Sturm","year":"1884","unstructured":"Sturm R (1884) \u00dcber den Punkt kleinster Entfernungssumme von gegebenen Punkten (In German). J f\u00fcr die reine und angewandte Mathematik 97:49\u201361","journal-title":"J f\u00fcr die reine und angewandte Mathematik"},{"key":"975_CR26","doi-asserted-by":"crossref","unstructured":"Chu SC, Tsai Pw, Pan JS (2006) Cat Swarm Optimization. In: Yang, Q., Webb, G. (eds) PRICAI 2006: Trends in Artificial Intelligence. PRICAI 2006. Lecture Notes in Computer Science 4099. Springer, Berlin, Heidelberg","DOI":"10.1007\/978-3-540-36668-3_94"},{"key":"975_CR27","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.advengsoft.2013.12.007","volume":"69","author":"S Mirjalili","year":"2014","unstructured":"Mirjalili S, Mirjalili SM, Lewis A (2014) Grey Wolf Optimizer. Adv Eng Softw 69:46\u201361","journal-title":"Adv Eng Softw"},{"issue":"6","key":"975_CR28","doi-asserted-by":"publisher","first-page":"793","DOI":"10.1068\/a240793","volume":"24","author":"LN Tellier","year":"1992","unstructured":"Tellier LN (1992) From the Weber problem to a \u2018topodynamic\u2019 approach to locational systems. Environ Plan: A Econ Space 24(6):793\u2013806","journal-title":"Environ Plan: A Econ Space"},{"key":"975_CR29","unstructured":"Weber A (1909) \u00dcber den Standort der Industrien, Erster Teil: Reine Theorie des Standortes (in German). T\u00fcbingen: Mohr"},{"key":"975_CR30","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/s10479-008-0352-z","volume":"167","author":"E Weiszfeld","year":"2009","unstructured":"Weiszfeld E, Plastria F (2009) On the point for which the sum of the distances to n given points is minimum. Ann Oper Res 167:7\u201341","journal-title":"Ann Oper Res"},{"key":"975_CR31","first-page":"5","volume":"1","author":"G Wesolowsky","year":"1993","unstructured":"Wesolowsky G (1993) The Weber problem: History and perspective. Locat Sci 1:5\u201323","journal-title":"Locat Sci"},{"key":"975_CR32","doi-asserted-by":"crossref","unstructured":"Xia L, Chu J, Geng Z (2012) MPSO-Based operational conditions optimization in chemical process: A Case Study. In: J. Lei and F.L. Wang and H. Deng and D. Miao (eds), Artificial Intelligence and Computational Intelligence. AICI. Lecture Notes in Computer Science, vol 7530. Springer, Berlin, Heidelberg","DOI":"10.1007\/978-3-642-33478-8_83"},{"key":"975_CR33","doi-asserted-by":"publisher","unstructured":"Yang XS (2010) A New Metaheuristic Bat-Inspired Algorithm. In: Gonz\u00e1lez JR, Pelta DA, Cruz C, Terrazas G, Krasnogor N (eds) Nature Inspired Cooperative Strategies for Optimization (NICSO 2010). Studies in Computational Intelligence, vol 284. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/978-3-642-12538-6_6","DOI":"10.1007\/978-3-642-12538-6_6"},{"key":"975_CR34","doi-asserted-by":"crossref","unstructured":"Zhang L, Yu H, Hu S (2003) A new approach to improve particle swarm optimization. In Proceedings of the 2003 International Conference on Genetic and Evolutionary Computation, 134-139","DOI":"10.1007\/3-540-45105-6_12"},{"key":"975_CR35","unstructured":"https:\/\/vnexpress.net\/cong-suat-khai-thac-cua-22-san-bay-viet-nam-4018578.html (accessed on 28.09.2021)"}],"container-title":["Evolutionary Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-024-00975-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12065-024-00975-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-024-00975-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,19]],"date-time":"2024-10-19T06:21:49Z","timestamp":1729318909000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12065-024-00975-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,31]]},"references-count":35,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2024,10]]}},"alternative-id":["975"],"URL":"https:\/\/doi.org\/10.1007\/s12065-024-00975-y","relation":{},"ISSN":["1864-5909","1864-5917"],"issn-type":[{"value":"1864-5909","type":"print"},{"value":"1864-5917","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,8,31]]},"assertion":[{"value":"29 March 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 July 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 August 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 August 2024","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"}}]}}