查詢教學大綱與進度

教學大綱與進度

課程基本資料：

學年期課號課程名稱階段學分時數修教師班級人撤備註

102-2 183614 運籌系統分析 1 3.0 3 ★ 盧宗成資管所
管理外國學生專班 6 0 教室:科研640,資管所與IMBA合開

學年期	課號	課程名稱	階段	學分	時數	修	教師	班級	人	撤	備註
102-2	183614	運籌系統分析	1	3.0	3	★	盧宗成	資管所管理外國學生專班	6	0	教室:科研640,資管所與IMBA合開

教學大綱與進度：

教師姓名盧宗成

Email jasonlu@ntut.edu.tw

最後更新時間 2014-01-16 08:03:27

課程大綱本課程的目的在學習各種運籌系統分析的模式與方法，主要分別從供給面與需求面探討運籌系統，並且探討供給與需求之間的均衡分析。課程內容包含：網路設計、分析與最佳化、等候理論、網路均衡指派、動態網路分析、以及商用車輛營運管理與車輛路線問題等。

課程進度 1 Course Introduction 2 Graph Theory and Network Representations 3 Computational Complexity 4 Shortest Path Problem (SPP) 5 Shortest Path Problem (SPP) 6 Shortest Path Problem (SPP) 7 Spring Break 8 Shortest Path Problem (SPP) 9 Midterm Exam 10 Arc Routing Problem – Chinese Postman Problem (CPP) 11 Arc Routing Problem – Chinese Postman Problem (CPP) 12 Node Routing Problem – Traveling Salesman Problem (TSP) 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 Facility Location 17 Final Exam 18 Paper or Project Presentation

評量方式與標準 Midterm Exam 25% Final Exam 25% Paper Presentation or Mini Term Project 20% Homework Assignment 15% Attendance and Class Participation 15%

使用教材、參考書目或其他 【遵守智慧財產權觀念，請使用正版教科書，不得使用非法影印教科書】

使用外文原文書：　
Text: (1) Please download class handouts from the e-learning website of NTUT. Some other important references: (2) 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/) (3) Daskin, M. S., 1995. Network and Discrete Location: Models, Algorithms and Applications, John Wiley and Sons, Inc., New York. (4) Ahuja, R. K., Magnanti, T. L., Orlin, J. B., 1993. Network Flows: Theory, Algorithms, and Applications.

課程諮詢管道

備註

教師姓名	盧宗成
Email	jasonlu@ntut.edu.tw
最後更新時間	2014-01-16 08:03:27
課程大綱	本課程的目的在學習各種運籌系統分析的模式與方法，主要分別從供給面與需求面探討運籌系統，並且探討供給與需求之間的均衡分析。課程內容包含：網路設計、分析與最佳化、等候理論、網路均衡指派、動態網路分析、以及商用車輛營運管理與車輛路線問題等。
課程進度	1 Course Introduction 2 Graph Theory and Network Representations 3 Computational Complexity 4 Shortest Path Problem (SPP) 5 Shortest Path Problem (SPP) 6 Shortest Path Problem (SPP) 7 Spring Break 8 Shortest Path Problem (SPP) 9 Midterm Exam 10 Arc Routing Problem – Chinese Postman Problem (CPP) 11 Arc Routing Problem – Chinese Postman Problem (CPP) 12 Node Routing Problem – Traveling Salesman Problem (TSP) 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 Facility Location 17 Final Exam 18 Paper or Project Presentation
評量方式與標準	Midterm Exam 25% Final Exam 25% Paper Presentation or Mini Term Project 20% Homework Assignment 15% Attendance and Class Participation 15%
使用教材、參考書目或其他	【遵守智慧財產權觀念，請使用正版教科書，不得使用非法影印教科書】使用外文原文書：　 Text: (1) Please download class handouts from the e-learning website of NTUT. Some other important references: (2) 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/) (3) Daskin, M. S., 1995. Network and Discrete Location: Models, Algorithms and Applications, John Wiley and Sons, Inc., New York. (4) Ahuja, R. K., Magnanti, T. L., Orlin, J. B., 1993. Network Flows: Theory, Algorithms, and Applications.
課程諮詢管道
備註