運輸最佳化概念與應用
Optimization concepts and applications in transportation
| 節 | 週四 |
|---|---|
2 09:00–09:50 | 運輸最佳化概念與應用 A806 3 節連堂 |
3 10:10–11:00 | |
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 |
| 第 2 週 | Basics of mathematical models |
| 第 3 週 | Linear and integer programming problem; Duality Theory |
| 第 4 週 | Transportation and assignment problem, shortest path problem, and flow problem |
| 第 5 週 | OR-Tools: Basic functions and logics |
| 第 6 週 | OR-Tools: Linear and integer programming problems |
| 第 7 週 | OR-Tools: Assignment problems |
| 第 8 週 | OR-Tools: Flow problem and shortest path problems |
| 第 9 週 | Stable matching problems |
| 第 10 週 | Scheduling problems |
| 第 11 週 | Dynamic programming (I): Characteristics |
| 第 12 週 | Dynamic programming (II): Deterministic model |
| 第 13 週 | Introduction and mechanism of local search |
| 第 14 週 | Application of local search |
| 第 15 週 | Performance assessment of heuristics |
| 第 16 週 | Final examination |
| 第 17 週 | |
| 第 18 週 |
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
- 地點
- A814
- 時間
- Wednesday 1430 – 1530
- 聯絡方式
- csshui@nctu.edu.tw