{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:28:11Z","timestamp":1750307291055,"version":"3.41.0"},"reference-count":12,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2010,11,1]],"date-time":"2010-11-01T00:00:00Z","timestamp":1288569600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGSPATIAL Special"],"published-print":{"date-parts":[[2010,11]]},"abstract":"<jats:p>This paper describes ongoing PhD research on applications of graph algorithms in Geographical Information Systems. Many GIS problems can be translated into a graph problem, especially in the domain of routing in road networks. Our research aims to evaluate and develop efficient methods for different variants of the routing problem.<\/jats:p>\n          <jats:p>Standard existing shortest path algorithms are not always suited for use in road networks, e.g. in a realistic situation forbidden turns and turn penalties need to be taken into account. An experimental evaluation of different methods for this purpose is presented.<\/jats:p>\n          <jats:p>\n            Another interesting problem is the generation of alternative routes. This can be modelled as a\n            <jats:italic>k<\/jats:italic>\n            shortest paths problem, where a ranking of\n            <jats:italic>k<\/jats:italic>\n            paths is desired rather than only the shortest path itself. A new heuristic approach for generating alternative routes is presented and evaluated.\n          <\/jats:p>","DOI":"10.1145\/1953102.1953108","type":"journal-article","created":{"date-parts":[[2011,3,8]],"date-time":"2011-03-08T14:52:22Z","timestamp":1299595942000},"page":"31-36","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Applications of graph algorithms in GIS"],"prefix":"10.1145","volume":"2","author":[{"given":"St\u00e9phanie","family":"Vanhove","sequence":"first","affiliation":[{"name":"Ghent University, Ghent, Belgium"}]},{"given":"Veerle","family":"Fack","sequence":"additional","affiliation":[{"name":"Ghent University, Ghent, Belgium"}]}],"member":"320","published-online":{"date-parts":[[2010,11]]},"reference":[{"key":"e_1_2_1_1_1","first-page":"785","volume-title":"Proceedings of the 13th Mini-EURO Conference on Handling Uncertainty in the Analysis of Traffic and Transportation Systems.","author":"Dell'Olmo P.","year":"2002","unstructured":"P. Dell'Olmo , M. Gentili , and A. Scozzari . Finding dissimilar routes for the transportation of hazardous materials . In Proceedings of the 13th Mini-EURO Conference on Handling Uncertainty in the Analysis of Traffic and Transportation Systems. , pages 785 -- 788 , 2002 . P. Dell'Olmo, M. Gentili, and A. Scozzari. Finding dissimilar routes for the transportation of hazardous materials. In Proceedings of the 13th Mini-EURO Conference on Handling Uncertainty in the Analysis of Traffic and Transportation Systems., pages 785--788, 2002."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"volume-title":"9th dimacs implementation challenge on shortest paths","author":"DIMACS.","key":"e_1_2_1_3_1","unstructured":"DIMACS. 9th dimacs implementation challenge on shortest paths . http:\/\/www.dis.uniroma1.it\/~challenge9\/, 2005. DIMACS. 9th dimacs implementation challenge on shortest paths. http:\/\/www.dis.uniroma1.it\/~challenge9\/, 2005."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2008.12.015"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-007-0198-9"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1290672.1290682"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0041-1647(69)80022-5"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1080\/13658810600607766"},{"key":"e_1_2_1_9_1","unstructured":"NAVTEQ. Navteq network for developers. http:\/\/www.nn4d.com\/ 2007.  NAVTEQ. Navteq network for developers. http:\/\/www.nn4d.com\/ 2007."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/956676.956692"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1020853410145"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.17.11.712"}],"container-title":["SIGSPATIAL Special"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1953102.1953108","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1953102.1953108","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:59:41Z","timestamp":1750244381000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1953102.1953108"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,11]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,11]]}},"alternative-id":["10.1145\/1953102.1953108"],"URL":"https:\/\/doi.org\/10.1145\/1953102.1953108","relation":{},"ISSN":["1946-7729"],"issn-type":[{"type":"electronic","value":"1946-7729"}],"subject":[],"published":{"date-parts":[[2010,11]]},"assertion":[{"value":"2010-11-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}