{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:41:03Z","timestamp":1725475263703},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540340751"},{"type":"electronic","value":"9783540340768"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11751595_62","type":"book-chapter","created":{"date-parts":[[2006,5,11]],"date-time":"2006-05-11T14:27:59Z","timestamp":1147357679000},"page":"581-589","source":"Crossref","is-referenced-by-count":0,"title":["Hybrid Evolutionary Algorithms for the Rectilinear Steiner Tree Problem Using Fitness Estimation"],"prefix":"10.1007","author":[{"given":"Byounghak","family":"Yang","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"62_CR1","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195099713.001.0001","volume-title":"Evolutionary Algorithm in Theory and Practice","author":"T. B\u00e4ck","year":"1996","unstructured":"B\u00e4ck, T.: Evolutionary Algorithm in Theory and Practice. Oxford University Press, Oxford (1996)"},{"key":"62_CR2","unstructured":"Barreiros, J.: An Hierarchic Genetic Algorithm for Computing (near) Optimal Euclidean Stein Steiner Trees. In: Workshop on Application of hybrid Evolutionary Algorithms to NP-Complete Problems, Chicago (2003)"},{"key":"62_CR3","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"J.E. Beasley","year":"1990","unstructured":"Beasley, J.E.: OR-Library: distributing test problems by electronic mail. Journal of the Operational Research Society\u00a041, 1069\u20131072 (1990)","journal-title":"Journal of the Operational Research Society"},{"key":"62_CR4","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1016\/0377-2217(92)90214-T","volume":"58","author":"J.E. Beasley","year":"1992","unstructured":"Beasley, J.E.: A heuristic for Euclidean and rectilinear Steiner problems. European Journal of Operational Research\u00a058, 284\u2013292 (1992)","journal-title":"European Journal of Operational Research"},{"key":"62_CR5","doi-asserted-by":"publisher","first-page":"1563","DOI":"10.1109\/43.331412","volume":"13","author":"M. Borah","year":"1994","unstructured":"Borah, M., Owens, R.M.: An Edge-Based Heuristic for Steiner Routing. IEEE Trans. on Computer Aided Design\u00a013, 1563\u20131568 (1994)","journal-title":"IEEE Trans. on Computer Aided Design"},{"key":"62_CR6","first-page":"57","volume":"14","author":"R.L. France","year":"1963","unstructured":"France, R.L.: A note on the optimum location of new machines in existing plant layouts. J. Industrial Engineering\u00a014, 57\u201359 (1963)","journal-title":"J. Industrial Engineering"},{"key":"62_CR7","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/S0166-218X(98)00089-4","volume":"90","author":"J.L. Ganley","year":"1999","unstructured":"Ganley, J.L.: Computing optimal rectilinear Steiner trees: A survey and experimental evaluation. Discrete Applied Mathematics\u00a090, 161\u2013171 (1999)","journal-title":"Discrete Applied Mathematics"},{"key":"62_CR8","doi-asserted-by":"publisher","first-page":"826","DOI":"10.1137\/0132071","volume":"32","author":"M.R. Garey","year":"1977","unstructured":"Garey, M.R., Johnson, D.S.: The rectilinear Steiner tree problem is NP-complete. SIAM Journal on Applied Mathematics\u00a032, 826\u2013834 (1977)","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"62_CR9","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1137\/0114025","volume":"14","author":"M. Hanan","year":"1966","unstructured":"Hanan, M.: On Steiner\u2019s problem with rectilinear distance. SLAM Journal on Applied Mathematics\u00a014, 255\u2013265 (1966)","journal-title":"SLAM Journal on Applied Mathematics"},{"key":"62_CR10","unstructured":"Hesser, J., Manner, R., Stucky, O.: Optimization of Steiner Trees using Genetic Algorithms. In: Proceedings of the Third International Conference on Genetic Algorithm, pp. 231\u2013236 (1989)"},{"key":"62_CR11","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s00500-003-0328-5","volume":"9","author":"Y. Jin","year":"2005","unstructured":"Jin, Y.: A Survey on fitness Approximation in Evolutionary Computation. Journal of Soft Computing\u00a09, 3\u201312 (2005)","journal-title":"Journal of Soft Computing"},{"key":"62_CR12","doi-asserted-by":"crossref","unstructured":"Julstrom, B.A.: Encoding Rectilinear Trees as Lists of Edges. In: Proceedings of the 16th ACM Symposium on Applied Computing, pp. 356\u2013360 (2001)","DOI":"10.1145\/372202.372365"},{"key":"62_CR13","doi-asserted-by":"publisher","first-page":"893","DOI":"10.1109\/43.144853","volume":"11","author":"A.B. Kahng","year":"1992","unstructured":"Kahng, A.B., Robins, B.: A New Class of Iterative Steiner Tree Heuristics with Good Performance. IEEE Trans. on Computer Aided Design\u00a011, 893\u2013902 (1992)","journal-title":"IEEE Trans. on Computer Aided Design"},{"key":"62_CR14","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1109\/TCS.1976.1084243","volume":"23","author":"J.L. Lee","year":"1976","unstructured":"Lee, J.L., Bose, N.K., Hwang, F.K.: Use of Steiner\u2019s problem in suboptimal routing in rectilinear metric. IEEE Transaction son Circuits and Systems\u00a023, 470\u2013476 (1976)","journal-title":"IEEE Transaction son Circuits and Systems"},{"key":"62_CR15","first-page":"10","volume":"31","author":"S.M. Sock","year":"2005","unstructured":"Sock, S.M., Ahn, B.H.: A New Tree Representation for Evolutionary Algorithms. Journal of the Korean Institute of Industrial Engineers\u00a031, 10\u201319 (2005)","journal-title":"Journal of the Korean Institute of Industrial Engineers"},{"key":"62_CR16","first-page":"48","volume":"15","author":"J. Soukup","year":"1973","unstructured":"Soukup, J., Chow, W.F.: Set of test problems for the minimum length connection networks. ACM\/SIGMAP Newsletter\u00a015, 48\u201351 (1973)","journal-title":"ACM\/SIGMAP Newsletter"},{"key":"62_CR17","volume-title":"Advances in Steiner Tree","author":"D.M. Warme","year":"1998","unstructured":"Warme, D.M., Winter, P., Zachariasen, M.: Exact Algorithms for Plane Steiner Tree Problems: A Computational Study. In: Du, D.Z., Smith, J.M., Rubinstein, J.H. (eds.) Advances in Steiner Tree. Kluser Academic Publishers, Dordrecht (1998)"},{"key":"62_CR18","unstructured":"Warme, D.M.: http:\/\/www.group-w-inc.com\/warme\/research"},{"key":"62_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/11424925_27","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2005","author":"B.H. Yang","year":"2005","unstructured":"Yang, B.H.: An Evolution Algorithm for the Rectilinear Steiner Tree Problem. In: Gervasi, O., Gavrilova, M.L., Kumar, V., Lagan\u00e1, A., Lee, H.P., Mun, Y., Taniar, D., Tan, C.J.K. (eds.) ICCSA 2005. LNCS, vol.\u00a03483, pp. 241\u2013249. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications - ICCSA 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11751595_62.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,27]],"date-time":"2021-07-27T02:54:21Z","timestamp":1627354461000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11751595_62"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540340751","9783540340768"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11751595_62","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}