{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T07:00:23Z","timestamp":1761807623229},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,1,26]],"date-time":"2011-01-26T00:00:00Z","timestamp":1296000000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Evol. Intel."],"published-print":{"date-parts":[[2011,3]]},"DOI":"10.1007\/s12065-011-0049-0","type":"journal-article","created":{"date-parts":[[2011,1,25]],"date-time":"2011-01-25T04:20:51Z","timestamp":1295929251000},"page":"51-65","source":"Crossref","is-referenced-by-count":7,"title":["Studying the application of ant colony optimization and river formation dynamics to the steiner tree problem"],"prefix":"10.1007","volume":"4","author":[{"given":"Pablo","family":"Rabanal","sequence":"first","affiliation":[]},{"given":"Ismael","family":"Rodr\u00edguez","sequence":"additional","affiliation":[]},{"given":"Fernando","family":"Rubio","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,1,26]]},"reference":[{"key":"49_CR1","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0020-0190(89)90039-2","volume":"32","author":"M Bern","year":"1989","unstructured":"Bern M, Plassmann P (1989) The Steiner tree problem with edge lengths 1 and 2. Inform Proc Lett 32:171\u2013176","journal-title":"Inform Proc Lett"},{"key":"49_CR2","doi-asserted-by":"crossref","unstructured":"Caldwell A, Kahng A, Mantik S, Markov I, Zelikovsky A (1998) On wirelength estimations for row-based placement. In: International symposium on physical design. ACM Press, New York, pp 4\u201311","DOI":"10.1145\/274535.274536"},{"key":"49_CR3","volume-title":"Nature-inspired algorithms for optimisation. Volume 193 of studies in computational intelligence","year":"2009","unstructured":"Chiong R (ed) (2009) Nature-inspired algorithms for optimisation. Volume 193 of studies in computational intelligence. Springer, Berlin"},{"key":"49_CR4","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/S0304-3975(97)00226-0","volume":"225","author":"AEF Clementi","year":"1999","unstructured":"Clementi AEF (1999) Improved non-approximability results for minimum vertex cover with density constraints. Theor Comput Sci 225:113\u2013128","journal-title":"Theor Comput Sci"},{"key":"49_CR5","unstructured":"Das S, Gosavi SV, Hsu WH, Vaze SA (2002) An ant colony approach for the steiner tree problem. In: GECCO\u201902: proceedings of the genetic and evolutionary computation conference, page 135. Morgan Kaufmann Publishers Inc., Orlando"},{"key":"49_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/b99492","volume-title":"Ant colony optimization","author":"M Dorigo","year":"2004","unstructured":"Dorigo M (2004) Ant colony optimization. MIT Press, New York"},{"key":"49_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-05094-1","volume-title":"Introduction to evolutionary computing","author":"AE Eiben","year":"2003","unstructured":"Eiben AE, Smith JE (2003) Introduction to evolutionary computing. Springer, Berlin"},{"key":"49_CR8","doi-asserted-by":"crossref","unstructured":"Fleischer M (1995) Simulated annealing: past, present, and future. In: Proceedings of the 27th conference on winter simulation, pp 155\u2013161","DOI":"10.1145\/224401.224457"},{"key":"49_CR9","unstructured":"Hu Y, Jing T, Hong X, Feng Z, Hu X, Yan G (2004) An efficient rectilinear Steiner minimum tree algorithm based on ant colony optimization. In: IEEE ICCCAS. IEEE Computer Society Press, Los Alamitos, pp 1276\u20131280"},{"key":"49_CR10","doi-asserted-by":"crossref","unstructured":"Hwang F, Richards D, Winter P (1992) The steiner tree problem. North-Holland","DOI":"10.1002\/net.3230220105"},{"key":"49_CR11","volume-title":"Minimal networks: the steiner problem and its generalizations","author":"A Ivanov","year":"1994","unstructured":"Ivanov A, Tuzhelin A (1994) Minimal networks: the steiner problem and its generalizations. CRC Press, Cleveland"},{"key":"49_CR12","volume-title":"Evolutionary computation: a unified approach","author":"KA De Jong","year":"2006","unstructured":"De Jong KA (2006) Evolutionary computation: a unified approach. MIT Press, New York"},{"key":"49_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2363-2","volume-title":"On optimal interconnections for VLSI","author":"AB Kahng","year":"1995","unstructured":"Kahng AB, Robins G (1995) On optimal interconnections for VLSI. Kluwer Publishers, Boston"},{"key":"49_CR14","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of computer computations","author":"RM Karp","year":"1972","unstructured":"Karp RM (1972) Reducibility among combinatorial problems. In: Miller RE, Thatcher JW (eds) Complexity of computer computations. Plenum Press, New York, pp 85\u2013103"},{"issue":"4598","key":"49_CR15","first-page":"671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gelatt CD Jr., Vecchi MP (1983) Optimization by simulated annealing. Sci Agric 220(4598):671","journal-title":"Sci Agric"},{"key":"49_CR16","unstructured":"Koch T (2009) Steinlib testdata library. Technical report, Konrad-Zuse-Zentrum f\u00fcr Informationstechnik Berlin. http:\/\/steinlib.zib.de\/steinlib.php"},{"key":"49_CR17","volume-title":"Paths, flows and VLSI-layout","author":"B Korte","year":"1990","unstructured":"Korte B, Pr\u00f6mel HJ, Steger S et\u00a0al (1990) Steiner trees in VLSI-layouts. In: Korte B (ed) Paths, flows and VLSI-layout. Springer, Berlin"},{"key":"49_CR18","doi-asserted-by":"crossref","unstructured":"Luyet L, Varone S, Zufferey N (2007) An ant algorithm for the steiner tree problem in graphs. In: EvoWorkshops 2007 on EvoCoMnet, EvoFIN, EvoIASP, EvoINTERACTION, EvoMUSART, EvoSTOC and EvoTransLog. Springer, Berlin, pp 42\u201351","DOI":"10.1007\/978-3-540-71805-5_5"},{"key":"49_CR19","doi-asserted-by":"crossref","unstructured":"Prossegger M, Bouchachia A (2008) Ant colony optimization for Steiner tree problems. In: 5th international conference on soft computing as transdisciplinary science and technology. ACM Press, New York, pp 331\u2013336","DOI":"10.1145\/1456223.1456292"},{"key":"49_CR20","doi-asserted-by":"crossref","unstructured":"Rabanal P, Rodr\u00edguez I, Rubio F (2007) Using river formation dynamics to design heuristic algorithms. In: Unconventional computation, UC\u201907, LNCS 4618. Springer, pp 163\u2013177","DOI":"10.1007\/978-3-540-73554-0_16"},{"key":"49_CR21","doi-asserted-by":"crossref","unstructured":"Rabanal P, Rodr\u00edguez I, Rubio F (2008) Finding minimum spanning\/distances trees by using river formation dynamics. In: Ant colony optimization and Swarm intelligence, ANTS\u201908, LNCS 5217. Springer, pp 60\u201371","DOI":"10.1007\/978-3-540-87527-7_6"},{"key":"49_CR22","doi-asserted-by":"crossref","unstructured":"Rabanal P, Rodr\u00edguez I, Rubio F (2009) Applying river formation dynamics to solve NP-complete problems. In: Chiong R (ed) Nature-inspired algorithms for optimisation, volume 193 of studies in computational intelligence. Springer, pp 333\u2013368","DOI":"10.1007\/978-3-642-00267-0_12"},{"key":"49_CR23","doi-asserted-by":"crossref","unstructured":"Rabanal P, Rodr\u00edguez I, Rubio F (2009) A formal approach to heuristically test restorable systems. In: 6th international colloquium on theoretical aspects of computing\u2014ICTAC 2009, LNCS 5684. Springer, pp 292\u2013306","DOI":"10.1007\/978-3-642-03466-4_19"},{"key":"49_CR24","doi-asserted-by":"crossref","unstructured":"Rabanal P, Rodr\u00edguez I, Rubio F (2010) Applying river formation dynamics to the steiner tree problem. In: International conference on cognitive informatics (ICCI\u201910). IEEE Computer Society Press, Calgary","DOI":"10.1109\/COGINF.2010.5599822"},{"key":"49_CR25","unstructured":"Robins G, Zelikovsky A (2000) Improved Steiner tree approximation in graphs. In: Eleventh annual ACM-SIAM symposium on discrete algorithms. Society for Industrial and Applied Mathematics, pp 770\u2013779"},{"key":"49_CR26","first-page":"6","volume":"24","author":"H Takahashi","year":"1980","unstructured":"Takahashi H, Matsuyama A (1980) An approximate solution for the Steiner problem in graphs. Math Japonica 24:6","journal-title":"Math Japonica"},{"key":"49_CR27","unstructured":"Weise T, Chiong R (2009) Evolutionary approaches and their applications to distributed systems. In: Intelligent systems for automated learning and adaptation: emerging trends and applications, chap 6. pp 114\u2013149"}],"container-title":["Evolutionary Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-011-0049-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12065-011-0049-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-011-0049-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T23:39:52Z","timestamp":1559950792000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12065-011-0049-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,1,26]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,3]]}},"alternative-id":["49"],"URL":"https:\/\/doi.org\/10.1007\/s12065-011-0049-0","relation":{},"ISSN":["1864-5909","1864-5917"],"issn-type":[{"value":"1864-5909","type":"print"},{"value":"1864-5917","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,1,26]]}}}