淡江大學機構典藏:Item 987654321/68439
English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 60861/93638 (65%)
造訪人次 : 1104402      線上人數 : 25
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/68439


    題名: Improving Genetic Algorithms with Solution Space Partitioning and Evolution Refinements
    作者: Liou, Ay-hwa Andy;Chi, Tzong-heng;Yu, I-jun
    貢獻者: 淡江大學資訊管理學系
    關鍵詞: Evolution Refinement;Genetic Algorithms;Graph Theory;Irregularity Sum;Problem Decomposition
    日期: 2007-08
    上傳時間: 2011-10-23 12:56:23 (UTC+8)
    摘要: Irregular sum problem (ISP) is an issue resulted from mathematical problems and graph theories. It has the characteristic that when the problem size is getting bigger, the space of the solution is also become larger. Therefore, while searching for the feasible solution, the larger the question the harder the attempt to come up with an efficient search. We propose a new genetic algorithm, called the Incremental Improving Genetic Algorithm (IIGA), which is considered efficient and has the capability to incrementally improve itself from partial solutions. The initial solutions can be constructed by satisfying the constraints in stepwise fashion. The effectiveness of IIGA also comes from the allowing of suitable percentage of illegal solutions during the evolution for increasing the effectiveness of searching. The cut-point of the genetic coding for generating the descendants has carefully planned so that the algorithm can focus on the key factors for the contradiction and has the chances to fix it. After comparing the results of IIGA and usual genetic algorithm among different graphs, we found and shown that the performance of IIGA is truly better.
    關聯: Natural Computation, 2007. ICNC 2007. Third International Conference on, v.4, pp.238-242
    DOI: 10.1109/ICNC.2007.439
    顯示於類別:[資訊管理學系暨研究所] 會議論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    Improving Genetic Algorithms with Solution Space Partitioning.pdf221KbAdobe PDF353檢視/開啟
    index.html0KbHTML195檢視/開啟

    在機構典藏中所有的資料項目都受到原著作權保護.

    TAIR相關文章

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