https://www.scipedia.com/wd/index.php?action=history&feed=atom&title=Bohmova_et_al_2013aBohmova et al 2013a - Revision history2026-05-26T14:42:09ZRevision history for this page on the wikiMediaWiki 1.27.0-wmf.10https://www.scipedia.com/wd/index.php?title=Bohmova_et_al_2013a&diff=194477&oldid=prevScipediacontent: Scipediacontent moved page Draft Content 450757118 to Bohmova et al 2013a2021-01-28T21:03:55Z<p>Scipediacontent moved page <a href="/public/Draft_Content_450757118" class="mw-redirect" title="Draft Content 450757118">Draft Content 450757118</a> to <a href="/public/Bohmova_et_al_2013a" title="Bohmova et al 2013a">Bohmova et al 2013a</a></p>
<table class="diff diff-contentalign-left" data-mw="interface">
<tr style='vertical-align: top;' lang='en'>
<td colspan='1' style="background-color: white; color:black; text-align: center;">← Older revision</td>
<td colspan='1' style="background-color: white; color:black; text-align: center;">Revision as of 21:03, 28 January 2021</td>
</tr><tr><td colspan='2' style='text-align: center;' lang='en'><div class="mw-diff-empty">(No difference)</div>
</td></tr></table>Scipediacontenthttps://www.scipedia.com/wd/index.php?title=Bohmova_et_al_2013a&diff=194476&oldid=prevScipediacontent: Created page with " == Abstract == International audience; We study the problem of robust routing in urban public transportation networks. In order to propose solutions that are robust for typi..."2021-01-28T21:03:50Z<p>Created page with " == Abstract == International audience; We study the problem of robust routing in urban public transportation networks. In order to propose solutions that are robust for typi..."</p>
<p><b>New page</b></p><div><br />
== Abstract ==<br />
<br />
International audience; We study the problem of robust routing in urban public transportation networks. In order to propose solutions that are robust for typical delays, we assume that we have past observations of real traffic situations available. In particular, we assume that we have "daily records" containing the observed travel times in the whole network for a few past days. We introduce a new concept to express a solution that is feasible in any record of a given public transportation network. We adapt the method of Buhmann et al. [Buhmann et al., ITCS 2013] for optimization under uncertainty, and develop algorithms that allow its application for finding a robust journey from a given source to a given destination. The performance of the algorithms and the quality of the predicted journey are evaluated in a preliminary experimental study. We furthermore introduce a measure of reliability of a given journey, and develop algorithms for its computation. The robust routing concepts presented in this work are suited specially for public transportation networks of large cities that lack clear hierarchical structure and contain services that run with high frequencies.<br />
<br />
<br />
== Original document ==<br />
<br />
The different versions of the original document can be found in:<br />
<br />
* [http://dx.doi.org/10.4230/oasics.atmos.2013.27 http://dx.doi.org/10.4230/oasics.atmos.2013.27]<br />
<br />
* [https://cris.maastrichtuniversity.nl/en/publications/b8d9bd56-4ebb-4d41-8366-d758106fa4d0 https://cris.maastrichtuniversity.nl/en/publications/b8d9bd56-4ebb-4d41-8366-d758106fa4d0]<br />
<br />
* [https://hal.inria.fr/hal-00871734 https://hal.inria.fr/hal-00871734],<br />
: [https://hal.inria.fr/hal-00871734/document https://hal.inria.fr/hal-00871734/document],<br />
: [https://hal.inria.fr/hal-00871734/file/4.pdf https://hal.inria.fr/hal-00871734/file/4.pdf]</div>Scipediacontent