{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T20:30:31Z","timestamp":1775766631980,"version":"3.50.1"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2019,8,28]],"date-time":"2019-08-28T00:00:00Z","timestamp":1566950400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,8,28]],"date-time":"2019-08-28T00:00:00Z","timestamp":1566950400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2020,5]]},"DOI":"10.1007\/s10115-019-01397-4","type":"journal-article","created":{"date-parts":[[2019,8,28]],"date-time":"2019-08-28T14:03:56Z","timestamp":1567001036000},"page":"1751-1780","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Queries of K-discriminative paths on road networks"],"prefix":"10.1007","volume":"62","author":[{"given":"Chien-Wei","family":"Chang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chu-Di","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3914-8550","authenticated-orcid":false,"given":"Kun-Ta","family":"Chuang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,8,28]]},"reference":[{"key":"1397_CR1","volume-title":"Network flows: theory, algorithms, and applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: theory, algorithms, and applications. Prentice-Hall Inc, Upper Saddle River"},{"key":"1397_CR2","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1016\/S0377-2217(99)00214-3","volume":"121","author":"V Akgun","year":"2000","unstructured":"Akgun V, Erkut E, Batta R (2000) On finding dissimilar paths. Eur J Oper Res 121:232\u2013246","journal-title":"Eur J Oper Res"},{"key":"1397_CR3","doi-asserted-by":"crossref","unstructured":"Bomze I, Budinich M, Pardalos P, Pelillo M (1999) The maximum clique problem. In: Handbook of combinatorial optimization. Springer, Berlin","DOI":"10.1007\/978-1-4757-3023-4_1"},{"key":"1397_CR4","unstructured":"Borzsony S, Kossmann D, Stocker K (2001) The skyline operator. In: IEEE international conference on data engineering"},{"key":"1397_CR5","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1016\/0377-2217(89)90215-4","volume":"43","author":"J Brumbaugh-Smith","year":"1989","unstructured":"Brumbaugh-Smith J, Shier D (1989) An empirical investigation of some bicriterion shortest path algorithms. Eur J Oper Res 43:216\u2013224","journal-title":"Eur J Oper Res"},{"key":"1397_CR6","doi-asserted-by":"crossref","unstructured":"Caramia M, Dell\u2019Olmo P (2008) Chapter 2 Multi-objective optimization. In: Multi-objective management in freight logistics. Springer, London, pp 11\u201336","DOI":"10.1007\/978-1-84800-382-8_2"},{"key":"1397_CR7","doi-asserted-by":"publisher","first-page":"1304","DOI":"10.1016\/j.cor.2005.06.003","volume":"34","author":"P Carotenuto","year":"2007","unstructured":"Carotenuto P, Giordani S, Ricciardelli S (2007) Finding minimum and equitable risk routes for hazmat shipments. Comput Oper Res 34:1304\u20131327","journal-title":"Comput Oper Res"},{"key":"1397_CR8","doi-asserted-by":"publisher","first-page":"775","DOI":"10.1177\/003335490612100620","volume":"121","author":"SK Carpender","year":"2006","unstructured":"Carpender SK, Campbell PH, Quiram BJ, Frances J, Artzberger A (2006) Urban evacuations and rural America: lessons learned from Hurricane Rita. Public Health Rep 121:775\u2013779","journal-title":"Public Health Rep"},{"key":"1397_CR9","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0377-2217(90)90318-6","volume":"44","author":"RL Carraway","year":"1990","unstructured":"Carraway RL, Morin TL, Moskowitz H (1990) Generalized dynamic programming for multicriteria optimization. Eur J Oper Res 44:95\u2013104","journal-title":"Eur J Oper Res"},{"key":"1397_CR10","unstructured":"Chomicki J, Godfrey P, Gryz J, Liang D (2003) Skyline with presorting. In: IEEE international conference on data engineering"},{"issue":"7","key":"1397_CR11","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1016\/S0965-8564(03)00007-7","volume":"37","author":"TJ Cova","year":"2003","unstructured":"Cova TJ, Johnson JP (2003) A network flow model for lane-based evacuation routing. Transp Res Part A Policy Pract 37(7):579\u2013604","journal-title":"Transp Res Part A Policy Pract"},{"key":"1397_CR12","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0305-0548(90)90042-6","volume":"17","author":"JR Current","year":"1990","unstructured":"Current JR, Revelle CS, Cohon JL (1990) An interactive approach to identify the best compromise solution for two objective shortest path problems. Comput Oper Res 17:187\u2013198","journal-title":"Comput Oper Res"},{"issue":"1","key":"1397_CR13","first-page":"1","volume":"8","author":"Y Dean","year":"2008","unstructured":"Dean Y (2008) Coping with disaster: the impact of hurricanes on international financial flows, 1970\u20132002. BE J Econ Anal Policy 8(1):1\u201345","journal-title":"BE J Econ Anal Policy"},{"key":"1397_CR14","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.ejor.2003.10.033","volume":"162","author":"P Dell\u2019Olmo","year":"2005","unstructured":"Dell\u2019Olmo P, Gentili M, Scozzari A (2005) On finding dissimilar pareto-optimal paths. Eur J Oper Res 162:70\u201382","journal-title":"Eur J Oper Res"},{"key":"1397_CR15","doi-asserted-by":"crossref","unstructured":"Deng K, Zhou X, Shen HT (2007) Multi-source skyline query processing in road networks. In: IEEE international conference on data engineering","DOI":"10.1109\/ICDE.2007.367925"},{"key":"1397_CR16","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1109\/MCI.2006.329691","volume":"1","author":"M Dorigo","year":"2006","unstructured":"Dorigo M, Birattari M, Stutzle T (2006) Ant colony optimization\u2013artificial ants as a computational intelligence technique. IEEE Comput Intell Mag 1:28\u201339","journal-title":"IEEE Comput Intell Mag"},{"key":"1397_CR17","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/j.tcs.2005.05.020","volume":"344","author":"M Dorigo","year":"2005","unstructured":"Dorigo M, Blum C (2005) Ant colony optimization theory: a survey. Theor Comput Sci 344:243\u2013278","journal-title":"Theor Comput Sci"},{"key":"1397_CR18","unstructured":"Eskovitz J (2006) Evacuation planning in Texas: before and after Hurricane Rita. In: Interim news"},{"key":"1397_CR19","doi-asserted-by":"crossref","unstructured":"Fang H, Zhao P, Sheng VS, Wu J, Xu J, Liu A, Cui Z (2015) Effective spatial keyword query processing on road networks. In: Databases theory and applications, vol 9093. Springer, Cham, pp 194\u2013206","DOI":"10.1007\/978-3-319-19548-3_16"},{"key":"1397_CR20","doi-asserted-by":"crossref","unstructured":"Gilmour S, Dras M (2005) Understanding the pheromone system within ant colony optimization. In: Advances in artificial intelligence, vol 3809. Springer, Berlin, Heidelberg","DOI":"10.1007\/11589990_81"},{"key":"1397_CR21","first-page":"109","volume":"19","author":"F Glover","year":"1998","unstructured":"Glover F, Kuo C-C, Dhir KS (1998) Heuristic algorithms for the maximum diversity problem. J Inf Optim Sci 19:109\u2013132","journal-title":"J Inf Optim Sci"},{"key":"1397_CR22","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/S0377-2217(02)00594-5","volume":"151","author":"J Granat","year":"2003","unstructured":"Granat J, Guerriero F (2003) The interactive analysis of the multicriteria shortest path problem by the reference point method. Eur J Oper Res 151:103\u2013118","journal-title":"Eur J Oper Res"},{"key":"1397_CR23","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1023\/A:1012602011914","volume":"111","author":"F Guerriero","year":"2001","unstructured":"Guerriero F, Musmanno R (2001) Label correcting methods to solve multicriteria shortest path problems. J Optim Theory Appl 111:589\u2013613","journal-title":"J Optim Theory Appl"},{"key":"1397_CR24","unstructured":"Hoppe B, Tardos E (1994) Polynomial time algorithms for some evacuation problems. In: Proceedings of the fifth annual ACM-SIAM symposium on discrete algorithms, SODA \u201994. Society for Industrial and Applied Mathematics, Philadelphia, pp 433\u2013441"},{"key":"1397_CR25","unstructured":"Hribar M, Taylor VE, Boyce DE (1995) Choosing a shortest path algorithm. Technical report. EECS Department, Northwestern University"},{"key":"1397_CR26","doi-asserted-by":"crossref","unstructured":"Hsu WT, Wen YT, Wei LY, Peng WC (2014) Skyline travel routes: exploring skyline for trip planning. In: International conference on mobile data management","DOI":"10.1109\/MDM.2014.64"},{"key":"1397_CR27","doi-asserted-by":"crossref","unstructured":"Jang SM, Yoo JS (2008) Processing continuous skyline queries in road networks. In: The international symposium on computer science and its applications","DOI":"10.1109\/CSA.2008.30"},{"key":"1397_CR28","unstructured":"Johnson PE, Joy DS, Clarke D (1992) Highway3.01, an enhancement routing model: program, description, methodology and revised user\u2019s manual. Technical report, CSE-95-004"},{"key":"1397_CR29","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0377-2217(94)00099-X","volume":"86","author":"J Karkazis","year":"1995","unstructured":"Karkazis J, Boffey T (1995) Optimal location of routes for vehicles transporting hazardous materials. Eur J Oper Res 86:201\u2013215","journal-title":"Eur J Oper Res"},{"key":"1397_CR30","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s00158-004-0465-1","volume":"29","author":"I Kim","year":"2005","unstructured":"Kim I, de Weck O (2005) Adaptive weighted-sum method for bi-objective optimization: Pareto front generation. Struct Multidiscip Optim 29:149\u2013158","journal-title":"Struct Multidiscip Optim"},{"key":"1397_CR31","doi-asserted-by":"crossref","unstructured":"Kuang X, Zhao P, Sheng V, Wu J, Li Z, Liu G, Cui Z (2015) TK-SK: textual-restricted k spatial keyword query on road networks. In: Databases theory and applications. Springer","DOI":"10.1007\/978-3-319-19548-3_14"},{"key":"1397_CR32","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1111\/j.1538-4632.1997.tb00966.x","volume":"29","author":"M Kuby","year":"1997","unstructured":"Kuby M, Zhongyi X, Xiaodong X (1997) A minimax method for finding the k best differentiated paths. Geogr Anal 29:298\u2013313","journal-title":"Geogr Anal"},{"key":"1397_CR33","doi-asserted-by":"crossref","unstructured":"Li W, Guan J, Zhou S (2014) Efficiently evaluating range-constrained spatial keyword query on road networks. In: Database systems for advanced applications. Springer, Berlin","DOI":"10.1007\/978-3-662-43984-5_21"},{"key":"1397_CR34","doi-asserted-by":"publisher","first-page":"945","DOI":"10.1109\/TKDE.2012.33","volume":"25","author":"X Liu","year":"2013","unstructured":"Liu X, Yang D-N, Ye M, Lee W-C (2013) U-skyline: a new skyline query for uncertain databases. Trans Knowl Data Eng 25:945\u2013960","journal-title":"Trans Knowl Data Eng"},{"key":"1397_CR35","doi-asserted-by":"publisher","first-page":"853","DOI":"10.1007\/s00158-009-0460-7","volume":"41","author":"R Marler","year":"2010","unstructured":"Marler R, Arora J (2010) The weighted sum method for multi-objective optimization: new insights. Struct Multidiscip Optim 41:853\u2013862","journal-title":"Struct Multidiscip Optim"},{"key":"1397_CR36","doi-asserted-by":"publisher","first-page":"2905","DOI":"10.1016\/j.cor.2009.01.003","volume":"36","author":"R Mart\u00ed","year":"2009","unstructured":"Mart\u00ed R, Velarde JLG, Duarte A (2009) Heuristics for the bi-objective path dissimilarity problem. Comput Oper Res 36:2905\u20132912","journal-title":"Comput Oper Res"},{"key":"1397_CR37","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/0377-2217(84)90077-8","volume":"16","author":"EQV Martins","year":"1984","unstructured":"Martins EQV (1984) On a multicriteria shortest path problem. European J Oper Res 16:236\u2013245","journal-title":"European J Oper Res"},{"key":"1397_CR38","unstructured":"Miller L, Douglas K (2009) Collective thinking keeps us safe: lessons from hurricanes Katrina, Rita and Ike"},{"key":"1397_CR39","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1016\/S0377-2217(97)00376-7","volume":"111","author":"P Modesti","year":"1998","unstructured":"Modesti P, Sciomachen A (1998) A utility measure for finding multiobjective shortest paths in urban multimodal transportation networks. Eur J Oper Res 111:495\u2013508","journal-title":"Eur J Oper Res"},{"key":"1397_CR40","unstructured":"Pisinger D (1999) Exact solution of p-dispersion problems. Technical report. DIKU, University of Copenhagen, Denmark"},{"key":"1397_CR41","doi-asserted-by":"crossref","unstructured":"Tian Y, Lee K CK, Lee W-C (2009) Finding skyline paths in road networks. In: ACM SIGSPATIAL international conference on advances in geographic information systems","DOI":"10.1145\/1653771.1653840"},{"key":"1397_CR42","unstructured":"Tiwari JM (2014) Ant colony algorithm: its emergence and applications in soft computing. Discovery Publication"},{"issue":"10","key":"1397_CR43","doi-asserted-by":"publisher","first-page":"931","DOI":"10.1080\/00207729608929296","volume":"27","author":"T Yamada","year":"1996","unstructured":"Yamada T (1996) A network flow approach to a city emergency evacuation planning. Int J Syst Sci 27(10):931\u2013936. https:\/\/doi.org\/10.1080\/00207729608929296","journal-title":"Int J Syst Sci"},{"issue":"4","key":"1397_CR44","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1090\/qam\/253822","volume":"27","author":"JY Yen","year":"1970","unstructured":"Yen JY (1970) An algorithm for finding shortest routes from all source nodes to a given destination in general networks. Q Appl Math 27(4):526\u2013530","journal-title":"Q Appl Math"},{"key":"1397_CR45","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1287\/mnsc.17.11.712","volume":"17","author":"JY Yen","year":"1971","unstructured":"Yen JY (1971) Finding the k shortest loopless paths in a network. Manag Sci 17:712\u2013716","journal-title":"Manag Sci"},{"key":"1397_CR46","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1109\/TAC.1963.1105511","volume":"8","author":"L Zadeh","year":"1963","unstructured":"Zadeh L (1963) Optimality and non-scalar-valued performance criteria. IEEE Trans Autom Control 8:59\u201360","journal-title":"IEEE Trans Autom Control"},{"key":"1397_CR47","first-page":"38","volume":"5","author":"Y Zheng","year":"2014","unstructured":"Zheng Y, Capra L, Wolfson O, Yang H (2014) Urban computing: concepts, methodologies, and applications. ACM Trans Intell Syst Technol 5:38","journal-title":"ACM Trans Intell Syst Technol"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-019-01397-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-019-01397-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-019-01397-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,22]],"date-time":"2024-07-22T17:56:25Z","timestamp":1721670985000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-019-01397-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,28]]},"references-count":47,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2020,5]]}},"alternative-id":["1397"],"URL":"https:\/\/doi.org\/10.1007\/s10115-019-01397-4","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,8,28]]},"assertion":[{"value":"22 February 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 August 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 August 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 August 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}