English  |  正體中文  |  简体中文  |  Items with full text/Total items : 25459/26053 (98%)
Visitors : 6690478      Online Users : 49
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU 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://ir.lib.ksu.edu.tw/handle/987654321/12646

    Title: 應用分群蛙跳覓食演算法於避雷器裝設位置之選址規劃
    Authors: 黃世杰;蘇偉府;張哲瑋;劉憲宗;洪得峻
    Contributor: 電機工程系
    Keywords: 避雷器裝設位置;分群蛙跳覓食演算法;架空輸電系統
    arrester placement;shuffled frog leaping algorithm;overhead transmission system
    Date: 2010-12-03
    Issue Date: 2010-12-16 14:37:51 (UTC+8)
    Publisher: 台南縣:崑山科技大學
    Abstract: 本文提出分群蛙跳覓食演算法求解避雷器裝設位置之最佳化。此方法係模擬青蛙覓食期間之彼此信息溝通與移動行為,俾於協助搜尋獲得最充足食物源之位置,而本文之研究主旨即在於將此概念形成之演算法予以延伸應用至避雷器裝設位置之選址規劃,同時與其他演算法比較測試,期以驗證所提之分群蛙跳覓食演算法
    An application of shuffled frog leaping algorithm to assist in the decision-making of the arrestor placement is proposed in this paper. Thus proposed method mimics the food search behavior observed in the frog groups, in which the frogs communicate with each other and make leap
    movement towards the place deemed the most bountiful one, implying that the best solution to the problem can be hence equivalently reached. Then, through the application of such an effective approach, it is applied to determine
    the location for the arrestors to place and compare with the other method, thereby validating the feasibility of the proposed approach for the application investigated.
    Relation: 第31屆電力工程研討會
    Appears in Collections:[電機工程系所 ] 2010第卅一屆電力工程研討會

    Files in This Item:

    File Description SizeFormat
    G0025 論文本文.pdf426KbAdobe PDF800View/Open

    All items in KSUIR are protected by copyright, with all rights reserved.

    ©Kun Shan University Library and Information Center
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback