{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,15]],"date-time":"2024-02-15T01:42:17Z","timestamp":1707961337710},"reference-count":24,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Comp. Intel. Appl."],"published-print":{"date-parts":[[2005,6]]},"abstract":"<jats:p> This paper presents a genetic algorithm for designing minimum-cost two-connected networks such that the shortest cycle to which each edge belongs to does not exceed a given length. We provide numerical results based on randomly generated graphs found in the literature and compare the solution quality with that of tabu search and branch and bound. The results demonstrate the effectiveness of our algorithm and show promise for tackling ring-based network design problems. This paper is among the first to document the implementation of a genetic algorithm for the design of two-connected networks with the added constraint of bounded rings. <\/jats:p>","DOI":"10.1142\/s1469026805001611","type":"journal-article","created":{"date-parts":[[2005,9,16]],"date-time":"2005-09-16T06:51:52Z","timestamp":1126853512000},"page":"267-281","source":"Crossref","is-referenced-by-count":3,"title":["A GENETIC ALGORITHM FOR THE DESIGN OF MINIMUM-COST TWO-CONNECTED NETWORKS WITH BOUNDED RINGS"],"prefix":"10.1142","volume":"05","author":[{"given":"MARIO","family":"VENTRESCA","sequence":"first","affiliation":[{"name":"Department of Computing &amp; Information Science, University of Guelph, Guelph, Ontario, N1G 2W1, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"BEATRICE M.","family":"OMBUKI","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Brock University, St. Catharines, Ontario, L2S 3A1, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1016\/0026-2714(82)90007-5"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1016\/0026-2714(93)90132-I"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1080\/03052159508941193"},{"key":"rf4","volume":"22","author":"He L.","journal-title":"BT Technol. J."},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1023\/B:HEUR.0000012447.32370.fd"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03822-2"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1287\/opre.48.6.866.12390"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-002-0299-9"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1023\/B:COAP.0000008649.61438.6b"},{"key":"rf11","volume-title":"Computers and Intractability, A Guide to the Theory of NP-Completeness","author":"Garey M. R.","year":"1979"},{"key":"rf12","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1109\/TCT.1969.1083004","volume":"16","author":"Steiglitz K.","journal-title":"IEEE Trans. Circuit Theory"},{"key":"rf13","doi-asserted-by":"publisher","DOI":"10.1137\/0403043"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1287\/opre.37.4.531"},{"key":"rf15","doi-asserted-by":"publisher","DOI":"10.1287\/opre.40.2.309"},{"key":"rf16","series-title":"Handbooks in Operations Research and Management","doi-asserted-by":"crossref","DOI":"10.1016\/S0927-0507(05)80127-6","volume-title":"Network Models","volume":"7","author":"Grotschel M.","year":"1995"},{"key":"rf17","doi-asserted-by":"publisher","DOI":"10.1137\/0406047"},{"key":"rf18","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-4669-6"},{"key":"rf20","first-page":"134","volume":"134","author":"Chamtac I.","journal-title":"SPIE Int. Soc. Opt. Eng., Proc. SPIE"},{"key":"rf21","volume-title":"Genetic Algorithms in Search, Optimization, and Machine Learning","author":"Goldberg D. E.","year":"1989"},{"key":"rf22","doi-asserted-by":"publisher","DOI":"10.1887\/0750308958"},{"key":"rf23","doi-asserted-by":"publisher","DOI":"10.1109\/4235.661548"},{"key":"rf24","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018919205346"},{"key":"rf25","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009665726946"},{"key":"rf27","first-page":"1545","volume":"84","author":"Ombuki B. M.","journal-title":"IEICE Trans. Fund. Elect. Commun. Comput. Sci."}],"container-title":["International Journal of Computational Intelligence and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1469026805001611","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T20:26:55Z","timestamp":1565123215000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1469026805001611"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,6]]},"references-count":24,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2005,6]]}},"alternative-id":["10.1142\/S1469026805001611"],"URL":"https:\/\/doi.org\/10.1142\/s1469026805001611","relation":{},"ISSN":["1469-0268","1757-5885"],"issn-type":[{"value":"1469-0268","type":"print"},{"value":"1757-5885","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,6]]}}}