{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:09:24Z","timestamp":1742911764145,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031232350"},{"type":"electronic","value":"9783031232367"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-23236-7_24","type":"book-chapter","created":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T01:22:43Z","timestamp":1672536163000},"page":"342-356","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Active GA Accelerated by\u00a0Simulated Annealing to\u00a0Solve SPP in\u00a0Packet Networks"],"prefix":"10.1007","author":[{"given":"Daniel S.","family":"Fonseca","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elizabeth F.","family":"Wanner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carolina G.","family":"Marcelino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gabriel P.","family":"Silva","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Silvia","family":"Jimenez-Fernandez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sancho","family":"Salcedo-Sanz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"key":"24_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2022.102868","volume":"132","author":"F Fazli","year":"2022","unstructured":"Fazli, F., Mansubbassiri, M.: V-RPL: an effective routing algorithm for low power and lossy networks using multi-criteria decision-making techniques. Ad Hoc Netw. 132, 102868 (2022)","journal-title":"Ad Hoc Netw."},{"key":"24_CR2","doi-asserted-by":"publisher","first-page":"810","DOI":"10.1109\/TNET.2014.2306592","volume":"23","author":"Y Yao","year":"2015","unstructured":"Yao, Y., Cao, Q., Vasilakos, A.V.: EDAL: an energy-efficient, delay-aware, and lifetime-balancing data collection protocol for heterogeneous wireless sensor networks. IEEE\/ACM Trans. Netw. 23, 810\u2013823 (2015)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"24_CR3","first-page":"62","volume":"1","author":"N Anwar","year":"2015","unstructured":"Anwar, N., Deng, H.: Ant colony optimization based multicast routing algorithm for mobile ad hoc networks. IEEE Adva. Wirel. Opti. Commun. (RTUWO) 1, 62\u201367 (2015)","journal-title":"IEEE Adva. Wirel. Opti. Commun. (RTUWO)"},{"key":"24_CR4","series-title":"Lecture Notes on Data Engineering and Communications Technologies","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/978-981-16-3961-6_49","volume-title":"Cyber Security and Digital Forensics","author":"Rajiv Yadav","year":"2022","unstructured":"Yadav, Rajiv, Indu, S.., Gupta, Daya: Review of evolutionary algorithms for energy efficient and secure wireless sensor networks. In: Khanna, Kavita, Estrela, Vania Vieira, Rodrigues, Joel Jos\u00e9 Puga Coelho. (eds.) Cyber Security and Digital Forensics. LNDECT, vol. 73, pp. 597\u2013608. Springer, Singapore (2022). https:\/\/doi.org\/10.1007\/978-981-16-3961-6_49"},{"key":"24_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2022.102790","volume":"130","author":"A Rovira-Sugranes","year":"2022","unstructured":"Rovira-Sugranes, A., Razi, A., Afghah, F., Chakareski, J.: A review of AI-enabled routing protocols for UAV networks: trends, challenges, and future outlook. Ad Hoc Netw. 130, 102790 (2022)","journal-title":"Ad Hoc Netw."},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"Lopez, A., Heisterkamp, D.R.: Simulated annealing based hierarchical Q-routing: a dynamic routing protocol. In: 2011 Eighth International Conference on Information Technology: New Generations, pp. 791\u2013796 (2011)","DOI":"10.1109\/ITNG.2011.138"},{"issue":"3","key":"24_CR7","doi-asserted-by":"publisher","first-page":"2223","DOI":"10.1109\/TNSE.2021.3085514","volume":"8","author":"A Rovira-Sugranes","year":"2021","unstructured":"Rovira-Sugranes, A., Afghah, F., Qu, J., Razi, A.: Fully-echoed Q-routing with simulated annealing inference for flying adhoc networks. IEEE Trans. Netw. Sci. Eng. 8(3), 2223\u20132234 (2021)","journal-title":"IEEE Trans. Netw. Sci. Eng."},{"issue":"4","key":"24_CR8","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1504\/IJBIC.2020.108596","volume":"15","author":"H Wang","year":"2020","unstructured":"Wang, H., Li, K., Pedrycz, W.: A routing algorithm based on simulated annealing algorithm for maximising wireless sensor networks lifetime with a sink node. Int. J. Bio-Inspir. Comput. 15(4), 264\u2013275 (2020)","journal-title":"Int. J. Bio-Inspir. Comput."},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"Zhao, L., Saldin, A., Hu, J., Fu, L., Shi, J., Guan, Y.: A novel simulated annealing based routing algorithm in F-SDNs. In: IEEE INFOCOM 2020 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), pp. 1202\u20131207 (2020)","DOI":"10.1109\/INFOCOMWKSHPS50562.2020.9162933"},{"issue":"3","key":"24_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.36548\/jscp.2019.1.001","volume":"1","author":"JS Raj","year":"2019","unstructured":"Raj, J.S., Rahimunnisa, K.: Hybridized genetic-simulated annealing algorithm for performance optimization in wireless ad-hoc network. J. Soft Comput. Paradig. 1(3), 1\u201313 (2019)","journal-title":"J. Soft Comput. Paradig."},{"issue":"12","key":"24_CR11","volume":"31","author":"R Sundar","year":"2020","unstructured":"Sundar, R., Kathirvel, A.: Aggressively delivered mechanism over variable length density using a simulated annealing algorithm in mobile ad hoc network. Trans. Emerg. Telecommun. Technol. 31(12), e3863 (2020)","journal-title":"Trans. Emerg. Telecommun. Technol."},{"issue":"3","key":"24_CR12","first-page":"23","volume":"8","author":"AY Prasad","year":"2020","unstructured":"Prasad, A.Y., Rayanki, B.: A generic algorithmic protocol approaches to improve network life time and energy efficient using combined genetic algorithm with simulated annealing in manet. Int. J. Intell. Unmanned Syst. 8(3), 23\u201342 (2020)","journal-title":"Int. J. Intell. Unmanned Syst."},{"key":"24_CR13","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.eij.2010.10.004","volume":"11","author":"A Hamed","year":"2010","unstructured":"Hamed, A.: A genetic algorithm for finding the k shortest paths in a network. Egypt. Inform. J. 11, 75\u201379 (2010)","journal-title":"Egypt. Inform. J."},{"key":"24_CR14","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.comcom.2008.09.023","volume":"32","author":"L Zhang","year":"2009","unstructured":"Zhang, L., Cai, L., Li, M., Wang, F.: A method for least-cost QoS multicast routing based on genetic simulated annealing algorithm. Comput. Commun. 32, 105\u2013110 (2009)","journal-title":"Comput. Commun."},{"key":"24_CR15","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/j.eij.2011.04.004","volume":"312","author":"A Younes","year":"2011","unstructured":"Younes, A.: Multicast routing with bandwidth and delay constraints based on genetic algorithms. Egypt. Inform. J. 312, 107\u2013114 (2011)","journal-title":"Egypt. Inform. J."},{"key":"24_CR16","doi-asserted-by":"publisher","first-page":"177534","DOI":"10.1109\/ACCESS.2020.3027043","volume":"8","author":"A Bhardwaj","year":"2020","unstructured":"Bhardwaj, A., El-Ocla, H.: Multipath routing protocol using genetic algorithm in mobile ad hoc networks. IEEE Access 8, 177534\u2013177548 (2020)","journal-title":"IEEE Access"},{"key":"24_CR17","doi-asserted-by":"publisher","first-page":"158082","DOI":"10.1109\/ACCESS.2020.3020158","volume":"8","author":"C Wang","year":"2020","unstructured":"Wang, C., Liu, X., Hu, H., Han, Y., Yao, M.: Energy-efficient and load-balanced clustering routing protocol for wireless sensor networks using a chaotic genetic algorithm. IEEE Access 8, 158082\u2013158096 (2020)","journal-title":"IEEE Access"},{"key":"24_CR18","doi-asserted-by":"publisher","first-page":"2703","DOI":"10.1007\/s11277-019-07011-8","volume":"111","author":"N Muruganantham","year":"2020","unstructured":"Muruganantham, N., El-Ocla, H.: Routing using genetic algorithm in a wireless sensor network. Wirel. Pers. Commun. 111, 2703\u20132732 (2020)","journal-title":"Wirel. Pers. Commun."},{"key":"24_CR19","first-page":"1","volume":"131","author":"M Singh","year":"2020","unstructured":"Singh, M., Amin, S., Choudhary, A.: Genetic algorithm based sink mobility for energy efficient data routing in wireless sensor networks. AEU Int. J. Electron. Commun. 131, 1\u201310 (2020)","journal-title":"AEU Int. J. Electron. Commun."},{"key":"24_CR20","doi-asserted-by":"crossref","unstructured":"Heidari, E., Movaghar, A., Motameni, H., Barzegar, B.: A novel approach for clustering and routing in WSN using genetic algorithm and equilibrium optimizer. Int. J. Commun. Syst., e5148 (2022)","DOI":"10.1002\/dac.5148"},{"key":"24_CR21","doi-asserted-by":"publisher","first-page":"3623","DOI":"10.1007\/s11277-021-09306-1","volume":"123","author":"L Chu-hang","year":"2022","unstructured":"Chu-hang, L., Xiao-li, W., You-jia, H., Huang-shui, H., Sha-sha, W.: An improved genetic algorithm based annulus-sector clustering routing protocol for wireless sensor networks. Wirel. Pers. Commun 123, 3623\u20133644 (2022)","journal-title":"Wirel. Pers. Commun"},{"key":"24_CR22","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1, 269\u2013271 (1959)","journal-title":"Numer. Math."},{"key":"24_CR23","first-page":"63","volume":"2","author":"H Chen","year":"2005","unstructured":"Chen, H., Sun, B.: Multicast routing optimization algorithm with bandwidth and delay constraints based on GA. J. Commun. Comput. 2, 63\u201367 (2005)","journal-title":"J. Commun. Comput."},{"key":"24_CR24","doi-asserted-by":"publisher","first-page":"960","DOI":"10.1007\/978-1-4419-1153-7_1167","volume-title":"Encyclopedia of Operations Research and Management Science","author":"K Sorensen","year":"2013","unstructured":"Sorensen, K., Glover, F.W.: Metaheuristics. In: Gass, S.I., Fu, M.C. (eds.) Encyclopedia of Operations Research and Management Science, vol. 1, pp. 960\u2013970. Springer, Boston (2013). https:\/\/doi.org\/10.1007\/978-1-4419-1153-7_1167"},{"key":"24_CR25","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/j.swevo.2018.03.012","volume":"43","author":"S Stockt","year":"2018","unstructured":"Stockt, S., Engelbrecht, A.: Analysis of selection hyper-heuristics for population-based meta-heuristics in real-valued dynamic optimization. Swarm Evol. Comput. 43, 127\u2013146 (2018)","journal-title":"Swarm Evol. Comput."},{"key":"24_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-1-4419-1665-5_1","volume-title":"Handbook of Metaheuristics","author":"A Nikolaev","year":"2010","unstructured":"Nikolaev, A., Jacobson, S.: Simulated annealing. In: Gendreau, M., Potvin, J.Y. (eds.) Handbook of Metaheuristics, pp. 1\u201339. Springer, Boston (2010). https:\/\/doi.org\/10.1007\/978-1-4419-1665-5_1"},{"key":"24_CR27","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1109\/4235.797971","volume":"3","author":"DE Goldberg","year":"1999","unstructured":"Goldberg, D.E.: The compact genetic algorithm. IEEE Trans. Evol. Comput. 3, 287\u2013297 (1999)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"24_CR28","first-page":"1","volume":"10","author":"R Kumar","year":"2010","unstructured":"Kumar, R., Kumar, M.: Exploring genetic algorithm for shortest path optimization in data networks. Global J. Comput. Sci. Technol. 10, 1\u20135 (2010)","journal-title":"Global J. Comput. Sci. Technol."},{"key":"24_CR29","unstructured":"Montgomery, D., Runger, G.: Applied statistics and probability for engineers. LTC (2009)"}],"container-title":["Communications in Computer and Information Science","Optimization, Learning Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-23236-7_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T02:29:13Z","timestamp":1672540153000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-23236-7_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031232350","9783031232367"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-23236-7_24","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"OL2A","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Optimization, Learning Algorithms and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bragan\u00e7a","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ol2a2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ol2a.ipb.pt\/EN_index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"145","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"53","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"37% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}