A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit <a rel="external noopener" href="http://gisserv.apichon.com:80/AT76.9035/papers/18.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
Frequency-based search for public transit
<span title="">2014</span>
<i title="ACM Press">
<a target="_blank" rel="noopener" href="https://fatcat.wiki/container/q6tw7qmnszfgbikw4mpyjrokkm" style="color: black;">Proceedings of the 22nd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems - SIGSPATIAL '14</a>
</i>
Preserved Fulltext
We consider the application of route planning in large publictransportation networks (buses, trains, subways, etc). Many connections in such networks are operated at periodic time intervals. When a set of connections has sufficient periodicity, it becomes more efficient to store the time range and frequency (e.g., every 15 minutes from 8:00am -6:00pm) instead of storing each of the time events separately. Identifying an optimal frequency-compression is NP-hard, so we present a time-and
<span class="external-identifiers">
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2666310.2666405">doi:10.1145/2666310.2666405</a>
<a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/gis/BastS14.html">dblp:conf/gis/BastS14</a>
<a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/qtiohor725f5rcyjrys2dfyi3a">fatcat:qtiohor725f5rcyjrys2dfyi3a</a>
</span>
more »
... icient heuristic. We show how we can use this compression to not only save space but also query time. We particularly consider profile queries, which ask for all optimal routes with departure times in a given interval (e.g., a whole day). In particular, we design a new version of Dijkstra's algorithm that works with frequency-based labels and is suitable for profile queries. We evaluate the savings of our approach on two metropolitan and three country-wide public-transportation networks. On our largest network, we simultaneously achieve a better space consumption than all previous methods as well as profile query times that are about 5 times faster than the best previous method. We also improve Transfer Patterns, a state-of-the-art technique for fully realistic route planning in large public-transportation networks. In particular, we accelerate the expensive preprocessing by a factor of 60 compared to the original publication.
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20160716234704/http://gisserv.apichon.com:80/AT76.9035/papers/18.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext">
<button class="ui simple right pointing dropdown compact black labeled icon button serp-button">
<i class="icon ia-icon"></i>
Web Archive
[PDF]
<div class="menu fulltext-thumbnail">
<img src="https://blobs.fatcat.wiki/thumbnail/pdf/6a/eb/6aebc4c60659b5fa8dad772909381c1bfe98bc8c.180px.jpg" alt="fulltext thumbnail" loading="lazy">
</div>
</button>
</a>
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2666310.2666405">
<button class="ui left aligned compact blue labeled icon button serp-button">
<i class="external alternate icon"></i>
acm.org
</button>
</a>