| 000 | 03477nas a2200397 a 4500 | ||
|---|---|---|---|
| 005 | 20260818174131.0 | ||
| 008 | 100305s2009 th uu|m rtt 0| a1eng d | ||
| 035 | _a.b12073945 | ||
| 099 | 9 | _aAIT Thesis no.TE-08-04 | |
| 100 | 1 | _aMaribojoc, Theonette Ruba | |
| 245 | 1 | 0 | _aProbabilistic travel time based route choice problem with a hierarchical path enumeration algorithm |
| 260 |
_aPathum Thani, Thailand : _bAsian Institute of Technology, _c2009 |
||
| 300 |
_a61 leaves : _bill. |
||
| 490 | 1 |
_aThesis ; _vno. TE-08-04 |
|
| 500 | _aA thesis submitted in partial fulfillment of the re quirements for the degree of Master of Engineering in Transportation Engineering, School of Engineering and Technology | ||
| 520 | _aIt has long been aimed by transportation researcher s to solve the unmanageable urban traffic congestion all over the world. RGS and ATIS are amo ng the useful ITS applications for urban passenger car travel. However, available mode ls used in evaluating their effectiveness have not precisely imitated the real transportation network. For example, many of the previous studies avoided path enumeration, route ch oice models were formulated without integrating the driver{u2019}s perception error, etc. All of the aforementioned issues are significant in a route choice model{u2019}s efficiency. Moreover, in traffic assignment and network design problems, reliable route choice models are very essential. The proposed route choice model is provided with an efficient path enumeration algorithm. The combined concepts of hierarchical road classifi cation, resource constraints, link penalty and the link-based shortest path searching algorith m successfully enumerated independent paths; manifested through the choice probability re sults of the deterministic multinomial logit (MNL) model. In addition, the model calculates the path choice probabilities both when a reference travel time frame is known and unknown. U sing a network in Bangkok, Thailand, the proposed model was examined and the calculated path choice probabilities were compared to the Success Rate (SR) and deterministic MNL. Significant advantages of the proposed model over the conventional MNL were estab lished. | ||
| 502 | _aThesis (M.Eng.) - Asian Institute of Technology, 2008 | ||
| 650 | 0 |
_aTransportation _zThailand _zBangkok _xPlanning |
|
| 650 | 0 |
_aRoute choice _zThailand _zBangkok |
|
| 700 | 1 |
_aKim, Hyunmyung, _eChaiperson |
|
| 700 | 0 |
_aKunnawee Kanitpong, _eExamination committee |
|
| 700 | 1 |
_aTanaka, Shinji, _eExamination committee |
|
| 710 | 2 |
_aThailand (HM King), _eScholarship donor |
|
| 810 | 2 |
_aAsian Institute of Technology. _tThesis ; _vno. TE-08-04 |
|
| 856 |
_3Full-Text _uhttp://203.159.5.9/ait-thesis/detail.php?q=B04093 |
||
| 907 |
_a.b12073945 _bmnait _cu |
||
| 902 | _a240329 | ||
| 998 |
_b0 _c100305 _dm _ea _fu _g0 |
||
| 945 | _lmnait | ||
| 945 | _lmnarc | ||
| 942 | _c22 | ||
| 942 | _c40 | ||
| 909 |
_aBarcode : 30050120704043 _bCREATED : 2014-09-04 _cRECORD # : i12788399 _dLPATRON : 1025582 _eLCHKIN : 2016-03-05 _f# RENEWALS : 0 _g# OVERDUE : 0 _hIUSE3 : 0 _iTOT CHKOUT : 1 _jTOT RENEW : 0 |
||
| 909 |
_aBarcode : 30050160041736 _bCREATED : 2016-03-24 _cRECORD # : i12907285 _dLPATRON : 0 _eLCHKIN : - _f# RENEWALS : 0 _g# OVERDUE : 0 _hIUSE3 : 0 _iTOT CHKOUT : 0 _jTOT RENEW : 0 |
||
| 999 |
_c92194 _d92194 |
||