Least expected time paths in stochastic schedule-based transit networks

DOI10.1155/2016/7609572zbMath1400.90184OpenAlexW2295152109WikidataQ59141191 ScholiaQ59141191MaRDI QIDQ1793543

Van Hoai Tran, Dang Khoa Vo, Nguyen Huynh Tuong, Tran Vu Pham

Publication date: 12 October 2018

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2016/7609572

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Stochastic scheduling theory in operations research (90B36)

Related Items (1)

Corrigendum to: ``Least expected time paths in stochastic schedule-based transit networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Equilibrium traffic assignment for large scale transit networks
• Schedule-based dynamic transit modeling. Theory and applications
• Finding optimal hyperpaths in large transit networks with realistic headway distributions
• A Doubly Dynamic Schedule-based Assignment Model for Transit Networks
• On the online shortest path problem with limited arc cost dependencies
• Stochastic shortest path problems with recourse
• Dijkstra's algorithm on-line
• Label correcting methods to solve multicriteria shortest path problems

This page was built for publication: Least expected time paths in stochastic schedule-based transit networks