| 改进的遗传算法在作业调度中的应用 |
| |
| 引用本文： | 李佳,彭玉青,胡希文.改进的遗传算法在作业调度中的应用[J].计算机工程与科学,2008,30(10):48-50. |
| |
| 作者姓名： | 李佳 彭玉青 胡希文 |
| |
| 作者单位： | 1. 河北工业大学计算机科学与软件学院,天津,300401
2. 沧州广播电视大学,河北,沧州,061001 |
| |
| 摘 要： | 作业调度问题（JSP）是一类典型的NP-hard问题，遗传算法作为一种通用的优化算法在求解JSP中得到了广泛的应用。本文主要针对作业车间调度问题，基于改进的遗传算法 ，根据种群的进化状况，从而确定种群的适应度值，使之能够保持种群的多样化。
|
| 关 键 词： | 作业车间调度 遗传算法 自适应遗传算法 |
Modified Genetic Algorithms for Job-Shop Scheduling Problems |
| |
| LI Jia,PENG Yu-qing,HU Xi-wen.Modified Genetic Algorithms for Job-Shop Scheduling Problems[J].Computer Engineering & Science,2008,30(10):48-50. |
| |
| Authors: | LI Jia PENG Yu-qing HU Xi-wen |
| |
| Abstract: | The job-shop scheduling problem(JSSP)is one of the most difficult combinatorial optimization problems,and it is also a typical NP-hard problem.GA(Genetic Algorithm),as a current optimized algorithm,has been used widely for JSP.In order to solve the problem of job-shop scheduling,and according to the condition of population evolution,this paper presents a new adaptive algorithm with a new crossover and mutation method based on the improved genetic algorithm,and realizes a multi-population crossover in order to keep the population's diversification. |
| |
| Keywords: | job-shop scheduling genetic algorithm adaptive genetic algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与科学》浏览原始摘要信息 |
|
点击此处可从《计算机工程与科学》下载全文 |
|
