About: Generalised Time-Dependent Graphs for Fully Multimodal Journey Planning

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Generalised Time-Dependent Graphs for Fully Multimodal Journey Planning Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
rdfs:seeAlso	http://agents.fel.cvut.cz/~hrncir/publications/hrncir2013_ITSC.pdf
Description	We solve the fully multimodal journey planning problem, in which journey plans can employ any combination of scheduled public transport (e.g., bus, tram and underground), individual (e.g., walk, bike, shared bike and car), and on-demand (e.g., taxi) transport modes. Our solution is based on a generalised time-dependent graph that allows representing the fully multimodal earliest arrival problem as a standard graph search problem and consequently using general shortest path algorithms to solve it. In addition, to allow users to express their journey planning preferences and to speed up the search process, flexible journey plan templates can be used in our approach to restrict the transport modes and mode combinations permitted in generated journey plans. We have evaluated our solution on a real-world transport network of the city of Helsinki and achieved practically usable search runtimes in the range of hundreds of milliseconds. We solve the fully multimodal journey planning problem, in which journey plans can employ any combination of scheduled public transport (e.g., bus, tram and underground), individual (e.g., walk, bike, shared bike and car), and on-demand (e.g., taxi) transport modes. Our solution is based on a generalised time-dependent graph that allows representing the fully multimodal earliest arrival problem as a standard graph search problem and consequently using general shortest path algorithms to solve it. In addition, to allow users to express their journey planning preferences and to speed up the search process, flexible journey plan templates can be used in our approach to restrict the transport modes and mode combinations permitted in generated journey plans. We have evaluated our solution on a real-world transport network of the city of Helsinki and achieved practically usable search runtimes in the range of hundreds of milliseconds. (en)
Title	Generalised Time-Dependent Graphs for Fully Multimodal Journey Planning Generalised Time-Dependent Graphs for Fully Multimodal Journey Planning (en)
skos:prefLabel	Generalised Time-Dependent Graphs for Fully Multimodal Journey Planning Generalised Time-Dependent Graphs for Fully Multimodal Journey Planning (en)
skos:notation	RIV/68407700:21230/13:00209841!RIV15-MSM-21230___
http://linked.open...avai/riv/aktivita	P S
http://linked.open...avai/riv/aktivity	P(7E12065), P(LD12044), S
http://linked.open...vai/riv/dodaniDat	2015
http://linked.open...aciTvurceVysledku	Jakob, Michal Hrnčíř, Jan
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	České vysoké učení technické v Praze / Fakulta elektrotechnická
http://linked.open...dnocenehoVysledku	76298
http://linked.open...ai/riv/idVysledku	RIV/68407700:21230/13:00209841
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	Multi-modal ITS; Personalized Public Transit (en)
http://linked.open.../riv/klicoveSlovo	Multi-modal ITS Personalized Public Transit
http://linked.open...ontrolniKodProRIV	[05308B82AF08]
http://linked.open...v/mistoKonaniAkce	Haag
http://linked.open...i/riv/mistoVydani	Red Hook, NY
http://linked.open...i/riv/nazevZdroje	Proceedings of 16th International IEEE Conference on Intelligent Transportation Systems
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	2 (xsd:int)
http://linked.open...cetTvurcuVysledku	2 (xsd:int)
http://linked.open...vavai/riv/projekt	SUstainable and PERsuasive Human Users moBility in future cities Agent-based Computing for Autonomic Road Transport Support Systems
http://linked.open...UplatneniVysledku	2013
http://linked.open...iv/tvurceVysledku	Jakob, Michal Hrnčíř, Jan
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open...ain/vavai/riv/wos	000346481000343
http://linked.open.../riv/zahajeniAkce	2013-10-06 (xsd:date)
issn	2153-0009
number of pages	8 (xsd:int)
http://bibframe.org/vocab/doi	10.1109/ITSC.2013.6728545
http://purl.org/ne...btex#hasPublisher	Curran Associates
https://schema.org/isbn	978-1-4799-2914-6
http://localhost/t...ganizacniJednotka	21230

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software