Least Expected Time Paths in Stochastic Schedule-Based Transit Networks

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

Mathematical Problems in Engineering, 2016, vol. 2016, 1-13

Abstract:

We consider the problem of determining a least expected time (LET) path that minimizes the number of transfers and the expected total travel time in a stochastic schedule-based transit network. A time-dependent model is proposed to represent the stochastic transit network where vehicle arrival times are fully stochastically correlated. An exact label-correcting algorithm is developed, based on a proposed dominance condition by which Bellman’s principle of optimality is valid. Experimental results, which are conducted on the Ho Chi Minh City bus network, show that the running time of the proposed algorithm is suitable for real-time operation, and the resulting LET paths are robust against uncertainty, such as unknown traffic scenarios.

Date: 2016
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2016/7609572.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2016/7609572.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:7609572

DOI: 10.1155/2016/7609572

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().