網路模式分析
Network Modeling Analysis
| 節 | 週四 |
|---|---|
5 13:20–14:10 | 網路模式分析 TB429 3 節連堂 |
6 14:20–15:10 | |
7 15:30–16:20 |
* 根據陽明交大上課時間表所列
The objective of this course is to introduce network optimization problems and their models and solution algorithms in transportation and logistics. The main topics include graph theory, network representation, computational complexity, shortest path problems, arc routing problems (e.g., Chinese Postman Problem), node routing problems (Traveling Salesman Problem and Vehicle Routing Problem), facility location problems, and time-space network applications. Students will find these models most useful in application areas such as Supply Chain Planning, Distribution Network Design, Logistics System Design, Transportation Planning, Transportation System Analysis, Vehicle Routing and Scheduling, and Service Facility Planning.
微積分、作業研究
Midterm Exam 25% Final Exam 25% Term Project (group) 25% Homework Assignment 15% Attendance and Class Participation 10%
| 週次 | 主題 |
|---|---|
| 第 1 週 | Course Introduction & Graph Theory and Network Representations |
| 第 2 週 | Computational Complexity |
| 第 3 週 | Shortest Path Problem (SPP) |
| 第 4 週 | Shortest Path Problem (SPP) |
| 第 5 週 | Shortest Path Problem (SPP) |
| 第 6 週 | Arc Routing Problem – Chinese Postman Problem (CPP) |
| 第 7 週 | Node Routing Problem – Traveling Salesman Problem (TSP) |
| 第 8 週 | Node Routing Problem – Vehicle Routing Problem (VRP) |
| 第 9 週 | Midterm Exam |
| 第 10 週 | Node Routing Problem – Vehicle Routing Problem (VRP) |
| 第 11 週 | Facility Location Problem |
| 第 12 週 | Time-space network applications (1) |
| 第 13 週 | Time-space network applications (2) |
| 第 14 週 | Time-space network applications (3) |
| 第 15 週 | Solution algorithms for network problems |
| 第 16 週 | Paper or Project Presentation |
| 第 17 週 | |
| 第 18 週 |
Text: Please download class handouts from the e3 website of NCTU. Some other important references: 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. Daskin, M. S., 1995. Network and Discrete Location: Models, Algorithms and Applications, John Wiley and Sons, Inc., New York. 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).
- 地點
- TBD
- 時間
- 2:30-3:30 pm on Thursday or by appointment
- 聯絡方式
- jasoncclu@gmail.com