啟發式解法
Heuristics
| 節 | 週二 |
|---|---|
2 09:00–09:50 | 啟發式解法 A904（光復） 3 節連堂 |
3 10:10–11:00 | |
4 11:10–12:00 |
* 根據陽明交大上課時間表所列
This course would like to introduce several soft-computing heuristics that can solve difficult problems in Transportation and Logistics Management. We shall use several classical optimization problems to introduce the implementation of these heuristics, the theoretical foundations, and the guidelines (e.g., the parameter settings, etc.) for applying these heuristics
Basic programming skills and elementary level of probability theory.
無備註
All the lectures and the midterm examination will be in class unless Prof. Yao makes a particular announcement due to the consideration of pandemic control.
1. Homework 50% 2. Midterm examination 40% 3. Final presentation 10%
Design of Local Search
1. The Traveling Salesman Problem 2. Constructive Heuristic procedure for solving TSP 3. Local search for solving TSP
- 講授：
- 12
Simulated Annealing (SA)
1. Introduction of the SA 2. Theoretical Background of SA 3. Application of SA: Graph Partitioning Problem 4. Optimizing the Parameter Setting in Simulated Annealing
- 講授：
- 15
Genetic Algorithm (GA)
1. Introduction of the GA 2. Theoretical Background of Genetic Algorithm using Binary Encoding 3. Hybrid GA with local search procedures 4. Applying GA for Solving Constrained Optimization Problems
- 講授：
- 18
| 週次 | 主題 |
|---|---|
| 第 1 週 | A Constructive Heuristic for Solving Traveling Salesman Problem 2026-09-08(二) |
| 第 2 週 | Local Search Algorithms for Solving Traveling Salesman Problem 2026-09-15(二) |
| 第 3 週 | Local Search Operators for Solving TSP/VRP 2026-09-22(二) |
| 第 4 週 | Application of Simulated Annealing: Graph Partitioning Problem 2026-09-29(二) |
| 第 5 週 | Introduction of the Simulated Annealing and Theoretical Background of Simulated Annealing 2026-10-06(二) |
| 第 6 週 | Application of Simulated Annealing: Graph Partitioning Problem 2026-10-13(二) |
| 第 7 週 | Application of Simulated Annealing: Graph Partitioning Problem 2026-10-20(二) |
| 第 8 週 | Optimizing the Parameter Setting in Simulated Annealing 2026-10-27(二) |
| 第 9 週 | Introduction to the Genetic Algorithm The Implementation of Genetic Algorithms 2026-11-03(二) |
| 第 10 週 | The Theoretical Background of Genetic algorithms 2026-11-10(二) |
| 第 11 週 | Selected Topics on Selection and Termination 2026-11-17(二) |
| 第 12 週 | The Genetic Algorithm Using Integer Encoding 2026-11-24(二) |
| 第 13 週 | Term project presentation 2026-12-01(二) |
| 第 14 週 | Midterm Examine 2026-12-08(二) |
| 第 15 週 | Term project presentation 2026-12-15(二) |
| 第 16 週 | Term project presentation 2026-12-22(二) |
1. The lecture notes prepared by Prof. Yao. 2. The journal papers related to the introduced soft-computing heuristics.
- 地點
- A809
- 時間
- MON GH
- 聯絡方式
- ext: 57215 myao@nycu.edu.tw