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


    題名: A new efficient encoding mode of genetic algorithms for the generalized plant allocation problem
    作者: 侯永昌;Hou, Young-chang;張應華;Chang, Y. H.
    貢獻者: 淡江大學資訊管理學系
    日期: 2004-09-01
    上傳時間: 2009-11-30 13:13:08 (UTC+8)
    出版者: 中央研究院資訊科學研究所
    摘要: This study proposes a novel, efficient means of encoding genetic algorithms to solve the generalized plant allocation problem. The problem relates to allocating products across plants to minimize a total cost function. The proposed encoding method can reduce the search space of solutions more efficiently than the penalty encoding method does. The new encoding method thus exhibits higher performance. It need involve only a few more generations to yield sufficiently good solutions when the number of plants is increased. The penalty encoding method, however, requires many more generations to yield the same solutions. Additionally, a new simultaneous crossover and mutation operation is proposed to enable the new method of encoding chromosomes to run correctly following standard genetic algorithm procedures. In addition to the mathematical certification, the performance of this approach is evaluated using some test problems of various sizes. Solutions obtained by this approach are always efficient.
    關聯: Journal of information science and engineering 20(5), pp.1019-1034
    顯示於類別:[資訊管理學系暨研究所] 期刊論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    0KbUnknown332檢視/開啟
    A new efficient encoding mode of genetic algorithms for the generalized plant allocation problem.pdf198KbAdobe PDF0檢視/開啟
    index.html0KbHTML20檢視/開啟

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

    TAIR相關文章

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