2 項進行中

115-1 選課時程

進行中

  • 初選第一階段 6/15 – 6/18
  • 初選第二階段 6/22 – 6/25
  • 校際選修 進行中 8/24 – 9/18
  • 初選第三階段 8/31 – 9/3
  • 開學後加退選 進行中 9/7 – 9/21
  • 逾期加退選 9/21 – 9/24
選課資源

加入行事曆

選擇訂閱 Google Calendar,或下載通用的 ICS 檔案。

使用 Google Calendar 時,Google 會收到這份課表的公開連結。

網路模式分析

Network Modeling Analysis

學期
114-2
學分
3 學分
當期課號
537205
永久課號
MGTM30026
開課單位
人工智慧跨域學程-管理組、運輸與物流管理學系交通運輸碩博士班、運輸與物流管理學系物流管理碩博士班
授課教師
張宗勝
校區
光復
類別
選修
上課時間表
週三
2
09:00–09:50
網路模式分析
A904(光復)
3 節連堂
3
10:10–11:00
4
11:10–12:00

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

概述

This course will cover the modeling techniques, solution methods and application considerations of those widely applied network models that include Shortest Path Problems, (LP) Minimum-Cost Flow Problems, (NLP) User Equilibrium Traffic Assignment, (Node Covering) Traveling Salesman Problems, (Arc Covering) Chinese Postman Problem, Vehicle Routing Problem, and Facility Location Problems. Recent development of meta-heuristics applications will be discussed as well. 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.

先修科目

微積分、作業研究

備註

無備註

教學方式

教師未提供此項資料

評分方式

Class Participation 25% Homework and Group Assignment 25% Midterm Examination 25% Final Presentation 25%

課程大綱

教師未提供此項資料

週次計畫
週次主題
第 1 週

Course Overview Konigsburg Seven-Bridge Problem

2026-02-25(三)
第 2 週

Quantitative/Network Models/Presentation/ Algorithmic Concerns/Formulation and Applications

2026-03-04(三)
第 3 週

Shortest Path Problem (I): Label Setting SPP (II): Label Correcting Algorithm

2026-03-11(三)
第 4 週

SPP (III): Floyd's Algorithm Review of LP Simplex

2026-03-18(三)
第 5 週

國慶日 National Holiday

2026-03-25(三)
第 6 週

Minimum Cost Flow Problems: Network Simplex

2026-04-01(三)
第 7 週

Traffic Assignment User Equilibrium Assignment Beckmann Transformation UE Equivalent MP Model Review of Optimization Techniques

2026-04-08(三)
第 8 週

Application of Frank-Wolfe Algorithm to UE Assignment

2026-04-15(三)
第 9 週

**** First Examination ****

2026-04-22(三)
第 10 週

Arc Covering Problem Chinese Postman Problem (CPP) on undirected network

2026-04-29(三)
第 11 週

CPP on directed networks Facility Location: Median and Center Problem

2026-05-06(三)
第 12 週

Node Covering: Traveling Salesman Problem (TSP) --Problem Complexity: NP-Completeness& #9 TSP Exact Solution: Branch & Bound Algorithm TSP Heuristics, Euclidean TSP

2026-05-13(三)
第 13 週

TSP(II): TSP for Directed Graphs, M-TSP VRP(I): Formulation C-W Savings Algorithm

2026-05-20(三)
第 14 週

VRP(II): VRP Heuristic Methods VRP Variants

2026-05-27(三)
第 15 週

**** Second Examination ****

2026-06-03(三)
第 16 週

More of VRP Heuristics/Metaheuristics Neighborhood Search VND/RVND Tabu Search SA/TA/RRT Evolutionary Methods: GA/MA/PSO

2026-06-10(三)
第 17 週

Application Examples: (PSO) VRP & MCVRP (ILS) VRP-IRF & PLRP (Multi-Start) SDVRP & Variants& #9

2026-06-17(三)
第 18 週

Final Presentation (in groups)

2026-06-24(三)
教科書

Text Materials: 1. Evans, James and Edward Minieka, Optimization Algorithms for Networks and Graphs, 2nd ed., Marcel Dekker, 1992. 2. Christofides, N., Graph Theory: An Algorithmic Approach, Academic Press, 1975. 3. Larson, R. and A. Odoni, Urban Operations Research, Prentice Hall, 1981. 4. Bradley, S., A. Hax and T. Magnanti, Applied Mathematical Programming, Addison-Wesley, 1977. 5. Sheffi, Y., Urban Transportation Networks, Prentice Hall, 1985. 6. Williams, H.P., Model Building in Mathematical Programming, 4th ed., John Wiley & Sons, 1999. 7. Teodorovic, D., Transportation Networks: A Quantitative Treatment, Gordon and Breach Science Publisher, 1986. 8. Bodin, Lawrence, Bruce Golden, Arjang Assad and Michael Ball, "Routing and Scheduling of Vehicles and Crews," Special Issue of Computers and Operations Research, 1983. 9. Golden, Bruce, S. Raghavan and Edward Wasil (eds.), The Vehicle Routing Problem: Latest Advances and New Challenges, Springer, 2008 References Books: 1. Ahuja, R.K., T. Magnanti and J.B. Orlin, Network Flows: Theory, Algorithms, and Applications, Prentice Hall, 1993. 2. Ball, M., T. Magnanti, C. Monma and G. Nemhauser (eds.), Network Models, Handbooks in Operations Research and Management Science, Volume 7, INFORMS, Elsevier, 1995. 3. Ball, M., T. Magnanti, C. Monma and G. Nemhauser (eds.), Network Routing, Handbooks in Operations Research and Management Science, Volume 8, INFORMS, Elsevier, 1995. 4. Golden, Bruce, S. Raghavan and Edward Wasil (eds.), The Vehicle Routing Problem: Latest Advances and New Challenges, Springer, 2008. 5. Williams, H.P., Logic and Integer Programming, Springer, 2009.

Office Hours
地點
教師未提供此項資料
時間
教師未提供此項資料
聯絡方式
教師未提供此項資料