|
|||||
|
|
| 基于蚁群算法的车间作业调度问题研究 | |
| 引用本文： | 姬耀锋,党培,郭小波.基于蚁群算法的车间作业调度问题研究[J].计算机与数字工程,2011,39(1):4-6,52. |
| 作者姓名： | 姬耀锋 党培 郭小波 |
| 作者单位： | 1. 郑州职业技术学院机械工程系,郑州,450121;河南工业大学机电工程学院,郑州,450052 2. 河南工业大学机电工程学院,郑州,450052 3. 河南工程学院计算机科学与工程系,郑州,451191 |
| 基金项目： | 河南省教育厅基础研究项目(编号:2003520261)资助 |
| 摘 要： | 对基于蚁群算法的车间作业调度问题求解进行了研究,在分析了传统蚁群算法求解车间作业调度问题容易出现早熟、收敛于局部最优解以及搜索速度慢的缺陷,提出了一种改进的混合蚁群算法。该方法在信息素更新规则上利用信息素局部更新策略和全局更新策略来进行信息素的更新,并将领域搜索与蚁群算法相结合,从而求得问题的可行解。最后,基于benchmarks问题进行了实验仿真,实验结果证明该改进混合算法的有效性及可行性。 |
| 关 键 词： | 车间作业调度问题 蚁群算法 局部更新 全局更新 |
Study of Job Shop Scheduling Problem Based on an Improved Ant Colony Algorithm |
|
| Ji Yaofeng,Dang Pei,Guo Xiaobo.Study of Job Shop Scheduling Problem Based on an Improved Ant Colony Algorithm[J].Computer and Digital Engineering,2011,39(1):4-6,52. | |
| Authors: | Ji Yaofeng Dang Pei Guo Xiaobo |
| Affiliation: | Ji Yaofeng1),2) Dang Pei2) Guo Xiaobo3)(Department of Mechanical Engineering,Zhengzhou Technical College1),Zhengzhou 450121) (College of Mechanical & Electrical Engineering,Henan University of Technology2),Zhengzhou 450052) (Department of Computer Science &Engineering,Henan Institute of Engineering3),Zhengzhou 451191) |
| Abstract: | First,the thesis researches the solving of the Job Shop Scheduling Problem(JSSP) based on the Ant Colony Algorithm(ACA),and analyses the faults of the solving of the JSSP based on the traditional ACA,such as easy earliness,converging local optimal solution and search speed solw,the thesis puts an improved hybrid Ant Colony Algorithm.This algorithm carries out the update by using the pheromone update rule on the local pheromone update strategy and the global pheromone update strategy,and combines the field o... |
| Keywords: | job shop scheduling problem ant colony algorithm local update global update |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ | |
