English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 112721/143689 (78%)
Visitors : 49621732      Online Users : 581
RC Version 6.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
    Home ‧ Login ‧ Upload ‧ Help ‧ About ‧ Administer Goto mobile version


    Please use this identifier to cite or link to this item: https://nccur.lib.nccu.edu.tw/handle/140.119/53429


    Title: 開發新的蟻群演算法求解流程式排程問題
    Other Titles: Revised Ant Colony Optimization for Permutation Flow Shop Scheduling
    Authors: 陳春龍
    Contributors: 國立政治大學資訊管理學系
    行政院國家科學委員會
    Keywords: 蟻群演算法;流程式排程問題;總完成時間;啟發式方法
    Date: 2011
    Issue Date: 2012-08-30 15:49:03 (UTC+8)
    Abstract: 本研究擬開發一個新的蟻群演算法來求解常見的流程式排程問題。我們首先開發一個新的費洛蒙 (pheromone) 計算方法來導引蟻群的搜尋機制，然後，我們開發一個新的過濾策略（filter strategy）來預防蟻群的搜尋陷入區域最佳解。如果蟻群的搜尋還是陷入區域最佳解，則我們開發一個新的跳出策略(jumping strategy)來幫助蟻群的搜尋跳出區域最佳解。我們已經使用常用的Taillard 測試問題組來評估新的費洛蒙計算方法、過濾策略和跳出策略的效果，接下來，本研究將使用兩個新的想法完整探討上述的策略對新的蟻群演算法在廣度搜尋能力(explorative capability)與深度搜尋能力(exploitative capability)的影響，以持續改善新的蟻群演算法求解流程式排程問題的效率與效能。
    This research proposes a Revised Ant Colony Optimization (RACO) for the minimization of makespan in permutation flow shop scheduling problems (PFSP-makespan). The proposed algorithm develops a new method to produce pheromone trails for guiding the search and applies a novel filter strategy to keep the search from trapping into local optimums. Also, a new jumping strategy is developed to help the search escape if the search does become trapped at a local optimum. Computational experiments on the well-known Taillard`s benchmark data sets have been performed to evaluate the effects of the pheromone trails updating mechanism, the filter strategy and the jumping strategy. A couple of new ideas will be further applied to thoroughly study the impact of the aforementioned strategies on the explorative capability and the exploitative capability of RACO in order to improve its performance for solving PFSP-makespan.
    Relation: 應用研究
    學術補助
    研究期間:10008~ 10107
    研究經費:563仟元
    Data Type: report
    Appears in Collections:[資訊管理學系] 國科會研究計畫

    Files in This Item:

    File Description SizeFormat
    100-2221-E-004-004.pdf338KbAdobe PDF2557View/Open


    All items in 政大典藏 are protected by copyright, with all rights reserved.


    社群 sharing

    著作權政策宣告 Copyright Announcement
    1.本網站之數位內容為國立政治大學所收錄之機構典藏，無償提供學術研究與公眾教育等公益性使用，惟仍請適度，合理使用本網站之內容，以尊重著作權人之權益。商業上之利用，則請先取得著作權人之授權。
    The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

    2.本網站之製作，已盡力防止侵害著作權人之權益，如仍發現本網站之數位內容有侵害著作權人權益情事者，請權利人通知本網站維護人員(nccur@nccu.edu.tw)，維護人員將立即採取移除該數位著作等補救措施。
    NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback