首页    期刊浏览 2022年01月18日 星期二
登录注册

文章基本信息

  • 标题:GA IMPLEMENTATION OF THE MULTI DIMENSIONAL KNAPSACK PROBLEM USING COMPRESSED BINARY TRIES
  • 本地全文:下载
  • 作者:Sunanda Gupta, Garg M.L.
  • 期刊名称:Advances in Computational Research
  • 印刷版ISSN:0975-3273
  • 电子版ISSN:0975-9085
  • 出版年度:2009
  • 期号:489
  • 页码:43-46
  • 出版社:Bioinfo Publications
  • 摘要:During the last two decades solving combinatorial optimization problems, using genetic algorithms (GA), has attracted the attention of many researchers. The genetic algorithm on which this work is based on uses a special repair operator to prevent the generation of infeasible solutions and to transform each feasible solution into a locally optimal solution. In longer runs it is likely that this algorithm produces candidate solutions that have already been generated and evaluated before. This effect can significantly reduce the algorithm's overall performance. To prevent the reconsideration of already evaluated solutions, a solution based on a Trie is studied. This paper presents the algorithms and data structures for compressing the Binary Trie and incorporates this in the GA implementation of the Multi Dimensional Knapsack Problem.
国家哲学社会科学文献中心版权所有