運輸網路概論

Introductory Transportation Network

學期

114-2

學分

3 學分

當期課號

517209

永久課號

MGTM20014

開課單位

運輸與物流管理學系跨域學程(B)外系學生、運輸與物流管理學系

授課教師

盧宗成

校區

光復

類別

選修

上課時間表

節	週二
5 13:20–14:10	運輸網路概論 A905（光復） 3 節連堂
6 14:20–15:10
7 15:30–16:20

* 根據陽明交大上課時間表所列

概述

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 2026-02-24(二)
第 2 週	Graph Theory and Network Representations 2026-03-03(二)
第 3 週	Computational Complexity 2026-03-10(二)
第 4 週	Shortest Path Algorithms 2026-03-17(二)
第 5 週	Shortest Path Algorithms 2026-03-24(二)
第 6 週	Shortest Path Algorithms 2026-03-31(二)
第 7 週	清明節放假 2026-04-07(二)
第 8 週	Fundamentals of Traffic Flow Theory 2026-04-14(二)
第 9 週	Queueing Models 2026-04-21(二)
第 10 週	Midterm Exam 2026-04-28(二)
第 11 週	Facility Location Models 2026-05-05(二)
第 12 週	Arc Routing Problem – Chinese Postman Problem (CPP) 2026-05-12(二)
第 13 週	Node Routing Problem – Traveling Salesman Problem (TSP) 2026-05-19(二)
第 14 週	Node Routing Problem – Vehicle Routing Problem (VRP) 2026-05-26(二)
第 15 週	Node Routing Problem – Vehicle Routing Problem (VRP) 2026-06-02(二)
第 16 週	Term Project Presentation 2026-06-09(二)

教科書

Ahuja, R. K., Magnanti, T. L. ＆amp; 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., ＆amp; Solomon, M.M., 2005. Column Generation, Springer. Evans, J. ＆amp; Minieka, E., 1992. Optimization Algorithms for Networks and Graphs, 2nd ed., Marcel Dekker. Garey, M.R. ＆amp; Johnson, D.S., 1979. Computers and intractability: a guide to the theory of NP completeness, San Francisco: Freeman. Golden, B. L., Raghavan, S. ＆amp; Wasil, E., 2008. The Vehicle Routing Problem: Latest Advances and New Challenges. Boston, MA, Springer. Larson, R. C. ＆amp; 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. ＆amp; Steiglitz, K., 1998. Combinatorial Optimization – Algorithms and Complexity, Dovers Publications Inc., New York. Toth, P. ＆amp; Vigo, D., 2002. The Vehicle Routing Problem (Discrete Mathematics and Applications), SIAM (Society for Industrial and Applied Mathematics) Toth, P. ＆amp; Vigo, D., 2014. Vehicle Routing: Problems, Methods, and Applications, Second Edition (MOS-SIAM Series on Optimization), SIAM (Society for Industrial and Applied Mathematics).

Office Hours

地點: 綜合一館八樓
時間: 11:00-12:00 Thursday
聯絡方式: jasoncclu@nycu.edu.tw