| 改进遗传算法求解作业车间提前/拖期调度问题 |
| |
| 引用本文： | 葛安华,周晏明,李权章. 改进遗传算法求解作业车间提前/拖期调度问题[J]. 森林工程, 2013, 0(3): 138-141 |
| |
| 作者姓名： | 葛安华 周晏明 李权章 |
| |
| 作者单位： | 东北林业大学工程技术学院,哈尔滨150040 |
| |
| 基金项目： | 国家林业公益性行业科研专项项目（201104007） |
| |
| 摘 要： | 为解决作业车间提前/拖期调度问题,提出一个以最小惩罚为目标的改进遗传算法。该算法采用双染色体矩阵编码方式,利用部分映射交叉重排算子对父代个体进行交叉操作,提供了一种可以保留较高适应度个体的记忆功能,并利用爬山算法对记忆库进行更新,提高算法的局部搜索能力及收敛速度。仿真实验表明,与其他算法相比,该算法的搜索效率更高,收敛性能更好,求解的调度方案更优。
|
| 关 键 词： | 作业车间 遗传算法 记忆功能 爬山算法 |
Improved Genetic Algorithm for the Job-shop Earliness/ Tardiness Scheduling Problem |
| |
| Ge Anhua,Zhou Yanming,Li Quanzhang. Improved Genetic Algorithm for the Job-shop Earliness/ Tardiness Scheduling Problem[J]. Forest Engineering, 2013, 0(3): 138-141 |
| |
| Authors: | Ge Anhua Zhou Yanming Li Quanzhang |
| |
| Affiliation: | (College of Engineering and Technology, Northeast Forestry University, Harbin 150040) |
| |
| Abstract: | To solve the job-shop earliness/tardiness scheduling problem, an improved genetic a/gorithm whose objective is to mini- mize punishment was presented. The algorithm is based on the Pairs of chromosomes-Matrix Coding and the partially - mapping- Rear- rangement crossover operator. It provides a memory function to retain the higher fitness individuals and hill-climbing algorithm to update the memory. A case study was presented to verify the effectiveness of the method. The simulation experiment showed that compared to other algorithms the improved algorithm has higher local search ability and search speed and a better schedulinz scheme can be obtained. |
| |
| Keywords: | job shop genetic algorithm memory function hill-climbing algorithm |
| 本文献已被 维普 等数据库收录！ |
|
