none

• Main Authors: Yu-hang Yan, 顏郁航
• Other Authors: 陳惠國
• Format: Others
• Language: zh-TW
• Published: 2014
• Online Access: http://ndltd.ncl.edu.tw/handle/06381250663613765570

碩士 === 國立中央大學 === 土木工程學系 === 102 === The doubly constrained trip distribution problem is to find the O-D demands assuming that both the total flow generated at each origin and the total flow attracted to each destination are fixed and known. The input data of TD(trip distribution) and TA(traffic assignment) has to depend on each other. Using the concept of combined model can eliminate the inconsistency of two interfaces. Traditionally, in order to solve the combined model, which the TD is considered along with TA, there are mainly two method: direct method and double-stage algorithm. Though the double-stage algorithm is much more accuracy and precise than the direct method in solving the combined model, they both still are not accuracy and precise enough in acquiring the unique route flow solution procedure, according to the past studies. Most of traffic assignment algorithm still couldn't conquer multiple solutions problems, until Bar-Gera (2010) mentioned TAPAS algorithm, which add into the concept of proportionality and entropy. Here is a new method presented in the article. We utilize the concept of extend network(Chen ,2011), and regard doubly constrained combined model as extend traffic assignment problem to construct the MEUE combined model and supernetwork. Using the extend TAPAS algorithm to solve it. The results indicate that the extend TAPAS algorithm is more efficient and has a better precision than the double-stage algorithm. Besides, we can breach the bottleneck to get the unique route flow solution for combined model.