您的位置:首页  > 论文页面

一类求解置换流水车间问题的蚁群算法

发表时间:2013-08-31  浏览量:1469  下载量:584
全部作者: 尚可,冯祖仁,柯良军
作者单位: 西安交通大学机械制造系统工程国家重点实验室
摘 要: 研究置换流水车间问题(permutation flow shop problem,PFSP),其目标是最小化完工时间或最大化完成时间,是著名的NP难组合优化问题。提出一类有限级蚁群优化(finite grade ant colony optimization, FGACO)算法求解PFSP,该算法的主要特点是信息素迹的更新数量独立于目标函数值,并且采用了一种有效的启发信息。通过一种基于旅行商问题(traveling salesman prolem, TSP)的方法把原始PFSP转化成为TSP,然后利用提出的算法求解该TSP. 提出的算法应用于基准问题,实验结果表明所提算法有效。
关 键 词: 系统工程;蚁群算法;有限级信息素;置换流水车间问题
Title: An ant colony algorithm for permutation flow shop problem
Author: SHANG Ke, FENG Zuren, KE Liangjun
Organization: State Key Laboratory for Manufacturing Systems Engineering, Xi’an Jiaotong University
Abstract: In this paper, the permutation flow shop problem (PFSP) with the objective to minimize makespan or maximum completion time was studied, and it was a well-known NP-hard combinatorial optimization problem. An algorithm, called finite grade ant colony optimization (FGACO), was proposed to solve permutation flow shop problem. The main characteristic of this algorithm was that the updated quantities of pheromone trails were independent of objective function values, and an effective heuristic information was adopted. Furthermore, based on traveling salesman problem (TSP) method, the original PFSP was transformed into TSP, then the TSP was solved by the proposed algorithm. The developed algorithm had been applied to the benchmark problems. Comparison results demonstrated that the performance of the proposed algorithm was promising.
Key words: systems engineering; ant colony algorithm; finite grade pheromone; permutation flow shop problem
发表期数: 2013年8月第16期
引用格式: 尚可,冯祖仁,柯良军. 一类求解置换流水车间问题的蚁群算法[J]. 中国科技论文在线精品论文,2013,6(16):1576-1582.
 
0 评论数 0
暂无评论
友情链接