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 會收到這份課表的公開連結。

運輸最佳化概念與應用

Optimization concepts and applications in transportation

學期
113-2
學分
0 學分
當期課號
517209
永久課號
MGTM20016
開課單位
運輸與物流管理學系
授課教師
水敬心
校區
光復
類別
選修
上課時間表
週五
3
10:10–11:00
運輸最佳化概念與應用
A904(光復)
2 節連堂
4
11:10–12:00

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

概述

This course aims to equip students with optimization concepts that can be applied in different decision-making scenarios, especially in transportation and logistics planning. It demonstrates the way that conventional transportation operation designs incorporate the theories and methodologies, such as station location problems and vehicle fleet management problems. It embeds the taught theories into the design problems in emerging transportation systems, such as vehicle sharing systems (e.g., e-scooter, bike, and car), carpooling and on-demand transport systems, and crowdsourced transportation systems (e.g., Lalamove). It introduces and equips students to use Open Solvers (i.e., OR-Tools by Google) and simple metaheuristics to accomplish popular optimization problems. After the course, the students should equip with the following skills applicable in optimization decision-making scenarios, including: 1) Interpreting the mathematical models in the literature and formulating basic optimization problems; 2) Interpreting, formulating, and solving deterministic dynamic problems; 3) Solving the classic combinatorial problems using commercial solvers, open-source solvers, and simple heuristics and evaluating the effectiveness of the solution methods.

先修科目

Pre-requisite: Operations Research (I) Programming skills at the beginner level is expected

備註

無備註

教學方式

教師未提供此項資料

評分方式

1. Homework and Assignments a. One written assignment (total 15%) b. One individual coding assignment (total 15%) c. One group project (total 35%) 2. Exams and Quizzes: a. Final exam (35%)

課程大綱

教師未提供此項資料

週次計畫
週次主題
第 1 週

Course introduction

2025-02-21(五)
第 2 週

Basics of mathematical models

2025-02-28(五)
第 3 週

Linear and integer programming problem Duality Theory

2025-03-07(五)
第 4 週

Transportation and assignment problem, shortest path problem, and flow problem

2025-03-14(五)
第 5 週

OR-Tools: Basic functions and logics

2025-03-21(五)
第 6 週

OR-Tools: Linear and integer programming problems

2025-03-28(五)
第 7 週

OR-Tools: Assignment problems

2025-04-04(五)
第 8 週

OR-Tools: Flow problem and shortest path problems

2025-04-11(五)
第 9 週

Stable matching problems

2025-04-18(五)
第 10 週

Scheduling problems

2025-04-25(五)
第 11 週

Dynamic programming (I): Characteristics

2025-05-02(五)
第 12 週

Dynamic programming (II): Deterministic model

2025-05-09(五)
第 13 週

Introduction and mechanism of local search

2025-05-16(五)
第 14 週

Application of local search

2025-05-23(五)
第 15 週

Performance assessment of heuristics

2025-05-30(五)
第 16 週

Final examination

2025-06-06(五)
第 17 週

2025-06-13(五)
第 18 週

2025-06-20(五)
教科書

Hillier, F. S.; Lieberman, G. J. (2020), Introduction to Operations Research, 11th Edition, McGraw-Hill Gendreau, M.; Potvin, J-Y. (2019). Handbook of Metaheuristics, 2nd Edition, Springer. https://link.springer.com/book/10.1007%2F978-3-319-91086-4

Office Hours
地點
A814
時間
Wednesday 1430 – 1530
聯絡方式
csshui@nycu.edu.tw