{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,19]],"date-time":"2026-04-19T16:37:39Z","timestamp":1776616659412,"version":"3.51.2"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,4,19]],"date-time":"2026-04-19T00:00:00Z","timestamp":1776556800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,4,19]],"date-time":"2026-04-19T00:00:00Z","timestamp":1776556800000},"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":["Telecommun Syst"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1007\/s11235-026-01443-x","type":"journal-article","created":{"date-parts":[[2026,4,19]],"date-time":"2026-04-19T15:42:54Z","timestamp":1776613374000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Solving the constrained steiner tree problem in MANETs using an adaptive simulated annealing optimization approach"],"prefix":"10.1007","volume":"89","author":[{"given":"Sabrina","family":"Tadjine","sequence":"first","affiliation":[]},{"given":"Ali","family":"Lemouari","sequence":"additional","affiliation":[]},{"given":"Messaoud","family":"Kara","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,4,19]]},"reference":[{"issue":"5","key":"1443_CR1","doi-asserted-by":"publisher","first-page":"49","DOI":"10.5120\/ijca2017913641","volume":"164","author":"KIM Abuzanouneh","year":"2017","unstructured":"Abuzanouneh, K. I. M. (2017). Hybrid multi-objectives genetic algorithms and immigrants scheme for dynamic routing problems in mobile networks. International Journal of Computer Applications, 164(5), 49\u201357.","journal-title":"International Journal of Computer Applications"},{"issue":"1","key":"1443_CR2","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.asej.2011.05.002","volume":"2","author":"RF Abdel-Kader","year":"2011","unstructured":"Abdel-Kader, R. F. (2011). Hybrid discrete pso with ga operators for efficient qos-multicast routing. Ain Shams Engineering Journal, 2(1), 21\u201331.","journal-title":"Ain Shams Engineering Journal"},{"key":"1443_CR3","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1016\/j.energy.2019.05.211","volume":"181","author":"M Aguitoni","year":"2019","unstructured":"Aguitoni, M., Pav\u00e3o, L., & Ravagnani, M. (2019). Heat exchanger network synthesis combining simulated annealing and differential evolution. Energy, 181, 654\u2013664.","journal-title":"Energy"},{"issue":"3","key":"1443_CR4","doi-asserted-by":"publisher","first-page":"981","DOI":"10.1016\/j.jnca.2012.01.023","volume":"36","author":"S Bitam","year":"2013","unstructured":"Bitam, S., & Mellouk, A. (2013). Bee life-based multi constraints multicast routing optimization for vehicular ad hoc networks. Journal of Network and Computer Applications, 36(3), 981\u2013991.","journal-title":"Journal of Network and Computer Applications"},{"issue":"5","key":"1443_CR5","doi-asserted-by":"publisher","first-page":"806","DOI":"10.1016\/j.engappai.2010.01.021","volume":"23","author":"H Cheng","year":"2010","unstructured":"Cheng, H., & Yang, S. (2010). Genetic algorithms with immigrants schemes for dynamic multicast problems in mobile ad hoc networks. Engineering Applications of Artificial Intelligence, 23(5), 806\u2013819.","journal-title":"Engineering Applications of Artificial Intelligence"},{"key":"1443_CR6","doi-asserted-by":"crossref","unstructured":"Cheng, H., & Yang, S. (2012). Hyper-mutation based genetic algorithms for dynamic multicast routing problem in mobile ad hoc networks. IEEE 11th International Conference on Trust, Security and Privacy in Computing and Communications (pp. 1586\u20131592). IEEE.","DOI":"10.1109\/TrustCom.2012.179"},{"issue":"1","key":"1443_CR7","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.ipl.2003.09.014","volume":"89","author":"DE Drake","year":"2004","unstructured":"Drake, D. E., & Hougardy, S. (2004). On approximation algorithms for the terminal steiner tree problem. Information Processing Letters, 89(1), 15\u201318.","journal-title":"Information Processing Letters"},{"key":"1443_CR8","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E Dijkstra","year":"1959","unstructured":"Dijkstra, E. (1959). A note on two problems in connexion with graphs. Numerische Mathematik, 1, 269\u2013271.","journal-title":"Numerische Mathematik"},{"key":"1443_CR9","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/s11235-007-9031-7","volume":"34","author":"N Ghaboosi","year":"2007","unstructured":"Ghaboosi, N., & Haghighat, A. T. (2007). Tabu search based algorithms for bandwidth-delay-constrained least-cost multicast routing. Telecommunication Systems, 34, 147\u2013166.","journal-title":"Telecommunication Systems"},{"key":"1443_CR10","doi-asserted-by":"crossref","unstructured":"Hamed, A., Alkinani, M., & Hassan, M. (2020). A genetic algorithm optimization for multi-objective multicast routing. constraints,6, 10.","DOI":"10.32604\/iasc.2020.012663"},{"issue":"1","key":"1443_CR11","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1002\/net.3230220105","volume":"22","author":"FK Hwang","year":"1992","unstructured":"Hwang, F. K., & Richards, D. S. (1992). Steiner tree problems. Networks, 22(1), 55\u201389.","journal-title":"Networks"},{"key":"1443_CR12","unstructured":"Kun, Z., Heng, W., & Feng-Yu, L. (2005). An efficient algorithm based on simulated annealing for multicast routing with delay and delay variation constraints. 19th International Conference on Advanced Information Networking and Applications (AINA\u201905) (pp. 261\u2013266). IEEE."},{"key":"1443_CR13","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S. (1983). Improvement of reliabilities of regulations using a hierarchical structure in a genetic network. Science, 220, 671\u2013680.","journal-title":"Science"},{"key":"1443_CR14","doi-asserted-by":"crossref","unstructured":"Kalaiselvi, D., Radhakrishnan, R., et al. (2015) Multiconstrained qos routing using a differentially guided krill herd algorithm in mobile ad hoc networks. Mathematical Problems in Engineering 2015","DOI":"10.1155\/2015\/862145"},{"key":"1443_CR15","doi-asserted-by":"crossref","unstructured":"Kumari, P., & Sahana, S. (2022). Swarm based hybrid aco-pso meta-heuristic (hapm) for qos multicast routing optimization in manets. Wireless Personal Communications, 1\u201323.","DOI":"10.1007\/s11277-021-09174-9"},{"key":"1443_CR16","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s11047-016-9545-6","volume":"16","author":"M Liang","year":"2017","unstructured":"Liang, M., Gao, C., & Zhang, Z. (2017). A new genetic algorithm based on modified physarum network model for bandwidth-delay constrained least-cost multicast routing. Natural computing, 16, 85\u201398.","journal-title":"Natural computing"},{"issue":"3","key":"1443_CR17","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1504\/IJSCC.2018.093395","volume":"9","author":"S Labed","year":"2018","unstructured":"Labed, S., Kout, A., Chikhi, S., & Bourennane, E.-B. (2018). A hybrid bio-inspired approach to solving the routing problem in mobile ad hoc networks. International Journal of Systems, Control and Communications, 9(3), 185\u2013209.","journal-title":"International Journal of Systems, Control and Communications"},{"key":"1443_CR18","doi-asserted-by":"crossref","unstructured":"Mara, S. T. W., Norcahyo, R., Jodiawan, P., Lusiantoro, L., & Rifai, A. P. (2022). A survey of adaptive large neighborhood search algorithms and applications. Computers & Operations Research,146, Article 105903.","DOI":"10.1016\/j.cor.2022.105903"},{"issue":"3","key":"1443_CR19","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1504\/IJCNDS.2019.098873","volume":"22","author":"Y Meraihi","year":"2019","unstructured":"Meraihi, Y., Ramdane-Cherif, A., Mahseur, M., & Acheli, D. (2019). A hybrid quantum evolutionary algorithm with cuckoo search algorithm for qos multicast routing problem. International Journal of Communication Networks and Distributed Systems, 22(3), 329\u2013361.","journal-title":"International Journal of Communication Networks and Distributed Systems"},{"key":"1443_CR20","doi-asserted-by":"crossref","unstructured":"Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., & Teller, E. (1953). Equation of state calculations by fast computing machines. The journal of chemical physics,21(6), 1087\u20131092.","DOI":"10.1063\/1.1699114"},{"issue":"2","key":"1443_CR21","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1177\/0020720918822757","volume":"58","author":"X Miao","year":"2021","unstructured":"Miao, X., & Wu, X. (2021). A delay-bounded low-cost multicast routing algorithm for mobile ad hoc networks. The International Journal of Electrical Engineering & Education, 58(2), 403\u2013418.","journal-title":"The International Journal of Electrical Engineering & Education"},{"key":"1443_CR22","unstructured":"Mofaddel, M., Younes, A., & El-Sayed, H. (2020). Multi-objective multicast routing based on ant colony optimization in mobile ad-hoc networks. Journal of Statistics Applications and Probability Acceptance,213,"},{"key":"1443_CR23","doi-asserted-by":"crossref","unstructured":"Revathi, P., Anusuya, V., Raj, V., & Pareek, P. (2023). Hybrid cocky search algorithm with hill climb approach for solving the quality-of-service multicast routing in manet. 2023 International Conference on Ambient Intelligence, Knowledge Informatics and Industrial Electronics (AIKIIE) (pp. 1\u20138). IEEE.","DOI":"10.1109\/AIKIIE60097.2023.10390117"},{"key":"1443_CR24","doi-asserted-by":"crossref","unstructured":"Rajalakshmi, S., Maguteeswaran, R., et al. (2015) Quality of service routing in manet using a hybrid intelligent algorithm inspired by cuckoo search. the Scientific world Journal 2015","DOI":"10.1155\/2015\/703480"},{"key":"1443_CR25","doi-asserted-by":"crossref","unstructured":"Ropke, S., & Pisinger, D. (2006). An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation science,40(4), 455\u2013472.","DOI":"10.1287\/trsc.1050.0135"},{"issue":"8","key":"1443_CR26","doi-asserted-by":"publisher","first-page":"825","DOI":"10.1016\/S0140-3664(01)00404-2","volume":"25","author":"P-R Sheu","year":"2002","unstructured":"Sheu, P.-R., & Chen, S.-T. (2002). A fast and efficient heuristic algorithm for the delay-and delay variation-bounded multicast tree problem. Computer Communications, 25(8), 825\u2013833.","journal-title":"Computer Communications"},{"issue":"1","key":"1443_CR27","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/j.engappai.2010.08.001","volume":"24","author":"J Sun","year":"2011","unstructured":"Sun, J., Fang, W., Wu, X., Xie, Z., & Xu, W. (2011). Qos multicast routing using a quantum-behaved particle swarm optimization algorithm. Engineering Applications of Artificial Intelligence, 24(1), 123\u2013131.","journal-title":"Engineering Applications of Artificial Intelligence"},{"key":"1443_CR28","doi-asserted-by":"crossref","unstructured":"Shaw, P. (1998). Using constraint programming and local search methods to solve vehicle routing problems. International Conference on Principles and Practice of Constraint Programming (pp. 417\u2013431). Springer.","DOI":"10.1007\/3-540-49481-2_30"},{"issue":"8","key":"1443_CR29","doi-asserted-by":"publisher","first-page":"4365","DOI":"10.1016\/j.amc.2011.10.012","volume":"218","author":"H-L Shieh","year":"2011","unstructured":"Shieh, H.-L., Kuo, C.-C., & Chiang, C.-M. (2011). Modified particle swarm optimization algorithm with simulated annealing behavior and its numerical verification. Applied Mathematics and Computation, 218(8), 4365\u20134383.","journal-title":"Applied Mathematics and Computation"},{"key":"1443_CR30","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1016\/j.supflu.2017.04.007","volume":"127","author":"G Sodeifian","year":"2017","unstructured":"Sodeifian, G., Sajadian, S. A., & Ardestani, N. S. (2017). Experimental optimization and mathematical modeling of the supercritical fluid extraction of essential oil from eryngium billardieri: Application of simulated annealing (sa) algorithm. The Journal of Supercritical Fluids, 127, 146\u2013157.","journal-title":"The Journal of Supercritical Fluids"},{"issue":"1","key":"1443_CR31","doi-asserted-by":"publisher","first-page":"637","DOI":"10.32604\/csse.2023.034224","volume":"46","author":"N Veeraiah","year":"2023","unstructured":"Veeraiah, N., Alotaibi, Y., Alghamdi, S., & Thatavarti, S. (2023). A novel gradient boosted energy optimization model (gbeom) for manet. Comput. Syst. Sci. Eng., 46(1), 637\u2013657.","journal-title":"Comput. Syst. Sci. Eng."},{"issue":"1","key":"1443_CR32","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1108\/IJICC-02-2017-0016","volume":"11","author":"W Wei","year":"2018","unstructured":"Wei, W., Qin, Y., & Cai, Z. (2018). A multi-objective multicast routing optimization based on differential evolution in manet. International Journal of Intelligent Computing and Cybernetics, 11(1), 121\u2013140.","journal-title":"International Journal of Intelligent Computing and Cybernetics"},{"key":"1443_CR33","doi-asserted-by":"crossref","unstructured":"Xu, Y., & Xing, H. (2014) A multi-objective jumping particle swarm optimization algorithm for the multicast routing. In: Advances in Swarm Intelligence: 5th International Conference, ICSI 2014, Hefei, China, October 17-20, 2014, Proceedings, Part I 5, pp. 414\u2013423. Springer","DOI":"10.1007\/978-3-319-11857-4_47"},{"issue":"11\u201312","key":"1443_CR34","doi-asserted-by":"publisher","first-page":"1140","DOI":"10.1016\/S0140-3664(02)00029-4","volume":"25","author":"H Youssef","year":"2002","unstructured":"Youssef, H., Al-Mulhem, A., Sait, S. M., & Tahir, M. A. (2002). Qos-driven multicast tree generation using tabu search. Computer Communications, 25(11\u201312), 1140\u20131149.","journal-title":"Computer Communications"},{"issue":"11\u201312","key":"1443_CR35","doi-asserted-by":"publisher","first-page":"2238","DOI":"10.1016\/j.mcm.2010.10.008","volume":"53","author":"Y-S Yen","year":"2011","unstructured":"Yen, Y.-S., Chao, H.-C., Chang, R.-S., & Vasilakos, A. (2011). Flooding-limited and multi-constrained qos multicast routing based on the genetic algorithm for manets. Mathematical and Computer Modelling, 53(11\u201312), 2238\u20132250.","journal-title":"Mathematical and Computer Modelling"},{"key":"1443_CR36","doi-asserted-by":"crossref","unstructured":"Yen, J. (1971). Finding the k shortest loopless paths in a network. management Science,17(11), 712\u2013716.","DOI":"10.1287\/mnsc.17.11.712"},{"issue":"1","key":"1443_CR37","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.-B., Li, M., & Wang, F.-H. (2009). A method for least-cost qos multicast routing based on genetic simulated annealing algorithm. Computer Communications, 32(1), 105\u2013110.","journal-title":"Computer Communications"},{"issue":"8","key":"1443_CR38","doi-asserted-by":"publisher","first-page":"24","DOI":"10.23919\/JCC.2019.08.003","volume":"16","author":"Q Zhang","year":"2019","unstructured":"Zhang, Q., Ding, L., & Liao, Z. (2019). A novel genetic algorithm for stable multicast routing in mobile ad hoc networks. China Communications, 16(8), 24\u201337.","journal-title":"China Communications"},{"key":"1443_CR39","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.energy.2018.08.112","volume":"163","author":"W Zhang","year":"2018","unstructured":"Zhang, W., Maleki, A., Rosen, M. A., & Liu, J. (2018). Optimization with a simulated annealing algorithm of a hybrid system for renewable energy including battery and hydrogen storage. Energy, 163, 191\u2013207.","journal-title":"Energy"},{"issue":"1","key":"1443_CR40","doi-asserted-by":"publisher","first-page":"18","DOI":"10.3390\/a12010018","volume":"12","author":"X Zhang","year":"2019","unstructured":"Zhang, X., Shen, X., & Yu, Z. (2019). A novel hybrid ant colony optimization for a multicast routing problem. Algorithms, 12(1), 18.","journal-title":"Algorithms"}],"container-title":["Telecommunication Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11235-026-01443-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11235-026-01443-x","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11235-026-01443-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,19]],"date-time":"2026-04-19T15:42:58Z","timestamp":1776613378000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11235-026-01443-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4,19]]},"references-count":40,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["1443"],"URL":"https:\/\/doi.org\/10.1007\/s11235-026-01443-x","relation":{},"ISSN":["1018-4864","1572-9451"],"issn-type":[{"value":"1018-4864","type":"print"},{"value":"1572-9451","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,4,19]]},"assertion":[{"value":"2 October 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 March 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 April 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}},{"value":"\u2013 This material is the authors\u2019 original work, which has not been previously published elsewhere. \u2013 The paper has not been published previously.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"Not applicable.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"Code is available on request from the authors.","order":6,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code availability"}}],"article-number":"67"}}