| 一种求解作业车间调度问题的混和遗传算法 |
| |
| 引用本文： | 赵良辉,邓飞其.一种求解作业车间调度问题的混和遗传算法[J].系统工程与电子技术,2007,29(6):899-902. |
| |
| 作者姓名： | 赵良辉 邓飞其 |
| |
| 作者单位： | 华南理工大学系统工程研究所,广东,广州,510640 |
| |
| 摘 要： | 作业车间调度问题(JSSP)是组合优化问题中的NP难问题。本文提出了以适用于JSSP问题的二进制编码遗传算法为基础,在算法中增加了两种启发式算子:激活算子和瓶颈修复算子,并相应调整算法结构,形成混和遗传算法解决JSSP问题。激活算子以GT算法为依据,将种群中部分个体转化为活动调度个体,是一种较有独创性的新算子;瓶颈修复算子对所得结果进一步优化。算例运行结果表明与其它算法相比,该算法在全局搜索能力和运行效率上都有突出的表现。
|
| 关 键 词： | 作业车间调度问题(JSSP) 混合遗传算法 瓶颈修复 活动调度 |
| 文章编号： | 1001-506X(2007)06-0899-04 |
| 修稿时间： | 2006年6月8日 |
Heuristic genetic algorithm for Job shop scheduling problem |
| |
| ZHAO Liang-hui,DENG Fei-qi.Heuristic genetic algorithm for Job shop scheduling problem[J].System Engineering and Electronics,2007,29(6):899-902. |
| |
| Authors: | ZHAO Liang-hui DENG Fei-qi |
| |
| Abstract: | Job Shop Scheduling Problem is one of the most difficult NP-hard problems.A new Binary-coded Genetic Algorithm(GA) for solving JSSPs is proposed,which introduces two heuristic operators: the Activation operator and the Bottleneck Repair operator.The Activation operator originates from Giffler and Thompson's algorithm,shifting part of the population into active schedules,and the Bottleneck Repair operator improves them further by finding and repairing bottlenecks among operation permutations of schedules iteratively.Experiment results shows the Hybrid GA is outstanding in the global searching and the effectiveness compared to other algorithms. |
| |
| Keywords: | Job shop scheduling problem(JSSP) Hybrid genetic algorithm(HGA) Active schedule Bottleneck repair |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
