Least Expected Time Paths in Stochastic Schedule-Based Transit Networks
Autor: | Nguyen Huynh Tuong, Dang Khoa Vo, Van Hoai Tran, Tran Vu Pham |
---|---|
Rok vydání: | 2016 |
Předmět: |
050210 logistics & transportation
Mathematical optimization Schedule Article Subject Computer science lcsh:Mathematics General Mathematics 05 social sciences General Engineering 010501 environmental sciences lcsh:QA1-939 01 natural sciences Bus network lcsh:TA1-2040 Bellman equation 0502 economics and business Path (graph theory) lcsh:Engineering (General). Civil engineering (General) Transit (satellite) 0105 earth and related environmental sciences |
Zdroj: | Mathematical Problems in Engineering, Vol 2016 (2016) |
ISSN: | 1563-5147 1024-123X |
DOI: | 10.1155/2016/7609572 |
Popis: | 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. |
Databáze: | OpenAIRE |
Externí odkaz: |