{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:04:27Z","timestamp":1725566667595},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642163876"},{"type":"electronic","value":"9783642163883"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16388-3_11","type":"book-chapter","created":{"date-parts":[[2010,9,27]],"date-time":"2010-09-27T07:49:05Z","timestamp":1285573745000},"page":"97-107","source":"Crossref","is-referenced-by-count":3,"title":["Ranking Based Selection Genetic Algorithm for Capacity Flow Assignments"],"prefix":"10.1007","author":[{"given":"Guangming","family":"Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chengbo","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shaobin","family":"Zhan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yunting","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","unstructured":"Gerla, M.: The design of store-and-forward networks for computer communications. Ph.D. Thesis, UCLA (1973)"},{"issue":"4","key":"11_CR2","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1109\/26.20116","volume":"37","author":"B. Gavish","year":"1989","unstructured":"Gavish, B., Neuman, I.: A system for routing and capacity assignment in computer communication networks. IEEE Trans. Communication\u00a037(4), 360\u2013366 (1989)","journal-title":"IEEE Trans. Communication"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Pirkul, H., et al.: Route selection in backbone data communication networks. Computer Networks and ISDN Systems, 121\u2013133 (1988)","DOI":"10.1016\/0169-7552(88)90048-7"},{"issue":"5","key":"11_CR4","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/0140-3664(94)90045-0","volume":"17","author":"H. Pirkul","year":"1994","unstructured":"Pirkul, H., Amiri, A.: Routing in packet-switched communication networks. Computer Comm.\u00a017(5), 307\u2013316 (1994)","journal-title":"Computer Comm."},{"key":"11_CR5","volume-title":"Adaptation in Natural and Artificial Systems","author":"J. Holland","year":"1975","unstructured":"Holland, J.: Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor (1975)"},{"key":"11_CR6","unstructured":"Ye, D., Wu, X.: Optimal Design of Computer Communication Network Based on Genetic Algorithm. Journal of Nanjing Institute of Posts and Telecommunications\u00a016(2) (June 9-15, 1996)"},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1016\/S0140-3664(02)00240-2","volume":"26","author":"X. Lin","year":"2003","unstructured":"Lin, X., Kwok, Y., Lau, V.: A genetic algorithm based approach to route selection and capacity flow assignment. Computer Communications\u00a026, 961\u2013974 (2003)","journal-title":"Computer Communications"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Chang, W., Ramakrishna, R.S.: A genetic algorithm for shortest path routing problem and the sizing of populations. IEEE Transaction on Evolutionary Computation\u00a06(6) (December 2002)","DOI":"10.1109\/TEVC.2002.804323"}],"container-title":["Communications in Computer and Information Science","Computational Intelligence and Intelligent Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16388-3_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T02:58:52Z","timestamp":1559703532000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16388-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642163876","9783642163883"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16388-3_11","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2010]]}}}