| Document Date: 2011-09-19 09:22:17
Open Document File Size: 669,68 KBShare Result on Facebook
City Paris / / Company Creative Commons / Dagstuhl Publishing / Intel / / Country France / / / Facility France Karlsruhe Institute / / IndustryTerm continental sized road networks / car layer / multi-modal transportation networks / transportation mode / transportation / constrained shortest path search / public transportation vehicle / search technique / road networks / bidirectional search / uniALT algorithm / continental size road networks / case travel time / travel time / travel times / multi-modal transportation network / public transportation / transportation modes / public transportation layer / realistic multi-modal public transportation network / bi-directional search / public transportation network / model public transportation stations / pre-processing phase / multi-modal network / / OperatingSystem L3 / / Organization Ecole Polytechnique / Institute of Technology / / Person Thomas Pajor / Alberto Caprara / Leo Liberti / Roberto Wolfler Calvo / Dominik Kirchler / Roberto Wolfler / / Position model public transportation stations / / ProgrammingLanguage C++ / / Technology RAM / Av / resulting algorithm / uniALT algorithm The A∗ algorithm / A∗ algorithm / DRegLC algorithm / Digital Object Identifier / / URL www.v-trafic.fr / www.velib.paris.fr / www.stif.info / www.mediamobile.fr / www.openstreetmap.org / /
SocialTag |
UniALT for Regular Language Constrained Shortest Paths on a Multi-Modal Transportation Network Dominik Kirchler1,2,3 , Leo Liberti1 , Thomas Pajor4 , and Roberto Wolfler Calvo2 1