How to find good night train connections

DOI10.1002/NET.20380MaRDI QIDQ3076014zbMATHOpenAlexDBLPWikidataFDO

Authors Thorsten Gunkel, Mathias Schnee, Matthias Müller-Hannemann

Publication date 17 February 2011

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.20380

zbMATH Keywords

multi-criteria optimizationcomputational studytimetable information systemnight trains

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Case-oriented studies in operations research (90B90) Traffic problems in operations research (90B20)

Recommendations

• Paying less for train connections with MOTIS
• Reliability and delay distributions of train connections
• Accelerating time-dependent multi-criteria timetable information is harder than expected
• Connection scan accelerated
• Near optimum paths in time-table graphs

Cites work

• scientific article; zbMATH DE number 1488066 (Why is no real title available?)
• Dijkstra's algorithm on-line
• Efficient models for timetable information in public transportation systems
• Minimum weight paths in time-dependent networks
• On the cardinality of the Pareto set in bicriteria shortest path problems
• Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
• The shortest route through a network with time-dependent internodal transit times
• Time dependency in multiple objective dynamic programming
• Time-dependent networks as models to achieve fast exact time-table queries
• Towards realistic modeling of time-table information through the time-dependent approach

Cited in

(3)

• Reliability and delay distributions of train connections
• Does direct connect benefit travellers?
• Paying less for train connections with MOTIS

This page was built for publication: How to find good night train connections

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