교통계획특론
- 고려대학교
- 강승모
페이스북
트위터
카카오톡
네이버밴드
링크복사
-
- 주제분류
- 공학 >토목ㆍ도시 >교통공학
-
- 강의학기
- 2011년 2학기
-
- 조회수
- 5,903
-
This course is about the transportation network analysis focusing on planning and optimization. Starting from a conventional travel demand modeling, this includes precise algorithms for finding transport network equilibrium flows and applications that relate to these flows, routing algorithms, deterministic equilibrium, transportation network design, and stochastic extensions.
차시별 강의
| 1. | |
Course Introduction | Course introduction including teaching assistant, textbook, course objectives, and grading policy |  |
| 2. | |
Transportation Planning Process | Planning, implementing, evaluation of transportation | |
| 3. | |
Review of Travel Demand Analysis | Travel forecasting, 4-step model, trip distribution | |
| 4. | |
Mode Choice | Utility theory, logit model, nested logit model | |
| 5. | |
Route Choice | All-or-Nothing assignment, System optimal assignment, basic conecpts of problem minimization | |
| 6. | |
Basic Concepts in Minimization Problems | Linear programming, integer programming, nonlinear programming, convexity | |
| 7. | |
Basic Concepts in Minimization Problems 1 | Constrained minization programs with single variable, uncontrained minization programs with multiple variables | |
| 8. | |
Basic Concepts in Minimization Problems 2 | Contrained minization problems with multiple variables, minimization with linear equality contraints | |
| 9. | |
Trip Distribution: How to Solve Gravity Model | Trip distribution, gravity model, iterative balancing, logit model in mode choice | |
| 10. | |
Assignment Problem as a Mathmatical Program | User equilibrium | |
| 11. | |
Solving for user euqilibrium 1 | Convex combination algoritum, convergence criterion, bisection method | |
| 12. | |
Solving for user euqilibrium 2 | Path based assignment, gradient projection algorithm, GP algorithm performance | |
연관 자료
