{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:13:24Z","timestamp":1725560004950},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540283126"},{"type":"electronic","value":"9783540318309"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11539506_39","type":"book-chapter","created":{"date-parts":[[2010,7,21]],"date-time":"2010-07-21T14:15:58Z","timestamp":1279721758000},"page":"312-320","source":"Crossref","is-referenced-by-count":3,"title":["Genetic Algorithms for Dissimilar Shortest Paths Based on Optimal Fuzzy Dissimilar Measure and Applications"],"prefix":"10.1007","author":[{"given":"Yinzhen","family":"Li","sequence":"first","affiliation":[]},{"given":"Ruichun","family":"He","sequence":"additional","affiliation":[]},{"given":"Linzhong","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Yaohuang","family":"Guo","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"39_CR1","doi-asserted-by":"crossref","unstructured":"Cherkassky, B.V., Goldberg, A.V., Radzik, T.: Shortest paths algorithms:Theory and experimental evaluation. Mathematical programming, 129\u2013174 (1996)","DOI":"10.1007\/BF02592101"},{"key":"39_CR2","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1287\/mnsc.17.11.712","volume":"17","author":"J.Y. Yen","year":"1971","unstructured":"Yen, J.Y.: Finding the k shortest loopless paths in a network. Management Science\u00a017, 721\u2013726 (1971)","journal-title":"Management Science"},{"key":"39_CR3","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/0377-2217(91)90093-B","volume":"53","author":"S.P. Miaou","year":"1991","unstructured":"Miaou, S.P., Chin, S.M.: Computing k-shortest paths for nuclear spent fuel highway transportation. European Journal of Operational Research\u00a053, 64\u201380 (1991)","journal-title":"European Journal of Operational Research"},{"key":"39_CR4","first-page":"341","volume":"17","author":"D.R. Shier","year":"1979","unstructured":"Shier, D.R.: On algorithms for finding the k shortest paths in a network. Networks\u00a017, 341\u2013352 (1979)","journal-title":"Networks"},{"key":"39_CR5","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0968-090X(94)90008-6","volume":"2c","author":"C.K. Lee","year":"1994","unstructured":"Lee, C.K.: A multiple path routing strategy for Vehicle route guidance systems. Tran. Res.\u00a02c, 185\u2013195 (1994)","journal-title":"Tran. Res."},{"key":"39_CR6","first-page":"214","volume":"9","author":"R. Dial","year":"1999","unstructured":"Dial, R., Glover, F., Karney, D.: A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees. Networks\u00a09, 214\u2013248 (1999)","journal-title":"Networks"},{"key":"39_CR7","first-page":"25","volume":"1","author":"K. Lombard","year":"1993","unstructured":"Lombard, K., Church, R.L.: The gateway shortest path problem:Generating alternative routes for a corridor location problem. Geographical systems\u00a01, 25\u201345 (1993)","journal-title":"Geographical systems"},{"key":"39_CR8","first-page":"8","volume":"1","author":"K. Wang","year":"2001","unstructured":"Wang, K., Xu, Y.: A model and algorithm on the path selection in dissimilar path problem. Theory Method Application of system engineering\u00a01, 8\u201312 (2001)","journal-title":"Theory Method Application of system engineering"},{"key":"39_CR9","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1111\/j.1538-4632.1987.tb00133.x","volume":"19","author":"M. Kuby","year":"1987","unstructured":"Kuby, M.: Programming models for facility dispersion: The p-dispersion and Maximum Dispersion Problems. Geographical Analysis\u00a019, 315\u2013329 (1987)","journal-title":"Geographical Analysis"},{"key":"39_CR10","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/0377-2217(90)90297-O","volume":"46","author":"E. Erkut","year":"1990","unstructured":"Erkut, E.: The discrete p-dispersion problem. European Journal of operational Research\u00a046, 48\u201360 (1990)","journal-title":"European Journal of operational Research"},{"key":"39_CR11","unstructured":"Ruphail, N.M., et al.: A Dss for dynamic pre-trip route planning. Applications of advanced technologies in transportation engineering. In: Proc of the 4th Intl. Conference, pp. 325\u2013329 (1995)"},{"key":"39_CR12","first-page":"42","volume":"4","author":"Q. Yang","year":"2004","unstructured":"Yang, Q.: Research on the path selection based on multiple rational paths. Journal of managing Engineering\u00a04, 42\u201345 (2004)","journal-title":"Journal of managing Engineering"},{"key":"39_CR13","unstructured":"Gen, M.: Bicriterion network design problem. In: The 3rd International Information and Management Science Conference, Dunhuang, P.R.of China, vol.\u00a05, pp. 419\u2013425 (2004)"},{"key":"39_CR14","unstructured":"Li, Y., He, R.: On the models and algorithms for finding dissimilar shortest paths in a traffic network. In: The 7th National Operation Research Conference of China, Qingdao, China, vol.\u00a08 (2004)"}],"container-title":["Lecture Notes in Computer Science","Fuzzy Systems and Knowledge Discovery"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11539506_39.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:16:48Z","timestamp":1605644208000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11539506_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540283126","9783540318309"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11539506_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}