{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T08:45:40Z","timestamp":1770972340625,"version":"3.50.1"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"23","license":[{"start":{"date-parts":[[2018,8,17]],"date-time":"2018-08-17T00:00:00Z","timestamp":1534464000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61703183"],"award-info":[{"award-number":["61703183"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61773410"],"award-info":[{"award-number":["61773410"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004731","name":"Natural Science Foundation of Zhejiang Province","doi-asserted-by":"publisher","award":["LY15F020039"],"award-info":[{"award-number":["LY15F020039"]}],"id":[{"id":"10.13039\/501100004731","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004731","name":"Natural Science Foundation of Zhejiang Province","doi-asserted-by":"publisher","award":["LY15F030021"],"award-info":[{"award-number":["LY15F030021"]}],"id":[{"id":"10.13039\/501100004731","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1007\/s00500-018-3462-9","type":"journal-article","created":{"date-parts":[[2018,8,17]],"date-time":"2018-08-17T09:19:51Z","timestamp":1534497591000},"page":"7787-7796","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A comparative performance analysis of evolutionary algorithms on $${\\varvec{k}}$$ k -median and facility location problems"],"prefix":"10.1007","volume":"22","author":[{"given":"Xue","family":"Peng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7922-3343","authenticated-orcid":false,"given":"Xiaoyun","family":"Xia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rong","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lei","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huimin","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pei","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,17]]},"reference":[{"key":"3462_CR1","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1016\/j.asoc.2017.03.022","volume":"66","author":"M Al-Ayyoub","year":"2018","unstructured":"Al-Ayyoub M, Rabab\u2019Ah A, Jararweh Y, Al-Kabi MN, Gupta BB (2018) Studying the controversy in online crowds\u2019 interactions. Appl Soft Comput 66:557\u2013563","journal-title":"Appl Soft Comput"},{"issue":"3","key":"3462_CR2","first-page":"35","volume":"5","author":"MA Alzain","year":"2015","unstructured":"Alzain MA, Li AS, Soh B (2015) Multi-cloud data management using Shamir\u2019s secret sharing and quantum byzantine agreement schemes. Int J Cloud Appl Comput 5(3):35\u201352","journal-title":"Int J Cloud Appl Comput"},{"issue":"3","key":"3462_CR3","first-page":"21","volume":"33","author":"V Arya","year":"2004","unstructured":"Arya V, Garg N, Khandekar R (2004) Local search heuristic for $$k$$ k -median and facility location problems. SIAM J Sci Comput 33(3):21\u201329","journal-title":"SIAM J Sci Comput"},{"key":"3462_CR4","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195099713.001.0001","volume-title":"Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming","author":"T B\u00e4ck","year":"1996","unstructured":"B\u00e4ck T (1996) Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming. Oxford University Press, Oxford"},{"issue":"1\u20134","key":"3462_CR5","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/s00170-010-2622-6","volume":"51","author":"R Bhattacharya","year":"2010","unstructured":"Bhattacharya R, Bandyopadhyay S (2010) Solving conflicting bi-objective facility location problem by NSGA II evolutionary algorithm. Int J Adv Manuf Technol 51(1\u20134):397\u2013414","journal-title":"Int J Adv Manuf Technol"},{"key":"3462_CR6","doi-asserted-by":"crossref","unstructured":"Charikar M, Guha S (1999) Improved combinatorial algorithms for the facility location and $$k$$ k -median problems. In: Foundations of computer science annual symposium on, New York, USA, pp 378\u2013388","DOI":"10.1109\/SFFCS.1999.814609"},{"issue":"2","key":"3462_CR7","first-page":"654","volume":"97","author":"M Chrobak","year":"2005","unstructured":"Chrobak M, Kenyon C, Young NE (2005) The reverse greedy algorithm for the metric $$k$$ k -median problem. Inform Process Lett 97(2):654\u2013660","journal-title":"Inform Process Lett"},{"issue":"3","key":"3462_CR8","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1287\/opre.11.3.331","volume":"11","author":"L Cooper","year":"1963","unstructured":"Cooper L (1963) Location-allocation problems. Oper Res 11(3):331\u2013343","journal-title":"Oper Res"},{"key":"3462_CR9","doi-asserted-by":"crossref","unstructured":"Doerr B, Happ E, Klein C (2007) A tight analysis of the $$(1{+}1)$$ ( 1 + 1 ) -EA for the single source shortest path problem. In: Proceedings of the IEEE congress on evolutionary computation. Singapore, pp 1890\u20131895","DOI":"10.1109\/CEC.2007.4424704"},{"issue":"1","key":"3462_CR10","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/S0304-3975(01)00182-7","volume":"276","author":"S Droste","year":"2002","unstructured":"Droste S, Jansen T, Wegener I (2002) On the analysis of the $$(1{+}1)$$ ( 1 + 1 ) evolutionary algorithm. Theor Comput Sci 276(1):51\u201381","journal-title":"Theor Comput Sci"},{"issue":"1\u20132","key":"3462_CR11","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/S0304-3975(01)00182-7","volume":"276","author":"S Droste","year":"2002","unstructured":"Droste S, Jansen T, Wegener I (2002) On the analysis of the $$(1{+}1)$$ ( 1 + 1 ) evolutionary algorithm. Theor Comput Sci 276(1\u20132):51\u201381","journal-title":"Theor Comput Sci"},{"issue":"82","key":"3462_CR12","first-page":"14","volume":"15","author":"O Giel","year":"2003","unstructured":"Giel O, Wegener I (2003) Evolutionary algorithms and the maximum matching problem. Inform Process Lett 15(82):14\u201319","journal-title":"Inform Process Lett"},{"issue":"18","key":"3462_CR13","doi-asserted-by":"publisher","first-page":"5413","DOI":"10.1007\/s00500-016-2130-1","volume":"21","author":"P He","year":"2017","unstructured":"He P, Deng ZL, Gao CZ, Wang XN, Li J (2017) Model approach to grammatical evolution: deep-structured analyzing of model and representation. Soft Comput 21(18):5413\u20135423","journal-title":"Soft Comput"},{"key":"3462_CR14","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-642-03246-2_12","volume":"5666","author":"T Jansen","year":"2009","unstructured":"Jansen T, Zarges C (2009) A theoretical analysis of immune inspired somatic contiguous hypermutations for function optimization. Lect Notes Comput Sci 5666:80\u201394","journal-title":"Lect Notes Comput Sci"},{"issue":"6","key":"3462_CR15","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1016\/j.tcs.2010.09.027","volume":"412","author":"T Jansen","year":"2011","unstructured":"Jansen T, Zarges C (2011) Analyzing different variants of immune inspired somatic contiguous hypermutations. Theor Comput Sci 412(6):517\u2013533","journal-title":"Theor Comput Sci"},{"issue":"1","key":"3462_CR16","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1006\/jagm.2000.1100","volume":"37","author":"MR Korupolu","year":"2000","unstructured":"Korupolu MR, Plaxton CG, Rajaraman R (2000) Analysis of a local search heuristic for facility location problems. J Algorithm 37(1):146\u2013188","journal-title":"J Algorithm"},{"issue":"6","key":"3462_CR17","doi-asserted-by":"publisher","first-page":"860","DOI":"10.1109\/TEVC.2013.2291790","volume":"18","author":"XS Lai","year":"2014","unstructured":"Lai XS, Zhou YR, He J, Zhang J (2014) Performance analysis of evolutionary algorithms for the minimum label spanning tree problem. IEEE Trans Evol Comput 18(6):860\u2013872","journal-title":"IEEE Trans Evol Comput"},{"key":"3462_CR18","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1016\/j.ins.2010.01.031","volume":"259","author":"PK Lehre","year":"2014","unstructured":"Lehre PK, Yao X (2014) Runtime analysis of the $$(1{+}1)$$ ( 1 + 1 ) EA on computing unique input output sequences. Inf Sci 259:510\u2013531","journal-title":"Inf Sci"},{"issue":"5","key":"3462_CR19","doi-asserted-by":"publisher","first-page":"1301","DOI":"10.1007\/s00500-015-1862-7","volume":"21","author":"WW Lin","year":"2017","unstructured":"Lin WW, Xu SY, Li J, Xu LL, Peng ZP (2017) Design and theoretical analysisi of virtual machine placement algorithm based on peak workload characteristics. Soft Comput 21(5):1301\u20131314","journal-title":"Soft Comput"},{"issue":"1","key":"3462_CR20","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.tcs.2006.11.002","volume":"378","author":"F Neumann","year":"2007","unstructured":"Neumann F, Wegener I (2007) Randomized local search, evolutionary algorithms, and the minimum spanning tree problem. Theor Comput Sci 378(1):32\u201340","journal-title":"Theor Comput Sci"},{"key":"3462_CR21","doi-asserted-by":"crossref","unstructured":"Neumann F, Witt C, et al (2010) Bioinspired computation in combinatorial optimization: algorithms and their computational complexity. Nat Comput, pp 1035\u20131058","DOI":"10.1007\/978-3-642-16544-3"},{"issue":"5","key":"3462_CR22","doi-asserted-by":"publisher","first-page":"1006","DOI":"10.1109\/TEVC.2009.2014362","volume":"13","author":"PS Oliveto","year":"2009","unstructured":"Oliveto PS, He J, Yao X (2009) Analysis of the $$(1{+}1)$$ ( 1 + 1 ) -EA for finding approximate solutions to vertex cover problems. IEEE Trans Evol Comput 13(5):1006\u20131029","journal-title":"IEEE Trans Evol Comput"},{"key":"3462_CR23","unstructured":"Pandit V (2018) Local search based approximation algorithms the $$k$$ k -median problem. http:\/\/www.cse.iitd.ernet.in\/~pandit\/localsearch.pdf . Accessed 26 Mar 2018"},{"issue":"9","key":"3462_CR24","doi-asserted-by":"publisher","first-page":"11203","DOI":"10.1007\/s11042-017-5466-3","volume":"77","author":"X Peng","year":"2018","unstructured":"Peng X, Xia XY, Liao WZ, Guo ZW (2018) Runtime analysis of the Pareto archived evolution strategy on pseudo-Boolean functions. Multimed Tools Appl 77(9):11203\u201311217","journal-title":"Multimed Tools Appl"},{"key":"3462_CR25","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1016\/j.future.2017.09.082","volume":"82","author":"AP Plageras","year":"2018","unstructured":"Plageras AP, Stergiou C, Psannis KE (2018) Efficient IoT-based sensor BIG Data collection-processing and analysis in smart buildings. Future Gener Comput Syst 82:349\u2013357","journal-title":"Future Gener Comput Syst"},{"key":"3462_CR26","doi-asserted-by":"publisher","first-page":"964","DOI":"10.1016\/j.future.2016.11.031","volume":"78","author":"C Stergiou","year":"2018","unstructured":"Stergiou C, Psannis KE, Kim BG, Gupta BB (2018) Secure integration of internet-of-things and cloud computing. Future Gener Comput Syst 78:964\u2013975","journal-title":"Future Gener Comput Syst"},{"issue":"4","key":"3462_CR27","doi-asserted-by":"publisher","first-page":"827","DOI":"10.1007\/s10766-016-0445-2","volume":"45","author":"Y Wang","year":"2017","unstructured":"Wang Y, Li KL, Li KQ (2017) Partition scheduling on heterogeneous multicore processors for multi-dimensional loops applications. Int J Parallel Prog 45(4):827\u2013852","journal-title":"Int J Parallel Prog"},{"key":"3462_CR28","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/j.jocs.2017.06.008","volume":"26","author":"Y Wang","year":"2018","unstructured":"Wang Y, Liu Q, Hou HD, Rho S, Gupta B, Mu YX (2018) Big data driven outlier detection for soybean straw near infrared spectroscopy. J Comput Sci 26:178\u2013189","journal-title":"J Comput Sci"},{"key":"3462_CR29","doi-asserted-by":"publisher","first-page":"17756","DOI":"10.1109\/ACCESS.2017.2779154","volume":"6","author":"XY Xia","year":"2018","unstructured":"Xia XY, Peng X (2018) Performance guarantees of evolutionary algorithms for the bank account location problem. IEEE Access 6:17756\u201317767","journal-title":"IEEE Access"},{"key":"3462_CR30","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.ins.2017.10.038","volume":"426","author":"XY Xia","year":"2018","unstructured":"Xia XY, Zhou YR (2018) On the effectiveness of immune inspired mutation operators in some discrete optimization problems. Inf Sci 426:87\u2013100","journal-title":"Inf Sci"},{"key":"3462_CR31","doi-asserted-by":"publisher","first-page":"16904","DOI":"10.1109\/ACCESS.2017.2741221","volume":"5","author":"SH Zhang","year":"2017","unstructured":"Zhang SH, Yang ZB, Xing XF, Gao Y, Xie DQ, Wong HS (2017) Generalized pair-counting similartiy measures for clustering and cluster ensembles. IEEE Access 5:16904\u201316918","journal-title":"IEEE Access"},{"issue":"2","key":"3462_CR32","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1016\/j.artint.2008.11.002","volume":"173","author":"YR Zhou","year":"2009","unstructured":"Zhou YR, He J, Nie Q (2009) A comparative runtime analysis of heuristic algorithms for satisfiability problems. Artif Intell 173(2):240\u2013257","journal-title":"Artif Intell"},{"issue":"1","key":"3462_CR33","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s00453-014-9898-0","volume":"73","author":"YR Zhou","year":"2015","unstructured":"Zhou YR, Zhang J, Wang Y (2015) Performance analysis of the $$(1{+}1)$$ ( 1 + 1 ) evolutionary algorithm for the multiprocessor scheduling problem. Algorithmica 73(1):21\u201341","journal-title":"Algorithmica"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-018-3462-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-018-3462-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-018-3462-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T11:50:22Z","timestamp":1693828222000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-018-3462-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,17]]},"references-count":33,"journal-issue":{"issue":"23","published-print":{"date-parts":[[2018,12]]}},"alternative-id":["3462"],"URL":"https:\/\/doi.org\/10.1007\/s00500-018-3462-9","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,8,17]]},"assertion":[{"value":"17 August 2018","order":1,"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":"All procedures performed in studies involving human participants were in accordance with the ethical standards of the institutional and\/or national research committee and with the 1964 Helsinki Declaration and its later amendments or comparable ethical standards.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical standards"}},{"value":"This article does not contain any studies with animals performed by any of the authors.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Human and animal rights statement"}},{"value":"Informed consent was obtained from all individual participants included in the study.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Informed consent"}}]}}