{"id":"https://openalex.org/W2065426758","doi":"https://doi.org/10.1145/2699886","title":"User-Constrained Multimodal Route Planning","display_name":"User-Constrained Multimodal Route Planning","publication_year":2015,"publication_date":"2015-02-03","ids":{"openalex":"https://openalex.org/W2065426758","doi":"https://doi.org/10.1145/2699886","mag":"2065426758"},"language":"en","primary_location":{"id":"doi:10.1145/2699886","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2699886","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","raw_type":"journal-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/A5028639690","display_name":"Julian Dibbelt","orcid":null},"institutions":[{"id":"https://openalex.org/I102335020","display_name":"Karlsruhe Institute of Technology","ror":"https://ror.org/04t3en479","country_code":"DE","type":"education","lineage":["https://openalex.org/I102335020","https://openalex.org/I1305996414"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Julian Dibbelt","raw_affiliation_strings":["Karlsruhe Institute of Technology, Karlsruhe, Germany","Karlsruhe Institute of Technology, Karlsruhe,#N#Germany"],"affiliations":[{"raw_affiliation_string":"Karlsruhe Institute of Technology, Karlsruhe, Germany","institution_ids":["https://openalex.org/I102335020"]},{"raw_affiliation_string":"Karlsruhe Institute of Technology, Karlsruhe,#N#Germany","institution_ids":["https://openalex.org/I102335020"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5007683400","display_name":"Thomas Pajor","orcid":null},"institutions":[{"id":"https://openalex.org/I102335020","display_name":"Karlsruhe Institute of Technology","ror":"https://ror.org/04t3en479","country_code":"DE","type":"education","lineage":["https://openalex.org/I102335020","https://openalex.org/I1305996414"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Thomas Pajor","raw_affiliation_strings":["Karlsruhe Institute of Technology, Karlsruhe, Germany","Karlsruhe Institute of Technology, Karlsruhe,#N#Germany"],"affiliations":[{"raw_affiliation_string":"Karlsruhe Institute of Technology, Karlsruhe, Germany","institution_ids":["https://openalex.org/I102335020"]},{"raw_affiliation_string":"Karlsruhe Institute of Technology, Karlsruhe,#N#Germany","institution_ids":["https://openalex.org/I102335020"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045460793","display_name":"Dorothea Wagner","orcid":"https://orcid.org/0000-0002-9141-7076"},"institutions":[{"id":"https://openalex.org/I102335020","display_name":"Karlsruhe Institute of Technology","ror":"https://ror.org/04t3en479","country_code":"DE","type":"education","lineage":["https://openalex.org/I102335020","https://openalex.org/I1305996414"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Dorothea Wagner","raw_affiliation_strings":["Karlsruhe Institute of Technology, Karlsruhe, Germany","Karlsruhe Institute of Technology, Karlsruhe,#N#Germany"],"affiliations":[{"raw_affiliation_string":"Karlsruhe Institute of Technology, Karlsruhe, Germany","institution_ids":["https://openalex.org/I102335020"]},{"raw_affiliation_string":"Karlsruhe Institute of Technology, Karlsruhe,#N#Germany","institution_ids":["https://openalex.org/I102335020"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5028639690"],"corresponding_institution_ids":["https://openalex.org/I102335020"],"apc_list":null,"apc_paid":null,"fwci":4.0529,"has_fulltext":false,"cited_by_count":52,"citation_normalized_percentile":{"value":0.94557354,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"19","issue":null,"first_page":"1","last_page":"19"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998999834060669,"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":0.9998999834060669,"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/T10757","display_name":"Geographic Information Systems Studies","score":0.9890999794006348,"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"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9776999950408936,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8072031736373901},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.5756415724754333},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5079300999641418},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.4927106201648712},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.48110002279281616},{"id":"https://openalex.org/keywords/ask-price","display_name":"Ask price","score":0.4587888717651367},{"id":"https://openalex.org/keywords/public-transport","display_name":"Public transport","score":0.4449034333229065},{"id":"https://openalex.org/keywords/modal","display_name":"Modal","score":0.43261295557022095},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.41910433769226074},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.4187948703765869},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3475862145423889},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33693480491638184},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2438201606273651},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.22163978219032288},{"id":"https://openalex.org/keywords/transport-engineering","display_name":"Transport engineering","score":0.11918187141418457}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8072031736373901},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.5756415724754333},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5079300999641418},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.4927106201648712},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.48110002279281616},{"id":"https://openalex.org/C90329073","wikidata":"https://www.wikidata.org/wiki/Q914232","display_name":"Ask price","level":2,"score":0.4587888717651367},{"id":"https://openalex.org/C539828613","wikidata":"https://www.wikidata.org/wiki/Q178512","display_name":"Public transport","level":2,"score":0.4449034333229065},{"id":"https://openalex.org/C71139939","wikidata":"https://www.wikidata.org/wiki/Q910194","display_name":"Modal","level":2,"score":0.43261295557022095},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.41910433769226074},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.4187948703765869},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3475862145423889},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33693480491638184},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2438201606273651},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.22163978219032288},{"id":"https://openalex.org/C22212356","wikidata":"https://www.wikidata.org/wiki/Q775325","display_name":"Transport engineering","level":1,"score":0.11918187141418457},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C136264566","wikidata":"https://www.wikidata.org/wiki/Q159810","display_name":"Economy","level":1,"score":0.0},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"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/C188027245","wikidata":"https://www.wikidata.org/wiki/Q750446","display_name":"Polymer chemistry","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2699886","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2699886","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.228.8446","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.228.8446","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://i11www.ira.uka.de/extra/publications/dpw-ucmmr-12.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.398.77","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.398.77","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://siam.omnibooksonline.com/2012ALENEX/data/papers/023.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.6499999761581421,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W30435042","https://openalex.org/W113019534","https://openalex.org/W1483530364","https://openalex.org/W1489358540","https://openalex.org/W1491427870","https://openalex.org/W1493214567","https://openalex.org/W1508854722","https://openalex.org/W1510939284","https://openalex.org/W1528485123","https://openalex.org/W1533159348","https://openalex.org/W1575936991","https://openalex.org/W1595694344","https://openalex.org/W1908662580","https://openalex.org/W1920501755","https://openalex.org/W1964915778","https://openalex.org/W1969483458","https://openalex.org/W1993643838","https://openalex.org/W1996936086","https://openalex.org/W2011824721","https://openalex.org/W2014889099","https://openalex.org/W2021134775","https://openalex.org/W2041172083","https://openalex.org/W2095677000","https://openalex.org/W2101923813","https://openalex.org/W2112513979","https://openalex.org/W2113276858","https://openalex.org/W2135282325","https://openalex.org/W2147095480","https://openalex.org/W2148831787","https://openalex.org/W2149964853","https://openalex.org/W2150418461","https://openalex.org/W2168148394","https://openalex.org/W2269184848","https://openalex.org/W2399690039","https://openalex.org/W2574671299","https://openalex.org/W2995414748","https://openalex.org/W3022772499"],"related_works":["https://openalex.org/W2058965144","https://openalex.org/W2164382479","https://openalex.org/W98480971","https://openalex.org/W2150291671","https://openalex.org/W2027972911","https://openalex.org/W2146343568","https://openalex.org/W2013643406","https://openalex.org/W2810603179","https://openalex.org/W2571454161","https://openalex.org/W2107524205"],"abstract_inverted_index":{"In":[0,49,80],"the":[1,45,127,132],"multimodal":[2,54,88],"route":[3],"planning":[4],"problem,":[5],"we":[6,83,155,181],"are":[7,156],"given":[8],"multiple":[9],"transportation":[10],"networks":[11,40],"(e.g.,":[12],"pedestrian,":[13],"road,":[14],"public":[15,116],"transit)":[16],"and":[17,170,186],"ask":[18],"for":[19],"a":[20,32,57,104,122,145,163],"best":[21],"integrated":[22],"journey":[23,35],"between":[24,39],"two":[25],"points.":[26],"The":[27],"main":[28],"challenge":[29],"is":[30,78],"that":[31,41,90],"seemingly":[33],"optimal":[34],"may":[36],"have":[37],"changes":[38],"do":[42],"not":[43],"reflect":[44],"user\u2019s":[46],"modal":[47,73,97],"preferences.":[48],"fact,":[50],"quickly":[51],"computing":[52,86],"reasonable":[53],"routes":[55],"remains":[56],"challenging":[58],"problem:":[59],"previous":[60],"approaches":[61],"either":[62],"suffer":[63],"from":[64],"poor":[65],"query":[66,76,100],"performance":[67],"or":[68,110,124,129,134],"their":[69],"available":[70],"choices":[71],"of":[72,131,167,174],"preferences":[74],"during":[75],"time":[77],"limited.":[79],"this":[81],"work,":[82],"focus":[84],"on":[85,152,162],"exact":[87],"journeys":[89],"can":[91,106],"be":[92],"restricted":[93],"by":[94],"specifying":[95],"arbitrary":[96],"sequences":[98],"at":[99,126,138],"time.":[101],"For":[102],"example,":[103],"user":[105],"say":[107],"whether":[108],"he":[109],"she":[111],"wants":[112],"to":[113,119,148,158],"only":[114],"use":[115,121],"transit,":[117],"prefers":[118],"also":[120],"taxi":[123],"walking":[125],"beginning":[128],"end":[130],"journey,":[133],"has":[135],"no":[136],"restrictions":[137],"all.":[139],"By":[140],"carefully":[141],"adapting":[142],"node":[143],"contraction,":[144],"common":[146],"ingredient":[147],"many":[149],"speedup":[150],"techniques":[151],"road":[153],"networks,":[154],"able":[157],"compute":[159],"point-to-point":[160],"queries":[161],"continental":[164],"network":[165],"combined":[166],"cars,":[168],"railroads,":[169],"flights":[171],"several":[172],"orders":[173],"magnitude":[175],"faster":[176],"than":[177],"Dijkstra\u2019s":[178],"algorithm.":[179],"Thereby,":[180],"require":[182],"little":[183],"space":[184],"overhead":[185],"obtain":[187],"fast":[188],"preprocessing":[189],"times.":[190]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":12},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}