摘要
为了解决多选择背包问题,引入了多重群体遗传算法作为求解方法,根据此问题的特点而制定了具体的杂交、变异方法,设计了遗传算法。在算法中以目标函数加惩罚函数为适应值评价函数,采用新陈代谢的选择策略,以更好地保持进化过程中的遗传多样性。实践表明,引入了多重群体遗传算法之后,求解此问题效率有明显的改善与提高。
In this paper,a new kind of optimization of Multiple -choice knapsack problem and its solving method by Multigroup genetic algorithm are proposed. The complete method of crossover and mutation are designed according to the characteristics of Multiple- choice knapsack problem. In the algorithm,the fitness functions are divided into two parts ,one is the objectives function,and the other is the penalty function. In the process of selection, the strategy of metabolism which chose the individual from multiple generation are used to so as to keep the variation of the individual in the process of the evolution. The result of simulation explained that the effciency of the problem solving has improved greatly after using the method of Multi - group genetic algorithms.
出处
《电脑开发与应用》
2005年第11期8-10,共3页
Computer Development & Applications
基金
湖北省自然科学基金(No.2003ABA045)资助
关键词
遗传算法
多重群体遗传算法
多选择背包问题
种群
genetic algorithm, Multi - group genetic algorithm, Multiple - choice knapsack problem, population
