{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T12:26:20Z","timestamp":1762431980125,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030708658"},{"type":"electronic","value":"9783030708665"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-70866-5_23","type":"book-chapter","created":{"date-parts":[[2021,3,2]],"date-time":"2021-03-02T16:03:57Z","timestamp":1614701037000},"page":"349-363","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Novel Heuristic Optimization Algorithm for Solving the Delay-Constrained Least-Cost Problem"],"prefix":"10.1007","author":[{"given":"Amina","family":"Boudjelida","sequence":"first","affiliation":[]},{"given":"Ali","family":"Lemouari","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,3,3]]},"reference":[{"issue":"1","key":"23_CR1","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1109\/65.819174","volume":"14","author":"C Diot","year":"2000","unstructured":"Diot, C., Levine, B.N., Lyles, B., Kassem, H., Balensiefen, D.: Deployment issues for the IP multicast service and architecture. IEEE Netw. 14(1), 78\u201388 (2000)","journal-title":"IEEE Netw."},{"issue":"6","key":"23_CR2","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1109\/MCOM.2002.1007412","volume":"40","author":"A Striegel","year":"2002","unstructured":"Striegel, A., Manimaran, G.: A survey of QoS multicasting issues. IEEE Commun. Mag. 40(6), 82\u201387 (2002)","journal-title":"IEEE Commun. Mag."},{"key":"23_CR3","unstructured":"Xu, Y.: Metaheuristic approaches for QoS multicast routing problems. Ph.D. thesis, University of Nottingham Nottingham (2011)"},{"key":"23_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-642-11169-3_2","volume-title":"Learning and Intelligent Optimization","author":"R Qu","year":"2009","unstructured":"Qu, R., Xu, Y., Kendall, G.: A variable neighborhood descent search algorithm for delay-constrained least-cost multicast routing. In: St\u00fctzle, T. (ed.) LION 2009. LNCS, vol. 5851, pp. 15\u201329. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-11169-3_2"},{"key":"23_CR5","unstructured":"Lee, S.J., Gerla, M., Chiang, C.C.: On-demand multicast routing protocol. In: 1999 IEEE Wireless Communications and Networking Conference, WCNC (Cat. no. 99TH8466), vol. 3, pp. 1298\u20131302. IEEE (1999)"},{"key":"23_CR6","unstructured":"Boppana, A.: A scalable simplified multicast forwarding for mobile ad-hoc networks (2011)"},{"key":"23_CR7","unstructured":"Chelius, G., Fleury, \u00c9.: Performance evaluation of multicast trees in adhoc networks (2002)"},{"issue":"5\u20136","key":"23_CR8","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/S0950-7051(03)00032-7","volume":"16","author":"AT Haghighat","year":"2003","unstructured":"Haghighat, A.T., Faez, K., Dehghan, M., Mowlaei, A., Ghahremani, Y.: GA-based heuristic algorithms for QoS based multicast routing. Knowl.-Based Syst. 16(5\u20136), 305\u2013312 (2003)","journal-title":"Knowl.-Based Syst."},{"issue":"4","key":"23_CR9","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1109\/90.720901","volume":"6","author":"M Parsa","year":"1998","unstructured":"Parsa, M., Zhu, Q., Garcia-Luna-Aceves, J.J.: An iterative algorithm for delay-constrained minimum-cost multicasting. IEEE\/ACM Trans. Netw. 6(4), 461\u2013474 (1998)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"7\u20138","key":"23_CR10","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1016\/S0140-3664(00)00273-5","volume":"24","author":"W Zhengying","year":"2001","unstructured":"Zhengying, W., Bingxin, S., Erdun, Z.: Bandwidth-delay-constrained least-cost multicast routing based on heuristic genetic algorithm. Comput. Commun. 24(7\u20138), 685\u2013692 (2001)","journal-title":"Comput. Commun."},{"issue":"1","key":"23_CR11","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s11235-006-8202-2","volume":"32","author":"N Skorin-Kapov","year":"2006","unstructured":"Skorin-Kapov, N., Kos, M.: A grasp heuristic for the delay-constrained multicast routing problem. Telecommun. Syst. 32(1), 55\u201369 (2006). https:\/\/doi.org\/10.1007\/s11235-006-8202-2","journal-title":"Telecommun. Syst."},{"issue":"1","key":"23_CR12","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.: A method for least-cost QoS multicast routing based on genetic simulated annealing algorithm. Comput. Commun. 32(1), 105\u2013110 (2009)","journal-title":"Comput. Commun."},{"issue":"1","key":"23_CR13","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.: A multi-objective multicast routing optimization based on differential evolution in MANET. Int. J. Intell. Comput. Cybern. 11(1), 121\u2013140 (2018)","journal-title":"Int. J. Intell. Comput. Cybern."},{"issue":"1","key":"23_CR14","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.: A novel hybrid ant colony optimization for a multicast routing problem. Algorithms 12(1), 18 (2019)","journal-title":"Algorithms"},{"issue":"2","key":"23_CR15","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1109\/JCN.2000.6596737","volume":"2","author":"I Matta","year":"2000","unstructured":"Matta, I., Guo, L.: QDMR: an efficient QoS dependent multicast routing algorithm. J. Commun. Netw. 2(2), 168\u2013176 (2000)","journal-title":"J. Commun. Netw."},{"issue":"2","key":"23_CR16","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/BF00288961","volume":"15","author":"L Kou","year":"1981","unstructured":"Kou, L., Markowsky, G., Berman, L.: A fast algorithm for Steiner trees. Acta Informatica 15(2), 141\u2013145 (1981). https:\/\/doi.org\/10.1007\/BF00288961","journal-title":"Acta Informatica"},{"key":"23_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-0311-1","volume-title":"Mathematical Aspects of Network Routing Optimization","author":"CA Oliveira","year":"2011","unstructured":"Oliveira, C.A., Pardalos, P.M.: Mathematical Aspects of Network Routing Optimization. Springer, New York (2011). https:\/\/doi.org\/10.1007\/978-1-4614-0311-1"},{"issue":"4","key":"23_CR18","doi-asserted-by":"publisher","first-page":"145","DOI":"10.2299\/jsp.20.145","volume":"20","author":"M Fujita","year":"2016","unstructured":"Fujita, M., Kimura, T., Jin\u2019no, K.: An effective construction algorithm for the Steiner tree problem based on edge betweenness. J. Sig. Process. 20(4), 145\u2013148 (2016)","journal-title":"J. Sig. Process."},{"issue":"3\u20134","key":"23_CR19","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.: Tabu search based algorithms for bandwidth-delay-constrained least-cost multicast routing. Telecommun. Syst. 34(3\u20134), 147\u2013166 (2007). https:\/\/doi.org\/10.1007\/s11235-007-9031-7","journal-title":"Telecommun. Syst."},{"key":"23_CR20","doi-asserted-by":"crossref","unstructured":"Skorin-Kapov, N., Kos, M.: The application of Steiner trees to delay constrained multicast routing: a tabu search approach. In: 2003 Proceedings of the 7th International Conference on Telecommunications, ConTEL 2003, vol. 2, pp. 443\u2013448. IEEE (2003)","DOI":"10.1109\/CONTEL.2003.176945"},{"issue":"11\u201312","key":"23_CR21","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.: QoS-driven multicast tree generation using tabu search. Comput. Commun. 25(11\u201312), 1140\u20131149 (2002)","journal-title":"Comput. Commun."},{"key":"23_CR22","unstructured":"Zhang, K., Wang, H., Liu, F.: Multicast routing for delay and delay variation bounded Steiner tree using simulated annealing. In: Proceedings of the 2005 IEEE Networking, Sensing and Control, pp. 682\u2013687. IEEE (2005)"},{"issue":"5","key":"23_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11704-019-8199-9","volume":"14","author":"Z Askari","year":"2020","unstructured":"Askari, Z., Avokh, A.: EMSC: a joint multicast routing, scheduling, and call admission control in multi-radio multi-channel WMNs. Front. Comput. Sci. 14(5), 1\u201316 (2020). https:\/\/doi.org\/10.1007\/s11704-019-8199-9","journal-title":"Front. Comput. Sci."},{"issue":"2","key":"23_CR24","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"TA Feo","year":"1995","unstructured":"Feo, T.A., Resende, M.G.: Greedy randomized adaptive search procedures. J. Global Optim. 6(2), 109\u2013133 (1995). https:\/\/doi.org\/10.1007\/BF01096763","journal-title":"J. Global Optim."},{"issue":"3","key":"23_CR25","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1007\/s10489-019-01547-9","volume":"50","author":"Q Liu","year":"2019","unstructured":"Liu, Q., Tang, R., Ren, H., Pei, Y.: Optimizing multicast routing tree on application layer via an encoding-free non-dominated sorting genetic algorithm. Appl. Intell. 50(3), 759\u2013777 (2019). https:\/\/doi.org\/10.1007\/s10489-019-01547-9","journal-title":"Appl. Intell."},{"key":"23_CR26","doi-asserted-by":"publisher","first-page":"105276","DOI":"10.1016\/j.knosys.2019.105276","volume":"191","author":"Q Liu","year":"2020","unstructured":"Liu, Q., Ren, H.P., Tang, R.J., Yao, J.L.: Optimizing co-existing multicast routing trees in IP network via discrete artificial fish school algorithm. Knowl.-Based Syst. 191, 105276 (2020)","journal-title":"Knowl.-Based Syst."},{"issue":"3","key":"23_CR27","doi-asserted-by":"publisher","first-page":"1159","DOI":"10.32604\/cmc.2020.09176","volume":"63","author":"M Hassan","year":"2020","unstructured":"Hassan, M., Hamid, A., Alkinani, M.: Ant colony optimization for multi-objective multicast routing. Comput. Mater. Continua 63(3), 1159\u20131173 (2020)","journal-title":"Comput. Mater. Continua"},{"key":"23_CR28","unstructured":"Xu, Y., Qu, R.: A GRASP approach for the delayconstrained multicast routing problem. In: Proceedings of the 4th Multidisplinary International Scheduling Conference (MISTA4), Dublin, Ireland, pp. 93\u2013104 (2009)"},{"key":"23_CR29","series-title":"Combinatorial Optimization","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/978-1-4613-0255-1_9","volume-title":"Steiner Trees in Industry","author":"T Koch","year":"2001","unstructured":"Koch, T., Martin, A., Vo\u00df, S.: SteinLib: an updated library on steiner tree problems in graphs. In: Cheng, X.Z., Du, D.Z. (eds.) Steiner Trees in Industry. COOP, vol. 11, pp. 285\u2013325. Springer, Boston (2001). https:\/\/doi.org\/10.1007\/978-1-4613-0255-1_9"}],"container-title":["Lecture Notes in Computer Science","Machine Learning for Networking"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-70866-5_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,2]],"date-time":"2021-03-02T16:16:01Z","timestamp":1614701761000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-70866-5_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030708658","9783030708665"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-70866-5_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"3 March 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MLN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Machine Learning for Networking","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Paris","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 November 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 November 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mln2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.adda-association.org\/mln-2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"50","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":"22","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":"0","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":"44% - 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":"3","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)"}},{"value":"Due to the Corona pandemic this event was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}