Combined Traffic Signal Control andTraffic Assignment
(주)학지사
- 최초 등록일
- 2015.03.25
- 최종 저작일
- 2000.01
- 27페이지/
어도비 PDF
- 가격 5,600원
![할인쿠폰받기](/images/v4/document/ico_det_coupon.gif)
* 본 문서는 배포용으로 복사 및 편집이 불가합니다.
서지정보
ㆍ발행기관 : 대한교통학회
ㆍ수록지정보 : 대한교통학회지 / 37권
ㆍ저자명 : Chungwon Lee
목차
Ⅰ. INTRODUCTION
Ⅱ. OBJECTIVES, ASSUMPTIONS AND FORMULATION
Ⅲ. LOCAL SEARCH
Ⅳ. EXPERIMENT
Ⅴ. CONCLUSION
Ⅵ. REFERENCES
한국어 초록
Traffic signal setting policies and traffic assignment procedures are mutually dependent. The combined signal control and traffic assignment problem deals with this interaction. With the total travel time minimization objective, gradient based local search methods are implemented. Deterministic user equilibrium is the selected user route choice rule, Webster's delay curve is the link performance function, and green time per cycle ratios are decision variables. Three implemented solution codes resulting in six variations include intersections operating under multiphase operation with overlapping traffic movements. For reference, the iterative approach is also coded and all codes are tested in four example networks at five demand levels. The results show the numerical gradient estimation procedure performs best although the simplified local searches show reducing the large network computational burden. Demand level as well as network size affects the relative performance of the local and iterative approaches. As demand level becomes higher, (1) in the small network, the local search tends to outperfonn the iterative search and (2) in the large network, vice versa.
영어 초록
Traffic signal setting policies and traffic assignment procedures are mutually dependent. The combined signal control and traffic assignment problem deals with this interaction. With the total travel time minimization objective, gradient based local search methods are implemented. Deterministic user equilibrium is the selected user route choice rule, Webster's delay curve is the link performance function, and green time per cycle ratios are decision variables. Three implemented solution codes resulting in six variations include intersections operating under multiphase operation with overlapping traffic movements. For reference, the iterative approach is also coded and all codes are tested in four example networks at five demand levels. The results show the numerical gradient estimation procedure performs best although the simplified local searches show reducing the large network computational burden. Demand level as well as network size affects the relative performance of the local and iterative approaches. As demand level becomes higher, (1) in the small network, the local search tends to outperfonn the iterative search and (2) in the large network, vice versa.
참고 자료
없음