中大機構典藏-NCU Institutional Repository-提供博碩士論文、考古題、期刊論文、研究計畫等下載:Item 987654321/61164
English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 80990/80990 (100%)
造訪人次 : 41659695      線上人數 : 1883
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋


    請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/61164


    題名: 維度經驗重心分享粒子群演算法;PSO algorithm with Center of Gravity and Dimension Searching
    作者: 李憲昌;li,Hsien-Chang
    貢獻者: 電機工程學系
    關鍵詞: 粒子群演算法;控制器設計;分數階PID;最佳化;PSO;PID;FOPID
    日期: 2013-07-08
    上傳時間: 2013-08-22 12:13:39 (UTC+8)
    出版者: 國立中央大學
    摘要: 本論文中我們提出了一種改良的粒子群演算法,名為維度經驗重心分享粒子群演算法 SDGPSO(Standard Dimension Searching with Center of Gravity PSO algorithm),其特殊的單維度搜索機制,讓其必須擁有較一般粒子群演法不同的經驗分享機制,且在前期能夠有優秀且快速的收斂能力,化簡的計算程序也能減少計算消耗時間,並且在多數函數都能夠有優良的最終收斂值,但在後期跳脫區域最優解的能力還是不如標準型粒子群演算法SPSO,所以在本論文又對SDGPSO作一個新的改良融合命名為SDGPSO-MSP (Standard Dime- nsion Searching with Center of Gravity PSO algorithm Mixing SPSO),其中本文提出的銜接機制讓SDGPSO-MSP擷取SDGPSO前期快速收斂的能力和SPSO 後期優秀的跳脫能力,讓其優缺能夠達到良好的互補。最後我們使用測試函數對SDGPSO 和SDGPSO-MSP作性能測試並且與幾個已提出的擁有優良校能粒子群演算法作比較。經由模擬結果顯示,本文所提出的單維搜索與經驗重心分享機制在銜接SPSO後整體測試都均具有優越的表現,並且SDGPSO-MSP表現出兩邊所擷取的優點甚至更加優良。
    In this thesis we have presented an improved algorithm for Particle Swarm Optimization (PSO) named Standard Dimension Searching with Center of Gravity PSO algorithm (SDGPSO). The SDGPSO algorithm needs to have a special experience-sharing mechanism to coordinate with single-dimensional searching mechanism. These mechanisms cause the faster convergence ability in the pre-convergence and have less computing time than SPSO. However, The ability to escape local optimal solution is worse than SPSO in the post-convergence. Because of this shortcoming, we further proposed a hybrid version named SDGPSO-MSP which takes advantages of fast and excellent convergence ability from SDGPSO and obtaining the better convergent solution from SPSO. The performances of SDGPSO and SDGPSO-MSP are fairly demonstrated by applying sixteen benchmark problems and compared it with several popular PSO algorithm. The simulations of results show that our proposed methods are effective and gain better performance than other compared PSO algorithms.
    顯示於類別:[電機工程研究所] 博碩士論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    index.html0KbHTML558檢視/開啟


    在NCUIR中所有的資料項目都受到原著作權保護.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 隱私權政策聲明