{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,27]],"date-time":"2026-06-27T11:11:15Z","timestamp":1782558675960,"version":"3.54.5"},"reference-count":41,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2025,3,14]],"date-time":"2025-03-14T00:00:00Z","timestamp":1741910400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"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":["2024A-024"],"award-info":[{"award-number":["2024A-024"]}],"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":["23JRRA766"],"award-info":[{"award-number":["23JRRA766"]}],"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":["24CXGA046"],"award-info":[{"award-number":["24CXGA046"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Gansu Provincial University Teachers Innovation Foundation","award":["62162040"],"award-info":[{"award-number":["62162040"]}]},{"name":"Gansu Provincial University Teachers Innovation Foundation","award":["2024A-024"],"award-info":[{"award-number":["2024A-024"]}]},{"name":"Gansu Provincial University Teachers Innovation Foundation","award":["23JRRA766"],"award-info":[{"award-number":["23JRRA766"]}]},{"name":"Gansu Provincial University Teachers Innovation Foundation","award":["24CXGA046"],"award-info":[{"award-number":["24CXGA046"]}]},{"name":"Gansu Provincial Science Fund for Distinguished Young Scholars","award":["62162040"],"award-info":[{"award-number":["62162040"]}]},{"name":"Gansu Provincial Science Fund for Distinguished Young Scholars","award":["2024A-024"],"award-info":[{"award-number":["2024A-024"]}]},{"name":"Gansu Provincial Science Fund for Distinguished Young Scholars","award":["23JRRA766"],"award-info":[{"award-number":["23JRRA766"]}]},{"name":"Gansu Provincial Science Fund for Distinguished Young Scholars","award":["24CXGA046"],"award-info":[{"award-number":["24CXGA046"]}]},{"name":"Gansu Provincial Science Fund for Technological Innovation Guidance Plan","award":["62162040"],"award-info":[{"award-number":["62162040"]}]},{"name":"Gansu Provincial Science Fund for Technological Innovation Guidance Plan","award":["2024A-024"],"award-info":[{"award-number":["2024A-024"]}]},{"name":"Gansu Provincial Science Fund for Technological Innovation Guidance Plan","award":["23JRRA766"],"award-info":[{"award-number":["23JRRA766"]}]},{"name":"Gansu Provincial Science Fund for Technological Innovation Guidance Plan","award":["24CXGA046"],"award-info":[{"award-number":["24CXGA046"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>Influence maximization (IM) is a pivotal challenge in social network analysis, which aims to identify a subset of key nodes that can maximize the information spread across networks. Traditional methods often sacrifice solution accuracy for spreading efficiency, while meta-heuristic approaches face limitations in escaping local optima and balancing exploration and exploitation. To address such challenges, this paper introduces a landscape-aware discrete particle swarm optimization (LA-DPSO) to solve the IM problem. The proposed algorithm employs a population partitioning strategy based on a fitness distance correlation index to enhance population diversity. For the two partitioned subpopulations, a global evolutionary mechanism and a variable neighborhood search mechanism are designed to make a symmetrical balance between the exploration and exploitation. The fitness landscape entropy is introduced to detect the local optima and prevent the population from premature convergence during the evolution. Experiments conducted on six real-world social networks demonstrate that the proposed LA-DPSO achieves an average performance improvement of 16% compared to state-of-the-art methods while exhibiting excellent scalability across diverse network types.<\/jats:p>","DOI":"10.3390\/sym17030435","type":"journal-article","created":{"date-parts":[[2025,3,14]],"date-time":"2025-03-14T08:46:46Z","timestamp":1741942006000},"page":"435","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A Landscape-Aware Discrete Particle Swarm Optimization for the Influence Maximization Problem in Social Networks"],"prefix":"10.3390","volume":"17","author":[{"given":"Baoqiang","family":"Chai","sequence":"first","affiliation":[{"name":"School of Information science and Engineering, Lanzhou University, Lanzhou 730000, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiaqiang","family":"Fu","sequence":"additional","affiliation":[{"name":"School of Computer and Communication, Lanzhou University of Technology, Lanzhou 730050, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ruisheng","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Information science and Engineering, Lanzhou University, Lanzhou 730000, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jianxin","family":"Tang","sequence":"additional","affiliation":[{"name":"School of Computer and Communication, Lanzhou University of Technology, Lanzhou 730050, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2025,3,14]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"123429","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":"ref_2","doi-asserted-by":"crossref","first-page":"1169","DOI":"10.1016\/j.ejor.2020.07.046","article-title":"Incentive rate determination in viral marketing","volume":"289","author":"Tavasoli","year":"2021","journal-title":"Eur. J. Oper. Res."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"672","DOI":"10.1016\/j.ins.2022.11.101","article-title":"On the role of community structure in evolution of opinion formation: A new bounded confidence opinion dynamics","volume":"621","author":"Peng","year":"2023","journal-title":"Inf. Sci."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"2397","DOI":"10.1109\/TCSS.2023.3277465","article-title":"Rumor propagation control with anti-rumor mechanism and intermittent control strategies","volume":"11","author":"Zhong","year":"2023","journal-title":"IEEE Trans. Comput. Soc. Syst."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., and Tardos, \u00c9. (2003, January 24\u201327). Maximizing the spread of influence through a social network. Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, DC, USA.","DOI":"10.1145\/956750.956769"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., VanBriesen, J., and Glance, N. (2007, January 12\u201315). Cost-effective outbreak detection in networks. Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Jose, CA, USA.","DOI":"10.1145\/1281192.1281239"},{"key":"ref_7","unstructured":"Goyal, A., Lu, W., and Lakshmanan, L.V. (April, January 28). Celf++ optimizing the greedy algorithm for influence maximization in social networks. Proceedings of the 20th International Conference Companion on World Wide Web, Hyderabad, India."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"101798","DOI":"10.1016\/j.jksuci.2023.101798","article-title":"Towards identifying influential nodes in complex networks using semi-local centrality metrics","volume":"35","author":"Zhang","year":"2023","journal-title":"J. King Saud. Univ. Comput. Inf. Sci."},{"key":"ref_9","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":"ref_10","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","author":"Gong","year":"2016","journal-title":"Inf. Sci."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"7749","DOI":"10.1007\/s10489-021-02283-9","article-title":"Identification of top-k influential nodes based on discrete crow search algorithm optimization for influence maximization","volume":"51","author":"Li","year":"2021","journal-title":"Appl. Intell."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"111037","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":"ref_13","doi-asserted-by":"crossref","first-page":"127195","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":"ref_14","unstructured":"Wright, S. (2025, March 05). The Roles of Mutation, Inbreeding, Crossbreeding, and Selection in Evolution. Available online: http:\/\/www.esp.org\/books\/6th-congress\/facsimile\/contents\/6th-cong-p356-wright.pdf."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/j.neucom.2022.06.084","article-title":"A survey of fitness landscape analysis for optimization","volume":"503","author":"Zou","year":"2022","journal-title":"Neurocomputing"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/j.knosys.2016.09.020","article-title":"Big social network influence maximization via recursively estimating influence spread","volume":"113","author":"Lu","year":"2016","journal-title":"Knowl. Based Syst."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"3767","DOI":"10.1007\/s12652-021-03510-4","article-title":"A quick GRASP-based method for influence maximization in social networks","volume":"14","author":"Duarte","year":"2023","journal-title":"J. Ambient Intell. Humaniz. Comput."},{"key":"ref_18","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":"ref_19","doi-asserted-by":"crossref","first-page":"093106","DOI":"10.1063\/1.5140646","article-title":"An adaptive heuristic clustering algorithm for influence maximization in complex networks","volume":"30","author":"Yang","year":"2020","journal-title":"Chaos Interdiscip. J. Nonlinear Sci."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"114207","DOI":"10.1016\/j.eswa.2020.114207","article-title":"A dynamic algorithm based on cohesive entropy for influence maximization in social networks","volume":"169","author":"Li","year":"2021","journal-title":"Expert Syst. Appl."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"114168","DOI":"10.1016\/j.eswa.2020.114168","article-title":"An efficient path-based approach for influence maximization in social networks","volume":"167","author":"Kianian","year":"2021","journal-title":"Expert Syst. Appl."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/s10462-024-10725-2","article-title":"A new semi-local centrality for identifying influential nodes based on local average shortest path with extended neighborhood","volume":"57","author":"Xiao","year":"2024","journal-title":"Artif. Intell. Rev."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"578","DOI":"10.1016\/j.ins.2022.07.103","article-title":"CBIM: Community-based influence maximization in multilayer networks","volume":"609","author":"Rao","year":"2022","journal-title":"Inf. Sci."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"118869","DOI":"10.1016\/j.eswa.2022.118869","article-title":"FIP: A fast overlapping community-based Influence Maximization Algorithm using probability coefficient of global diffusion in social networks","volume":"213","author":"Bouyer","year":"2023","journal-title":"Expert Syst. Appl."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1109\/TNSE.2023.3295911","article-title":"Influence nodes identifying method via community-based backward generating network framework","volume":"11","author":"Liu","year":"2023","journal-title":"IEEE Trans. Netw. Sci. Eng."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1109\/TETC.2024.3403891","article-title":"Fair Influence Maximization in Social Networks: A Community-Based Evolutionary Algorithm","volume":"13","author":"Ma","year":"2024","journal-title":"IEEE Trans. Emerg. Top. Comput."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"1288","DOI":"10.1109\/TCSS.2022.3164667","article-title":"PIANO: Influence maximization meets deep reinforcement learning","volume":"10","author":"Li","year":"2022","journal-title":"IEEE Trans. Comput. Soc. Syst."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"1617","DOI":"10.1016\/j.ins.2022.06.075","article-title":"Influence maximization in social networks using graph embedding and graph neural network","volume":"607","author":"Kumar","year":"2022","journal-title":"Inf. Sci."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"118770","DOI":"10.1016\/j.eswa.2022.118770","article-title":"Influence maximization in social networks using transfer learning via graph-based LSTM","volume":"212","author":"Kumar","year":"2023","journal-title":"Expert Syst. Appl."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"102183","DOI":"10.1016\/j.jksuci.2024.102183","article-title":"GCNT: Identify influential seed set effectively in social networks by integrating graph convolutional networks with graph transformers","volume":"36","author":"Tang","year":"2024","journal-title":"J. King. Saud. Univ. Comput. Inf. Sci."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"103681","DOI":"10.1016\/j.ipm.2024.103681","article-title":"HCCKshell: A heterogeneous cross-comparison improved Kshell algorithm for Influence Maximization","volume":"61","author":"Li","year":"2024","journal-title":"Infor. Process. Manag."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/j.knosys.2018.06.013","article-title":"Maximizing the spread of influence via the collective intelligence of discrete bat algorithm","volume":"160","author":"Tang","year":"2018","journal-title":"Knowl. Based Syst."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"116342","DOI":"10.1016\/j.eswa.2021.116342","article-title":"A two-stage VIKOR assisted multi-operator differential evolution approach for Influence Maximization in social networks","volume":"192","author":"Biswas","year":"2022","journal-title":"Expert Syst. Appl."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"110062","DOI":"10.1016\/j.asoc.2023.110062","article-title":"ABEM: An adaptive agent-based evolutionary approach for influence maximization in dynamic social networks","volume":"136","author":"Li","year":"2023","journal-title":"Appl. Soft Comput."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"1091","DOI":"10.1109\/TEVC.2021.3081478","article-title":"Identifying influential spreaders in social networks through discrete moth-flame optimization","volume":"25","author":"Wang","year":"2021","journal-title":"IEEE Trans. Evolut. Comput."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/j.jnca.2017.12.003","article-title":"DDSE: A novel evolutionary algorithm based on degree-descending search strategy for influence maximization in social networks","volume":"103","author":"Cui","year":"2018","journal-title":"J. Netw. Comput. Appl."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"112128","DOI":"10.1016\/j.asoc.2024.112128","article-title":"A constrained multi-objective evolutionary algorithm based on fitness landscape indicator","volume":"166","author":"Fang","year":"2024","journal-title":"Appl. Soft Comput."},{"key":"ref_38","doi-asserted-by":"crossref","unstructured":"Malan, K.M., and Engelbrecht, A.P. (2009, January 18\u201321). Quantifying ruggedness of continuous landscapes using entropy. Proceedings of the 2009 IEEE Congress on Evolutionary Computation, Trondheim, Norway.","DOI":"10.1109\/CEC.2009.4983112"},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"111126","DOI":"10.1016\/j.asoc.2023.111126","article-title":"Hierarchical parallel search with automatic parameter configuration for particle swarm optimization","volume":"151","author":"Zhao","year":"2024","journal-title":"Appl. Soft Comput."},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"108871","DOI":"10.1016\/j.cie.2022.108871","article-title":"An adaptive hybrid variable-large neighborhood search algorithm for profit maximization problem in designing production lines","volume":"175","author":"Demir","year":"2023","journal-title":"Comput. Ind. Eng."},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"115192","DOI":"10.1016\/j.chaos.2024.115192","article-title":"ENIMNR: Enhanced node influence maximization through node representation in social networks","volume":"186","author":"Wei","year":"2024","journal-title":"Chaos Solitons Fract."}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/17\/3\/435\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T16:53:49Z","timestamp":1760028829000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/17\/3\/435"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,14]]},"references-count":41,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2025,3]]}},"alternative-id":["sym17030435"],"URL":"https:\/\/doi.org\/10.3390\/sym17030435","relation":{},"ISSN":["2073-8994"],"issn-type":[{"value":"2073-8994","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3,14]]}}}