| 自适应变异的遗传算法求解Flow Shop问题 |
| |
| 引用本文： | 于文莉,李海,陈亚军.自适应变异的遗传算法求解Flow Shop问题[J].电脑与信息技术,2006,14(4):12-15. |
| |
| 作者姓名： | 于文莉 李海 陈亚军 |
| |
| 作者单位： | 1. 山东工商学院信息与电子工程学院智能计算研究所,山东,烟台,264005
2. 西华师范大学物理与电子信息工程学院,四川,南充,637002 |
| |
| 摘 要： | 针对遗传算法在求解流水车间调度问题中易出现早熟收敛的局限性．提出了自适应变异的遗传算法。该算法在运行的过程中，首先定义了一种新的衡量种群多样性的熵．然后根据熵值来确定变异概率。这种变异增强了遗传算法跳出局部最优解的能力。仿真实例的结果表明了该算法的有效性，最后利用该算法设计并实现了一个简单的服装加工智能调度器。
|
| 关 键 词： | 遗传算法 流水车间调度问题 自适应变异 |
| 文章编号： | 1005-1228(2006)04-0012-04 |
| 修稿时间： | 2006年3月18日 |
Application of genetic algorithm with adaptive mutation to Flow Shop Scheduling Problem |
| |
| YU Wen-li,LI Hai,CHEN Ya-jun.Application of genetic algorithm with adaptive mutation to Flow Shop Scheduling Problem[J].Computer and Information Technology,2006,14(4):12-15. |
| |
| Authors: | YU Wen-li LI Hai CHEN Ya-jun |
| |
| Abstract: | In order to avoid the common defect of early convergence of Genetic Algorithms(GA) in its application to Flow Shop Scheduling Problem,a new Genetic Algorithms with Adaptive Mutation(AMGA) is presented.During the running,a new entropy of the diversity in population is first proposed and then the mutation probability is determined by the entropy.The ability to break away from the local optimum is greatly improved by the mutation.The result of examples verify its better performance.At last,a simple garment processing workshop intelligent scheduler is desired and implemented. |
| |
| Keywords: | Genetic Algorithm(GA) Flow Shop Scheduling Problem(FSP) adaptive mutation |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
