A ROUTE-BASED SOLUTION ALGORITHM FOR DYNAMIC USER EQUILIBRIUM ASSIGNMENT
(주)학지사
- 최초 등록일
- 2015.03.25
- 최종 저작일
- 2002.01
- 40페이지/ 어도비 PDF
- 가격 6,900원
* 본 문서는 배포용으로 복사 및 편집이 불가합니다.
서지정보
ㆍ발행기관 : 대한교통학회
ㆍ수록지정보 : 대한교통학회지 / 41권
ㆍ저자명 : Sangjin Han
목차
ABSTRACT
1. INTRODUCTION
2. FORMULATION OF THE MODEL
3. A DYNAMIC NETWORK LOADING METHOD
4. SOLYTION APPROACH
5. NUMERICAL EXAMPLE
6. DISCUSSION AND CONCLUSION
REFERENCE
APPENDIX 1 A BACK-TRACK ALGORITHM
APPENDIX 2 CALCULATION OF OUTFLOWS IN DISCRETE TIME
한국어 초록
The aim of the present study is to find a good quality user equilibrium assignments under time varying condition. For this purpose, this study introduces a dynamic network loading method that can maintain correct flow propagation as well as flow conservation, and it develops a novel solution algorithm that does not need evaluation of the objective function by modifying the Schittenhelm (1990)'s algorithm. This novel algorithm turns out to be efficient and convenient compared to the conventional Frank-Wolfe (1956) algorithm because the former finds solutions based on routes rather than links so that it can maintain correct flow propagation intrinsically in the time-varying network conditions. The application of dynamic user equilibrium (DUE) assignment model with this novel solution algorithm to test networks including medium-sized one shows that the present DUE assignment model gives rise to high quality discrete time solutions when we adopt the deterministic queuing model for a link performance function, and we associate flows and costs in a proper way.
영어 초록
The aim of the present study is to find a good quality user equilibrium assignments under time varying condition. For this purpose, this study introduces a dynamic network loading method that can maintain correct flow propagation as well as flow conservation, and it develops a novel solution algorithm that does not need evaluation of the objective function by modifying the Schittenhelm (1990)'s algorithm. This novel algorithm turns out to be efficient and convenient compared to the conventional Frank-Wolfe (1956) algorithm because the former finds solutions based on routes rather than links so that it can maintain correct flow propagation intrinsically in the time-varying network conditions. The application of dynamic user equilibrium (DUE) assignment model with this novel solution algorithm to test networks including medium-sized one shows that the present DUE assignment model gives rise to high quality discrete time solutions when we adopt the deterministic queuing model for a link performance function, and we associate flows and costs in a proper way.
참고 자료
없음