啟發式解法
Heuristics
| 節 | 週二 |
|---|---|
2 09:00–09:50 | 啟發式解法 A905 3 節連堂 |
3 10:10–11:00 | |
4 11:10–12:00 |
* 根據陽明交大上課時間表所列
This course would like to introduce several Softcomputing heuristics that shall be able to solve the difficult problems in Transportation and Logistics Management. We shall use several classical optimization problems as platforms to introduce the implementation of these heuristics, the theoretical foundations and the guidelines (e.g., the parameter settings, etc) for the application of these heuristics.
Basic programming skill and elementary level of probability theory.
The teaching of this course shall be mostly conducted by lecturing. Also, we will employ many sets of homework to assist the students to get used to the application of the heuristics. The instructor will give all the lectures and the students will do their final presentation via Google Meet due to the consideration of pandemic control. But, the midterm examination will be in-class.
1. Homework 40% 2. Midterm examine 40% 3. Final presentation 20%
- Fundamentals of Algorithm Design and Complexity Analysis.
- Design of Local Search
- Simulated Annealing (SA)
- Genetic Algorithm (GA)
| 週次 | 主題 |
|---|---|
| 第 1 週 | Fundamentals of Algorithm Design and Complexity Analysis. |
| 第 2 週 | Moon Festival long weekend |
| 第 3 週 | Design of Local Search Algorithms for Solving Traveling Salesman Problem |
| 第 4 週 | Application of Simulated Annealing: Graph Partitioning Problem |
| 第 5 週 | Introduction of the Simulated Annealing and Theoretical Background of Simulated Annealing |
| 第 6 週 | Application of Simulated Annealing: Graph Partitioning Problem |
| 第 7 週 | Optimizing the Parameter Setting in Simulated Annealing |
| 第 8 週 | Introduction of the Genetic Algorithm |
| 第 9 週 | The Implementation of Genetic Algorithm |
| 第 10 週 | The Theoretical Background of Genetic Algorithm |
| 第 11 週 | Midterm Examine |
| 第 12 週 | Selected Topics on Selection and Termination |
| 第 13 週 | The Genetic Algorithm using Integer Encoding |
| 第 14 週 | Hybrid Genetic Algorithm with local search procedures Applying Genetic Algorithm for Solving Constrained Optimization Problems |
| 第 15 週 | Term project presentation |
| 第 16 週 | Term project presentation |
| 第 17 週 | Online learning |
| 第 18 週 | Online learning |
1. The lecture notes prepared by Prof. Yao. 2. The journal papers related to the introduced Softcomputing heuristics.
- 地點
- A809
- 時間
- MON G THU AB
- 聯絡方式
- ext: 57215 myao@nctu.edu.tw