{"id":"https://openalex.org/W585970348","doi":null,"title":"Efficient routing on multi-modal transportation networks","display_name":"Efficient routing on multi-modal transportation networks","publication_year":2013,"publication_date":"2013-10-03","ids":{"openalex":"https://openalex.org/W585970348","mag":"585970348"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.594.3393","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.594.3393","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://hal.inria.fr/docs/00/87/74/50/PDF/00a-tesi_main_to_print.pdf","raw_type":"text"},"volume":null,"type":"article","indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/10068/1018062","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5002138349","display_name":"Dominik Kirchler","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I4210139461","display_name":"Laboratoire d'Informatique de l'\u00c9cole Polytechnique","ror":"https://ror.org/04afed728","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I142476485","https://openalex.org/I4210139461","https://openalex.org/I4210145102","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Dominik Kirchler","raw_affiliation_strings":["Laboratoire d'informatique de l'\u00c9cole polytechnique [Palaiseau]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratoire d'informatique de l'\u00c9cole polytechnique [Palaiseau]","institution_ids":["https://openalex.org/I4210139461"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5002138349"],"corresponding_institution_ids":["https://openalex.org/I4210139461"],"apc_list":null,"apc_paid":null,"fwci":1.5791,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.87801758,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.88919997215271,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.88919997215271,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.0414000004529953,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T11942","display_name":"Transportation and Mobility Innovations","score":0.019899999722838402,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/multimodal-routing","display_name":"multimodal routing","score":0.8830000162124634},{"id":"https://openalex.org/keywords/dial-a-ride","display_name":"dial-a-ride","score":0.9169999957084656},{"id":"https://openalex.org/keywords/shortest-path-algorithms","display_name":"shortest path algorithms","score":0.8500000238418579},{"id":"https://openalex.org/keywords/dijkstra-s-algorithm","display_name":"Dijkstra's algorithm","score":0.6679999828338623},{"id":"https://openalex.org/keywords/vehicle-sharing","display_name":"vehicle sharing","score":0.31299999356269836},{"id":"https://openalex.org/keywords/public-transport","display_name":"public transport","score":0.3449999988079071},{"id":"https://openalex.org/keywords/walking","display_name":"walking","score":0.6460000276565552},{"id":"https://openalex.org/keywords/sustainable-transport","display_name":"sustainable transport","score":0.48100000619888306}],"concepts":[{"id":"https://openalex.org/C71139939","wikidata":"https://www.wikidata.org/wiki/Q910194","display_name":"Modal","level":2,"score":0.8042635917663574},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.723746120929718},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6346025466918945},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5331448912620544},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5036265254020691},{"id":"https://openalex.org/C22212356","wikidata":"https://www.wikidata.org/wiki/Q775325","display_name":"Transport engineering","level":1,"score":0.4893342852592468},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.4727264940738678},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4277116060256958},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41349542140960693},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.35920804738998413},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.3250378966331482},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3213653564453125},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.16975629329681396},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11521148681640625},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.08137744665145874},{"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/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.594.3393","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.594.3393","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://hal.inria.fr/docs/00/87/74/50/PDF/00a-tesi_main_to_print.pdf","raw_type":"text"},{"id":"pmh:hdl:10068/1018062","doi":null,"is_oa":true,"landing_page_url":"http://hdl.handle.net/10068/1018062","pdf_url":null,"source":{"id":"https://openalex.org/S4377196900","display_name":"OpenGrey (Institut de l'Information Scientifique et Technique)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I1295345811","host_organization_name":"Institut de l'Information Scientifique et Technique","host_organization_lineage":["https://openalex.org/I1295345811"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"U - Thesis"},{"id":"mag:585970348","doi":null,"is_oa":false,"landing_page_url":"https://pastel.archives-ouvertes.fr/pastel-00877450","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"pmh:hdl:10068/1018062","doi":null,"is_oa":true,"landing_page_url":"http://hdl.handle.net/10068/1018062","pdf_url":null,"source":{"id":"https://openalex.org/S4377196900","display_name":"OpenGrey (Institut de l'Information Scientifique et Technique)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I1295345811","host_organization_name":"Institut de l'Information Scientifique et Technique","host_organization_lineage":["https://openalex.org/I1295345811"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"U - Thesis"},"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","score":0.5378999710083008,"id":"https://metadata.un.org/sdg/9"},{"display_name":"Sustainable cities and communities","score":0.5142999887466431,"id":"https://metadata.un.org/sdg/11"}],"sustainable_development_goals_aurora":[{"display_name":"Industry, innovation and infrastructure","score":0.6899999976158142,"id":"https://metadata.un.org/sdg/9"}],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1986797609","https://openalex.org/W1987132101","https://openalex.org/W2040481750","https://openalex.org/W2052614107","https://openalex.org/W2056638946"],"related_works":["https://openalex.org/W7143303879","https://openalex.org/W7214253406","https://openalex.org/W7151263494","https://openalex.org/W7148630211","https://openalex.org/W4206844617","https://openalex.org/W7024630619","https://openalex.org/W7147616391","https://openalex.org/W4392530148","https://openalex.org/W4392341368","https://openalex.org/W399524301"],"abstract_inverted_index":{"La":[0,56],"mobilit\u00e9":[1],"est":[2,60,295],"un":[3,91,110,130,188,207,226,232,237,325,353],"aspect":[4],"important":[5],"des":[6,18,65,166,318,322,386,409,422],"soci\u00e9t\u00e9s":[7],"modernes.":[8],"Par":[9],"cons\u00e9quent,":[10],"il":[11,333],"y":[12],"a":[13,132],"une":[14,39,248,391],"demande":[15],"croissante":[16],"pour":[17,83,100,247,262],"solutions":[19,407],"informatiques":[20],"de":[21,43,45,68,76,78,119,128,145,147,176,180,190,204,213,224,234,267,277,283,337,342,359,363,367,375,397,403,405,424,426,432],"calcul":[22,191],"d'itin\u00e9raire.":[23],"Dans":[24,206],"cette":[25,107,270],"th\u00e8se,":[26],"le":[27,31,218,272,313,349,365],"routage":[28],"multimodal":[29,139,209,229],"et":[30,173,198,236,288,315,321,328,369,383,395,419],"syst\u00e8me":[32,308],"Dial-a-Ride":[33,309],"sont":[34],"\u00e9tudi\u00e9s.":[35],"Ils":[36,355],"contribuent":[37],"\u00e0":[38,135,202,279,324],"utilisation":[40],"plus":[41,88,219,301,330],"efficace":[42,394],"l'infrastructure":[44],"transport":[46,69,146,338],"disponible,":[47],"\u00e9l\u00e9ment":[48],"d\u00e9terminant":[49],"dans":[50,408],"la":[51,120,126,148,154,160,162,211,214,316,343,427],"perspective":[52],"d'un":[53,137,193],"d\u00e9veloppement":[54],"durable.":[55],"planification":[57],"d'itin\u00e9raires":[58],"multimodaux":[59],"rendus":[61],"complexe":[62],"en":[63,158,351],"raison":[64],"diff\u00e9rents":[66],"modes":[67],"qui":[70,294],"doivent":[71],"\u00eatre":[72,81,255,263,275],"combin\u00e9s.":[73,292],"Une":[74],"g\u00e9n\u00e9ralisation":[75],"l'algorithme":[77,203],"Dijkstra":[79],"peut":[80],"utilis\u00e9e":[82],"trouver":[84,225],"les":[85,87,101,143,156,171,174,281,304,335,346,373,381,384],"chemins":[86],"courts":[89,411],"sur":[90,142,372],"r\u00e9seau":[92,138],"multimodal.":[93],"Cependant,":[94],"sa":[95],"performance":[96,127,181],"n'est":[97],"pas":[98],"suffisante":[99],"applications":[102],"industrielles.":[103],"De":[104],"ce":[105,299],"fait,":[106],"th\u00e8se":[108,389],"introduit":[109],"nouvel":[111],"algorithme":[112,378,430],"appel\u00e9":[113],"SDALT.":[114],"Il":[115,152,340],"s'agit":[116],"d'une":[117],"adaptation":[118],"technique":[121],"d'acc\u00e9l\u00e9ration":[122],"ALT.":[123],"Pour":[124,269],"\u00e9valuer":[125],"SDALT,":[129],"graphe":[131],"\u00e9t\u00e9":[133],"construit":[134],"partir":[136],"r\u00e9el":[140],"bas\u00e9":[141],"donn\u00e9es":[144],"r\u00e9gion":[149],"fran\u00e7aise":[150],"Ile-de-France.":[151],"inclut":[153],"marche,":[155],"transports":[157],"commun,":[159],"voiture,":[161],"bicyclette":[163],"ainsi":[164],"que":[165,183,303],"informations":[167],"relative":[168],"aux":[169,311,416],"horaires":[170,172,374,385],"conditions":[175],"circulation.":[177],"Les":[178],"tests":[179],"montrent":[182],"SDALT":[184],"fonctionne":[185,341],"bien,":[186],"avec":[187,329],"temps":[189,282],"r\u00e9duit":[192],"facteur":[194],"compris":[195],"entre":[196,231],"1,5":[197],"60":[199],"par":[200],"rapport":[201],"base.":[205],"contexte":[208],"autre":[210],"question":[212],"d\u00e9termination":[215],"du":[216,251,259,285,289],"chemin":[217,227],"court,":[220],"se":[221],"pose":[222],"celle":[223],"aller-retour":[228],"optimal":[230],"point":[233,238,266,358,362],"d\u00e9part":[235],"d'arriv\u00e9e.":[239],"Un":[240,377],"v\u00e9hicule":[241],"priv\u00e9":[242],"(voiture":[243],"ou":[244],"bicyclette)":[245],"utilis\u00e9":[246],"premi\u00e8re":[249],"partie":[250],"trajet":[252,260,286,290],"aller":[253,287],"doit":[254,274],"r\u00e9cup\u00e9r\u00e9":[256],"au":[257,265,420],"cours":[258],"retour":[261,291],"ramen\u00e9":[264],"d\u00e9part.":[268],"raison,":[271],"parking":[273],"choisi":[276],"mani\u00e8re":[278,344],"optimiser":[280],"d\u00e9placement":[284],"L'algorithme":[293],"propos\u00e9":[296],"ici":[297],"r\u00e9sout":[298],"probl\u00e8me":[300],"rapidement":[302],"techniques":[305],"actuelles.":[306],"Le":[307],"offre":[310],"passagers":[312,347],"confort":[314],"flexibilit\u00e9":[317],"voitures":[319],"priv\u00e9es":[320],"taxis":[323],"moindre":[326],"co\u00fbt":[327],"d'\u00e9co-efficacit\u00e9":[331],"car":[332],"regroupe":[334],"demandes":[336],"similaires.":[339],"suivante:":[345],"demandent":[348],"service":[350],"appelant":[352],"op\u00e9rateur.":[354],"communiquent":[356],"leur":[357,361],"d\u00e9part,":[360],"destination,":[364],"nombre":[366],"passagers,":[368],"quelques":[370],"pr\u00e9cisions":[371],"service.":[376],"calcule":[379],"ensuite":[380],"itin\u00e9raires":[382],"v\u00e9hicules.":[387],"Cette":[388],"propose":[390],"nouvelle":[392],"heuristique":[393],"rapide":[396],"type":[398],"Granular":[399],"Tabu":[400],"Search,":[401],"capable":[402],"produire":[404],"bonnes":[406],"d\u00e9lais":[410],"(jusqu'\u00e0":[412],"3":[413],"minutes).":[414],"Comparativement":[415],"autres":[417],"m\u00e9thodes,":[418],"regard":[421],"instances":[423],"test":[425],"litt\u00e9rature,":[428],"cet":[429],"donne":[431],"bons":[433],"r\u00e9sultats.":[434]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2}],"updated_date":"2026-09-21T07:43:02.447757","created_date":"2016-06-24T00:00:00"}