{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,22]],"date-time":"2026-05-22T04:11:11Z","timestamp":1779423071056,"version":"3.53.1"},"reference-count":34,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62427811"],"award-info":[{"award-number":["62427811"]}],"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":["62422203"],"award-info":[{"award-number":["62422203"]}],"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":["62172072"],"award-info":[{"award-number":["62172072"]}],"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":["62272115"],"award-info":[{"award-number":["62272115"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Sciences"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1016\/j.ins.2026.123492","type":"journal-article","created":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T08:53:43Z","timestamp":1775897623000},"page":"123492","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["RHMGSA: Reinforcement learning-guided evolutionary search for critical node detection"],"prefix":"10.1016","volume":"748","author":[{"given":"Xiancheng","family":"Feng","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-9071-9600","authenticated-orcid":false,"given":"Jingkun","family":"Fan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8132-2380","authenticated-orcid":false,"given":"Chanjuan","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5245-7905","authenticated-orcid":false,"given":"Enqiang","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Witold","family":"Pedrycz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.ins.2026.123492_bib0005","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s10588-006-7084-x","article-title":"Identifying sets of key players in a social network","volume":"12","author":"Borgatti","year":"2006","journal-title":"Comput. Math. Organ. Theory."},{"issue":"1","key":"10.1016\/j.ins.2026.123492_bib0010","article-title":"Influential node identification in command and control networks based on integral k-shell","volume":"2019","author":"Wang","year":"2019","journal-title":"Wirel. Commun. Mob. Comput."},{"issue":"3","key":"10.1016\/j.ins.2026.123492_bib0015","first-page":"346","article-title":"Recognition and vulnerability analysis of key nodes in power grid based on complex network centrality","volume":"65","author":"Liu","year":"2017","journal-title":"IEEE Trans. Circuits Syst. II Express Briefs"},{"key":"10.1016\/j.ins.2026.123492_bib0020","doi-asserted-by":"crossref","DOI":"10.1016\/j.chaos.2025.116765","article-title":"Lowest degree decomposition of complex networks","volume":"199","author":"Yu","year":"2025","journal-title":"Chaos Solit. Fractals"},{"key":"10.1016\/j.ins.2026.123492_bib0025","doi-asserted-by":"crossref","DOI":"10.1016\/j.ins.2023.119140","article-title":"Identifying the cardinality-constrained critical nodes with a hybrid evolutionary algorithm","volume":"642","author":"Liu","year":"2023","journal-title":"Inf. Sci."},{"issue":"2","key":"10.1016\/j.ins.2026.123492_bib0030","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1002\/net.20464","article-title":"Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs","volume":"60","author":"Shen","year":"2012","journal-title":"Networks"},{"issue":"7","key":"10.1016\/j.ins.2026.123492_bib0035","doi-asserted-by":"crossref","first-page":"2193","DOI":"10.1016\/j.cor.2008.08.016","article-title":"Detecting critical nodes in sparse graphs","volume":"36","author":"Arulselvan","year":"2009","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.ins.2026.123492_bib0040","doi-asserted-by":"crossref","DOI":"10.1016\/j.ins.2024.121660","article-title":"Intelligent influencer selection in social networks for product promotions with crowd effect","volume":"693","author":"Wang","year":"2025","journal-title":"Inf. Sci."},{"key":"10.1016\/j.ins.2026.123492_bib0045","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1007\/s10589-012-9458-y","article-title":"Branch and CUT algorithms for detecting critical nodes in undirected graphs","volume":"53","author":"Di Summa","year":"2012","journal-title":"Comput. Optim. Appl."},{"key":"10.1016\/j.ins.2026.123492_bib0050","doi-asserted-by":"crossref","first-page":"1245","DOI":"10.1007\/s11590-013-0666-x","article-title":"Exact identification of critical nodes in sparse networks via new compact formulations","volume":"8","author":"Veremyev","year":"2014","journal-title":"Optim. Lett."},{"key":"10.1016\/j.ins.2026.123492_bib0055","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2021.105254","article-title":"Efficient methods for the distance-based critical node detection problem in complex networks","volume":"131","author":"Alozie","year":"2021","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.ins.2026.123492_bib0060","series-title":"Clustering Challenges in Biological Networks","first-page":"153","article-title":"Identifying critical nodes in protein-protein interaction networks","author":"Boginski","year":"2009"},{"issue":"11","key":"10.1016\/j.ins.2026.123492_bib0065","doi-asserted-by":"crossref","first-page":"2763","DOI":"10.1016\/j.cor.2012.02.008","article-title":"Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem","volume":"39","author":"Ventresca","year":"2012","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.ins.2026.123492_bib0070","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/j.endm.2014.11.006","article-title":"VNS solutions for the critical node problem","volume":"47","author":"Aringhieri","year":"2015","journal-title":"Electron. Notes Discrete Math."},{"issue":"3","key":"10.1016\/j.ins.2026.123492_bib0075","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1002\/net.21671","article-title":"Local search metaheuristics for the critical node problem","volume":"67","author":"Aringhieri","year":"2016","journal-title":"Networks"},{"key":"10.1016\/j.ins.2026.123492_bib0080","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1016\/j.engappai.2016.06.010","article-title":"A general evolutionary framework for different classes of critical node problems","volume":"55","author":"Aringhieri","year":"2016","journal-title":"Eng. Appl. Artif. Intell."},{"key":"10.1016\/j.ins.2026.123492_bib0085","article-title":"DPCND: a dual-population based evolutionary approach for critical node detection problem in complex networks","volume":"298","author":"Zhang","year":"2026","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.ins.2026.123492_bib0090","doi-asserted-by":"crossref","DOI":"10.1016\/j.engappai.2025.112526","article-title":"Critical nodes detection for complex networks via knowledge-guided evolutionary framework","volume":"162","author":"Liu","year":"2025","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"3","key":"10.1016\/j.ins.2026.123492_bib0095","doi-asserted-by":"crossref","first-page":"1587","DOI":"10.1109\/TSMC.2025.3647205","article-title":"Ensemble transitive bidirectional decoupled self-distillation for time-series classification","volume":"56","author":"Xiao","year":"2026","journal-title":"IEEE Trans. Syst. Man Cybern. Syst."},{"key":"10.1016\/j.ins.2026.123492_bib0100","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2020.105893","article-title":"Identifying critical nodes in complex networks via graph convolutional networks","volume":"198","author":"Yu","year":"2020","journal-title":"Knowl.-based Syst."},{"key":"10.1016\/j.ins.2026.123492_bib0105","article-title":"A machine learning-based approach for vital node identification in complex networks","volume":"214","author":"Rezaei","year":"2023","journal-title":"Expert Syst. Appl."},{"issue":"6","key":"10.1016\/j.ins.2026.123492_bib0110","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1038\/s42256-020-0177-2","article-title":"Finding key players in complex networks through deep reinforcement learning","volume":"2","author":"Fan","year":"2020","journal-title":"Nat. Mach. Intell."},{"issue":"8","key":"10.1016\/j.ins.2026.123492_bib0115","doi-asserted-by":"crossref","first-page":"1266","DOI":"10.1038\/s42256-025-01070-2","article-title":"Deep-learning-aided dismantling of interdependent networks","volume":"7","author":"Gu","year":"2025","journal-title":"Nat. Mach. Intell."},{"key":"10.1016\/j.ins.2026.123492_bib0120","first-page":"197","article-title":"A hybrid approach to network disintegration: integrating graph convolutional network and genetic algorithm","author":"Deng","year":"2025","journal-title":"Chaos Solitons Fractals"},{"key":"10.1016\/j.ins.2026.123492_bib0125","author":"Bello"},{"issue":"2","key":"10.1016\/j.ins.2026.123492_bib0130","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1016\/j.ejor.2020.07.063","article-title":"Machine learning for combinatorial optimization: a methodological tour d\u2019horizon","volume":"290","author":"Bengio","year":"2021","journal-title":"Eur. J. Oper. Res."},{"issue":"10","key":"10.1016\/j.ins.2026.123492_bib0135","doi-asserted-by":"crossref","first-page":"3806","DOI":"10.1109\/TITS.2019.2909109","article-title":"Online vehicle routing with neural combinatorial optimization and deep reinforcement learning","volume":"20","author":"James","year":"2019","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"10.1016\/j.ins.2026.123492_bib0140","article-title":"Combinatorial optimization with graph convolutional networks and guided tree search","volume":"31","author":"Li","year":"2018","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.ins.2026.123492_bib0145","series-title":"Proceedings of the 22nd International Conference on World Wide Web","first-page":"1343","article-title":"Konect: the Koblenz Network collection","author":"Kunegis","year":"2013"},{"issue":"1","key":"10.1016\/j.ins.2026.123492_bib0150","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1080\/15427951.2009.10129177","article-title":"Community structure in large networks: natural cluster sizes and the absence of large well-defined clusters","volume":"6","author":"Leskovec","year":"2009","journal-title":"Internet Math."},{"issue":"7563","key":"10.1016\/j.ins.2026.123492_bib0155","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1038\/nature14604","article-title":"Influence maximization in complex networks through optimal percolation","volume":"524","author":"Morone","year":"2015","journal-title":"Nature"},{"issue":"44","key":"10.1016\/j.ins.2026.123492_bib0160","doi-asserted-by":"crossref","first-page":"12368","DOI":"10.1073\/pnas.1605083113","article-title":"Network dismantling","volume":"113","author":"Braunstein","year":"2016","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"1","key":"10.1016\/j.ins.2026.123492_bib0165","doi-asserted-by":"crossref","DOI":"10.1038\/srep37954","article-title":"Fast and simple decycling and dismantling of networks","volume":"6","author":"Zdeborov\u00e1","year":"2016","journal-title":"Sci. Rep."},{"issue":"1","key":"10.1016\/j.ins.2026.123492_bib0170","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1038\/s42005-023-01483-8","article-title":"Identifying key players in complex networks via network entanglement","volume":"7","author":"Huang","year":"2024","journal-title":"Commun. Phys."}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025526004238?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025526004238?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,22]],"date-time":"2026-05-22T04:03:35Z","timestamp":1779422615000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020025526004238"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":34,"alternative-id":["S0020025526004238"],"URL":"https:\/\/doi.org\/10.1016\/j.ins.2026.123492","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"RHMGSA: Reinforcement learning-guided evolutionary search for critical node detection","name":"articletitle","label":"Article Title"},{"value":"Information Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ins.2026.123492","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"123492"}}