淡江大學機構典藏:Item 987654321/53880
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 62805/95882 (66%)
Visitors : 3987273      Online Users : 731
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/53880


    Title: 粒子群最佳化演算法之加速裝置
    Authors: 翁慶昌;李世安;余家潤
    Contributors: 淡江大學電機工程學系
    Date: 2009-12-11
    Issue Date: 2011-05-20 15:37:25 (UTC+8)
    Abstract: 本案為一種粒子群最佳化演算法(Particle Swarm Optimization;PSO)之加速裝置,包含:一粒子群初始生成模組;一粒子群飛行更新模組,係連接該粒子群初始生成模組;一粒子群適應值比較模組,係連接該粒子群飛行更新模組;其中,該粒子群初始生成模組係用以生成複數個第一代粒子,並將該複數個第一代粒子提供至該粒子群飛行更新模組;每一代粒子群皆包含複數個粒子,每一代粒子群之複數個粒子皆會經由該粒子群適應值比較模組計算出每個粒子之適應值(Fitness Value)大小,並推得個體最佳解與群體最佳解後提供至該粒子群飛行更新模組;該粒子群飛行更新模組係根據每個粒子之上一代之位置以及該粒子群適應值比較模組所提供之個體最佳解及群體最佳解計算出每個粒子之飛行速度以及進行位置更新,並產生出相對應之複數個子代粒子;該複數個子代粒子會再傳送回該粒子群適應值比較模組求得該複數個子代粒子之個體最佳解與群體最佳解,再經由該粒子群飛行更新模組推衍出相對應之複數個新子代粒子,以此方式不斷衍化生成新的子代粒子,以趨近一問題之最佳解。
    Appears in Collections:[Graduate Institute & Department of Electrical Engineering] Patent

    Files in This Item:

    There are no files associated with this item.

    All items in 機構典藏 are protected by copyright, with all rights reserved.


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - Feedback