| 改进遗传算法解Job-Shop问题 |
| |
| 引用本文： | 朱旭东.改进遗传算法解Job-Shop问题[J].安徽大学学报(自然科学版),2008,32(5). |
| |
| 作者姓名： | 朱旭东 |
| |
| 作者单位： | 广东海洋大学,信息学院,广东,湛江,524088 |
| |
| 基金项目： | 广东省高等教育教学改革工程基金 |
| |
| 摘 要： | 结合Job-Shop问题和遗传算法的特征,提出改进遗传算法,从活性调度的定义推导出抢占式解码算法,并采用基于工件的编码.结合过滤相似个体和动态补充新个体,经过分析及Benchmark问题的测试实例验证,改进的遗传算法在解Job-Shop问题时有良好的效果.
|
| 关 键 词： | 生产调度 遗传算法 Job-Shop 抢占式解码 |
Solving Job-Shop problems with improved genetic algorithm |
| |
| ZHU Xu-dong.Solving Job-Shop problems with improved genetic algorithm[J].Journal of Anhui University(Natural Sciences),2008,32(5). |
| |
| Authors: | ZHU Xu-dong |
| |
| Abstract: | In combination with the characters of Job-Shop problems and Genetic Algorithm,this paper intended to solve Job-Shop problems with race-to-occupy decoding algorithm deduced from the definition of the active schedule.The coding algorithm was based on job order.With its advantages of picking out similar individual and dynamically filling in new ones,the improved genetic algorithm had achieved a better effect in solving Job-Shop problems. |
| |
| Keywords: | Job-Shop |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
