{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,28]],"date-time":"2026-05-28T14:11:51Z","timestamp":1779977511063,"version":"3.53.1"},"reference-count":61,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"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","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Reliability Engineering & System Safety"],"published-print":{"date-parts":[[2026,12]]},"DOI":"10.1016\/j.ress.2026.112918","type":"journal-article","created":{"date-parts":[[2026,5,22]],"date-time":"2026-05-22T16:17:56Z","timestamp":1779466676000},"page":"112918","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Influence regulation in networks and its metaheuristic solution"],"prefix":"10.1016","volume":"276","author":[{"given":"Qingtao","family":"Pan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8925-2367","authenticated-orcid":false,"given":"Jun","family":"Tang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhongshan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yirun","family":"Ruan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/j.ress.2026.112918_bib0001","article-title":"The path of complexity","volume":"1","author":"H\u00e9bert-Dufresne","year":"2024","journal-title":"Npj Complex"},{"key":"10.1016\/j.ress.2026.112918_bib0002","doi-asserted-by":"crossref","first-page":"T273","DOI":"10.1088\/0951-7715\/21\/12\/T03","article-title":"Nonlinearity in complexity science","volume":"21","author":"MacKay","year":"2008","journal-title":"Nonlinearity"},{"key":"10.1016\/j.ress.2026.112918_bib0003","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.physrep.2023.03.005","article-title":"Signal propagation in complex networks","volume":"1017","author":"Ji","year":"2023","journal-title":"Phys Rep"},{"key":"10.1016\/j.ress.2026.112918_bib0004","doi-asserted-by":"crossref","DOI":"10.1016\/j.ress.2024.109940","article-title":"Accident spread and risk propagation mechanism in complex industrial system network","volume":"244","author":"Feng","year":"2024","journal-title":"Reliab Eng Syst Saf"},{"key":"10.1016\/j.ress.2026.112918_bib0005","doi-asserted-by":"crossref","DOI":"10.1016\/j.physa.2019.122764","article-title":"An interactive propagation model of multiple information in complex networks","volume":"537","author":"Yao","year":"2020","journal-title":"Phys A: Stat Mech Appl"},{"key":"10.1016\/j.ress.2026.112918_bib0006","doi-asserted-by":"crossref","DOI":"10.1016\/j.chaos.2022.112136","article-title":"Node influence ranking in complex networks: a local structure entropy approach","volume":"160","author":"Lei","year":"2022","journal-title":"Chaos Solit Fractals"},{"key":"10.1016\/j.ress.2026.112918_bib0007","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1038\/nphys1746","article-title":"Identification of influential spreaders in complex networks","volume":"6","author":"Kitsak","year":"2010","journal-title":"Nat Phys"},{"key":"10.1016\/j.ress.2026.112918_bib0008","doi-asserted-by":"crossref","first-page":"1309","DOI":"10.1007\/s10115-024-02262-9","article-title":"IC-SNI: measuring nodes\u2019 influential capability in complex networks through structural and neighboring information","volume":"67","author":"Nandi","year":"2025","journal-title":"Knowl Inf Syst"},{"key":"10.1016\/j.ress.2026.112918_bib0009","doi-asserted-by":"crossref","DOI":"10.1016\/j.ress.2025.111527","article-title":"A novel method for identifying key focus ships in a complex network based on ship collision risks","volume":"265","author":"Zhen","year":"2026","journal-title":"Reliab Eng Syst Saf"},{"key":"10.1016\/j.ress.2026.112918_bib0010","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"},{"key":"10.1016\/j.ress.2026.112918_bib0011","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.ress.2026.112918_bib0012","doi-asserted-by":"crossref","DOI":"10.1016\/j.ress.2024.110525","article-title":"Spatial network disintegration based on spatial coverage","volume":"253","author":"Deng","year":"2025","journal-title":"Reliab Eng Syst Saf"},{"key":"10.1016\/j.ress.2026.112918_bib0013","series-title":"Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining","first-page":"57","article-title":"Mining the network value of customers","author":"Domingos","year":"2001"},{"key":"10.1016\/j.ress.2026.112918_bib0014","series-title":"Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining","first-page":"137","article-title":"Maximizing the spread of influence through a social network","author":"Kempe","year":"2003"},{"key":"10.1016\/j.ress.2026.112918_bib0015","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2024.126340","article-title":"Adaptive dissemination process in weighted hypergraphs","volume":"268","author":"Pan","year":"2025","journal-title":"Expert Syst Appl"},{"key":"10.1016\/j.ress.2026.112918_bib0016","series-title":"Proceedings of the 20th international conference companion on World wide web","first-page":"47","article-title":"CELF++: optimizing the greedy algorithm for influence maximization in social networks","author":"Goyal","year":"2011"},{"key":"10.1016\/j.ress.2026.112918_bib0017","doi-asserted-by":"crossref","first-page":"8138","DOI":"10.1073\/pnas.1614694114","article-title":"Optimal deployment of resources for maximizing impact in spreading processes","volume":"114","author":"Lokhov","year":"2017","journal-title":"Proc Natl Acad Sci USA"},{"key":"10.1016\/j.ress.2026.112918_bib0018","doi-asserted-by":"crossref","DOI":"10.1016\/j.ipm.2024.103856","article-title":"EIOA: a computing expectation-based influence evaluation method in weighted hypergraphs","volume":"61","author":"Pan","year":"2024","journal-title":"Inf Process Manag"},{"key":"10.1016\/j.ress.2026.112918_bib0019","doi-asserted-by":"crossref","DOI":"10.1063\/5.0256704","article-title":"Influence maximization in multilayer networks based on adaptive coupling degree","volume":"35","author":"Zhang","year":"2025","journal-title":"Chaos: Interdiscip J Nonlinear Sci"},{"key":"10.1016\/j.ress.2026.112918_bib0020","doi-asserted-by":"crossref","DOI":"10.1016\/j.ress.2023.109819","article-title":"Weaponized disinformation spread and its impact on multi-commodity critical infrastructure networks","volume":"243","author":"Jamalzadeh","year":"2024","journal-title":"Reliab Eng Syst Saf"},{"key":"10.1016\/j.ress.2026.112918_bib0021","series-title":"Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining","first-page":"1029","article-title":"Scalable influence maximization for prevalent viral marketing in large-scale social networks","author":"Chen","year":"2010"},{"key":"10.1016\/j.ress.2026.112918_bib0022","series-title":"2010 IEEE International Conference on Data Mining","first-page":"88","article-title":"Scalable influence maximization in social networks under the linear threshold model","author":"Chen","year":"2010"},{"key":"10.1016\/j.ress.2026.112918_bib0023","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.ress.2026.112918_bib0024","doi-asserted-by":"crossref","first-page":"2437","DOI":"10.1007\/s00607-021-00945-7","article-title":"A survey on meta-heuristic algorithms for the influence maximization problem in the social networks","volume":"103","author":"Aghaee","year":"2021","journal-title":"Computing"},{"key":"10.1016\/j.ress.2026.112918_bib0025","doi-asserted-by":"crossref","DOI":"10.1016\/j.ress.2021.108256","article-title":"Analysis of epidemic vaccination strategies by node importance and evolutionary game on complex networks","volume":"219","author":"Meng","year":"2022","journal-title":"Reliab Eng Syst Saf"},{"key":"10.1016\/j.ress.2026.112918_bib0026","series-title":"Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining","first-page":"420","article-title":"Cost-effective outbreak detection in networks","author":"Leskovec","year":"2007"},{"key":"10.1016\/j.ress.2026.112918_bib0027","series-title":"Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining","first-page":"199","article-title":"Efficient influence maximization in social networks","author":"Chen","year":"2009"},{"key":"10.1016\/j.ress.2026.112918_bib0028","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1016\/j.physa.2014.10.088","article-title":"Fast scalable greedy algorithm for influence maximization in social networks","volume":"420","author":"Heidari","year":"2015","journal-title":"Phys A: Stat Mech Appl"},{"key":"10.1016\/j.ress.2026.112918_bib0029","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 Netw"},{"key":"10.1016\/j.ress.2026.112918_bib0030","doi-asserted-by":"crossref","first-page":"35","DOI":"10.2307\/3033543","article-title":"A set of measures of centrality based on betweenness","volume":"40","author":"Freeman","year":"1977","journal-title":"Sociometry"},{"key":"10.1016\/j.ress.2026.112918_bib0031","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1007\/BF02289527","article-title":"The centrality index of a graph","volume":"31","author":"Sabidussi","year":"1966","journal-title":"Psychometrika"},{"key":"10.1016\/j.ress.2026.112918_bib0032","doi-asserted-by":"crossref","DOI":"10.1016\/j.ress.2023.109766","article-title":"Node importance identification of unweighted urban rail transit network: an adjacency information entropy based approach","volume":"242","author":"Huang","year":"2024","journal-title":"Reliab Eng Syst Saf"},{"key":"10.1016\/j.ress.2026.112918_bib0033","series-title":"Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining","first-page":"1039","article-title":"Community-based greedy algorithm for mining top-K influential nodes in mobile social networks","author":"Wang","year":"2010"},{"key":"10.1016\/j.ress.2026.112918_bib0034","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2532549","article-title":"CIM: community-based influence maximization in social networks","volume":"5","author":"Chen","year":"2014","journal-title":"ACM Trans Intell Syst Technol"},{"key":"10.1016\/j.ress.2026.112918_bib0035","doi-asserted-by":"crossref","first-page":"1188","DOI":"10.1016\/j.ipm.2016.05.006","article-title":"INCIM: a community-based algorithm for influence maximization problem under the linear threshold model","volume":"52","author":"Bozorgi","year":"2016","journal-title":"Inf Process Manag"},{"key":"10.1016\/j.ress.2026.112918_bib0036","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/j.knosys.2016.09.029","article-title":"CoFIM: a community-based framework for influence maximization on large-scale networks","volume":"117","author":"Shang","year":"2017","journal-title":"Knowl Based Syst"},{"key":"10.1016\/j.ress.2026.112918_bib0037","doi-asserted-by":"crossref","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":"10.1016\/j.ress.2026.112918_bib0038","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1609\/aaai.v25i1.7838","article-title":"Simulated annealing based influence maximization in social networks","volume":"25","author":"Jiang","year":"2011","journal-title":"AAAI"},{"key":"10.1016\/j.ress.2026.112918_bib0039","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":"10.1016\/j.ress.2026.112918_bib0040","doi-asserted-by":"crossref","first-page":"10181","DOI":"10.1007\/s00500-019-04533-y","article-title":"ACO-IM: maximizing influence in social networks using ant colony optimization","volume":"24","author":"Singh","year":"2020","journal-title":"Soft Comput"},{"key":"10.1016\/j.ress.2026.112918_bib0041","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-368","author":"Gong","year":"2016","journal-title":"Inf Sci (Ny)"},{"key":"10.1016\/j.ress.2026.112918_bib0042","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1109\/MCI.2016.2572538","article-title":"An efficient memetic algorithm for influence maximization in social networks","volume":"11","author":"Gong","year":"2016","journal-title":"IEEE Comput Intell Mag"},{"key":"10.1016\/j.ress.2026.112918_bib0043","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.ress.2026.112918_bib0044","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2019.112971","article-title":"Identification of influential users in social network using gray wolf optimization algorithm","volume":"142","author":"Zareie","year":"2020","journal-title":"Expert Syst Appl"},{"key":"10.1016\/j.ress.2026.112918_bib0045","doi-asserted-by":"crossref","DOI":"10.1016\/j.jnca.2024.104038","article-title":"IMUNE: a novel evolutionary algorithm for influence maximization in UAV networks","volume":"233","author":"Chen","year":"2025","journal-title":"J Netw Comput Appl"},{"key":"10.1016\/j.ress.2026.112918_bib0046","series-title":"Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics","first-page":"946","article-title":"Maximizing social influence in nearly optimal time","author":"Borgs","year":"2014"},{"key":"10.1016\/j.ress.2026.112918_bib0047","doi-asserted-by":"crossref","first-page":"189786","DOI":"10.1109\/ACCESS.2020.3029442","article-title":"Potential-driven model for influence maximization in social networks","volume":"8","author":"Felfli","year":"2020","journal-title":"IEEE Access"},{"key":"10.1016\/j.ress.2026.112918_bib0048","doi-asserted-by":"crossref","DOI":"10.1016\/j.ress.2025.111853","article-title":"Estimating node importance in transportation networks: a scalable machine learning approach","volume":"267","author":"Naser Moghaddasi","year":"2026","journal-title":"Reliab Eng Syst Saf"},{"key":"10.1016\/j.ress.2026.112918_bib0049","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 (Ny)"},{"key":"10.1016\/j.ress.2026.112918_bib0050","doi-asserted-by":"crossref","DOI":"10.1016\/j.neucom.2024.129117","article-title":"Online dynamic influence maximization based on deep reinforcement learning","volume":"618","author":"Song","year":"2025","journal-title":"Neurocomputing"},{"key":"10.1016\/j.ress.2026.112918_bib0051","series-title":"2017 IEEE International Conference on Information Reuse and Integration (IRI)","first-page":"501","article-title":"Influence analysis in online social networks using hypergraphs","author":"Amato","year":"2017"},{"key":"10.1016\/j.ress.2026.112918_bib0052","doi-asserted-by":"crossref","first-page":"801","DOI":"10.1109\/TNSE.2018.2873759","article-title":"Social influence maximization in hypergraph in Social networks","volume":"6","author":"Zhu","year":"2019","journal-title":"IEEE Trans Netw Sci Eng"},{"key":"10.1016\/j.ress.2026.112918_bib0053","doi-asserted-by":"crossref","DOI":"10.1016\/j.ipm.2022.103161","article-title":"An efficient adaptive degree-based heuristic algorithm for influence maximization in hypergraphs","volume":"60","author":"Xie","year":"2023","journal-title":"Inf Process Manag"},{"key":"10.1016\/j.ress.2026.112918_bib0054","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TEVC.2025.3577643","article-title":"Evolutionary hypergraph learning: a multi-objective influence maximization approach considering seed selection costs","author":"Qu","year":"2025","journal-title":"IEEE Trans Evol Comput"},{"key":"10.1016\/j.ress.2026.112918_bib0055","doi-asserted-by":"crossref","DOI":"10.1016\/j.chaos.2025.117713","article-title":"A state transition-based method for influence evaluation in networks","volume":"205","author":"Pan","year":"2026","journal-title":"Chaos Solit Fractals"},{"key":"10.1016\/j.ress.2026.112918_bib0056","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1016\/j.physa.2017.12.108","article-title":"Information spreading dynamics in hypernetworks","volume":"495","author":"Suo","year":"2018","journal-title":"Phys A: Stat Mech Appl"},{"key":"10.1016\/j.ress.2026.112918_bib0057","doi-asserted-by":"crossref","first-page":"17580","DOI":"10.1007\/s10489-022-03471-x","article-title":"EDOA: an elastic deformation optimization algorithm","volume":"52","author":"Pan","year":"2022","journal-title":"Appl Intell"},{"key":"10.1016\/j.ress.2026.112918_bib0058","doi-asserted-by":"crossref","DOI":"10.1016\/j.ress.2023.109596","article-title":"Measuring node importance in air transportation systems: on the quality of complex network estimations","volume":"240","author":"Wandelt","year":"2023","journal-title":"Reliab Eng Syst Saf"},{"key":"10.1016\/j.ress.2026.112918_bib0059","series-title":"Proceedings of ICNN\u201995 - International Conference on Neural Networks","first-page":"1942","article-title":"Particle swarm optimization","volume":"4","author":"Kennedy","year":"1995"},{"key":"10.1016\/j.ress.2026.112918_bib0060","series-title":"1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation","first-page":"4104","article-title":"A discrete binary version of the particle swarm algorithm","volume":"5","author":"Kennedy","year":"1997"},{"key":"10.1016\/j.ress.2026.112918_bib0061","doi-asserted-by":"crossref","DOI":"10.1016\/j.ress.2025.111538","article-title":"Stochastic modeling and availability optimization of wireless sensor network through particle swarm optimization","volume":"265","author":"Jadhav","year":"2026","journal-title":"Reliab Eng Syst Saf"}],"container-title":["Reliability Engineering & System Safety"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0951832026007283?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0951832026007283?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,28]],"date-time":"2026-05-28T13:58:01Z","timestamp":1779976681000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0951832026007283"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,12]]},"references-count":61,"alternative-id":["S0951832026007283"],"URL":"https:\/\/doi.org\/10.1016\/j.ress.2026.112918","relation":{},"ISSN":["0951-8320"],"issn-type":[{"value":"0951-8320","type":"print"}],"subject":[],"published":{"date-parts":[[2026,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Influence regulation in networks and its metaheuristic solution","name":"articletitle","label":"Article Title"},{"value":"Reliability Engineering & System Safety","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ress.2026.112918","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"112918"}}