Skip navigation

DSpace

機構典藏 DSpace 系統致力於保存各式數位資料(如:文字、圖片、PDF)並使其易於取用。

點此認識 DSpace
DSpace logo
English
中文
  • 瀏覽論文
    • 校院系所
    • 出版年
    • 作者
    • 標題
    • 關鍵字
  • 搜尋 TDR
  • 授權 Q&A
    • 我的頁面
    • 接受 E-mail 通知
    • 編輯個人資料
  1. NTU Theses and Dissertations Repository
  2. 工學院
  3. 工業工程學研究所
請用此 Handle URI 來引用此文件: http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/6688
標題: 多目標連續型仿水流優化演算法
Water Flow-like Optimization Algorithm for Multi-objective Continuous Optimization Problems
作者: Szu-Ting Chou
周思婷
指導教授: 楊烽正(Feng-Cheng Yang)
關鍵字: 仿水流優化演算法,多目標連續優化問題,ZDT標竿問題,正確率(Correctness),涵蓋度(Coverness),
Water Flow-like Algorithm,Multi-objective Continuous Optimization Problem,ZDT functions,Correctness,Coverness,
出版年 : 2012
學位: 碩士
摘要: The newly developed optimization algorithm, Water Flow-like Algorithm, that is WFA, simulates a solution searching agent as a water flow traversing the lowest point of a terrain. The number of water flows is dynamically changed while water flows split into subflows against rough terrain and merge several flows into one single flow. Flow splitting and merging are mimicked by the WAF to conduct efficient optimum search in the solution space. In addition, water evaporation and precipitation are simulated in WFA to jump out of local optima or to broaden the searching area. This paper presents a WFA for Multi-objective Continuous Optimization Problems, namely WFA4MC. This paper presents three merging methods for different merging conditions. First, the location-based merging approach is frequently adopted in general optimization problems, either continuous or discrete ones. In addition to the location-based approach, we propose an objective-based merging approach for our multi-objective optimization problems, where a set of non-dominated solutions with objective values dispersedly distributed in the objective space is preferred.
In order to prove WFA4MC performances precisely, this research proposes Correctness and Coverness to measure non-dominated solutions in ZDT functions.
Besides, the Generational Distance is used in the comparison with other heuristic Algorithms. The result showed that based on the same limit of the number of objective function calls, the WFA4MC outperform than others.
URI: http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/6688
全文授權: 同意授權(全球公開)
顯示於系所單位:工業工程學研究所

文件中的檔案:
檔案 大小格式 
ntu-101-1.pdf1.73 MBAdobe PDF檢視/開啟
顯示文件完整紀錄


系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。

社群連結
聯絡資訊
10617臺北市大安區羅斯福路四段1號
No.1 Sec.4, Roosevelt Rd., Taipei, Taiwan, R.O.C. 106
Tel: (02)33662353
Email: ntuetds@ntu.edu.tw
意見箱
相關連結
館藏目錄
國內圖書館整合查詢 MetaCat
臺大學術典藏 NTU Scholars
臺大圖書館數位典藏館
本站聲明
© NTU Library All Rights Reserved