碩士 / 淡江大學 / 運輸管理學系碩士班 / 97 / Since its introduction in late fifties, traditional sequential urban planning model has been implemented in a four steps manner as called Four-Step Model, or FSM in short. Although it has been recognized and widely accepted among transportation engineers and planners, an inherent drawback is its inconsistency of travel time (impedance) utilized in its sequence, notably between the trip distribution and traffic assignment step. This particular issue has been addressed in academic field but less known in practice. Several approaches have been proposed to tackle this problem of which the introduction of “feedback” loop seems particular appealing due to its simplicity and performance. In addition, recent development of dynamic traffic assignment has demonstrate its power to describe more real-world like traffic performance in road network to reveal the traffic flow pattern in both time and space dimensions. The later development complicates the inconsistency issue by adding time-varying and route-dependent travel time between any fixed given O-D pairs.
In this study, various feedback approaches implemented in static planning model were examined and compared to be implemented under dynamic network context. A simulation-based dynamic traffic assignment model DynaTAIWAN was utilized to replace the usual traffic assignment procedure in FSM. Two particular problems will be addressed: (1) the representative travel times (indices) between given O-D pairs and (2) the feedback processes. The adequateness of these feedbacks introduced for the modified FSM was analyzed by two cases, one as a simple virtual network for primary diagnosis and the other a sized-down network form a selected city network (Tao-Yuan) for real-world operation exercise.
After applying the continuous average method (Method of Successive Averages, MSA) as well as fixed weight (Constant Weights, CW) method with two alternative weight ratios (of 0.6 and 0.3 respectively), it has been shown that CW (0.3) outperformed the other methods in terms of lowest convergence level and fewer number of iterations to reach convergence. The results were generally in accordance with the previous related studies with static network cases, in particular the noted study by Boyce (2007).
| Identifer | oai:union.ndltd.org:TW/097TKU05425015 |
| Date | January 2009 |
| Creators | Yun-Yi Jan, 詹勻沂 |
| Contributors | 董啟崇 |
| Source Sets | National Digital Library of Theses and Dissertations in Taiwan |
| Language | zh-TW |
| Detected Language | English |
| Type | 學位論文 ; thesis |
| Format | 147 |
Page generated in 0.0294 seconds