{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T21:13:06Z","timestamp":1778101986411,"version":"3.51.4"},"reference-count":29,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T00:00:00Z","timestamp":1776038400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100008530","name":"European Regional Development Fund","doi-asserted-by":"publisher","award":["CONFIA PID2021-122916NB-I00"],"award-info":[{"award-number":["CONFIA PID2021-122916NB-I00"]}],"id":[{"id":"10.13039\/501100008530","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100012818","name":"Community of Madrid","doi-asserted-by":"publisher","award":["TEC-2024\/COM-404"],"award-info":[{"award-number":["TEC-2024\/COM-404"]}],"id":[{"id":"10.13039\/100012818","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003329","name":"Ministerio de Econom\u00eda y Competitividad","doi-asserted-by":"publisher","award":["PID2021-125709OA-C22"],"award-info":[{"award-number":["PID2021-125709OA-C22"]}],"id":[{"id":"10.13039\/501100003329","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Engineering Applications of Artificial Intelligence"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.engappai.2026.114775","type":"journal-article","created":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T12:16:23Z","timestamp":1775823383000},"page":"114775","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"P2","title":["Double Roman Domination Problem: An iterated local search approach"],"prefix":"10.1016","volume":"176","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3417-6859","authenticated-orcid":false,"given":"Alejandra","family":"Casado","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1702-4941","authenticated-orcid":false,"given":"Jes\u00fas","family":"S\u00e1nchez-Oro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5112-5629","authenticated-orcid":false,"given":"Oscar","family":"Cord\u00f3n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.engappai.2026.114775_b1","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2024.111306","article-title":"Meta-heuristic algorithms for double roman domination problem","volume":"154","author":"Aggarwal","year":"2024","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.engappai.2026.114775_b2","first-page":"1","article-title":"On the double roman domination in graphs","volume":"232","author":"Ahangar","year":"2017","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"10.1016\/j.engappai.2026.114775_b3","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/s10878-018-0286-6","article-title":"An upper bound on the double roman domination number","volume":"36","author":"Amjadi","year":"2018","journal-title":"J. Comb. Optim."},{"issue":"4","key":"10.1016\/j.engappai.2026.114775_b4","doi-asserted-by":"crossref","first-page":"1922","DOI":"10.1109\/TPWRS.2005.857942","article-title":"Causes of the 2003 major grid blackouts in north america and europe, and recommended means to improve system dynamic performance","volume":"20","author":"Andersson","year":"2005","journal-title":"IEEE Trans. Power Syst."},{"key":"10.1016\/j.engappai.2026.114775_b5","doi-asserted-by":"crossref","DOI":"10.1016\/j.adhoc.2019.102023","article-title":"Minimum connected dominating sets in heterogeneous 3D wireless ad hoc networks","volume":"97","author":"Bai","year":"2020","journal-title":"Ad Hoc Networks"},{"issue":"1","key":"10.1016\/j.engappai.2026.114775_b6","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1007\/s10878-019-00457-3","article-title":"Algorithmic results on double roman domination in graphs","volume":"39","author":"Banerjee","year":"2020","journal-title":"J. Comb. Optim."},{"key":"10.1016\/j.engappai.2026.114775_b7","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.dam.2016.03.017","article-title":"Double roman domination","volume":"211","author":"Beeler","year":"2016","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"10.1016\/j.engappai.2026.114775_b8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/10556788.2019.1679142","article-title":"Integer linear programming formulations for double roman domination problem","volume":"37","author":"Cai","year":"2022","journal-title":"Optim. Methods Softw."},{"key":"10.1016\/j.engappai.2026.114775_b9","doi-asserted-by":"crossref","unstructured":"Calvo, B., Shir, O.M., Ceberio, J., Doerr, C., Wang, H., B\u00e4ck, T., Lozano, J.A., 2019. Bayesian performance analysis for black-box optimization benchmarking. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion. pp. 1789\u20131797.","DOI":"10.1145\/3319619.3326888"},{"issue":"3","key":"10.1016\/j.engappai.2026.114775_b10","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1002\/net.22134","article-title":"Variable neighborhood search approach with intensified shake for monitor placement","volume":"81","author":"Casado","year":"2023","journal-title":"Networks"},{"key":"10.1016\/j.engappai.2026.114775_b11","doi-asserted-by":"crossref","unstructured":"Chen, W., Wang, Y., Yang, S., 2009. Efficient influence maximization in social networks. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. pp. 199\u2013208.","DOI":"10.1145\/1557019.1557047"},{"key":"10.1016\/j.engappai.2026.114775_b12","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/j.disc.2003.06.004","article-title":"On roman domination in graphs","volume":"278","author":"Cockayne","year":"2004","journal-title":"Discrete Math."},{"key":"10.1016\/j.engappai.2026.114775_b13","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2021.105368","article-title":"Heuristics for k-domination models of facility location problems in street networks","volume":"133","author":"Corcoran","year":"2021","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.engappai.2026.114775_b14","series-title":"Fundamentals of Domination in Graphs","author":"Haynes","year":"2013"},{"key":"10.1016\/j.engappai.2026.114775_b15","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1051\/ita\/2025006","article-title":"Meta-heuristic algorithms for quasi total double roman domination problem","volume":"59","author":"Karnati","year":"2025","journal-title":"RAIRO-Theor. Inf. Appl."},{"key":"10.1016\/j.engappai.2026.114775_b16","series-title":"2017 IFIP\/IEEE Symposium on Integrated Network and Service Management","first-page":"935","article-title":"Knowledge discovery of port scans from darknet","author":"Lagraa","year":"2017"},{"key":"10.1016\/j.engappai.2026.114775_b17","first-page":"43","article-title":"The irace package: Iterated racing for automatic algorithm configuration","volume":"3","author":"L\u00f3pez-Ib\u00e1\u00f1ez","year":"2016","journal-title":"Oper. Res. Perspect."},{"key":"10.1016\/j.engappai.2026.114775_b18","series-title":"Handbook of Metaheuristics","first-page":"320","article-title":"Iterated local search","author":"Louren\u00e7o","year":"2003"},{"issue":"1","key":"10.1016\/j.engappai.2026.114775_b19","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/s13278-024-01336-4","article-title":"A variable neighborhood search approach for the adaptive multi round influence maximization problem","volume":"14","author":"Lozano-Osorio","year":"2024","journal-title":"Soc. Netw. Anal. Min."},{"issue":"4","key":"10.1016\/j.engappai.2026.114775_b20","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":"Lozano-Osorio","year":"2023","journal-title":"J. Ambient. Intell. Humaniz. Comput."},{"issue":"02","key":"10.1016\/j.engappai.2026.114775_b21","doi-asserted-by":"crossref","DOI":"10.1142\/S1793830920500202","article-title":"Critical concept for double roman domination in graphs","volume":"12","author":"Nazari-Moghaddam","year":"2020","journal-title":"Discrete Math. Algorithms Appl."},{"issue":"2","key":"10.1016\/j.engappai.2026.114775_b22","doi-asserted-by":"crossref","first-page":"1153","DOI":"10.1007\/s40840-019-00735-7","article-title":"Extremal digraphs for an upper bound on the double roman domination number","volume":"43","author":"Ouldrabah","year":"2020","journal-title":"Bull. Malays. Math. Sci. Soc."},{"issue":"3","key":"10.1016\/j.engappai.2026.114775_b23","doi-asserted-by":"crossref","first-page":"1081","DOI":"10.1016\/j.akcej.2020.01.005","article-title":"Complexity of roman {2}-domination and the double roman domination in graphs","volume":"17","author":"Padamutham","year":"2020","journal-title":"AKCE Int. J. Graphs Comb."},{"key":"10.1016\/j.engappai.2026.114775_b24","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1016\/j.dam.2020.06.023","article-title":"On algorithmic complexity of double roman domination","volume":"285","author":"Poureidi","year":"2020","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"10.1016\/j.engappai.2026.114775_b25","first-page":"41","article-title":"Some progress on the double roman domination in graphs","volume":"39","author":"Rad","year":"2018","journal-title":"Discuss. Math. Graph Theory"},{"issue":"2","key":"10.1016\/j.engappai.2026.114775_b26","doi-asserted-by":"crossref","first-page":"351","DOI":"10.3390\/math11020351","article-title":"Double roman domination: a survey","volume":"11","author":"Rupnik Poklukar","year":"2023","journal-title":"Mathematics"},{"key":"10.1016\/j.engappai.2026.114775_b27","series-title":"NOMS 2016-2016 IEEE\/IFIP Network Operations and Management Symposium","first-page":"1175","article-title":"A strategy for clustering students minimizing the number of bus stops for solving the school bus routing problem","author":"Sarubbi","year":"2016"},{"key":"10.1016\/j.engappai.2026.114775_b28","doi-asserted-by":"crossref","first-page":"63345","DOI":"10.1109\/ACCESS.2018.2876460","article-title":"Discharging approach for double roman domination in graphs","volume":"6","author":"Shao","year":"2018","journal-title":"IEEE Access"},{"key":"10.1016\/j.engappai.2026.114775_b29","first-page":"669","article-title":"On the double roman domination of graphs","volume":"338","author":"Yue","year":"2018","journal-title":"Appl. Math. Comput."}],"container-title":["Engineering Applications of Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0952197626010572?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0952197626010572?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T20:31:17Z","timestamp":1778099477000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0952197626010572"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":29,"alternative-id":["S0952197626010572"],"URL":"https:\/\/doi.org\/10.1016\/j.engappai.2026.114775","relation":{},"ISSN":["0952-1976"],"issn-type":[{"value":"0952-1976","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Double Roman Domination Problem: An iterated local search approach","name":"articletitle","label":"Article Title"},{"value":"Engineering Applications of Artificial Intelligence","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.engappai.2026.114775","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Authors. Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}],"article-number":"114775"}}