{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,5]],"date-time":"2026-07-05T00:15:21Z","timestamp":1783210521034,"version":"3.54.6"},"reference-count":42,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"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":["62162040"],"award-info":[{"award-number":["62162040"]}],"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":["62562044"],"award-info":[{"award-number":["62562044"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100019530","name":"Science Fund for Distinguished Young Scholars of Gansu Province","doi-asserted-by":"publisher","award":["23JRRA766"],"award-info":[{"award-number":["23JRRA766"]}],"id":[{"id":"10.13039\/501100019530","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Swarm and Evolutionary Computation"],"published-print":{"date-parts":[[2026,5]]},"DOI":"10.1016\/j.swevo.2026.102404","type":"journal-article","created":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T10:19:30Z","timestamp":1777976370000},"page":"102404","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Artificial bee colony meets variable neighborhood search: Fresh insights into influence maximization in social networks"],"prefix":"10.1016","volume":"105","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6822-0590","authenticated-orcid":false,"given":"Jianxin","family":"Tang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fangjie","family":"Dong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chen","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wenhuan","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Huiyi","family":"Wei","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.swevo.2026.102404_b1","doi-asserted-by":"crossref","first-page":"7570","DOI":"10.1016\/j.jksuci.2021.08.009","article-title":"Influence maximization frameworks, performance, challenges and directions on social network: A theoretical study","volume":"34","author":"Singh","year":"2022","journal-title":"J. King Saud Univ.-Comput. Inf. Sci."},{"key":"10.1016\/j.swevo.2026.102404_b2","doi-asserted-by":"crossref","DOI":"10.1073\/pnas.2422890122","article-title":"The effects of social media criticism against public health institutions on trust, emotions, and social media engagement","volume":"122","author":"Lee","year":"2025","journal-title":"Proc. Natl. Acad. Sci."},{"key":"10.1016\/j.swevo.2026.102404_b3","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1038\/s41562-022-01459-8","article-title":"Identity effects in social media","volume":"7","author":"Taylor","year":"2023","journal-title":"Nat. Hum. Behav."},{"key":"10.1016\/j.swevo.2026.102404_b4","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2024.123429","article-title":"A survey on influence maximization models","volume":"248","author":"Jaouadi","year":"2024","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.swevo.2026.102404_b5","doi-asserted-by":"crossref","unstructured":"D. Kempe, J. Kleinberg, \u00c9. Tardos, Maximizing the spread of influence through a social network, in: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2003, pp. 137\u2013146.","DOI":"10.1145\/956750.956769"},{"key":"10.1016\/j.swevo.2026.102404_b6","doi-asserted-by":"crossref","DOI":"10.1016\/j.chaos.2025.116573","article-title":"Identifying critical nodes in complex networks via a Multi-Scale Influence Spread method","volume":"198","author":"Ma","year":"2025","journal-title":"Chaos Solitons Fractals"},{"key":"10.1016\/j.swevo.2026.102404_b7","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2024.101609","article-title":"IMNE: Maximizing influence through deep learning-based node embedding in social network","volume":"88","author":"Hu","year":"2024","journal-title":"Swarm Evol. Comput."},{"key":"10.1016\/j.swevo.2026.102404_b8","doi-asserted-by":"crossref","first-page":"0442","DOI":"10.34133\/research.0442","article-title":"Nature-inspired intelligent computing: A comprehensive survey","volume":"7","author":"Jiao","year":"2024","journal-title":"Research"},{"key":"10.1016\/j.swevo.2026.102404_b9","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2024.101542","article-title":"Finding robust and influential nodes on directed networks using a memetic algorithm","volume":"87","author":"Ou","year":"2024","journal-title":"Swarm Evol. Comput."},{"key":"10.1016\/j.swevo.2026.102404_b10","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2023.111037","article-title":"Influence Maximization in social networks using discretized Harris\u2019 Hawks Optimization algorithm","volume":"149","author":"Khatri","year":"2023","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.swevo.2026.102404_b11","doi-asserted-by":"crossref","DOI":"10.1016\/j.chaos.2025.117159","article-title":"Influential nodes identification based on Quasi-Laplacian Gravity Model","volume":"200","author":"Liu","year":"2025","journal-title":"Chaos Solitons Fractals"},{"key":"10.1016\/j.swevo.2026.102404_b12","article-title":"An idea based on honey bee swarm for numerical optimization","author":"Karaboga","year":"2005","journal-title":"J. Math. Sociol."},{"key":"10.1016\/j.swevo.2026.102404_b13","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","article-title":"Variable neighborhood search: Principles and applications","volume":"130","author":"Hansen","year":"2001","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.swevo.2026.102404_b14","doi-asserted-by":"crossref","unstructured":"J. Leskovec, A. Krause, C. Guestrin, C. Faloutsos, J. Vanbriesen, N. Glance, Cost-effective outbreak detection in networks, in: Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2007, pp. 420\u2013429.","DOI":"10.1145\/1281192.1281239"},{"key":"10.1016\/j.swevo.2026.102404_b15","doi-asserted-by":"crossref","unstructured":"W. Chen, Y. Wang, S. Yang, Efficient influence maximization in social networks, in: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2009, pp. 199\u2013208.","DOI":"10.1145\/1557019.1557047"},{"key":"10.1016\/j.swevo.2026.102404_b16","doi-asserted-by":"crossref","unstructured":"C. Borgs, M. Brautbar, J. Chayes, B. Lucier, Maximizing social influence in nearly optimal time, in: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014, pp. 946\u2013957.","DOI":"10.1137\/1.9781611973402.70"},{"key":"10.1016\/j.swevo.2026.102404_b17","doi-asserted-by":"crossref","unstructured":"Y. Tang, X. Xiao, Y. Shi, Influence maximization: near-optimal time complexity meets practical efficiency, in: Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data, 2014, pp. 75\u201386.","DOI":"10.1145\/2588555.2593670"},{"key":"10.1016\/j.swevo.2026.102404_b18","doi-asserted-by":"crossref","unstructured":"Y. Tang, Y. Shi, X. Xiao, Influence Maximization in Near-Linear Time: A Martingale Approach, in: Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, 2015, pp. 1539\u20131554.","DOI":"10.1145\/2723372.2723734"},{"key":"10.1016\/j.swevo.2026.102404_b19","doi-asserted-by":"crossref","unstructured":"Q. Guo, S. Wang, Z. Wei, M. Chen, Influence Maximization Revisited: Efficient Reverse Reachable Set Generation with Bound Tightened, in: Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data, 2020, pp. 2167\u20132181.","DOI":"10.1145\/3318464.3389740"},{"key":"10.1016\/j.swevo.2026.102404_b20","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1080\/0022250X.1972.9989806","article-title":"Factoring and weighting approaches to status scores and clique identification","volume":"2","author":"Bonacich","year":"1972","journal-title":"J. Math. Sociol."},{"key":"10.1016\/j.swevo.2026.102404_b21","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0378-8733(78)90021-7","article-title":"Centrality in social networks conceptual clarification","volume":"1","author":"Freeman","year":"1978","journal-title":"Soc. Networks"},{"key":"10.1016\/j.swevo.2026.102404_b22","doi-asserted-by":"crossref","first-page":"734","DOI":"10.1109\/JETCAS.2023.3283680","article-title":"Identification of Influential Nodes in Complex Networks With Degree and Average Neighbor Degree","volume":"13","author":"Chen","year":"2023","journal-title":"IEEE J. Emerg. Sel. Top. Circuits Syst."},{"key":"10.1016\/j.swevo.2026.102404_b23","doi-asserted-by":"crossref","DOI":"10.1016\/j.chaos.2025.116278","article-title":"Finding influential nodes in complex networks by integrating nodal intrinsic and extrinsic centrality","volume":"194","author":"Zhu","year":"2025","journal-title":"Chaos Solitons Fractals"},{"key":"10.1016\/j.swevo.2026.102404_b24","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2023.106432","article-title":"Automatic design of constructive heuristics for a reconfigurable distributed flowshop group scheduling problem","volume":"161","author":"Zhang","year":"2024","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.swevo.2026.102404_b25","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1007\/s12530-024-09640-2","article-title":"Meta-heuristic algorithms for influence maximization: a survey","volume":"16","author":"Fan","year":"2025","journal-title":"Evolving Syst."},{"key":"10.1016\/j.swevo.2026.102404_b26","doi-asserted-by":"crossref","unstructured":"Q. Jiang, G. Song, G. Cong, Y. Wang, W. Si, K. Xie, Simulated Annealing Based Influence Maximization in Social Networks, in: Proceedings of the 25th AAAI Conference on Artificial Intelligence, AAAI 2011, 2011, pp. 127\u2013132.","DOI":"10.1609\/aaai.v25i1.7838"},{"key":"10.1016\/j.swevo.2026.102404_b27","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.ins.2020.12.048","article-title":"An MCDM integrated adaptive simulated annealing approach for influence maximization in social networks","volume":"556","author":"Biswas","year":"2021","journal-title":"Inform. Sci."},{"key":"10.1016\/j.swevo.2026.102404_b28","doi-asserted-by":"crossref","DOI":"10.1016\/j.jnca.2020.102973","article-title":"LIDDE: A differential evolution algorithm based on local-influence-descending search strategy for influence maximization in social networks","volume":"178","author":"Qiu","year":"2021","journal-title":"J. Netw. Comput. Appl."},{"key":"10.1016\/j.swevo.2026.102404_b29","doi-asserted-by":"crossref","DOI":"10.1016\/j.neucom.2023.127195","article-title":"PHEE: Identifying influential nodes in social networks with a phased evaluation-enhanced search","volume":"572","author":"Zhu","year":"2024","journal-title":"Neurocomputing"},{"key":"10.1016\/j.swevo.2026.102404_b30","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2025.102002","article-title":"Probing the fitness landscape of the influential nodes for the influence maximization problem in social networks","volume":"97","author":"Tang","year":"2025","journal-title":"Swarm Evol. Comput."},{"key":"10.1016\/j.swevo.2026.102404_b31","doi-asserted-by":"crossref","first-page":"600","DOI":"10.1016\/j.ins.2016.07.012","article-title":"Influence maximization in social networks based on discrete particle swarm optimization","volume":"367\u2013368","author":"Gong","year":"2016","journal-title":"Inform. Sci."},{"key":"10.1016\/j.swevo.2026.102404_b32","doi-asserted-by":"crossref","first-page":"1365","DOI":"10.1109\/TCSS.2025.3528890","article-title":"Influence Maximization in Sentiment Propagation With Multisearch Particle Swarm Optimization Algorithm","volume":"12","author":"He","year":"2025","journal-title":"IEEE Trans. Comput. Soc. Syst."},{"key":"10.1016\/j.swevo.2026.102404_b33","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2019.105606","article-title":"Maximizing three-hop influence spread in social networks using discrete comprehensive learning artificial bee colony optimizer","volume":"83","author":"Ma","year":"2019","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.swevo.2026.102404_b34","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2020.106436","article-title":"Identifying influential spreaders using multi-objective artificial bee colony optimization","volume":"94","author":"Sheikhahmadi","year":"2020","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.swevo.2026.102404_b35","first-page":"2440","article-title":"A tutorial on variable neighborhood search","volume":"711","author":"Hansen","year":"2003","journal-title":"Les Cah. Du GERAD ISSN"},{"key":"10.1016\/j.swevo.2026.102404_b36","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/s13675-016-0075-x","article-title":"Variable neighborhood search: basics and variants","volume":"5","author":"Hansen","year":"2017","journal-title":"EURO J. Comput. Optim."},{"key":"10.1016\/j.swevo.2026.102404_b37","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2023.106221","article-title":"Variable Neighborhood Search: The power of change and simplicity","volume":"155","author":"Brimberg","year":"2023","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.swevo.2026.102404_b38","doi-asserted-by":"crossref","first-page":"3624","DOI":"10.1109\/TCYB.2025.3571421","article-title":"MFEA-rcim: A multifactorial evolutionary algorithm for determining robust and influential seeds from competitive networks under structural failures","volume":"55","author":"Wang","year":"2025","journal-title":"IEEE Trans. Cybern."},{"key":"10.1016\/j.swevo.2026.102404_b39","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2025.102187","article-title":"A multifactorial evolutionary algorithm to detect stably influential seeds from competitive networks under multiple damage scenarios","volume":"99","author":"Wang","year":"2025","journal-title":"Swarm Evol. Comput."},{"key":"10.1016\/j.swevo.2026.102404_b40","doi-asserted-by":"crossref","first-page":"P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","article-title":"Fast unfolding of communities in large networks","volume":"2008","author":"Blondel","year":"2008","journal-title":"J. Stat. Mech. Theory Exp."},{"key":"10.1016\/j.swevo.2026.102404_b41","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/s42979-023-02453-1","article-title":"Influence maximization in dynamic networks using reinforcement learning","volume":"5","author":"Dizaji","year":"2024","journal-title":"SN Comput. Sci."},{"key":"10.1016\/j.swevo.2026.102404_b42","doi-asserted-by":"crossref","DOI":"10.1155\/2017\/5049836","article-title":"On the shoulders of giants: incremental influence maximization in evolving social networks","volume":"2017","author":"Liu","year":"2017","journal-title":"Complexity"}],"container-title":["Swarm and Evolutionary Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2210650226001240?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2210650226001240?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T23:21:32Z","timestamp":1783207292000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2210650226001240"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5]]},"references-count":42,"alternative-id":["S2210650226001240"],"URL":"https:\/\/doi.org\/10.1016\/j.swevo.2026.102404","relation":{},"ISSN":["2210-6502"],"issn-type":[{"value":"2210-6502","type":"print"}],"subject":[],"published":{"date-parts":[[2026,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Artificial bee colony meets variable neighborhood search: Fresh insights into influence maximization in social networks","name":"articletitle","label":"Article Title"},{"value":"Swarm and Evolutionary Computation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.swevo.2026.102404","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"102404"}}