| 求解流水车间调度问题的一种混合式遗传算法 |
| |
| 引用本文： | 梁黎明,汪国强.求解流水车间调度问题的一种混合式遗传算法[J].华南理工大学学报(自然科学版),2001,29(11):85-88. |
| |
| 作者姓名： | 梁黎明 汪国强 |
| |
| 作者单位： | 华南理工大学应用数学系,广东,广州,510640 |
| |
| 摘 要： | 讨论了如何将邻域搜索与遗传算法相结合求解流水车间调度问题，提出了一种邻域结构，使之更适合求解流水车间问题，设计了一种基于扩展采样空间的混合式遗传算法的框架，并通过计算机模拟验证其有效性。
|
| 关 键 词： | 流水车间调度 遗传算法 邻域搜索 邻域结构 扩展采样空间 NP完全问题 |
| 文章编号： | 1000-565X(2001)11-0085-04 |
A Hybrid Genetic Algorithm for Flowshop Scheduling Problem |
| |
| Liang Li_ming,Wang Guo_qiang.A Hybrid Genetic Algorithm for Flowshop Scheduling Problem[J].Journal of South China University of Technology(Natural Science Edition),2001,29(11):85-88. |
| |
| Authors: | Liang Li_ming Wang Guo_qiang |
| |
| Abstract: | This paper introduces a new hybrid algorithm for solving flowshop scheduling problem, which incorporates a genetic algorithm and a neighborhood search algorithm. We define a new effective neighborhood structure and a framework of hybrid genetic algorithm based on expanding sampling space. Some promising results of computation experiment and comparison to other algorithms are reported. |
| |
| Keywords: | flowshop scheduling genetic algorithm neighborhood search |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
