{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T05:33:31Z","timestamp":1725946411414},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319745206"},{"type":"electronic","value":"9783319745213"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-319-74521-3_20","type":"book-chapter","created":{"date-parts":[[2018,1,21]],"date-time":"2018-01-21T21:54:37Z","timestamp":1516571677000},"page":"173-182","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Research on the Shortest Path Problem Based on Improved Genetic Algorithm"],"prefix":"10.1007","author":[{"given":"Baoliang","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Susu","family":"Yao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kaining","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huizhen","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,1,23]]},"reference":[{"issue":"C","key":"20_CR1","first-page":"67","volume":"89","author":"YD Ko","year":"2015","unstructured":"Ko, Y.D., Jang, Y.J., Min, S.L.: The optimal economic design of the wireless powered intelligent transportation system using genetic algorithm considering nonlinear cost function. Comput. Ind. Eng. 89(C), 67\u201379 (2015)","journal-title":"Comput. Ind. Eng."},{"issue":"1","key":"20_CR2","doi-asserted-by":"crossref","first-page":"1518","DOI":"10.1016\/j.eswa.2011.08.044","volume":"39","author":"C Chitra","year":"2012","unstructured":"Chitra, C., Subbaraj, P.: A nondominated sorting genetic algorithm solution for shortest path routing problem in computer networks. Expert Syst. Appl. 39(1), 1518\u20131525 (2012)","journal-title":"Expert Syst. Appl."},{"key":"20_CR3","first-page":"56","volume":"16","author":"H Cheng","year":"2013","unstructured":"Cheng, H.: Obstacle avoidance shortest path algorithm and its application. Electron. Des. Eng. 16, 56\u201360 (2013). (in Chinese)","journal-title":"Electron. Des. Eng."},{"key":"20_CR4","first-page":"526","volume":"05","author":"X Qi","year":"2005","unstructured":"Qi, X., Liu, S.: Selection algorithm for QoS routing based on k-shortest paths. J. Jilin Univ. (Eng. Technol. Ed.) 05, 526\u2013530 (2005). (in Chinese)","journal-title":"J. Jilin Univ. (Eng. Technol. Ed.)"},{"issue":"1","key":"20_CR5","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1(1), 269\u2013271 (1959)","journal-title":"Numer. Math."},{"key":"20_CR6","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1090\/qam\/102435","volume":"16","author":"R Bellman","year":"1958","unstructured":"Bellman, R.: On a routing problem. Q. Appl. Math. 16, 87\u201390 (1958)","journal-title":"Q. Appl. Math."},{"key":"20_CR7","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/978-3-540-95978-6_7","volume":"187","author":"L Lin","year":"2009","unstructured":"Lin, L., Gen, M.: Priority-based genetic algorithm for shortest path routing problem in OSPF. Stud. Comput. Intell. 187, 91\u2013103 (2009)","journal-title":"Stud. Comput. Intell."},{"key":"20_CR8","first-page":"1","volume-title":"Adaptation in Natural Artificial Systems","author":"JH Holland","year":"1975","unstructured":"Holland, J.H.: Adaptation in Natural Artificial Systems, pp. 1\u201317. MIT Press, Cambridge (1975)"},{"issue":"12","key":"20_CR9","first-page":"3193","volume":"5","author":"Z Cao","year":"2009","unstructured":"Cao, Z.: The study on exhaust algorithm, search algorithm, dynamic design for 0\u20131 Knapsack problem. Comput. Knowl. Technol. 5(12), 3193\u20133198 (2009). (in Chinese)","journal-title":"Comput. Knowl. Technol."},{"issue":"4","key":"20_CR10","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1109\/21.286385","volume":"24","author":"M Srinivas","year":"1994","unstructured":"Srinivas, M., Patnaik, L.: Adaptive probabilities of crossover and mutation in genetic algorithm. IEEE Trans. Syst. Man Cybern. 24(4), 656\u2013666 (1994)","journal-title":"IEEE Trans. Syst. Man Cybern."}],"container-title":["Lecture Notes in Computer Science","Human Centered Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-74521-3_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,12]],"date-time":"2022-08-12T19:34:40Z","timestamp":1660332880000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-74521-3_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319745206","9783319745213"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-74521-3_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}