| 000 | 03108nas a2200397 a 4500 | ||
|---|---|---|---|
| 005 | 20260818165844.0 | ||
| 008 | 100305s2009 th uu|m rtt 0| a1eng d | ||
| 035 | _a.b12073921 | ||
| 099 | 9 | _aAIT Thesis no.TE-08-02 | |
| 100 | 0 | _aTawin Tiratanapakhom | |
| 245 | 1 | 0 | _aNetwork design problem with a stochastic traffic assignment technique |
| 260 |
_aPathum Thani, Thailand : _bAsian Institute of Technology, _c2009 |
||
| 300 |
_a68 leaves : _bill. |
||
| 490 | 1 |
_aThesis ; _vno. TE-08-02 |
|
| 500 | _aA thesis submitted in partial fulfillment of the requirements for the degree of Master of Engineering in Transportation Engineering, School of Engineering and Technology | ||
| 502 | _aThesis (M.Eng.) - Asian Institute of Technology, 2008 | ||
| 520 | _aTraffic assignment model plays an important role in network design problem by producing a user equilibrium flow pattern for finding the optimal network improvement. The classical traffic assignment technique assigns a fixed OD table onto the network, so that a set of average link flows are generated. However, the demand for travel encounters many uncertainties in the real world. Therefore, the OD demand cannot be fixed and using it may provide some misleading information. To account for such uncertainties, a stochastic OD table with the assumed Normal distribution in each OD demand is introduced. The modified traffic assignment with a stochastic OD table was examined in several experiments. It has been found that the probabilistic link flows tend to follow the Normal distribution. Furthermore, the different decision results were observed between using vie ratio and probability of congestion. Eventually, the proposed idea was further extended to the network design problem and led to the formulation of new network design problem concept which aims to minimize the system probability of congestion (SPC). Furthermore, some more experiments were conducted for making a comparison between proposed and conventional NDP. Finally, in association with the SPC, the new concept of Braess' s paradox is introduced. | ||
| 650 | 0 | _aTraffic assignment | |
| 650 | 0 |
_aTransportation _xPlanning |
|
| 700 | 1 |
_aKim, Hyunmyung, _eChairperson |
|
| 700 | 0 |
_aKunnawee Kanitpong, _eExamination committee |
|
| 700 | 1 |
_aTanaka, Shinji, _eExamination committee |
|
| 710 | 2 |
_aRTG Fellowship, _eScholarship donor |
|
| 810 | 2 |
_aAsian Institute of Technology. _tThesis ; _vno. TE-08-02 |
|
| 856 |
_3Full-Text _uhttp://203.159.5.9/ait-thesis/detail.php?q=B04091 |
||
| 907 |
_a.b12073921 _bmnait _cu |
||
| 902 | _a240329 | ||
| 998 |
_b0 _c100305 _dm _ea _fu _g0 |
||
| 945 | _lmnait | ||
| 945 | _lmnarc | ||
| 942 | _c22 | ||
| 942 | _c40 | ||
| 909 |
_aBarcode : 30050120704068 _bCREATED : 2014-09-04 _cRECORD # : i12788314 _dLPATRON : 1025582 _eLCHKIN : 2016-03-05 _f# RENEWALS : 0 _g# OVERDUE : 0 _hIUSE3 : 0 _iTOT CHKOUT : 1 _jTOT RENEW : 0 |
||
| 909 |
_aBarcode : 30050160041751 _bCREATED : 2016-03-24 _cRECORD # : i12907194 _dLPATRON : 0 _eLCHKIN : - _f# RENEWALS : 0 _g# OVERDUE : 0 _hIUSE3 : 0 _iTOT CHKOUT : 0 _jTOT RENEW : 0 |
||
| 999 |
_c80423 _d80423 |
||