{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T08:09:44Z","timestamp":1758269384410,"version":"3.41.2"},"reference-count":42,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2021,11,28]],"date-time":"2021-11-28T00:00:00Z","timestamp":1638057600000},"content-version":"vor","delay-in-days":331,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Computational Intelligence and Neuroscience"],"published-print":{"date-parts":[[2021,1]]},"abstract":"<jats:p>The critical node detection problem (CNDP) refers to the identification of one or more nodes that have a significant impact on the entire complex network according to the importance of each node in a complex network. Most methods consider the CNDP as a single\u2010objective optimization problem, which requires more prior knowledge to a certain extent. This paper proposes a membrane evolution algorithm MEA\u2010CNDP to solve biobjective CNDP. MEA\u2010CNDP includes a population initialization strategy based on the evaluation of decision variables, a strategy to transform the main objective, a strategy to update the membrane inherited pool, and four membrane evolutionary operators. The numerical experiments on 16 benchmark problems with random and logarithmic weights show that MEA\u2010CNDP outperforms other algorithms in most cases. In particular, MEA\u2010CNDP has unique advantages in dealing with large\u2010scale sparse bi\u2010CNDP.<\/jats:p>","DOI":"10.1155\/2021\/8406864","type":"journal-article","created":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T03:05:06Z","timestamp":1638155106000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["MEA\u2010CNDP: A Membrane Evolutionary Algorithm for Solving Biobjective Critical Node Detection Problem"],"prefix":"10.1155","volume":"2021","author":[{"given":"Yaochang","family":"Xu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5239-8896","authenticated-orcid":false,"given":"Ping","family":"Guo","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2021,11,28]]},"reference":[{"key":"e_1_2_8_1_2","doi-asserted-by":"publisher","DOI":"10.1109\/TE.2020.3008878"},{"key":"e_1_2_8_2_2","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1693"},{"key":"e_1_2_8_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNB.2017.2722466"},{"key":"e_1_2_8_4_2","article-title":"A linear-time solution for all-SAT problem based on P system","volume":"27","author":"Ping G.","year":"2018","journal-title":"Chinese Journal of Electronics"},{"key":"e_1_2_8_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijleo.2016.06.016"},{"key":"e_1_2_8_6_2","doi-asserted-by":"publisher","DOI":"10.1007\/s41965-018-00002-x"},{"key":"e_1_2_8_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2014.02.057"},{"key":"e_1_2_8_8_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1100.0851"},{"volume-title":"Applications of Membrane Computing","year":"2007","author":"Nishida T. Y.","key":"e_1_2_8_9_2"},{"key":"e_1_2_8_10_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2015.08.008"},{"key":"e_1_2_8_11_2","doi-asserted-by":"publisher","DOI":"10.15837\/ijccc.2015.5.2030"},{"key":"e_1_2_8_12_2","doi-asserted-by":"publisher","DOI":"10.1166\/jctn.2015.3866"},{"key":"e_1_2_8_13_2","doi-asserted-by":"publisher","DOI":"10.15837\/ijccc.2015.2.1757"},{"key":"e_1_2_8_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/access.2019.2915550"},{"key":"e_1_2_8_15_2","doi-asserted-by":"publisher","DOI":"10.1109\/access.2019.2933383"},{"key":"e_1_2_8_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/access.2020.3035058"},{"key":"e_1_2_8_17_2","article-title":"A hybrid swarm algorithm for collective construction of 3D structures","volume":"18","author":"Zapata H.","year":"2020","journal-title":"International Journal of Artificial Intelligence"},{"key":"e_1_2_8_18_2","doi-asserted-by":"publisher","DOI":"10.1080\/00207721.2021.1927236"},{"key":"e_1_2_8_19_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2017.02.012"},{"key":"e_1_2_8_20_2","article-title":"Island-based cuckoo search with highly disruptive polynomial mutation","volume":"17","author":"Abed-Alguni B. H.","year":"2019","journal-title":"International Journal of Artificial Intelligence"},{"key":"e_1_2_8_21_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2008.08.016"},{"key":"e_1_2_8_22_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-0534-5_4"},{"key":"e_1_2_8_23_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-012-9458-y"},{"key":"e_1_2_8_24_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2014.02.003"},{"key":"e_1_2_8_25_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2018.04.012"},{"key":"e_1_2_8_26_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-016-2110-y"},{"key":"e_1_2_8_27_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2012.02.008"},{"key":"e_1_2_8_28_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2016.06.010"},{"key":"e_1_2_8_29_2","doi-asserted-by":"publisher","DOI":"10.1109\/tsmc.2018.2790438"},{"key":"e_1_2_8_30_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2017.08.053"},{"key":"e_1_2_8_31_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-019-03824-8"},{"key":"e_1_2_8_32_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2014.04.007"},{"key":"e_1_2_8_33_2","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2007.892759"},{"key":"e_1_2_8_34_2","doi-asserted-by":"publisher","DOI":"10.2307\/254267"},{"key":"e_1_2_8_35_2","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2017.2671462"},{"key":"e_1_2_8_36_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-013-0666-x"},{"key":"e_1_2_8_37_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2017.11.030"},{"key":"e_1_2_8_38_2","doi-asserted-by":"publisher","DOI":"10.1109\/tevc.2003.810758"},{"key":"e_1_2_8_39_2","unstructured":"HubandS. HingstonP. WhileL. andBaroneL. An evolution strategy with probabilistic mutation for multi-objective optimisation Proceedings of the 2003 Congress on Evolutionary Computation CEC\u201903. 2003 Canberra Australia."},{"key":"e_1_2_8_40_2","doi-asserted-by":"publisher","DOI":"10.1109\/tevc.2005.851275"},{"key":"e_1_2_8_41_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45356-3_83"},{"key":"e_1_2_8_42_2","unstructured":"SpearsW. M.andDe JongK. A. On the virtues of parameterized uniform crossover Proceedings of the 4th International Conference on Genetic Algorithms July 1991 San Diego CA USA."}],"container-title":["Computational Intelligence and Neuroscience"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/cin\/2021\/8406864.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/cin\/2021\/8406864.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2021\/8406864","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,6]],"date-time":"2024-08-06T12:27:51Z","timestamp":1722947271000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2021\/8406864"}},"subtitle":[],"editor":[{"given":"Radu-Emil","family":"Precup","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2021,1]]},"references-count":42,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["10.1155\/2021\/8406864"],"URL":"https:\/\/doi.org\/10.1155\/2021\/8406864","archive":["Portico"],"relation":{},"ISSN":["1687-5265","1687-5273"],"issn-type":[{"type":"print","value":"1687-5265"},{"type":"electronic","value":"1687-5273"}],"subject":[],"published":{"date-parts":[[2021,1]]},"assertion":[{"value":"2021-07-05","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-11-02","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-11-28","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"8406864"}}