校際選修

115-1 選課時程

進行中

  • 初選第一階段 6/15/2026
  • 初選第二階段 6/22/2026
  • 校際選修 8/24/2026
  • 初選第三階段 8/31/2026
  • 開學後加退選 9/7/2026
  • 逾期加退選 9/21/2026
選課資源

啟發式解法

Heuristics

學期
110-1
學分
3 學分
當期課號
5522
永久課號
ITS5271
開課單位
運輸與物流管理學系交通運輸碩博士班
授課教師
姚銘忠
校區
光復
類別
選修
上課時間表
週二
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.

Office Hours
地點
A809
時間
MON G THU AB
聯絡方式
ext: 57215 myao@nctu.edu.tw