{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T10:29:34Z","timestamp":1781087374260,"version":"3.54.1"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,2,8]],"date-time":"2025-02-08T00:00:00Z","timestamp":1738972800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,2,8]],"date-time":"2025-02-08T00:00:00Z","timestamp":1738972800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62206045"],"award-info":[{"award-number":["62206045"]}],"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":["61972063"],"award-info":[{"award-number":["61972063"]}],"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":["62106040"],"award-info":[{"award-number":["62106040"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["2412022QD041"],"award-info":[{"award-number":["2412022QD041"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["2412020FZ030"],"award-info":[{"award-number":["2412020FZ030"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100018594","name":"Central University Basic Research Fund of China","doi-asserted-by":"publisher","award":["2412019ZD013"],"award-info":[{"award-number":["2412019ZD013"]}],"id":[{"id":"10.13039\/501100018594","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100018594","name":"Central University Basic Research Fund of China","doi-asserted-by":"publisher","award":["2412019FZ051"],"award-info":[{"award-number":["2412019FZ051"]}],"id":[{"id":"10.13039\/501100018594","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100018594","name":"Central University Basic Research Fund of China","doi-asserted-by":"publisher","award":["2412022QD040"],"award-info":[{"award-number":["2412022QD040"]}],"id":[{"id":"10.13039\/501100018594","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["2412022ZD018"],"award-info":[{"award-number":["2412022ZD018"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["93K172022K10"],"award-info":[{"award-number":["93K172022K10"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["2412022ZD016"],"award-info":[{"award-number":["2412022ZD016"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Natural Science Research Foundation of Jilin Province of China","award":["YDZJ202201ZYTS423"],"award-info":[{"award-number":["YDZJ202201ZYTS423"]}]},{"name":"Jilin province science and technology department project","award":["YDZJ202201ZYTS415"],"award-info":[{"award-number":["YDZJ202201ZYTS415"]}]},{"name":"Jilin Education Department Project","award":["JJKH20231319KJ"],"award-info":[{"award-number":["JJKH20231319KJ"]}]},{"name":"Jilin Science and Technology Association","award":["QT202320"],"award-info":[{"award-number":["QT202320"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1007\/s10732-025-09552-7","type":"journal-article","created":{"date-parts":[[2025,2,8]],"date-time":"2025-02-08T09:30:47Z","timestamp":1739007047000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["An effective population-based approach for the partial set covering problem"],"prefix":"10.1007","volume":"31","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-3396-1978","authenticated-orcid":false,"given":"Ye","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jinlong","family":"He","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yupeng","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shuli","family":"Hu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dunbo","family":"Cai","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Naiyu","family":"Tian","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Minghao","family":"Yin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,2,8]]},"reference":[{"key":"9552_CR1","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/s11590-006-0031-4","volume":"1","author":"RM Aiex","year":"2007","unstructured":"Aiex, R.M., Resende, M.G., Ribeiro, C.C.: Ttt plots: a perl program to create time-to-target plots. Optim. Lett. 1, 355\u2013366 (2007)","journal-title":"Optim. Lett."},{"key":"9552_CR2","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/s10845-007-0017-9","volume":"18","author":"A Alfieri","year":"2007","unstructured":"Alfieri, A., Kroon, L., Van de Velde, S.: Personnel scheduling in a complex logistic system: a railway application case. J. Intell. Manuf. 18, 223\u2013232 (2007)","journal-title":"J. Intell. Manuf."},{"key":"9552_CR3","doi-asserted-by":"crossref","unstructured":"Babalola, A.E., Ojokoh, B.A., Odili, J.B.: A review of population-based optimization algorithms. In: 2020 International Conference in Mathematics, pp. 1\u20137. IEEE, Computer Engineering and Computer Science (ICMCECS) (2020)","DOI":"10.1109\/ICMCECS47690.2020.240856"},{"issue":"6","key":"9552_CR4","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1287\/opre.44.6.875","volume":"44","author":"E Balas","year":"1996","unstructured":"Balas, E., Carrera, M.C.: A dynamic subgradient-based branch-and-bound procedure for set covering. Oper. Res. 44(6), 875\u2013890 (1996)","journal-title":"Oper. Res."},{"issue":"4","key":"9552_CR5","doi-asserted-by":"publisher","first-page":"1256","DOI":"10.1137\/080736831","volume":"39","author":"N Bansal","year":"2010","unstructured":"Bansal, N., Caprara, A., Sviridenko, M.: A new approximation method for set covering problems, with applications to multidimensional bin packing. SIAM J. Comput. 39(4), 1256\u20131278 (2010)","journal-title":"SIAM J. Comput."},{"issue":"11","key":"9552_CR6","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"JE Beasley","year":"1990","unstructured":"Beasley, J.E.: Or-library: distributing test problems by electronic mail. J. Operat. Res. Soc. 41(11), 1069\u20131072 (1990)","journal-title":"J. Operat. Res. Soc."},{"issue":"2","key":"9552_CR7","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1016\/0377-2217(95)00159-X","volume":"94","author":"JE Beasley","year":"1996","unstructured":"Beasley, J.E., Chu, P.C.: A genetic algorithm for the set covering problem. Eur. J. Oper. Res. 94(2), 392\u2013404 (1996)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"9552_CR8","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0377-2217(92)90215-U","volume":"58","author":"JE Beasley","year":"1992","unstructured":"Beasley, J.E., J\u00f6rnsten, K.: Enhancing an algorithm for set covering problems. Eur. J. Oper. Res. 58(2), 293\u2013300 (1992)","journal-title":"Eur. J. Oper. Res."},{"key":"9552_CR9","doi-asserted-by":"crossref","unstructured":"Benhaya, K., Hocine, R., Bendib, S.S.: Ga-based approaches for optimization energy and coverage in wireless sensor network: State of the art. In: International Conference on Artificial Intelligence and its Applications, Springer, pp 346\u2013355 (2021)","DOI":"10.1007\/978-3-030-96311-8_32"},{"issue":"2","key":"9552_CR10","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s10732-013-9235-9","volume":"20","author":"N Bilal","year":"2014","unstructured":"Bilal, N., Galinier, P., Guibault, F.: An iterated-tabu-search heuristic for a variant of the partial set covering problem. J. Heuristics 20(2), 143\u2013164 (2014)","journal-title":"J. Heuristics"},{"issue":"1","key":"9552_CR11","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1111\/itor.12110","volume":"22","author":"M Boschetti","year":"2015","unstructured":"Boschetti, M., Maniezzo, V.: A set covering based matheuristic for a real-world city logistics problem. Int. Trans. Oper. Res. 22(1), 169\u2013195 (2015)","journal-title":"Int. Trans. Oper. Res."},{"key":"9552_CR12","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1023\/A:1018900128545","volume":"86","author":"MJ Brusco","year":"1999","unstructured":"Brusco, M.J., Jacobs, L.W., Thompson, G.M.: A morphing procedure to supplement a simulated annealing heuristic for cost-andcoverage-correlated set-covering problems. Ann. Oper. Res. 86, 611\u2013627 (1999)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"9552_CR13","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1023\/A:1019225027893","volume":"98","author":"A Caprara","year":"2000","unstructured":"Caprara, A., Toth, P., Fischetti, M.: Algorithms for the set covering problem. Ann. Oper. Res. 98(1), 353\u2013371 (2000)","journal-title":"Ann. Oper. Res."},{"key":"9552_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ins.2019.07.073","volume":"505","author":"SN Chaurasia","year":"2019","unstructured":"Chaurasia, S.N., Kim, J.H.: An evolutionary algorithm based hyper-heuristic framework for the set packing problem. Inf. Sci. 505, 1\u201331 (2019)","journal-title":"Inf. Sci."},{"key":"9552_CR15","unstructured":"Chekuri, C., Quanrud, K., Zhang, Z.: On approximating partial set cover and generalizations. arXiv preprint arXiv:1907.04413 (2019)"},{"key":"9552_CR16","volume":"1","author":"B Crawford","year":"2014","unstructured":"Crawford, B., Soto, R., Cuesta, R., Paredes, F.: Application of the artificial bee colony algorithm for solving the set covering problem. Sci. World J. 1, 189164 (2014)","journal-title":"Sci. World J."},{"issue":"3","key":"9552_CR17","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1111\/j.1538-4632.1999.tb00979.x","volume":"31","author":"MS Daskin","year":"1999","unstructured":"Daskin, M.S., Owen, S.H.: Two new location covering problems: The partial p-center problem and the partial set covering problem. Geogr. Anal. 31(3), 217\u2013235 (1999)","journal-title":"Geogr. Anal."},{"issue":"1","key":"9552_CR18","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M Dorigo","year":"1996","unstructured":"Dorigo, M., Maniezzo, V., Colorni, A.: Ant system: optimization by a colony of cooperating agents. IEEE Trans. Syst. Man Cybernetics part b cybernetics 26(1), 29\u201341 (1996)","journal-title":"IEEE Trans. Syst. Man Cybernetics part b cybernetics"},{"key":"9552_CR19","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.cor.2014.06.023","volume":"52","author":"\u00c1P Dorneles","year":"2014","unstructured":"Dorneles, \u00c1.P., De Ara\u00fajo, O.C., Buriol, L.S.: A fix-and-optimize heuristic for the high school timetabling problem. Comput. Oper. Res. 52, 29\u201338 (2014)","journal-title":"Comput. Oper. Res."},{"key":"9552_CR20","doi-asserted-by":"crossref","unstructured":"Emerick, B., Song, M.S., Lu, Y., Vasko, F.: An application of machine learning tools to predict the number of solutions for a minimum cardinality set covering problem. In: International Conference on Optimization and Learning, Springer, pp 175\u2013185 (2023)","DOI":"10.1007\/978-3-031-34020-8_13"},{"key":"9552_CR21","doi-asserted-by":"crossref","unstructured":"Festa, P., Pardalos, P.M., Pitsoulis, L.S., Resende, M.G.: Grasp with path-relinking for the weighted maximum satisfiability problem. In: Experimental and Efficient Algorithms: 4th International Workshop, WEA 2005, Santorini Island, Greece, May 10-13, 2005. Proceedings 4, Springer, pp 367\u2013379 (2005)","DOI":"10.1007\/11427186_32"},{"key":"9552_CR22","doi-asserted-by":"crossref","unstructured":"Gao, C., Weise, T., Li, J.: A weighting-based local search heuristic algorithm for the set covering problem. In: 2014 IEEE Congress on Evolutionary Computation (CEC), IEEE, pp 826\u2013831 (2014)","DOI":"10.1109\/CEC.2014.6900355"},{"issue":"3","key":"9552_CR23","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.: An efficient local search heuristic with row weighting for the unicost set covering problem. Eur. J. Oper. Res. 246(3), 750\u2013761 (2015)","journal-title":"Eur. J. Oper. Res."},{"key":"9552_CR24","doi-asserted-by":"crossref","unstructured":"Glover, F.: A template for scatter search and path relinking. In: European Conference on Artificial Evolution, Springer, pp 1\u201351 (1997)","DOI":"10.1007\/BFb0026589"},{"key":"9552_CR25","doi-asserted-by":"crossref","unstructured":"Hartmanis, J.: Computers and intractability: a guide to the theory of np-completeness (michael r. garey and david s. johnson). Siam Review 24(1):90 (1982)","DOI":"10.1137\/1024022"},{"issue":"3","key":"9552_CR26","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1137\/0211045","volume":"11","author":"DS Hochbaum","year":"1982","unstructured":"Hochbaum, D.S.: Approximation algorithms for the set covering and vertex cover problems. SIAM J. Comput. 11(3), 555\u2013556 (1982)","journal-title":"SIAM J. Comput."},{"key":"9552_CR27","doi-asserted-by":"crossref","unstructured":"Hutter, F., Hoos, H.H., Leyton-Brown, K.: Automated configuration of mixed integer programming solvers. In: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems: 7th International Conference, CPAIOR 2010, Bologna, Italy, June 14-18, 2010. Proceedings 7, Springer, pp 186\u2013202 (2010)","DOI":"10.1007\/978-3-642-13520-0_23"},{"key":"9552_CR28","unstructured":"Inamdar, T., Varadarajan, K.: On partial covering for geometric set systems. In: 34th International Symposium on Computational Geometry (SoCG 2018), Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2018)"},{"key":"9552_CR29","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2022.106038","volume":"149","author":"C Joncour","year":"2023","unstructured":"Joncour, C., Kritter, J., Michel, S., Schepler, X.: Generalized relax-and-fix heuristic. Comput. Oper. Res. 149, 106038 (2023)","journal-title":"Comput. Oper. Res."},{"key":"9552_CR30","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, \u00c9.: Maximizing the spread of influence through a social network. In: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, pp 137\u2013146 (2003)","DOI":"10.1145\/956750.956769"},{"key":"9552_CR31","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.: On the optimal placement of cameras for surveillance and the underlying set cover problem. Appl. Soft Comput. 74, 133\u2013153 (2019)","journal-title":"Appl. Soft Comput."},{"key":"9552_CR32","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.engappai.2016.02.008","volume":"52","author":"X Lai","year":"2016","unstructured":"Lai, X., Hao, J.K., L\u00fc, Z., Glover, F.: A learning-based path relinking algorithm for the bandwidth coloring problem. Eng. Appl. Artif. Intell. 52, 81\u201391 (2016)","journal-title":"Eng. Appl. Artif. Intell."},{"key":"9552_CR33","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2023.106339","volume":"159","author":"F Leutwiler","year":"2023","unstructured":"Leutwiler, F., Corman, F.: Set covering heuristics in a benders decomposition for railway timetabling. Comput. Oper. Res. 159, 106339 (2023)","journal-title":"Comput. Oper. Res."},{"issue":"8","key":"9552_CR34","doi-asserted-by":"publisher","first-page":"2245","DOI":"10.1109\/TCYB.2017.2731598","volume":"48","author":"CC Liao","year":"2017","unstructured":"Liao, C.C., Ting, C.K.: A novel integer-coded memetic algorithm for the set $$ k $$-cover problem in wireless sensor networks. IEEE Trans. Cybernetics 48(8), 2245\u20132258 (2017)","journal-title":"IEEE Trans. Cybernetics"},{"issue":"5","key":"9552_CR35","first-page":"762","volume":"56","author":"X Liu","year":"2022","unstructured":"Liu, X., Zhou, Y., Yin, M., Lv, S.: An argentine ant system algorithm for partial set covering problem. Data Technol. Appl. 56(5), 762\u2013781 (2022)","journal-title":"Data Technol. Appl."},{"key":"9552_CR36","first-page":"43","volume":"3","author":"M L\u00f3pez-Ib\u00e1\u00f1ez","year":"2016","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez, M., Dubois-Lacoste, J., C\u00e1ceres, L.P., Birattari, M., St\u00fctzle, T.: The irace package: Iterated racing for automatic algorithm configuration. Oper. Res. Perspect. 3, 43\u201358 (2016)","journal-title":"Oper. Res. Perspect."},{"issue":"3","key":"9552_CR37","doi-asserted-by":"publisher","first-page":"1403","DOI":"10.1109\/TCYB.2022.3199147","volume":"54","author":"C Luo","year":"2022","unstructured":"Luo, C., Xing, W., Cai, S., Hu, C.: Nusc: an effective local search algorithm for solving the set covering problem. IEEE Trans. Cybernetics 54(3), 1403\u20131416 (2022)","journal-title":"IEEE Trans. Cybernetics"},{"issue":"11","key":"9552_CR38","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24(11), 1097\u20131100 (1997)","journal-title":"Comput. Oper. Res."},{"key":"9552_CR39","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.116766","volume":"198","author":"AEF Muritiba","year":"2022","unstructured":"Muritiba, A.E.F., Gomes, M.J.N., de Souza, M.F., Oria, H.L.G.: Path-relinking with tabu search for the capacitated centered clustering problem. Expert Syst. Appl. 198, 116766 (2022)","journal-title":"Expert Syst. Appl."},{"key":"9552_CR40","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/j.cor.2014.08.006","volume":"53","author":"B Peng","year":"2015","unstructured":"Peng, B., L\u00fc, Z., Cheng, T.C.E.: A tabu search\/path relinking algorithm to solve the job shop scheduling problem. Comput. Oper. Res. 53, 154\u2013164 (2015)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"9552_CR41","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1109\/TEVC.2009.2039139","volume":"14","author":"A Pr\u00fcgel-Bennett","year":"2010","unstructured":"Pr\u00fcgel-Bennett, A.: Benefits of a population: Five mechanisms that advantage population-based algorithms. IEEE Trans. Evol. Comput. 14(4), 500\u2013517 (2010)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"9552_CR42","volume":"408","author":"Y Ran","year":"2021","unstructured":"Ran, Y., Zhang, Y., Zhang, Z.: Parallel approximation for partial set cover. Appl. Math. Comput. 408, 126358 (2021)","journal-title":"Appl. Math. Comput."},{"key":"9552_CR43","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1007\/s10732-015-9295-0","volume":"21","author":"CFM Toledo","year":"2015","unstructured":"Toledo, C.F.M., da Silva, Arantes M., Hossomi, M.Y.B., Fran\u00e7a, P.M., Akartunal\u0131, K.: A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems. J. Heuristics 21, 687\u2013717 (2015)","journal-title":"J. Heuristics"},{"issue":"12","key":"9552_CR44","doi-asserted-by":"publisher","first-page":"3206","DOI":"10.1016\/j.cor.2011.10.014","volume":"40","author":"FL Usberti","year":"2013","unstructured":"Usberti, F.L., Fran\u00e7a, P.M., Fran\u00e7a, A.L.M.: Grasp with evolutionary path-relinking for the capacitated arc routing problem. Comput. Oper. Res. 40(12), 3206\u20133217 (2013)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"9552_CR45","doi-asserted-by":"publisher","first-page":"1336","DOI":"10.1109\/TPWRS.2008.922642","volume":"23","author":"L Wang","year":"2008","unstructured":"Wang, L., Singh, C.: Population-based intelligent search in reliability evaluation of generation systems with wind power penetration. IEEE Trans. Power Syst. 23(3), 1336\u20131345 (2008)","journal-title":"IEEE Trans. Power Syst."},{"issue":"2","key":"9552_CR46","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1016\/j.ejor.2021.02.015","volume":"294","author":"Y Wang","year":"2021","unstructured":"Wang, Y., Pan, S., Al-Shihabi, S., Zhou, J., Yang, N., Yin, M.: An improved configuration checking-based algorithm for the unicost set covering problem. Eur. J. Oper. Res. 294(2), 476\u2013491 (2021)","journal-title":"Eur. J. Oper. Res."},{"key":"9552_CR47","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1007\/s10878-013-9612-1","volume":"29","author":"M Yaghini","year":"2015","unstructured":"Yaghini, M., Karimi, M., Rahbar, M.: A set covering approach for multi-depot train driver scheduling. J. Comb. Optim. 29, 636\u2013654 (2015)","journal-title":"J. Comb. Optim."},{"key":"9552_CR48","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2021.108000","volume":"239","author":"Y Zhou","year":"2022","unstructured":"Zhou, Y., Liu, X., Hu, S., Wang, Y., Yin, M.: Combining max-min ant system with effective local search for solving the maximum set k-covering problem. Knowl.-Based Syst. 239, 108000 (2022)","journal-title":"Knowl.-Based Syst."},{"issue":"2","key":"9552_CR49","doi-asserted-by":"publisher","first-page":"1912","DOI":"10.1007\/s10489-022-03531-2","volume":"53","author":"Y Zhou","year":"2023","unstructured":"Zhou, Y., Fan, M., Liu, X., Xu, X., Wang, Y., Yin, M.: A master-apprentice evolutionary algorithm for maximum weighted set k-covering problem. Appl. Intell. 53(2), 1912\u20131944 (2023)","journal-title":"Appl. Intell."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-025-09552-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10732-025-09552-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-025-09552-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,8]],"date-time":"2025-03-08T13:18:17Z","timestamp":1741439897000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10732-025-09552-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,8]]},"references-count":49,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["9552"],"URL":"https:\/\/doi.org\/10.1007\/s10732-025-09552-7","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,2,8]]},"assertion":[{"value":"22 May 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 January 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 January 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 February 2025","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 material has not been published in whole or in part elsewhere. The manuscript is not currently being considered for publication in another journal. All authors have been personally and actively involved in substantive work leading to the manuscript, and will hold themselves jointly and individually responsible for its content.","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":"17"}}