English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 62805/95882 (66%)
造访人次 : 3973041      在线人数 : 482
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻

    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/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
    显示于类别:[資訊管理學系暨研究所] 期刊論文


    档案 描述 大小格式浏览次数
    A new efficient encoding mode of genetic algorithms for the generalized plant allocation problem.pdf198KbAdobe PDF2检视/开启



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