{"id":"https://openalex.org/W2290289666","doi":"https://doi.org/10.1145/2820783.2820830","title":"Personalized route planning in road networks","display_name":"Personalized route planning in road networks","publication_year":2015,"publication_date":"2015-11-03","ids":{"openalex":"https://openalex.org/W2290289666","doi":"https://doi.org/10.1145/2820783.2820830","mag":"2290289666"},"language":"en","primary_location":{"id":"doi:10.1145/2820783.2820830","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2820783.2820830","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5108747743","display_name":"Stefan Funke","orcid":null},"institutions":[{"id":"https://openalex.org/I100066346","display_name":"University of Stuttgart","ror":"https://ror.org/04vnq7t77","country_code":"DE","type":"education","lineage":["https://openalex.org/I100066346"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Stefan Funke","raw_affiliation_strings":["Universit\u00e4t Stuttgart, Stuttgart, Germany"],"affiliations":[{"raw_affiliation_string":"Universit\u00e4t Stuttgart, Stuttgart, Germany","institution_ids":["https://openalex.org/I100066346"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027517542","display_name":"Sabine Storandt","orcid":"https://orcid.org/0000-0001-5411-3834"},"institutions":[{"id":"https://openalex.org/I161046081","display_name":"University of Freiburg","ror":"https://ror.org/0245cg223","country_code":"DE","type":"education","lineage":["https://openalex.org/I161046081"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Sabine Storandt","raw_affiliation_strings":["University of Freiburg, Freiburg, Germany"],"affiliations":[{"raw_affiliation_string":"University of Freiburg, Freiburg, Germany","institution_ids":["https://openalex.org/I161046081"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5108747743"],"corresponding_institution_ids":["https://openalex.org/I100066346"],"apc_list":null,"apc_paid":null,"fwci":2.3285,"has_fulltext":false,"cited_by_count":36,"citation_normalized_percentile":{"value":0.89554458,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"10"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10757","display_name":"Geographic Information Systems Studies","score":0.9933000206947327,"subfield":{"id":"https://openalex.org/subfields/3305","display_name":"Geography, Planning and Development"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7955179214477539},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.7803276777267456},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.6959211826324463},{"id":"https://openalex.org/keywords/preprocessor","display_name":"Preprocessor","score":0.6420549154281616},{"id":"https://openalex.org/keywords/route-planning","display_name":"Route planning","score":0.6340411305427551},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5288418531417847},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.46795737743377686},{"id":"https://openalex.org/keywords/footprint","display_name":"Footprint","score":0.43150627613067627},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35015636682510376},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.3499882221221924},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.32684653997421265},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.21140792965888977},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1469809114933014},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.10687130689620972},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.10631456971168518}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7955179214477539},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.7803276777267456},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.6959211826324463},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.6420549154281616},{"id":"https://openalex.org/C2989549987","wikidata":"https://www.wikidata.org/wiki/Q350882","display_name":"Route planning","level":2,"score":0.6340411305427551},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5288418531417847},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.46795737743377686},{"id":"https://openalex.org/C132943942","wikidata":"https://www.wikidata.org/wiki/Q2562511","display_name":"Footprint","level":2,"score":0.43150627613067627},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35015636682510376},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.3499882221221924},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.32684653997421265},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.21140792965888977},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1469809114933014},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.10687130689620972},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.10631456971168518},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2820783.2820830","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2820783.2820830","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.8100000023841858,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W82786942","https://openalex.org/W113019534","https://openalex.org/W122384246","https://openalex.org/W166260623","https://openalex.org/W282961531","https://openalex.org/W1500655453","https://openalex.org/W1557047551","https://openalex.org/W1904636577","https://openalex.org/W1920501755","https://openalex.org/W1988872756","https://openalex.org/W2014889099","https://openalex.org/W2083019227","https://openalex.org/W2112513979","https://openalex.org/W2143083884","https://openalex.org/W2229053133","https://openalex.org/W2262197264","https://openalex.org/W2704588827","https://openalex.org/W6603397323","https://openalex.org/W6606681466"],"related_works":["https://openalex.org/W3209137076","https://openalex.org/W4223969905","https://openalex.org/W2374560440","https://openalex.org/W1490490684","https://openalex.org/W4221129498","https://openalex.org/W2887026015","https://openalex.org/W2361442013","https://openalex.org/W2373384475","https://openalex.org/W4310124294","https://openalex.org/W143403600"],"abstract_inverted_index":{"Computing":[0],"shortest":[1],"paths":[2],"in":[3,108],"road":[4,110],"networks":[5,111],"with":[6,79],"millions":[7],"of":[8,34,44,82,92,117],"nodes":[9],"and":[10,121],"edges":[11],"is":[12,57],"challenging":[13],"on":[14],"its":[15,83],"own.":[16],"In":[17,62],"the":[18,50,54,89,93,114,118],"last":[19],"few":[20],"years,":[21],"several":[22],"preprocessing-based":[23],"acceleration":[24],"techniques":[25,46],"have":[26],"been":[27],"developed":[28],"to":[29,64],"enable":[30],"query":[31,77],"answering":[32,69],"orders":[33],"magnitudes":[35],"faster":[36],"than":[37],"a":[38,80],"plain":[39],"Dijkstra":[40],"computation.":[41],"But":[42],"most":[43],"these":[45],"work":[47],"only":[48],"if":[49],"metric":[51],"which":[52],"determines":[53],"optimal":[55],"path":[56],"static":[58],"or":[59],"rarely":[60],"changes.":[61],"contrast":[63],"that,":[65],"we":[66],"aim":[67],"at":[68],"personalized":[70,105],"route":[71,106],"planning":[72,107],"queries.":[73],"Here,":[74],"every":[75],"single":[76],"comes":[78],"specification":[81],"very":[84],"own":[85],"metric.":[86],"This":[87],"increases":[88],"combinatorial":[90],"complexity":[91],"problem":[94],"significantly.":[95],"We":[96],"develop":[97],"new":[98],"preprocessing":[99],"schemes":[100],"that":[101],"allow":[102],"for":[103],"real-time":[104],"huge":[109],"while":[112],"keeping":[113],"memory":[115],"footprint":[116],"preprocessed":[119],"data":[120],"subsequent":[122],"queries":[123],"small.":[124]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}