Engineering time-expanded graphs for faster timetable information

DOI10.4230/OASICS.ATMOS.2008.1582MaRDI QIDQ2917364zbMATH OpenOpenAlexFDO

Authors Daniel Delling, Thomas Pajor, Dorothea Wagner

Publication date 28 September 2012

Full work available at URL https://dblp.uni-trier.de/db/conf/atmos/atmos2008.html#DellingPW08

zbMATH Keywords

modelingshortest pathtimetable information

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Transportation, logistics and supply chain management (90B06)

Recommendations

• Engineering Time-Expanded Graphs for Faster Timetable Information
• Efficient models for timetable information in public transportation systems
• Engineering graph-based models for dynamic timetable information systems
• Accelerating time-dependent multi-criteria timetable information is harder than expected
• Time-dependent networks as models to achieve fast exact time-table queries

Cited in

(9)

• Efficient models for timetable information in public transportation systems
• Dynamic graph generation for the shortest path problem in time expanded networks
• Time-dependent networks as models to achieve fast exact time-table queries
• Towards realistic modeling of time-table information through the time-dependent approach
• Near optimum paths in time-table graphs
• Engineering graph-based models for dynamic timetable information systems
• Engineering Time-Expanded Graphs for Faster Timetable Information
• scientific article; zbMATH DE number 1926659 (Why is no real title available?)
• scientific article; zbMATH DE number 2080092 (Why is no real title available?)

This page was built for publication: Engineering time-expanded graphs for faster timetable information

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2917364)