{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T14:05:46Z","timestamp":1761401146640},"reference-count":40,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer Communications"],"published-print":{"date-parts":[[2004,1]]},"DOI":"10.1016\/s0140-3664(03)00185-3","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T12:45:30Z","timestamp":1056977130000},"page":"111-127","source":"Crossref","is-referenced-by-count":43,"title":["GA-based heuristic algorithms for bandwidth-delay-constrained least-cost multicast routing"],"prefix":"10.1016","volume":"27","author":[{"given":"A.T.","family":"Haghighat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Faez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Dehghan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Mowlaei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Y.","family":"Ghahremani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0140-3664(03)00185-3_BIB1","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1002\/net.3230010203","article-title":"Steiner problem in graphs and its implications","volume":"1","author":"Hakimi","year":"1971","journal-title":"Networks"},{"key":"10.1016\/S0140-3664(03)00185-3_BIB2","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"issue":"4","key":"10.1016\/S0140-3664(03)00185-3_BIB3","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1109\/90.720901","article-title":"An iterative algorithm for delay-constrained minimum-cost multicasting","volume":"6","author":"Parsa","year":"1998","journal-title":"IEEE\/ACM Transactions on Networking"},{"issue":"3","key":"10.1016\/S0140-3664(03)00185-3_BIB4","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1109\/90.234851","article-title":"Multicast routing for multimedia communication","volume":"1","author":"Kompella","year":"1993","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"10.1016\/S0140-3664(03)00185-3_BIB5","unstructured":"R. Widyono, The design and evaluation of routing algorithms for real-time channels, Technical Reports TR-94-024, Tenet Group, Department of EECS, University of California at Berkeley, 1994."},{"key":"10.1016\/S0140-3664(03)00185-3_BIB6","article-title":"A new heuristic for ATM multicast routing","author":"Waters","year":"1994","journal-title":"Second IFIP Workshop on Performance Modeling and Evaluation of ATM networks"},{"key":"10.1016\/S0140-3664(03)00185-3_BIB7","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF00288961","article-title":"A fast algorithm for Steiner trees","volume":"15","author":"Kou","year":"1981","journal-title":"Acta Informatica"},{"issue":"1","key":"10.1016\/S0140-3664(03)00185-3_BIB8","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1080\/0020739830140103","article-title":"The computation of nearly minimal Steiner trees in graphs","volume":"14","author":"Rayward-smith","year":"1983","journal-title":"International Journal of Mathematical Education in Science and Technology"},{"issue":"6","key":"10.1016\/S0140-3664(03)00185-3_BIB9","first-page":"573","article-title":"An approximate solution for the Steiner problem in graphs","volume":"22","author":"Takahashi","year":"1980","journal-title":"Mathematica Japonica"},{"issue":"2","key":"10.1016\/S0140-3664(03)00185-3_BIB10","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1109\/49.552065","article-title":"Improved neural heuristics for multicast routing","volume":"15","author":"Gelenbe","year":"1997","journal-title":"IEEE Journal of selected Area in Communication"},{"issue":"1","key":"10.1016\/S0140-3664(03)00185-3_BIB11","first-page":"43","article-title":"An efficient delay-constrained multicast routing algorithm","volume":"7","author":"Sun","year":"1998","journal-title":"Journal of High-Speed Networks"},{"key":"10.1016\/S0140-3664(03)00185-3_BIB12","article-title":"QDMR: an efficient QoS dependent multicast routing algorithm","author":"Guo","year":"1999","journal-title":"Proceedings of the Fifth IEEE Real-Time Technology and Applications Symposium"},{"issue":"3","key":"10.1016\/S0140-3664(03)00185-3_BIB13","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1109\/49.564133","article-title":"Multicast routing with end-to-end delay and delay variation constraints","volume":"15","author":"Rouskas","year":"1997","journal-title":"IEEE Journal on Selected Areas in Communications"},{"issue":"1","key":"10.1016\/S0140-3664(03)00185-3_BIB14","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1006\/jagm.1998.0930","article-title":"Bicriteria network design problems","volume":"28","author":"Marathe","year":"1998","journal-title":"Journal of Algorithms"},{"issue":"18","key":"10.1016\/S0140-3664(03)00185-3_BIB15","doi-asserted-by":"crossref","first-page":"1693","DOI":"10.1016\/S0140-3664(98)00208-4","article-title":"Algorithms for delay-constrained low-cost multicast tree construction","volume":"21","author":"Sriram","year":"1998","journal-title":"Computer Communications"},{"key":"10.1016\/S0140-3664(03)00185-3_BIB16","doi-asserted-by":"crossref","DOI":"10.1109\/INFCOM.1999.751662","article-title":"A rearrangeable algorithm for the construction of delay-constrained dynamic multicast trees","volume":"March","author":"Sriram","year":"1999","journal-title":"Proceedings of the Conference on Computer Communications, IEEE INFOCOM 99, New York"},{"issue":"3","key":"10.1016\/S0140-3664(03)00185-3_BIB17","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1109\/49.564132","article-title":"Evaluation of multicast routing algorithms for real-time communication on high-speed networks","volume":"15","author":"Salama","year":"1997","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"10.1016\/S0140-3664(03)00185-3_BIB18","first-page":"332","article-title":"Neural network approach to multicast routing in real-time communication networks","author":"Chotipat","year":"1995","journal-title":"IEEE International Conference on Network Protocols"},{"issue":"2","key":"10.1016\/S0140-3664(03)00185-3_BIB19","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1109\/3477.662766","article-title":"A genetic algorithm for designing distributed computer network topologies","volume":"28","author":"Pierre","year":"1998","journal-title":"IEEE Transactions on Systems Man and Cybernetics, Part B: Cybernetics"},{"issue":"13","key":"10.1016\/S0140-3664(03)00185-3_BIB20","doi-asserted-by":"crossref","first-page":"1150","DOI":"10.1049\/el:19960795","article-title":"Genetic framework for the high-level optimisation of low power VLSI DSP systems","volume":"32","author":"Bright","year":"1996","journal-title":"IEEE electronics Letters"},{"issue":"4","key":"10.1016\/S0140-3664(03)00185-3_BIB21","first-page":"299","article-title":"Use of evolutionary techniques to automate the design of combinational circuits","volume":"2","author":"Coello","year":"2000","journal-title":"International Journal of Smart Engineering System Design"},{"key":"10.1016\/S0140-3664(03)00185-3_BIB22","series-title":"The Steiner Tree Problem","author":"Hwang","year":"1992"},{"key":"10.1016\/S0140-3664(03)00185-3_BIB23","first-page":"231","article-title":"Optimization of Steiner trees using genetic algorithms","author":"Hesser","year":"1989","journal-title":"Proceedings of the Third International Conference on Genetic Algorithms, San Mateo, CA"},{"key":"10.1016\/S0140-3664(03)00185-3_BIB24","first-page":"474","article-title":"A genetic algorithm for the rectilinear Steiner problem","author":"Julstrom","year":"1993","journal-title":"Proceedings of the Fifth International Conference on Genetic Algorithms"},{"issue":"4","key":"10.1016\/S0140-3664(03)00185-3_BIB25","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1057\/jors.1993.69","article-title":"Solving the graphical Steiner tree problem using genetic algorithms","volume":"44","author":"Kapsalis","year":"1993","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0140-3664(03)00185-3_BIB26","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1002\/net.3230260403","article-title":"Computing near-optimal solutions to the Steiner problem in a graph using a genetic algorithm","volume":"26","author":"Esbensen","year":"1995","journal-title":"Networks"},{"issue":"4","key":"10.1016\/S0140-3664(03)00185-3_BIB27","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1109\/4235.738982","article-title":"A genetic algorithm for the multiple destination routing problems","volume":"2","author":"Leung","year":"1998","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"10.1016\/S0140-3664(03)00185-3_BIB28","unstructured":"Q. Sun, A genetic algorithm for delay-constrained minimum-cost multicasting, Technical Report, IBR, TU Braunschweig, Butenweg, 74\/75, 38106, Braunschweig, Germany, 1999."},{"key":"10.1016\/S0140-3664(03)00185-3_BIB29","doi-asserted-by":"crossref","first-page":"1394","DOI":"10.1016\/S0140-3664(99)00113-9","article-title":"QoS routing based on genetic algorithm","volume":"22","author":"Xiang","year":"1999","journal-title":"Computer Communications"},{"key":"10.1016\/S0140-3664(03)00185-3_BIB30","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1016\/S0140-3664(97)00124-2","article-title":"Source-based delay-bounded multicasting in multimedia networks","volume":"21","author":"Ravikumar","year":"1998","journal-title":"Computer Communications"},{"issue":"1","key":"10.1016\/S0140-3664(03)00185-3_BIB31","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1109\/4235.752920","article-title":"An orthogonal genetic algorithm for multimedia multicast routing","volume":"3","author":"Zhang","year":"1999","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"10.1016\/S0140-3664(03)00185-3_BIB32","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/S0020-0255(99)00102-4","article-title":"Multicast routing with multiple QoS constraints in ATM networks","volume":"124","author":"Wu","year":"2000","journal-title":"Information Sciences"},{"key":"10.1016\/S0140-3664(03)00185-3_BIB33","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1016\/S0140-3664(00)00273-5","article-title":"Bandwidth-delay-constrainted least-cost multicast routing based on heuristic genetic algorithm","volume":"24","author":"Wang","year":"2001","journal-title":"Computer Communications"},{"key":"10.1016\/S0140-3664(03)00185-3_BIB34","series-title":"Genetic Algorithm and its Application","author":"Guoliang","year":"1996"},{"issue":"3","key":"10.1016\/S0140-3664(03)00185-3_BIB35","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1109\/49.564133","article-title":"Multicast routing with end-to-end delay and delay variation constraints","volume":"15","author":"Rouskas","year":"1997","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"10.1016\/S0140-3664(03)00185-3_BIB36","series-title":"Genetic Algorithms and Engineering Optimization","author":"Gen","year":"2000"},{"issue":"3","key":"10.1016\/S0140-3664(03)00185-3_BIB37","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/S0305-0548(97)00039-7","article-title":"An effective genetic algorithm approach to the quadratic minimum spanning tree problem","volume":"25","author":"Zhou","year":"1998","journal-title":"Computers and operations research"},{"key":"10.1016\/S0140-3664(03)00185-3_BIB38","unstructured":"C.C. Palmer, An approach to a problem in network design using genetic algorithms, PhD Dissertation in Computer Science, Polytechnic University, April 1994."},{"key":"10.1016\/S0140-3664(03)00185-3_BIB39","doi-asserted-by":"crossref","unstructured":"A.T. Haghighat, K. Faez, M. Dehghan, A. Mowlaei, Y. Ghahremani, A genetic algorithm for Steiner tree optimization with multiple constraints using Pr\u00fcfer number, in EURASIA-ICT 2002 Conference, Tehran, Iran (2002) 167\u2013173.","DOI":"10.1007\/3-540-36087-5_32"},{"key":"10.1016\/S0140-3664(03)00185-3_BIB40","unstructured":"A.T. Haghighat, K. Faez, M. Dehghan, A. Mowlaei, Y. Ghahremani, Multicast routing with multiple constraints in high-speed networks based on genetic algorithms, in ICCC 2002 Conference, India (2002) 243\u2013249."}],"container-title":["Computer Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366403001853?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366403001853?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,24]],"date-time":"2020-03-24T05:11:28Z","timestamp":1585026688000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0140366403001853"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,1]]},"references-count":40,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2004,1]]}},"alternative-id":["S0140366403001853"],"URL":"https:\/\/doi.org\/10.1016\/s0140-3664(03)00185-3","relation":{},"ISSN":["0140-3664"],"issn-type":[{"value":"0140-3664","type":"print"}],"subject":[],"published":{"date-parts":[[2004,1]]}}}