摘要
提出了利用遗传算法来解决指派问题,主要将每项任务作为一个基因位,形成染色体,然后借助遗传操作的选择、交叉和变异等操作来对问题进行优化操作。实验结果表明该算法是有效的。
The paper presents the method to solve assignment problem by using genetic algorithm.The method takes every task as an genetic seat,then forms the chromosome, at last makes use of such operations as selections.chiasma and variations to realize optimism.The experiment results show the algorithm is efficient.
出处
《电脑学习》
2005年第6期23-24,共2页
Computer Study
关键词
遗传算法
优化
指派问题
Genetic Algorithm Optimism Assignment Problem