{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T19:33:58Z","timestamp":1743104038365,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031755422"},{"type":"electronic","value":"9783031755439"}],"license":[{"start":{"date-parts":[[2024,10,17]],"date-time":"2024-10-17T00:00:00Z","timestamp":1729123200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,17]],"date-time":"2024-10-17T00:00:00Z","timestamp":1729123200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-75543-9_8","type":"book-chapter","created":{"date-parts":[[2024,10,16]],"date-time":"2024-10-16T23:03:34Z","timestamp":1729119814000},"page":"97-110","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Novel Approaches to\u00a0the\u00a0Minimum Identifying Code Problem Using Enhanced Genetic Algorithms"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2833-9746","authenticated-orcid":false,"given":"Alejandro","family":"Lara-Caballero","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2267-7165","authenticated-orcid":false,"given":"Jorge","family":"Cervantes-Ojeda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0033-4476","authenticated-orcid":false,"given":"Mar\u00eda","family":"G\u00f3mez-Fuentes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,10,17]]},"reference":[{"key":"8_CR1","series-title":"Springer Handbooks","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1007\/978-1-4471-7503-2_33","volume-title":"Springer Handbook of Engineering Statistics","author":"M Gen","year":"2023","unstructured":"Gen, M., Lin, L.: Genetic algorithms and their applications. In: Pham, H. (ed.) Springer Handbook of Engineering Statistics. SHB, pp. 635\u2013674. Springer, London (2023). https:\/\/doi.org\/10.1007\/978-1-4471-7503-2_33"},{"issue":"2","key":"8_CR2","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1109\/18.661507","volume":"44","author":"MG Karpovsky","year":"1998","unstructured":"Karpovsky, M.G., Chakrabarty, K., Levitin, L.B.: On a new class of codes for identifying vertices in graphs. IEEE Trans. Inf. Theory 44(2), 599\u2013611 (1998). https:\/\/doi.org\/10.1109\/18.661507","journal-title":"IEEE Trans. Inf. Theory"},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/s11036-008-0105-x","volume":"14","author":"M Laifenfeld","year":"2009","unstructured":"Laifenfeld, M., Trachtenberg, A., Cohen, R., et al.: Joint monitoring and routing in wireless sensor networks using robust identifying codes. Mob. Netw. Appl. 14, 415\u2013432 (2009). https:\/\/doi.org\/10.1007\/s11036-008-0105-x","journal-title":"Mob. Netw. Appl."},{"key":"8_CR4","doi-asserted-by":"publisher","unstructured":"Ray, S., Ungrangsi, R., Pellegrini, D., Trachtenberg, A., Starobinski, D.: Robust location detection in emergency sensor networks. In: Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428), San Francisco, CA, USA, vol. 2, pp. 1044\u20131053 (2003). https:\/\/doi.org\/10.1109\/INFCOM.2003.1208941","DOI":"10.1109\/INFCOM.2003.1208941"},{"issue":"1","key":"8_CR5","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1186\/1471-2105-7-108","volume":"7","author":"T Haynes","year":"2006","unstructured":"Haynes, T., Knisley, D., Seier, E.: DK: a quantitative analysis of secondary RNA structure using domination based parameters on trees. BMC Bioinform. 7(1), 108 (2006)","journal-title":"BMC Bioinform."},{"issue":"18","key":"8_CR6","doi-asserted-by":"publisher","first-page":"3293","DOI":"10.1016\/j.dam.2008.04.015","volume":"156","author":"P Charbit","year":"2008","unstructured":"Charbit, P., Preissmann, M., Barth, D.: Identifying codes in hereditary classes of graphs and in some classes of sparse graphs. Discrete Appl. Math. 156(18), 3293\u20133302 (2008). https:\/\/doi.org\/10.1016\/j.dam.2008.04.015","journal-title":"Discrete Appl. Math."},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Lara-Caballero, A., Gonz\u00e1lez-Moreno, D.: A population-based local search algorithm for the identifying code problem. Mathematics 11(20), 4361 (2023). https:\/\/www.mdpi.com\/2227-7390\/11\/20\/4361","DOI":"10.3390\/math11204361"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Cervantes, J., Stephens, C.R.: Rank based variation operators for genetic algorithms. In: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation, pp. 905\u2013912 (2008)","DOI":"10.1145\/1389095.1389271"},{"issue":"2","key":"8_CR9","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1109\/TEVC.2008.927707","volume":"13","author":"J Cervantes","year":"2009","unstructured":"Cervantes, J., Stephens, C.R.: Limitations of existing mutation rate heuristics and how a rank GA overcomes them. IEEE Trans. Evol. Comput. 13(2), 369\u2013397 (2009). https:\/\/doi.org\/10.1109\/TEVC.2008.927707","journal-title":"IEEE Trans. Evol. Comput."},{"key":"8_CR10","doi-asserted-by":"publisher","first-page":"4073905","DOI":"10.1155\/2019\/4073905","volume":"2019","author":"J Cervantes-Ojeda","year":"2019","unstructured":"Cervantes-Ojeda, J., G\u00f3mez-Fuentes, M., Gonz\u00e1lez-Moreno, D., Olsen, M.: Rainbow connectivity using a rank genetic algorithm: Moore cages with girth six. J. Appl. Math. 2019, 4073905 (2019). https:\/\/doi.org\/10.1155\/2019\/4073905","journal-title":"J. Appl. Math."},{"issue":"1","key":"8_CR11","doi-asserted-by":"publisher","first-page":"11","DOI":"10.46298\/dmtcs.10189","volume":"25","author":"JC Garc\u00eda-Altamirano","year":"2023","unstructured":"Garc\u00eda-Altamirano, J.C., Olsen, M., Cervantes-Ojeda, J.: How to construct the symmetric cycle of length 5 using Haj\u00f3s construction with an adapted rank genetic algorithm. Discrete Math. Theor. Comput. Sci. 25(1), 11 (2023). https:\/\/doi.org\/10.46298\/dmtcs.10189. Paper No. 3","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"8_CR12","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/978-3-031-47765-2_20","volume-title":"Mexican International Conference on Artificial Intelligence","author":"J Cervantes-Ojeda","year":"2023","unstructured":"Cervantes-Ojeda, J., G\u00f3mez-Fuentes, M., Fres\u00e1n-Figueroa, J.A.: Applying genetic algorithms to validate a conjecture in graph theory: the minimum dominating set problem. In: Calvo, H., Mart\u00ednez-Villase\u00f1or, L., Ponce, H. (eds.) MICAI 2023. LNCS, vol. 14391, pp. 271\u2013282. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-47765-2_20"},{"issue":"9\u201310","key":"8_CR13","doi-asserted-by":"publisher","first-page":"1672","DOI":"10.1016\/j.artint.2011.03.003","volume":"175","author":"S Cai","year":"2011","unstructured":"Cai, S., Su, K., Sattar, A.T.: Local search with edge weighting and configuration checking heuristics for minimum vertex cover. Artif. Intell. 175(9\u201310), 1672\u20131696 (2011)","journal-title":"Artif. Intell."},{"issue":"3","key":"8_CR14","doi-asserted-by":"publisher","first-page":"2181","DOI":"10.1007\/s11831-022-09859-9","volume":"30","author":"I Rahimi","year":"2023","unstructured":"Rahimi, I., Gandomi, A.H., Chen, F., Mezura-Montes, E.: A review on constraint handling techniques for population-based algorithms: from single-objective to multi-objective optimization. Arch. Comput. Methods Eng. 30(3), 2181\u20132209 (2023). https:\/\/doi.org\/10.1007\/s11831-022-09859-9","journal-title":"Arch. Comput. Methods Eng."},{"issue":"1","key":"8_CR15","doi-asserted-by":"publisher","DOI":"10.1155\/2013\/203032","volume":"2013","author":"N Bilal","year":"2013","unstructured":"Bilal, N., Galinier, P., Guibault, F.: A new formulation of the set covering problem for metaheuristic approaches. Int. Sch. Res. Not. 2013(1), 203032 (2013). https:\/\/doi.org\/10.1155\/2013\/203032","journal-title":"Int. Sch. Res. Not."},{"key":"8_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2020.105057","volume":"123","author":"RL Church","year":"2020","unstructured":"Church, R.L., Wang, S.: Solving the p-median problem on regular and lattice networks. Comput. Oper. Res. 123, 105057 (2020). https:\/\/doi.org\/10.1016\/j.cor.2020.105057","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"8_CR17","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1109\/TSMCA.2006.88634","volume":"37","author":"YC Xu","year":"2006","unstructured":"Xu, Y.C., Xiao, R.B.: Solving the identifying code problem by a genetic algorithm. IEEE Trans. Syst. Man Cybern. Part A Syst. Hum. 37(1), 41\u201346 (2006). https:\/\/doi.org\/10.1109\/TSMCA.2006.88634","journal-title":"IEEE Trans. Syst. Man Cybern. Part A Syst. Hum."}],"container-title":["Lecture Notes in Computer Science","Advances in Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-75543-9_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,16]],"date-time":"2024-10-16T23:18:53Z","timestamp":1729120733000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-75543-9_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,17]]},"ISBN":["9783031755422","9783031755439"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-75543-9_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,10,17]]},"assertion":[{"value":"17 October 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MICAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mexican International Conference on Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tonantzintla","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mexico","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 October 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 October 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"micai2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.micai.org\/2024\/index.php","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}