運輸網路概論
Introductory Transportation Network
| 節 | 週一 | 週三 |
|---|---|---|
5 13:20–14:10 | 運輸網路概論 A901 2 節連堂 | |
6 14:20–15:10 | ||
7 15:30–16:20 | 運輸網路概論 A901 |
* 根據陽明交大上課時間表所列
The objective of this course is to introduce network optimization models and solution algorithms (heuristics) in transportation networks. The main topics include graph theory, network representation, computational complexity, shortest path problems, arc routing problems, node routing problems, traffic flow theory, queueing models and time-space network applications. Students will find these models most useful in application areas such as Transportation Planning, Transportation System Analysis, and Vehicle Routing and Scheduling.
Linear Algebra; Operations Research; Computer Programming
Please download class handouts from the e3 website of NCTU.
Midterm Exam 25% Term Project (group) 25% Homework Assignments & Quiz 25% Attendance and Class Participation 25% (The instructor reserves the right of modifying the weights of items above.)
| 週次 | 主題 |
|---|---|
| 第 1 週 | Course Introduction |
| 第 2 週 | 和平紀念日補假 |
| 第 3 週 | Graph Theory and Network Representations |
| 第 4 週 | Computational Complexity |
| 第 5 週 | Shortest Path Algorithms |
| 第 6 週 | Shortest Path Algorithms |
| 第 7 週 | 清明節放假 |
| 第 8 週 | Fundamentals of Traffic Flow Theory |
| 第 9 週 | Queueing Models |
| 第 10 週 | Midterm Exam |
| 第 11 週 | Congested Network Models |
| 第 12 週 | Arc Routing Problem – Chinese Postman Problem (CPP) |
| 第 13 週 | Node Routing Problem – Traveling Salesman Problem (TSP) |
| 第 14 週 | Node Routing Problem – Vehicle Routing Problem (VRP) |
| 第 15 週 | Node Routing Problem – Vehicle Routing Problem (VRP) |
| 第 16 週 | Term Project Presentation |
| 第 17 週 | 端午節放假 |
| 第 18 週 | 彈性補充教學 |
Ahuja, R. K., Magnanti, T. L. & Orlin, J. B., 1993. Network Flows: Theory, Algorithms, and Applications, Prentice Hall. Christofides, N., 1975. Graph Theory: An Algorithmic Approach, Academic Press. Desaulniers, G., Desrosiers, J., & Solomon, M.M., 2005. Column Generation, Springer. Evans, J. & Minieka, E., 1992. Optimization Algorithms for Networks and Graphs, 2nd ed., Marcel Dekker. Garey, M.R. & Johnson, D.S., 1979. Computers and intractability: a guide to the theory of NP completeness, San Francisco: Freeman. Golden, B. L., Raghavan, S. & Wasil, E., 2008. The Vehicle Routing Problem: Latest Advances and New Challenges. Boston, MA, Springer. Larson, R. C. & Odoni, A. R., 1981. Urban Operations Research. Prentice-Hall, New Jersey. (download this book: http://web.mit.edu/urban_or_book/www/book/) Papadimitriou, C. H. & Steiglitz, K., 1998. Combinatorial Optimization – Algorithms and Complexity, Dovers Publications Inc., New York. Toth, P. & Vigo, D., 2002. The Vehicle Routing Problem (Discrete Mathematics and Applications), SIAM (Society for Industrial and Applied Mathematics) Toth, P. & Vigo, D., 2014. Vehicle Routing: Problems, Methods, and Applications, Second Edition (MOS-SIAM Series on Optimization), SIAM (Society for Industrial and Applied Mathematics).
- 地點
- 綜合一館八樓
- 時間
- 15:3-17:00 Monday
- 聯絡方式
- jasoncclu@nctu.edu.tw