| 改进并行蚁群算法求解置换流水线调度问题 |
| |
| 引用本文： | 黄华,肖菁,张军. 改进并行蚁群算法求解置换流水线调度问题[J]. 计算机工程与设计, 2010, 31(3) |
| |
| 作者姓名： | 黄华 肖菁 张军 |
| |
| 作者单位： | 1. 中山大学,软件学院,广东,广州,510275
2. 中山大学计算机科学系,广东,广州,510275 |
| |
| 基金项目： | 国家自然科学基金项目，国家自然科学基金广东省联合基金重点项目 |
| |
| 摘 要： | 为了解决置换流水线的调度问题,提出了改进的并行蚁群算法.针对置换流水线问题本身的特性,在蚂蚁系统算法(ACS)的基础上,设计出了新的启发式信息算法.在计算大数据量的情况下,通过设计的新规律对数据进行分组,并对分组进行并行计算,然后合并各组最优解来问题的最优解.实验结果表明,该改进方法行之有效,新的启发式信息提高了解的质量,而按数据规律的分组并行不仅缩小查找最优值时间,相比于随机分组的并行算法,更加提高了解的质量.
|
| 关 键 词： | 置换流水线调度 蚁群系统 信息素 启发式算法 并行实现 |
Application of improved parallel ant colony system algorithm for permutation flow-shop scheduling problem |
| |
| HUANG Hua,XIAO Jing,ZHANG Jun. Application of improved parallel ant colony system algorithm for permutation flow-shop scheduling problem[J]. Computer Engineering and Design, 2010, 31(3) |
| |
| Authors: | HUANG Hua XIAO Jing ZHANG Jun |
| |
| Affiliation: | HUANG Hua 1,XIAO Jing 2,ZHANG Jun 2 (1.Software School,Sun Yat-Sen University,Guangzhou 510275,China,2.Department of Computer Science,China) |
| |
| Abstract: | In order to solve the permutation flow-shop scheduling problem(PFSP),advanced ant colony algorithm(ACS)with parallel is put forward According to the properties of the PFSP and the basis of colony system algorithm,a new heuristic algorithm information for the PFSP is designed.Under the situation of calculating large amount data,data is divided into groups by the new regulation,and the data is calculated in each group,and then the optimal solution is acquired by the combination of the optimal solution in each... |
| |
| Keywords: | permutation flow-shop scheduling problem (PFSP) ant colony system (ACS) pheromone heuristic algorithm parallel implement |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
