運輸網路概論
Introductory Transportation Network
| 節 | 週一 |
|---|---|
5 13:20–14:10 | 運輸網路概論 A905 3 節連堂 |
6 14:20–15:10 | |
7 15:30–16:20 |
* 根據陽明交大上課時間表所列
This course will introduce various network optimization problems, such as assignment problems, shortest path problems, and shortest path problems, and their solution algorithms in transportation systems. The objective of the course is to provide students with the fundamentals of management decision-making and analysis techniques that are used in transportation systems analysis and optimization.
Linear Algebra; Operations Research; Computer Programming
Midterm Exam: 25% Term Project: 30% Homework and Assignments: 25% Attendance and Class Participation: 20%
| 週次 | 主題 |
|---|---|
| 第 1 週 | Course overview |
| 第 2 週 | Transportation System, Graph Theory |
| 第 3 週 | Peace Memorial day |
| 第 4 週 | Transportation Problem |
| 第 5 週 | Transportation Problem BFS |
| 第 6 週 | Transportation Simplex Method |
| 第 7 週 | Assignment Problem |
| 第 8 週 | Midterm exam |
| 第 9 週 | Transshipment Problem, Shortest Path Problem |
| 第 10 週 | Shortest Path Algorithms |
| 第 11 週 | Minimum Spanning Tree, Network Simplex Method |
| 第 12 週 | Maximum Flow Problem, Minimum Cost Circulation Problem |
| 第 13 週 | Traveling Salesman Problem, Chinese Postman Problem |
| 第 14 週 | Integer Programming, Formulation |
| 第 15 週 | Integer Programming, Branch and Bound |
| 第 16 週 | Term project presentation |
| 第 17 週 | Self-learning/Flexible teaching |
| 第 18 週 | Self-learning/Flexible teaching |
Text: There is no required text for the course. Please download the lecture notes from e3 References: 1. Ahuja, R.K., T. L. Magnanti, and J.B. Orlin, 1993, “Network Flows,” Prentice Hall. 2. Bradley, S., A. Hax, and T. Magnanti, (1977), “Applied mathematical programming.” Addison-Wesley. 3. Conejo, A.J., E. Castillo, R. Minguez, and R. Garcia-Bertrand, 2006, “Decomposition techniques in mathematical programming,” Springer. 4. Cormen, T.H., C.E. Leiserson, R.L. Rivest, and C. Stein, 2009, “Introduction to Algorithms,” 3rd Edition, MIT Press. 5. Hamdy A. Taha, 2001, “Operations Research: An Introduction,” 9th Edition, Prentice Hall. 6. Hillier, F.S., and G.J. Lieberman, 2009, “Introduction to Operations Research,” 9th Edition, McGraw-Hill. 7. Larson, R.C., and A.R. Odoni, 1981, "Urban Operations Research," Prentice-Hall, Inc. 8. Sheffi, Y., 1985, "Urban Transportation Networks," Prentice-Hall. 9. West, D.B., 2000, “Introduction to Graph Theory,” 2nd Edition, Prentice Hall 10. Winston, W.L., 2004, “Operations Research: Applications and Algorithms,” 4th Edition, Brooks/Cole.
- 聯絡方式