{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T04:49:10Z","timestamp":1749703750815,"version":"3.37.3"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,5,4]],"date-time":"2022-05-04T00:00:00Z","timestamp":1651622400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,5,4]],"date-time":"2022-05-04T00:00:00Z","timestamp":1651622400000},"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":["Appl Intell"],"published-print":{"date-parts":[[2023,1]]},"DOI":"10.1007\/s10489-022-03531-2","type":"journal-article","created":{"date-parts":[[2022,5,4]],"date-time":"2022-05-04T22:03:42Z","timestamp":1651701822000},"page":"1912-1944","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A master-apprentice evolutionary algorithm for maximum weighted set K-covering problem"],"prefix":"10.1007","volume":"53","author":[{"given":"Yupeng","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mingjie","family":"Fan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaofan","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4259-6047","authenticated-orcid":false,"given":"Xin","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yiyuan","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Minghao","family":"Yin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,5,4]]},"reference":[{"key":"3531_CR1","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.cor.2016.08.018","volume":"78","author":"VR M\u00e1ximo","year":"2017","unstructured":"M\u00e1ximo V R, Nascimento MCV, Carvalho ACPLF (2017) Intelligent-guided adaptive search for the maximum covering location problem. Comput Oper Res 78:129\u2013137","journal-title":"Comput Oper Res"},{"issue":"2","key":"3531_CR2","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/j.ejor.2019.06.016","volume":"283","author":"J Heil","year":"2020","unstructured":"Heil J, Hoffmann K, Buscher U (2020) Railway crew scheduling: Models, methods and applications. Eur J Oper Res 283(2):405\u2013425","journal-title":"Eur J Oper Res"},{"issue":"5","key":"3531_CR3","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1109\/TEVC.2015.2511142","volume":"20","author":"X-Y Zhang","year":"2015","unstructured":"Zhang X-Y, Zhang J, Gong Y-J, Zhan Z-H, Chen W-N, Li Y (2015) Kuhn\u2013munkres parallel genetic algorithm for the set cover problem and its application to large-scale wireless sensor networks. IEEE Trans Evol Comput 20(5):695\u2013710","journal-title":"IEEE Trans Evol Comput"},{"issue":"3","key":"3531_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2699671","volume":"33","author":"A Anagnostopoulos","year":"2015","unstructured":"Anagnostopoulos A, Becchetti L, Bordino I, Leonardi S, Mele I, Sankowski P (2015) Stochastic query covering for fast approximate document retrieval. ACM Trans Inf Syst (TOIS) 33(3):1\u201335","journal-title":"ACM Trans Inf Syst (TOIS)"},{"key":"3531_CR5","doi-asserted-by":"crossref","unstructured":"Chierichetti F, Kumar R, Tomkins A (2010) Max-cover in map-reduce. In: Proceedings of the 19th international conference on World wide web, pp 231\u2013240","DOI":"10.1145\/1772690.1772715"},{"key":"3531_CR6","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/j.asoc.2018.10.025","volume":"74","author":"J Kritter","year":"2019","unstructured":"Kritter J, Br\u00e9villiers M, Lepagnot J, Idoumghar L (2019) On the optimal placement of cameras for surveillance and the underlying set cover problem. Appl Soft Comput 74:133\u2013153","journal-title":"Appl Soft Comput"},{"issue":"3","key":"3531_CR7","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1016\/0196-6774(85)90012-4","volume":"6","author":"DS Johnson","year":"1985","unstructured":"Johnson D S (1985) The np-completeness column: an ongoing guide. J Algorithm 6(3):434\u2013451","journal-title":"J Algorithm"},{"key":"3531_CR8","doi-asserted-by":"crossref","unstructured":"Yu H, Yuan D (2013) Set coverage problems in a one-pass data stream. In: Proceedings of the 2013 SIAM international conference on data mining. SIAM, pp 758\u2013766","DOI":"10.1137\/1.9781611972832.84"},{"issue":"7","key":"3531_CR9","doi-asserted-by":"publisher","first-page":"1595","DOI":"10.1007\/s00224-018-9878-x","volume":"63","author":"A McGregor","year":"2019","unstructured":"McGregor A, Vu H T (2019) Better streaming algorithms for the maximum coverage problem. Theory Comput Syst 63(7):1595\u20131619","journal-title":"Theory Comput Syst"},{"key":"3531_CR10","doi-asserted-by":"crossref","unstructured":"Indyk P, Vakilian A (2019) Tight trade-offs for the maximum k-coverage problem in the general streaming model. In: Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, pp 200\u2013217","DOI":"10.1145\/3294052.3319691"},{"issue":"10","key":"3531_CR11","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1007\/s00521-016-2599-7","volume":"29","author":"Y Wang","year":"2018","unstructured":"Wang Y, Ouyang D, Yin M, Zhang L, Zhang Y (2018) A restart local search algorithm for solving maximum set k-covering problem. Neural Comput Appl 29(10):755\u2013765","journal-title":"Neural Comput Appl"},{"key":"3531_CR12","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.knosys.2017.11.028","volume":"142","author":"G Lin","year":"2018","unstructured":"Lin G, Guan J (2018) Solving maximum set k-covering problem by an adaptive binary particle swarm optimization method. Knowl-Based Syst 142:95\u2013107","journal-title":"Knowl-Based Syst"},{"key":"3531_CR13","doi-asserted-by":"publisher","first-page":"113717","DOI":"10.1016\/j.eswa.2020.113717","volume":"161","author":"G Lin","year":"2020","unstructured":"Lin G, Xu H, Chen X, Guan J (2020) An effective binary artificial bee colony algorithm for maximum set k-covering problem. Expert Syst Appl 161:113717","journal-title":"Expert Syst Appl"},{"issue":"5","key":"3531_CR14","doi-asserted-by":"publisher","first-page":"1880","DOI":"10.1007\/s10489-018-1370-4","volume":"49","author":"Y Song","year":"2019","unstructured":"Song Y, Wang F, Chen X (2019) An improved genetic algorithm for numerical function optimization. Appl Intell 49(5):1880\u20131902","journal-title":"Appl Intell"},{"key":"3531_CR15","doi-asserted-by":"crossref","unstructured":"Yu J, You X, Liu S (2021) Dynamic reproductive ant colony algorithm based on piecewise clustering. Appl Intell:1\u201321","DOI":"10.1007\/s10489-021-02312-7"},{"issue":"3","key":"3531_CR16","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s10898-007-9149-x","volume":"39","author":"D Karaboga","year":"2007","unstructured":"Karaboga D, Basturk B (2007) A powerful and efficient algorithm for numerical function optimization: artificial bee colony (abc) algorithm. J Glob Optim 39(3):459\u2013471","journal-title":"J Glob Optim"},{"issue":"2","key":"3531_CR17","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s11704-018-7155-4","volume":"12","author":"W-N Chen","year":"2018","unstructured":"Chen W-N, Tan D-Z (2018) Set-based discrete particle swarm optimization and its applications: a survey. Front Comput Sci 12(2):203\u2013216","journal-title":"Front Comput Sci"},{"key":"3531_CR18","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/j.asoc.2019.03.010","volume":"80","author":"C-F Wang","year":"2019","unstructured":"Wang C-F, Song W-X (2019) A novel firefly algorithm based on gender difference and its convergence. Appl Soft Comput 80:107\u2013124","journal-title":"Appl Soft Comput"},{"issue":"7","key":"3531_CR19","doi-asserted-by":"publisher","first-page":"70201","DOI":"10.1007\/s11432-018-9752-9","volume":"62","author":"H Duan","year":"2019","unstructured":"Duan H, Qiu H (2019) Advancements in pigeon-inspired optimization and its variants. Sci China Inf Sci 62(7):70201\u20131","journal-title":"Sci China Inf Sci"},{"key":"3531_CR20","doi-asserted-by":"crossref","unstructured":"Ding J, L\u00fc Z, Li C-M, Shen L, Xu L, Glover F (2019) A two-individual based evolutionary algorithm for the flexible job shop scheduling problem. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol 33, pp 2262\u20132271","DOI":"10.1609\/aaai.v33i01.33012262"},{"key":"3531_CR21","doi-asserted-by":"crossref","unstructured":"Tan Y, Zhu Y (2010) Fireworks algorithm for optimization. In: International conference in swarm intelligence. Springer, pp 355\u2013364","DOI":"10.1007\/978-3-642-13495-1_44"},{"key":"3531_CR22","doi-asserted-by":"publisher","first-page":"31932","DOI":"10.1109\/ACCESS.2021.3051741","volume":"9","author":"Y Wang","year":"2021","unstructured":"Wang Y, L\u00fc Z, Punnen A P (2021) A fast and robust heuristic algorithm for the minimum weight vertex cover problem. IEEE Access 9:31932\u201331945","journal-title":"IEEE Access"},{"issue":"4","key":"3531_CR23","doi-asserted-by":"publisher","first-page":"39","DOI":"10.4018\/ijsir.2013100103","volume":"4","author":"Y Tan","year":"2013","unstructured":"Tan Y, Yu C, Zheng S, Ding K (2013) Introduction to fireworks algorithm. Int J Swarm Intell Res (IJSIR) 4(4):39\u201370","journal-title":"Int J Swarm Intell Res (IJSIR)"},{"key":"3531_CR24","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1016\/j.asoc.2017.10.046","volume":"62","author":"J Li","year":"2018","unstructured":"Li J, Tan Y (2018) The bare bones fireworks algorithm: A minimalist global optimizer. Appl Soft Comput 62:454\u2013462","journal-title":"Appl Soft Comput"},{"issue":"173","key":"3531_CR25","first-page":"2","volume":"7","author":"J Yu","year":"2018","unstructured":"Yu J, Takagi H, Tan Y (2018) Multi-layer explosion based fireworks algorithm. J Swarm Intel Evol Comput 7(173):2","journal-title":"J Swarm Intel Evol Comput"},{"issue":"6","key":"3531_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3362788","volume":"52","author":"J Li","year":"2019","unstructured":"Li J, Tan Y (2019) A comprehensive review of the fireworks algorithm. ACM Comput Surv (CSUR) 52(6):1\u201328","journal-title":"ACM Comput Surv (CSUR)"},{"key":"3531_CR27","doi-asserted-by":"publisher","first-page":"105774","DOI":"10.1016\/j.knosys.2020.105774","volume":"196","author":"B Peng","year":"2020","unstructured":"Peng B, Zhang Y, Cheng TCE, L\u00fc Z, Punnen A P (2020) A two-individual based path-relinking algorithm for the satellite broadcast scheduling problem. Knowl-Based Syst 196:105774","journal-title":"Knowl-Based Syst"},{"key":"3531_CR28","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/j.engappai.2016.08.004","volume":"56","author":"X Lai","year":"2016","unstructured":"Lai X, Hao J-K (2016) Iterated variable neighborhood search for the capacitated clustering problem. Eng Appl Artif Intell 56:102\u2013120","journal-title":"Eng Appl Artif Intell"},{"key":"3531_CR29","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/j.asoc.2018.02.032","volume":"66","author":"Y Qiu","year":"2018","unstructured":"Qiu Y, Wang L, Xu X, Fang X, Pardalos P M (2018) A variable neighborhood search heuristic algorithm for production routing problems. Appl Soft Comput 66:311\u2013318","journal-title":"Appl Soft Comput"},{"issue":"3","key":"3531_CR30","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P Hansen","year":"2001","unstructured":"Hansen P, Mladenovi\u0107 N (2001) Variable neighborhood search: Principles and applications. Eur J Oper Res 130(3):449\u2013467","journal-title":"Eur J Oper Res"},{"issue":"10","key":"3531_CR31","doi-asserted-by":"publisher","first-page":"1933","DOI":"10.1109\/TSMC.2018.2881686","volume":"49","author":"X Li","year":"2018","unstructured":"Li X, Gao L, Pan Q, Wan L, Chao K-M (2018) An effective hybrid genetic algorithm and variable neighborhood search for integrated process planning and scheduling in a packaging machine workshop. IEEE Trans Syst Man Cybern Syst 49(10):1933\u20131945","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"issue":"3","key":"3531_CR32","doi-asserted-by":"publisher","first-page":"750","DOI":"10.1016\/j.ejor.2015.05.038","volume":"246","author":"C Gao","year":"2015","unstructured":"Gao C, Yao X, Weise T, Li J (2015) An efficient local search heuristic with row weighting for the unicost set covering problem. Eur J Oper Res 246(3):750\u2013761","journal-title":"Eur J Oper Res"},{"issue":"1","key":"3531_CR33","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1109\/TEVC.2017.2672689","volume":"22","author":"P Yang","year":"2017","unstructured":"Yang P, Tang K, Yao X (2017) Turning high-dimensional optimization into computationally expensive optimization. IEEE Trans Evol Comput 22(1):143\u2013156","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"3531_CR34","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1109\/TEVC.2020.3017865","volume":"25","author":"F-F Wei","year":"2020","unstructured":"Wei F-F, Chen W-N, Yang Q, Deng J, Luo X-N, Jin H, Zhang J (2020) A classifier-assisted level-based learning swarm optimizer for expensive optimization. IEEE Trans Evol Comput 25(2):219\u2013233","journal-title":"IEEE Trans Evol Comput"},{"key":"3531_CR35","doi-asserted-by":"crossref","unstructured":"Hettmansperger T P, McKean J W (2010) Robust nonparametric statistical methods. CRC Press","DOI":"10.1201\/b10451"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-022-03531-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-022-03531-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-022-03531-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,4]],"date-time":"2023-01-04T04:51:00Z","timestamp":1672807860000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-022-03531-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,4]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,1]]}},"alternative-id":["3531"],"URL":"https:\/\/doi.org\/10.1007\/s10489-022-03531-2","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"type":"print","value":"0924-669X"},{"type":"electronic","value":"1573-7497"}],"subject":[],"published":{"date-parts":[[2022,5,4]]},"assertion":[{"value":"20 March 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 May 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 declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Conflict of Interests"}}]}}