{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T23:40:01Z","timestamp":1750376401491,"version":"3.41.0"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319618234"},{"type":"electronic","value":"9783319618241"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","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":[[2017]]},"DOI":"10.1007\/978-3-319-61824-1_42","type":"book-chapter","created":{"date-parts":[[2017,6,23]],"date-time":"2017-06-23T02:12:38Z","timestamp":1498183958000},"page":"386-393","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimizing Least-Cost Steiner Tree in Graphs via an Encoding-Free Genetic Algorithm"],"prefix":"10.1007","author":[{"given":"Qing","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rongjun","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingyan","family":"Kang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junliang","family":"Yao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenqing","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yali","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,6,24]]},"reference":[{"issue":"5","key":"42_CR1","doi-asserted-by":"publisher","first-page":"996","DOI":"10.1587\/transcom.E97.B.996","volume":"E97-B","author":"Q Liu","year":"2014","unstructured":"Liu, Q., Odaka, T., Kuroiwa, J., et al.: An artificial fish swarm algorithm for the multicast routing problem. IEICE Trans. Commun. E97-B(5), 996\u20131011 (2014)","journal-title":"IEICE Trans. Commun."},{"issue":"9","key":"42_CR2","first-page":"1503","volume":"14","author":"Z Zhou","year":"2003","unstructured":"Zhou, Z., Jiang, C., Huang, L., et al.: On optimal rectilinear shortest paths and 3-Steiner tree routing in presence of obstacles. J. Softw. 14(9), 1503\u20131514 (2003). (in Chinese with an English abstract)","journal-title":"J. Softw."},{"issue":"4","key":"42_CR3","first-page":"558","volume":"27","author":"Z Li","year":"2009","unstructured":"Li, Z., Shi, H.: A data-aggregation algorithm based on minimum Steiner tree in wireless sensor networks. J. Northwest. Polytech. Univ. 27(4), 558\u2013564 (2009). (in Chinese with an English abstract)","journal-title":"J. Northwest. Polytech. Univ."},{"key":"42_CR4","volume-title":"The Steiner Tree Problem","author":"FK Hwang","year":"1992","unstructured":"Hwang, F.K., Richards, D.S., Winter, P.: The Steiner Tree Problem, vol. 53. Elsevier, Amsterdam (1992)"},{"issue":"6","key":"42_CR5","first-page":"573","volume":"24","author":"H Takahashi","year":"1980","unstructured":"Takahashi, H., Matsuyama, A.: An approximate solution for the Steiner problem in graphs. Math. Jpn. 24(6), 573\u2013577 (1980)","journal-title":"Math. Jpn."},{"key":"42_CR6","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, 141\u2013145 (1981)","journal-title":"Acta Informatica"},{"issue":"1","key":"42_CR7","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1080\/0020739830140103","volume":"14","author":"VJ Rayward-Smith","year":"1983","unstructured":"Rayward-Smith, V.J.: The computation of nearly minimal Steiner trees in graphs. Int. J. Math. Educ. Sci. Tech. 14(1), 15\u201323 (1983)","journal-title":"Int. J. Math. Educ. Sci. Tech."},{"key":"42_CR8","unstructured":"Gary, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness (1979)"},{"issue":"2","key":"42_CR9","first-page":"269","volume":"LX","author":"J Plesn\u00edk","year":"1991","unstructured":"Plesn\u00edk, J.: Worst-case relative performances of heuristics for the Steiner problem in graphs. Acta Math. Univ. Comen. LX(2), 269\u2013284 (1991)","journal-title":"Acta Math. Univ. Comen."},{"issue":"5","key":"42_CR10","first-page":"65","volume":"29","author":"Y Fan","year":"2008","unstructured":"Fan, Y., Jianjun, Yu., Fang, Z.: Hybrid genetic simulated annealing algorithm based on niching for QoS multicast routing. J. Commun. 29(5), 65\u201371 (2008). (in Chinese with an English abstract)","journal-title":"J. Commun."},{"key":"42_CR11","doi-asserted-by":"crossref","unstructured":"Ma, X., Liu, Q.: A particle swarm optimization for Steiner tree problem. In: Proceedings of the 6th International Conference on Natural Computation (ICNC), pp. 2561\u20132565 (2010)","DOI":"10.1109\/ICNC.2010.5583217"},{"key":"42_CR12","doi-asserted-by":"crossref","unstructured":"Zhong, W.L., Huang, J., Zhang, J.: A novel particle swarm optimization for the Steiner tree problem in graphs. In: IEEE World Congress on Evolutionary Computation, pp. 2460\u20132467 (2008)","DOI":"10.1109\/CEC.2008.4631127"},{"key":"42_CR13","doi-asserted-by":"crossref","unstructured":"Ma, X., Liu, Q.: An artificial fish swarm algorithm for Steiner tree problem. In: IEEE-FUZZ, pp. 59\u201363 (2009)","DOI":"10.1109\/FUZZY.2009.5277219"},{"issue":"6","key":"42_CR14","doi-asserted-by":"publisher","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"RC Prim","year":"1957","unstructured":"Prim, R.C.: Shortest connection networks and some generalizations. Bell Syst. Tech. J. 36(6), 1389\u20131401 (1957)","journal-title":"Bell Syst. Tech. J."},{"key":"42_CR15","volume-title":"Genetic Programming: On the Programming of Computers by Means of Natural Selection","author":"J Koza","year":"1992","unstructured":"Koza, J.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge (1992)"}],"container-title":["Lecture Notes in Computer Science","Advances in Swarm Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-61824-1_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T23:18:11Z","timestamp":1750375091000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-61824-1_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319618234","9783319618241"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-61824-1_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"24 June 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICSI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Swarm Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Fukuoka","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 July 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 August 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"swarm2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ic-si.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}