啟發式解法
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.
1. Homework 30% 2. Midterm examine 40% 3. Term project presentation 30%
Fundamentals of Algorithm Design and Complexity Analysis.
1. The Fundamentals of Algorithm Design 2. Introduction to Complexity Analysis
- 講授：
- 3
Design of Local Search
1. The Traveling Salesman Problem 2. Local search procedure for solving TSP 3. Greedy algorithms
- 講授：
- 9
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
- 講授：
- 9
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
- 講授：
- 12
| 週次 | 主題 |
|---|---|
| 第 1 週 | Fundamentals of Algorithm Design and Complexity Analysis. 9/15(二)BCD-A905 |
| 第 2 週 | Design of Local Search Algorithms for Solving Traveling Salesman Problem 9/22(二)BCD-A905 |
| 第 3 週 | Design of Local Search Algorithms for Solving Traveling Salesman Problem 9/29(二)BCD-A905 |
| 第 4 週 | Application of Simulated Annealing: Graph Partitioning Problem 10/6(二)BCD-A905 |
| 第 5 週 | Introduction of the Simulated Annealing and Theoretical Background of Simulated Annealing 10/13(二)BCD-A905 |
| 第 6 週 | Application of Simulated Annealing: Graph Partitioning Problem 10/20(二)BCD-A905 |
| 第 7 週 | Optimizing the Parameter Setting in Simulated Annealing 10/27(二)BCD-A905 |
| 第 8 週 | Introduction of the Genetic Algorithm 11/3(二)BCD-A905 |
| 第 9 週 | The Implementation of Genetic Algorithm 11/10(二)BCD-A905 |
| 第 10 週 | The Theoretical Background of Genetic Algorithm 11/17(二)BCD-A905 |
| 第 11 週 | Selected Topics on Selection and Termination 11/24(二)BCD-A905 |
| 第 12 週 | The Genetic Algorithm using Integer Encoding 12/1(二)BCD-A905 |
| 第 13 週 | Midterm Examine 12/8(二)BCD-A905 |
| 第 14 週 | Hybrid Genetic Algorithm with local search procedures Applying Genetic Algorithm for Solving Constrained Optimization Problems 12/15(二)BCD-A905 |
| 第 15 週 | Term project presentation 12/22(二)BCD-A905 |
| 第 16 週 | Term project presentation 12/29(二)BCD-A905 |
| 第 17 週 | Term project presentation 1/5(二)BCD-A905 |
| 第 18 週 | Online learning 1/12(二)BCD-A905 |
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