{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T18:58:25Z","timestamp":1784228305364,"version":"3.55.0"},"reference-count":58,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2025,3,4]],"date-time":"2025-03-04T00:00:00Z","timestamp":1741046400000},"content-version":"vor","delay-in-days":62,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/doi.wiley.com\/10.1002\/tdm_license_1.1"}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Complexity"],"published-print":{"date-parts":[[2025,1]]},"abstract":"<jats:p>This study addresses influence maximization in complex networks, aiming to identify optimal seed nodes for maximal cascades. Greedy methods, though effective, prove inefficient for large\u2010scale social networks. This article introduces a double\u2010chromosome evolutionary algorithm to tackle this challenge efficiently. This method introduces a smart operator for stochastic selection based on the node degree to initialize the primary solutions. A novel smart approach was also employed to improve the convergence of the proposed method by ranking the nodes existing in the current solution and using a blacklist to reduce the probability of selecting the nodes that might be influenced by the selected nodes. Moreover, a novel local search operator with appropriate efficiency was proposed to increase influence. To maintain solution diversity, a population diversity retention operator is integrated. Experimental evaluations on six real\u2010world networks revealed the algorithm\u2019s superiority in terms of influence rates, consistently outperforming the DPSO algorithm and ranking second to CELF with minimal margin according to statistical analysis using the Friedman test. For runtime efficiency, the proposed method demonstrated significantly shorter execution times compared to CELF and DPSO, showcasing its scalability and robustness. These results underscore the method\u2019s effectiveness for applications requiring accurate identification of influential nodes.<\/jats:p>","DOI":"10.1155\/cplx\/9973872","type":"journal-article","created":{"date-parts":[[2025,3,12]],"date-time":"2025-03-12T01:08:48Z","timestamp":1741741728000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["EIM: A Novel Evolutionary Influence Maximizer in Complex Networks"],"prefix":"10.1155","volume":"2025","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-2219-0146","authenticated-orcid":false,"given":"Vahideh","family":"Sahargahi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2433-115X","authenticated-orcid":false,"given":"Vahid","family":"Majidnezhad","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4527-1731","authenticated-orcid":false,"given":"Saeid","family":"Taghavi Afshord","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2581-074X","authenticated-orcid":false,"given":"Yasser","family":"Jafari","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"311","published-online":{"date-parts":[[2025,3,4]]},"reference":[{"key":"e_1_2_14_1_2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011122126881"},{"key":"e_1_2_14_2_2","doi-asserted-by":"publisher","DOI":"10.1145\/1232722.1232727"},{"key":"e_1_2_14_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/2348283.2348373"},{"key":"e_1_2_14_4_2","doi-asserted-by":"publisher","DOI":"10.1145\/1148170.1148258"},{"key":"e_1_2_14_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"e_1_2_14_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2018.08.045"},{"key":"e_1_2_14_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2022.128179"},{"key":"e_1_2_14_8_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2021.126480"},{"key":"e_1_2_14_9_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2021.126841"},{"key":"e_1_2_14_10_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2021.04.084"},{"key":"e_1_2_14_11_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2020.05.084"},{"key":"e_1_2_14_12_2","unstructured":"BahutairM. Al AghbariZ. andKamelI. NodeRank: Finding Influential Nodes in Social Networks Based on Interests."},{"key":"e_1_2_14_13_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-020-01461-4"},{"key":"e_1_2_14_14_2","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281239"},{"key":"e_1_2_14_15_2","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557047"},{"key":"e_1_2_14_16_2","doi-asserted-by":"publisher","DOI":"10.1145\/1963192.1963217"},{"key":"e_1_2_14_17_2","doi-asserted-by":"crossref","unstructured":"CohenE. DellingD. PajorT. andWerneckR. Sketch-Based Influence Maximization and Computation: Scaling up With Guarantees 2014.","DOI":"10.1145\/2661829.2662077"},{"key":"e_1_2_14_18_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(99)00031-9"},{"key":"e_1_2_14_19_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2020.03.045"},{"key":"e_1_2_14_20_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2011.132"},{"key":"e_1_2_14_21_2","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2010.2052042"},{"key":"e_1_2_14_22_2","doi-asserted-by":"publisher","DOI":"10.1007\/s13369-024-09628-9"},{"key":"e_1_2_14_23_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2024.3424834"},{"key":"e_1_2_14_24_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2018.07.015"},{"key":"e_1_2_14_25_2","doi-asserted-by":"publisher","DOI":"10.1080\/03081079.2024.2339471"},{"key":"e_1_2_14_26_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2019.112971"},{"key":"e_1_2_14_27_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2017.12.003"},{"key":"e_1_2_14_28_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-020-00580-6"},{"key":"e_1_2_14_29_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2018.06.013"},{"key":"e_1_2_14_30_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2019.07.004"},{"key":"e_1_2_14_31_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2017.08.306"},{"key":"e_1_2_14_32_2","article-title":"Simulated Annealing Based Influence Maximization in Social Networks","author":"Jiang Q.","year":"2011","journal-title":"Presented at the Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, San Francisco, California"},{"key":"e_1_2_14_33_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00607-023-01157-x"},{"key":"e_1_2_14_34_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2018.08.033"},{"key":"e_1_2_14_35_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2018.07.038"},{"key":"e_1_2_14_36_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2016.07.012"},{"key":"e_1_2_14_37_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2018.09.040"},{"key":"e_1_2_14_38_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.105554"},{"key":"e_1_2_14_39_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2018.09.142"},{"key":"e_1_2_14_40_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-024-09648-5"},{"key":"e_1_2_14_41_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2019.01.070"},{"key":"e_1_2_14_42_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2017.10.007"},{"key":"e_1_2_14_43_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2944350"},{"key":"e_1_2_14_44_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2016.05.006"},{"key":"e_1_2_14_45_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-020-03355-2"},{"key":"e_1_2_14_46_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2017.07.029"},{"key":"e_1_2_14_47_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-022-04418-2"},{"key":"e_1_2_14_48_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2019.123590"},{"key":"e_1_2_14_49_2","doi-asserted-by":"publisher","DOI":"10.1007\/s13278-018-0489-y"},{"key":"e_1_2_14_50_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2014.03.070"},{"key":"e_1_2_14_51_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2017.05.089"},{"key":"e_1_2_14_52_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-01850-3"},{"key":"e_1_2_14_53_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.74.036104"},{"key":"e_1_2_14_54_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.68.065103"},{"key":"e_1_2_14_55_2","doi-asserted-by":"publisher","DOI":"10.1145\/1217299.1217301"},{"key":"e_1_2_14_56_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2016.10.020"},{"key":"e_1_2_14_57_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-01206-8_5"},{"key":"e_1_2_14_58_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-7552(98)00110-X"}],"container-title":["Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/cplx\/9973872","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full-xml\/10.1155\/cplx\/9973872","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/cplx\/9973872","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T03:54:42Z","timestamp":1773028482000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/cplx\/9973872"}},"subtitle":[],"editor":[{"given":"Hiroki","family":"Sayama","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"editor"}]}],"short-title":[],"issued":{"date-parts":[[2025,1]]},"references-count":58,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["10.1155\/cplx\/9973872"],"URL":"https:\/\/doi.org\/10.1155\/cplx\/9973872","archive":["Portico"],"relation":{},"ISSN":["1076-2787","1099-0526"],"issn-type":[{"value":"1076-2787","type":"print"},{"value":"1099-0526","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1]]},"assertion":[{"value":"2024-08-22","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-01-25","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-03-04","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"9973872"}}