{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T13:24:56Z","timestamp":1762953896213,"version":"3.37.3"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"21","license":[{"start":{"date-parts":[[2023,3,17]],"date-time":"2023-03-17T00:00:00Z","timestamp":1679011200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,3,17]],"date-time":"2023-03-17T00:00:00Z","timestamp":1679011200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["grant numbers 61972456","62172298"],"award-info":[{"award-number":["grant numbers 61972456","62172298"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100006606","name":"Natural Science Foundation of Tianjin","doi-asserted-by":"crossref","award":["grant number 20JCYBJC00140"],"award-info":[{"award-number":["grant number 20JCYBJC00140"]}],"id":[{"id":"10.13039\/501100006606","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Innovation Fund for Industry-University-Research in China Ministry of Education","award":["2022BL083"],"award-info":[{"award-number":["2022BL083"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2023,11]]},"DOI":"10.1007\/s00500-023-07982-8","type":"journal-article","created":{"date-parts":[[2023,3,17]],"date-time":"2023-03-17T08:02:46Z","timestamp":1679040166000},"page":"16087-16100","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["An evolutionary game algorithm for minimum weighted vertex cover problem"],"prefix":"10.1007","volume":"27","author":[{"given":"Yalun","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhengyi","family":"Chai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongling","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sifeng","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,3,17]]},"reference":[{"key":"7982_CR1","doi-asserted-by":"publisher","first-page":"113609","DOI":"10.1016\/j.cma.2020.113609","volume":"376","author":"L Abualigah","year":"2021","unstructured":"Abualigah L, Diabat A, Mirjalili S, Abd Elaziz M, Gandomi AH (2021a) The arithmetic optimization algorithm. Comput Methods Appl Mech Eng 376:113609","journal-title":"Comput Methods Appl Mech Eng"},{"key":"7982_CR2","doi-asserted-by":"publisher","first-page":"107250","DOI":"10.1016\/j.cie.2021.107250","volume":"157","author":"L Abualigah","year":"2021","unstructured":"Abualigah L, Yousri D, Abd Elaziz M, Ewees AA, Al-Qaness MA, Gandomi AH (2021b) Aquila optimizer: a novel meta-heuristic optimization algorithm. Comput Ind Eng 157:107250","journal-title":"Comput Ind Eng"},{"key":"7982_CR3","doi-asserted-by":"publisher","first-page":"116158","DOI":"10.1016\/j.eswa.2021.116158","volume":"191","author":"L Abualigah","year":"2022","unstructured":"Abualigah L, Abd Elaziz M, Sumari P, Geem ZW, Gandomi AH (2022) Reptile search algorithm (rsa): a nature-inspired meta-heuristic optimizer. Expert Syst Appl 191:116158","journal-title":"Expert Syst Appl"},{"key":"7982_CR4","doi-asserted-by":"publisher","first-page":"114570","DOI":"10.1016\/j.cma.2022.114570","volume":"391","author":"JO Agushaka","year":"2022","unstructured":"Agushaka JO, Ezugwu AE, Abualigah L (2022a) Dwarf mongoose optimization algorithm. Comput Methods Appl Mech Eng 391:114570","journal-title":"Comput Methods Appl Mech Eng"},{"key":"7982_CR5","doi-asserted-by":"publisher","first-page":"4099","DOI":"10.1007\/s00521-022-07854-6","volume":"35","author":"JO Agushaka","year":"2022","unstructured":"Agushaka JO, Ezugwu AE, Abualigah L (2022b) Gazelle optimization algorithm: a novel nature-inspired metaheuristic optimizer. Neural Comput Appl 35:4099\u20134131","journal-title":"Neural Comput Appl"},{"issue":"6","key":"7982_CR6","doi-asserted-by":"publisher","first-page":"1632","DOI":"10.1016\/j.asoc.2012.02.013","volume":"12","author":"S Bouamama","year":"2012","unstructured":"Bouamama S, Blum C et al (2012) A Population-based iterated greedy algorithm for the minimum weight vertex cover problem. Appl Soft Comput J 12(6):1632\u20131639","journal-title":"Appl Soft Comput J"},{"key":"7982_CR7","doi-asserted-by":"crossref","unstructured":"Cai S, Hou W, Lin J et al. (2018) Improving Local Search for Minimum Weight Vertex Cover by Dynamic Strategies. In: IJCAI International Joint Conference on Artificial Intelligence, pp 1412\u20131418","DOI":"10.24963\/ijcai.2018\/196"},{"key":"7982_CR8","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/j.ins.2018.08.052","volume":"471","author":"S Cai","year":"2019","unstructured":"Cai S, Li Y, Hou W et al (2019) Towards faster local search for minimum weight vertex cover on massive graphs. Inf Sci 471:64\u201379","journal-title":"Inf Sci"},{"key":"7982_CR9","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.engappai.2019.03.015","volume":"82","author":"Y Chen","year":"2019","unstructured":"Chen Y, Hao J (2019) Dynamic thresholding search for minimum vertex cover in massive sparse graphs. Eng Appl Artif Intell 82:76\u201384","journal-title":"Eng Appl Artif Intell"},{"issue":"22","key":"7982_CR10","doi-asserted-by":"publisher","first-page":"11775","DOI":"10.1007\/s00500-018-03729-y","volume":"23","author":"G D'Angelo","year":"2019","unstructured":"D\u2019Angelo G, Pilla R, Tascini C et al (2019) A proposal for distinguishing between bacterial and viral meningitis using genetic programming and decision trees\u201d. Soft Comput 23(22):11775\u201311791","journal-title":"Soft Comput"},{"issue":"1","key":"7982_CR11","doi-asserted-by":"publisher","first-page":"439","DOI":"10.4007\/annals.2005.162.439","volume":"162","author":"I Dinur","year":"2005","unstructured":"Dinur I, Safra S (2005) On the hardness of approximating minimum vertex cover. Ann Math 162(1):439\u2013485","journal-title":"Ann Math"},{"issue":"1","key":"7982_CR12","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/s12293-019-00292-3","volume":"12","author":"MA Dulebenets","year":"2020","unstructured":"Dulebenets MA (2020) An adaptive island evolutionary algorithm for the berth scheduling problem. Memetic Comput 12(1):51\u201372","journal-title":"Memetic Comput"},{"issue":"22","key":"7982_CR13","doi-asserted-by":"publisher","first-page":"20017","DOI":"10.1007\/s00521-022-07530-9","volume":"34","author":"AE Ezugwu","year":"2022","unstructured":"Ezugwu AE, Agushaka JO, Abualigah L, Mirjalili S, Gandomi AH (2022) Prairie dog optimization algorithm. Neural Comput Appl 34(22):20017\u201320065","journal-title":"Neural Comput Appl"},{"key":"7982_CR14","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-319-08016-1_7","volume":"8497","author":"Z Fang","year":"2014","unstructured":"Fang Z, Chu Y, Qiao K et al (2014) Combining edge weight and vertex weight for minimum vertex cover problem. Lect Notes Comput Sci 8497:71\u201381","journal-title":"Lect Notes Comput Sci"},{"key":"7982_CR15","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-3-642-39212-2_26","volume":"7966","author":"B Genest","year":"2013","unstructured":"Genest B, Gimbert H, Muscholl A et al (2013) Asynchronous games over tree architectures. Lect Notes Comput Sci 7966:275\u2013286","journal-title":"Lect Notes Comput Sci"},{"key":"7982_CR16","doi-asserted-by":"publisher","first-page":"60774","DOI":"10.1109\/ACCESS.2019.2915550","volume":"7","author":"P Guo","year":"2019","unstructured":"Guo P, Quan C, Chen H (2019) MEAMVC: a membrane evolutionary algorithm for solving minimum vertex cover problem. IEEE Access 7:60774\u201360784","journal-title":"IEEE Access"},{"key":"7982_CR17","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1007\/978-3-030-34029-2_31","volume":"11544","author":"R Jovanovic","year":"2019","unstructured":"Jovanovic R, Vo\u03b2 S (2019) Fixed search applied to the minimum weighted vertex cover problem. Lect Notes Comput Sci 11544:490\u2013504","journal-title":"Lect Notes Comput Sci"},{"issue":"8","key":"7982_CR18","doi-asserted-by":"publisher","first-page":"5360","DOI":"10.1016\/j.asoc.2011.05.023","volume":"11","author":"R Jovanovic","year":"2011","unstructured":"Jovanovic R, Tuba M et al (2011) An ant colony optimization algorithm with improved pheromone correction strategy for the minimum weight vertex cover problem. Appl Soft Comput J 11(8):5360\u20135366","journal-title":"Appl Soft Comput J"},{"key":"7982_CR19","unstructured":"Kotecha K, Gambhava N. (2003) A hybrid evolutionary algorithm for minimum vertex cover problem. In: Proceedings 1st Indian International Conference on Artificial Intelligence. pp 904\u2013913"},{"key":"7982_CR20","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1016\/j.ast.2017.05.031","volume":"68","author":"P Li","year":"2017","unstructured":"Li P, Duan H (2017) A potential game approach to multiple UAV cooperative search and surveillance. Aerosp Sci Technol 68:403\u2013415","journal-title":"Aerosp Sci Technol"},{"issue":"4","key":"7982_CR21","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1016\/j.jpdc.2005.10.007","volume":"66","author":"X Li","year":"2006","unstructured":"Li X, Wang Y (2006) Simple approximation algorithms and PTASs for various problems in wireless ad hoc networks. J Parallel Distrib Comput 66(4):515\u2013530","journal-title":"J Parallel Distrib Comput"},{"key":"7982_CR22","doi-asserted-by":"crossref","unstructured":"Li A, Tang C, Li X. (2014) An evolutionary game optimization to vertex cover of dynamic networks. In: Proceedings of the 33rd Chinese Control Conference, CCC 2014, pp 2757\u20132762","DOI":"10.1109\/ChiCC.2014.6897074"},{"key":"7982_CR23","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1016\/j.ins.2016.08.053","volume":"372","author":"R Li","year":"2016","unstructured":"Li R, Hu S et al (2016) An efficient local search framework for the minimum weighted vertex cover problem. Inf Sci 372:428\u2013445","journal-title":"Inf Sci"},{"issue":"9","key":"7982_CR24","doi-asserted-by":"publisher","first-page":"1498","DOI":"10.1080\/01605682.2019.1621218","volume":"71","author":"R Li","year":"2020","unstructured":"Li R, Hu S, Cai S et al (2020) NuMWVC: a novel local search for minimum weighted vertex cover problem. J Oper Res Soc 71(9):1498\u20131509","journal-title":"J Oper Res Soc"},{"key":"7982_CR25","doi-asserted-by":"crossref","unstructured":"Luo C, Hoos HH, Cai S, et al. (2019) Local search with efficient automatic configuration for minimum vertex cover. In: International Joint Conference on Artificial Intelligence. pp 1297\u20131304","DOI":"10.24963\/ijcai.2019\/180"},{"key":"7982_CR26","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/978-3-319-42911-3_24","volume":"9810","author":"Z Ma","year":"2016","unstructured":"Ma Z, Fan Y, Su K et al (2016) Local search with noisy strategy for minimum vertex cover in massive graphs. Lect Notes Comput Sci 9810:283\u2013294","journal-title":"Lect Notes Comput Sci"},{"issue":"6398","key":"7982_CR27","doi-asserted-by":"publisher","first-page":"826","DOI":"10.1038\/359826a0","volume":"359","author":"MA Nowak","year":"1992","unstructured":"Nowak MA, May RM (1992) Evolutionary games and spatial chaos. Nature 359(6398):826\u2013829","journal-title":"Nature"},{"key":"7982_CR28","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1007\/978-981-13-9042-5_49","volume":"999","author":"N Panda","year":"2020","unstructured":"Panda N, Majhi SK (2020) How effective is the salp swarm algorithm in data classification. Adv Intell Syst Comput 999:579\u2013588","journal-title":"Adv Intell Syst Comput"},{"key":"7982_CR29","doi-asserted-by":"publisher","first-page":"134743","DOI":"10.1109\/ACCESS.2020.3010176","volume":"8","author":"J Pasha","year":"2020","unstructured":"Pasha J, Dulebenets MA, Kavoosi M et al (2020) An optimization model and solution algorithms for the vehicle routing problem with a \u201cfactory-in-a-box.\u201d IEEE Access, v 8:134743\u2013134763","journal-title":"IEEE Access, v"},{"key":"7982_CR30","unstructured":"Siem C, Sema B (2018) A new hybrid approach based on genetic algorithm for minimum vertex cover. In: 2018 IEEE (SMC) International Conference on Innovations in Intelligent Systems and Applications, INISTA 2018"},{"key":"7982_CR31","doi-asserted-by":"publisher","first-page":"906","DOI":"10.1007\/s00453-019-00662-w","volume":"83","author":"F Shi","year":"2020","unstructured":"Shi F, Neumann F (2020) Runtime performances of randomized search heuristics for the dynamic weighted vertex cover problem. Algorithmica 83:906\u2013939","journal-title":"Algorithmica"},{"key":"7982_CR32","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1023\/B:ANOR.0000039523.95673.33","volume":"131","author":"SJ Shyu","year":"2004","unstructured":"Shyu SJ, Yin PY, Lin BMT (2004) An ant colony optimization algorithm for the minimum weight vertex cover problem. Ann Oper Res 131:283\u2013304","journal-title":"Ann Oper Res"},{"issue":"5","key":"7982_CR33","doi-asserted-by":"publisher","first-page":"1968","DOI":"10.1109\/TCYB.2018.2817631","volume":"49","author":"C Sun","year":"2019","unstructured":"Sun C, Sun W, Wang X et al (2019) Potential game theoretic learning for the minimal weighted vertex cover in distributed networking systems. IEEE Trans Cybern 49(5):1968\u20131978","journal-title":"IEEE Trans Cybern"},{"issue":"10","key":"7982_CR34","doi-asserted-by":"publisher","first-page":"2994","DOI":"10.1109\/TCYB.2017.2754919","volume":"48","author":"C Tang","year":"2018","unstructured":"Tang C, Li A, Li X (2018) Asymmetric game: a silver bullet to weighted vertex cover of networks. IEEE Trans Cybern 48(10):2994\u20133005","journal-title":"IEEE Trans Cybern"},{"issue":"1","key":"7982_CR35","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/s10878-015-9937-z","volume":"33","author":"L Wang","year":"2017","unstructured":"Wang L, Du W, Zhang Z et al (2017) A PTAS for minimum weighted connected vertex cover P3 problem in 3-dimensional wireless sensor networks. J Comb Optim 33(1):106\u2013122","journal-title":"J Comb Optim"},{"key":"7982_CR36","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/978-981-15-3753-0_46","volume":"1143","author":"Y Wang","year":"2019","unstructured":"Wang Y, Sun Y et al (2019) Research on algorithms for setting up advertising platform based on minimum weighted vertex covering. Adv Intell Syst Comput 1143:471\u2013479","journal-title":"Adv Intell Syst Comput"},{"issue":"3","key":"7982_CR37","doi-asserted-by":"publisher","first-page":"974","DOI":"10.1109\/TCYB.2018.2789930","volume":"49","author":"J Wu","year":"2019","unstructured":"Wu J, Shen X et al (2019) Game-based memetic algorithm to the vertex cover of networks. IEEE Trans Cybern 49(3):974\u2013988","journal-title":"IEEE Trans Cybern"},{"key":"7982_CR38","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1016\/j.asoc.2017.12.023","volume":"64","author":"X Xie","year":"2018","unstructured":"Xie X, Qin X, Yu C et al (2018) Test-cost-sensitive rough set-based approach for minimum weight vertex cover problem. Appl Soft Comput J 64:423\u2013435","journal-title":"Appl Soft Comput J"},{"key":"7982_CR39","doi-asserted-by":"crossref","unstructured":"Yadav V (2019) GA-PSO: service allocation in fog computing environment using hybrid bio-inspired algorithm. In: IEEE Region 10 Annual International Conference, Proceedings\/TENCON, pp 1280\u20131285","DOI":"10.1109\/TENCON.2019.8929234"},{"key":"7982_CR40","first-page":"725","volume":"1142","author":"G Yang","year":"2019","unstructured":"Yang G, Wang D, Xu J (2019) A hybrid evolutionary algorithm with taboo and competition strategies for minimum vertex cover problem. Commun Comput Inf Sci 1142:725\u2013732","journal-title":"Commun Comput Inf Sci"},{"issue":"3","key":"7982_CR41","doi-asserted-by":"publisher","first-page":"948","DOI":"10.1109\/TSMCB.2012.2218805","volume":"43","author":"Y Yang","year":"2013","unstructured":"Yang Y, Li X et al (2013) Towards a snowdrift game optimization to vertex cover of networks. IEEE Trans Cybern 43(3):948\u2013956","journal-title":"IEEE Trans Cybern"},{"key":"7982_CR42","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ins.2019.08.069","volume":"509","author":"H Zhao","year":"2020","unstructured":"Zhao H, Zhang C (2020) An online-learning-based evolutionary many-objective algorithm. Inf Sci 509:1\u201321","journal-title":"Inf Sci"},{"key":"7982_CR43","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.ins.2014.09.003","volume":"314","author":"J Zhou","year":"2015","unstructured":"Zhou J, Cao Z et al (2015) 4S: a secure and privacy-preserving key management scheme for cloud-assisted wireless body area network in m-healthcare social networks. Inf Sci 314:255\u2013276","journal-title":"Inf Sci"},{"issue":"2","key":"7982_CR44","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/s10878-015-9909-3","volume":"32","author":"T Zhou","year":"2016","unstructured":"Zhou T, L\u00fc Z, Wang Y et al (2016) Multi-start iterated tabu search for the minimum weight vertex cover problem. J Comb Optim 32(2):368\u2013384","journal-title":"J Comb Optim"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-023-07982-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-023-07982-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-023-07982-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,15]],"date-time":"2023-09-15T11:09:40Z","timestamp":1694776180000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-023-07982-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,17]]},"references-count":44,"journal-issue":{"issue":"21","published-print":{"date-parts":[[2023,11]]}},"alternative-id":["7982"],"URL":"https:\/\/doi.org\/10.1007\/s00500-023-07982-8","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2023,3,17]]},"assertion":[{"value":"19 January 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 March 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"None to declare.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Unexplored human body or animal experiment.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"All participants provided written informed assent and consent before the experiment.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Informed consent"}}]}}