{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:52:27Z","timestamp":1740099147001,"version":"3.37.3"},"publisher-location":"Singapore","reference-count":18,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811328251"},{"type":"electronic","value":"9789811328268"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","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-981-13-2826-8_17","type":"book-chapter","created":{"date-parts":[[2018,10,6]],"date-time":"2018-10-06T05:36:02Z","timestamp":1538804162000},"page":"186-197","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Efficient Genetic Algorithm for Solving Constraint Shortest Path Problem Through Specified Vertices"],"prefix":"10.1007","author":[{"given":"Zhang","family":"Kai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shao","family":"Yunfeng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhang","family":"Zhaozong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hu","family":"Wei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,10,7]]},"reference":[{"key":"17_CR1","doi-asserted-by":"publisher","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, 269\u2013271 (1959)","journal-title":"Numer. Math."},{"issue":"6","key":"17_CR2","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1145\/367766.368168","volume":"5","author":"RW Floyd","year":"1962","unstructured":"Floyd, R.W.: Algorithm 97 shortest path. Commun. ACM 5(6), 345 (1962)","journal-title":"Commun. ACM"},{"issue":"5","key":"17_CR3","doi-asserted-by":"publisher","first-page":"909","DOI":"10.1287\/opre.14.5.909","volume":"14","author":"JP Saksena","year":"1966","unstructured":"Saksena, J.P., Kumar, S.: The routing problem with \u201cK\" specified nodes. Oper. Res. 14(5), 909\u2013913 (1966)","journal-title":"Oper. Res."},{"issue":"3","key":"17_CR4","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1287\/opre.17.3.395","volume":"17","author":"SE Dreyfus","year":"1969","unstructured":"Dreyfus, S.E.: An appraisal of some shortest-path algorithms. Oper. Res. 17(3), 395\u2013412 (1969)","journal-title":"Oper. Res."},{"issue":"3","key":"17_CR5","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1051\/ro\/1984180302031","volume":"18","author":"G Laporte","year":"1984","unstructured":"Laporte, G., Mercure, H., Norbert, Y.: Optimal tour planning with specified nodes. RAIRO-Oper. Res. 18(3), 203\u2013210 (1984)","journal-title":"RAIRO-Oper. Res."},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/j.osn.2016.05.002","volume":"23","author":"T Gomes","year":"2017","unstructured":"Gomes, T., Martins, L., Ferreira, S.: Algorithms for determining a node-disjoint path pair visiting specified nodes. Opt. Switch. Netw. 23, 189\u2013204 (2017)","journal-title":"Opt. Switch. Netw."},{"issue":"6","key":"17_CR7","doi-asserted-by":"publisher","first-page":"1838","DOI":"10.1016\/j.cor.2004.11.021","volume":"33","author":"JF B\u00e9rub\u00e9","year":"2006","unstructured":"B\u00e9rub\u00e9, J.F., Potvin, J.Y., Vaucher, J.: Time-dependent shortest paths through a fixed sequence of nodes: application to a travel planning problem. Comput. Oper. Res. 33(6), 1838\u20131856 (2006)","journal-title":"Comput. Oper. Res."},{"key":"17_CR8","unstructured":"Andrade, R.C.: Elementary shortest-paths visiting a given set of nodes. Simp\u00f3sio Brasileiro de Pesquisa Operacional, 2378\u20132388 (2013)"},{"issue":"3","key":"17_CR9","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1016\/j.ejor.2016.05.008","volume":"254","author":"RC Andrade","year":"2016","unstructured":"Andrade, R.C.: New formulations for the elementary shortest-path problem visiting a given set of nodes. Eur. J. Oper. Res. 254(3), 755\u2013768 (2016)","journal-title":"Eur. J. Oper. Res."},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Jia, J., Pan, J.S., Xu, H.R.: The middle of the specified node set of shortest path algorithm. IEEE International Conference on Signal Processing, pp. 1823\u20131826 (2017)","DOI":"10.1109\/ICSP.2016.7878143"},{"issue":"2","key":"17_CR11","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1137\/1015031","volume":"15","author":"T Ibaraki","year":"1973","unstructured":"Ibaraki, T.: Algorithms for obtaining shortest paths visiting specified nodes. SIAM Rev. 15(2), 309\u2013317 (1973)","journal-title":"SIAM Rev."},{"issue":"2","key":"17_CR12","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1016\/0022-247X(72)90091-1","volume":"38","author":"GL Nemhauser","year":"1972","unstructured":"Nemhauser, G.L.: A generalized permanent label setting algorithm for the shortest path between specified nodes. J. Math. Anal. Appl. 38(2), 328\u2013334 (1972)","journal-title":"J. Math. Anal. Appl."},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"Gomes, T., Marques, S., Martins, L., et al.: Protected shortest path visiting specified nodes. In: IEEE 7th International Workshop on Reliable Networks Design and Modeling, pp. 120\u2013127 (2015)","DOI":"10.1109\/RNDM.2015.7325218"},{"key":"17_CR14","first-page":"846","volume":"5","author":"L Feng","year":"2014","unstructured":"Feng, L., Yuan, L., Luo, W.: A geometric algebraic algorithm for node-constrained shortest path. Acta Electron. Sin. 5, 846\u2013851 (2014)","journal-title":"Acta Electron. Sin."},{"key":"17_CR15","unstructured":"Yao, B., Feng, H., Gao, Y., Ma, J., Feng, Y.: Dynamic pruning search algorithm with node sets. Comput. Eng. Appl. 1\u20138 (2017)"},{"issue":"2","key":"17_CR16","first-page":"459","volume":"31","author":"Q Xu","year":"2009","unstructured":"Xu, Q., Ke, X.: Research on the shortest path problem model and corresponding genetic algorithm for the mandatory point. Syst. Eng. Electron. 31(2), 459\u2013462 (2009)","journal-title":"Syst. Eng. Electron."},{"key":"17_CR17","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/s41650-017-0025-7","volume":"2","author":"Z Liu","year":"2017","unstructured":"Liu, Z., Lin, J., Jin, T.: The shortest path algorithm based on the improved genetic algorithm. Inf. Commun. 2, 46\u201348 (2017)","journal-title":"Inf. Commun."},{"issue":"3","key":"17_CR18","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/BF00977785","volume":"9","author":"DT Lee","year":"1980","unstructured":"Lee, D.T., Schachter, B.J.: Two algorithms for constructing a Delaunay triangulation. Int. J. Comput. Inf. Sci. 9(3), 219\u2013242 (1980)","journal-title":"Int. J. Comput. Inf. Sci."}],"container-title":["Communications in Computer and Information Science","Bio-inspired Computing: Theories and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-13-2826-8_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,25]],"date-time":"2019-10-25T12:29:22Z","timestamp":1572006562000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-13-2826-8_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9789811328251","9789811328268"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-981-13-2826-8_17","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"BIC-TA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Bio-Inspired Computing: Theories and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Beijing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 November 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"bicta2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/2018.bicta.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}