期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

求解零空闲流水线调度问题的改进蚁群算法 被引量：1

Ant-colony heuristic algorithm for no-idle flow shop scheduling problem
在线阅读 下载PDF
导出
摘要 针对零空闲流水线调度问题的最大完工时间,提出一种改进蚁群算法。该算法改进了信息素密度的初始化方法和更新规则,采用新的状态转移策略构建新解,结合快速插入邻域局部搜索算法,解决蚁群算法易陷入局部收敛的缺点,从而提高算法的搜索效率。基于典型算例的仿真实验,表明了改进算法具有高效性和优越性。 This paper proposed an advanced ant colony algorithm for no-idle flow shop problem（NIFS） with makespan criterion.Improved the pheromone density initialization and updating rules by using a hybrid heuristic strategy,adoped a new state transition rule to construct an ant-sequence.Then,presented an local search algorithm based on the speed-up technology for inserting neighborhood structure for overcoming algorithm into the local convergence.And the simulation experiments show that the presented algorithm is effective and superiority in finding optimal or near optimal solutions.
作者 张风荣 段俊华 庞荣波 韩红燕
机构地区 聊城大学计算机科学学院 聊城大学东昌学院 聊城大学数学学院
出处 《计算机应用研究》 CSCD 北大核心 2011年第3期859-861,共3页 Application Research of Computers
基金 华中科技大学数字制造装备与技术国家重点实验室开放课题 中国博士后科学基金资助项目(20070410791)
关键词 蚁群算法 信息素密度 信息素更新规则 零空闲流水线调度 最大完工时间 邻域搜索 ant colony optimization algorithm pheromon density pheromon updating rules no-idle flow shop scheduling makespan local search
分类号 TP18 [自动化与计算机技术—控制理论与控制工程] TP301.6 [自动化与计算机技术—计算机系统结构]
  • 相关文献

参考文献16

  • 1NAWAZ M,JrENSCORE E E,HAM E I.A heuristic algorithm for the m-machine,n-job flowshop sequencing problem[J].Omega,the International Journal of Management Science,1983,11(1):91-95.
  • 2KAMBUROWSKI J.More on three-machine no-idle flow shops[J].Computers and Industrial Engineering,2004,48(3):461-466.
  • 3SAADANI N E H,GUINER A,MOALLA M.A travelling salesman approach to solve the F/no-idle/C《,max》 problem[J].European Journal of Operational Research,2005,161 (16):11-20.
  • 4DORICO M,MANIEZZO V,COLORNI A.The ant system:optimization by a colony of cooperating agents[J].IEEE Trans on Systems,Man and Cybernetics,1996,26(1):29-41.
  • 5RAJENDRAN C,ZIEGLER H.Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs[J].European Journal of Operational Research,2004,155(2):426-428.
  • 6GAJPAL Y,RAJENDRAN C.An ant-colony-optimization algorithm for minimizing the completion-time variance of jobs in flowshops[J].Intemational Journal of Production Economics,2006,101 (2):259-272.
  • 7LIN B M T,LU C Y,SHYU S J,et al.Development of new features of ant colony optimization for flowshop scheduling[J].International Journal of Production Economics,2008,112(2):742-755.
  • 8OZGUR B,SONER H,HUSEYIN C,et al.A new solution algorithm for improving performance of ant colony optimization[J].Applied Mathematics and Computation,2009,211 (1):75-84.
  • 9PAN Quan-ke,WANG Ling.No-idle permutation flow shop scheduling based on a hybrid discrete particle swarm optimization algorithm[J].International Journal Advanced Manufacturing Technology,2008,39(7-8):796-807.
  • 10TAILLARD E.Benchmarks for basic scheduling problems[J].European Journal Operational Research,1993,64(2):278-285.

二级参考文献18

  • 1李亮,迟世春.新型和声搜索算法在土坡稳定分析中的应用[J].水利与建筑工程学报,2007,5(3):1-6. 被引量：14
  • 2刘波,王凌,金以慧.差分进化算法研究进展[J].控制与决策,2007,22(7):721-729. 被引量：294
  • 3PAN Quanke, WANG Ling. A novel differential evolution algorithm for no-idle permutation flow shop scheduling problems [J]. European Journal of Industrial Engineering, 2008,2 (3) : 279-297.
  • 4GEEM Z. Optimal cost design of water distribution networks using harmony search[J]. Engineering Optimization, 2006,38 (3) :259-280.
  • 5GEEM Z, KIM J, LOGANATHAN G. A new heuristic optimization algorithm: harmony search[J]. Simulation, 2001,76 (2) :60-68.
  • 6GEEM Z, KIM J, LOGANATHAN G. Harmony search opti mization application to pipe network design[J]. International Journal of Model Simulation,2002,22(2):125-133.
  • 7OMRAN M G H, MAHDAVI M. Globle-best harmony search [J]. Applied Mathematics and Computation, 2008, 198 ( 2): 643-656.
  • 8MAHDAVI M, FESANGHARY M, DAMANGIR E. An improved harmony search algorithm for solving optimization problems[J]. Applied Mathematics and Computation, 2007, 188(2) : 1567-1579.
  • 9Saadani N E I, Guinet A, Moala M. A traveling salesman approach to solve the f/no-idle/Cmax problem [J]. European J of Operation Research, 2005,161 (1):11-20.
  • 10Kalczynski P J, Kamburowski J. A heuristic for minimizing the makespan in no-idle permutation flow shops[J]. Computer & Industrial Engineering, 2005, 49(1) : 146-154.

共引文献30

同被引文献11

  • 1Baptiste P, Hguny L K.A branch and bound algorithm for the F/no-idle/C [C]//Proceedings of the Interna- tional Conference on Industrial Engineering and Produc- tion Management, IEPM' 97,1997 : 429-438.
  • 2Narain L,Bagga P C.Minimizing total elapsed time sub- ject to zero total idle time machines in nx3 flow shop problem[J].Indian Journal of Pure and Applied Mathe- matics, 2003,34 ( 2 ) : 219-228.
  • 3Pan Q K, Wang L.A novel differential evolution algo- rithm for the no-idle permutation flow shop scheduling problems[J].European Journal of Industrial Engineering, 2008,2 C 3 ) : 279-297.
  • 4Pan Q K,Wang L,Zhao B shop scheduling based on H.No-idle permutation flow a hybrid discrete particle swarm optimization algorithm[J].lnternational Journal of Advanced Manufacturing Technology, 2008,39( 7/8 ) : 796-807.
  • 5Ruiz R, Stutzle T.A simple and effective iterated greedy algorithm for the permutation flow shop scheduling problem[J].European Journal of Operational Research, 2007,177 : 2033-2049.
  • 6Passio K M.Biomimicry of social foraging bacteria for distributed optimization: models, principles, and emer- gent behaviors[J].Journal of Optimization Theory and Applications, 2002,115 (3) ~ 603-628.
  • 7潘全科,王凌,赵保华.解决零空闲流水线调度问题的离散粒子群算法[J].控制与决策,2008,23(2):191-194. 被引量：16
  • 8王亚敏,潘全科,冀俊忠,包云.基于蛙跳算法的零空闲流水线调度问题优化[J].计算机工程与应用,2010,46(17):52-56. 被引量：6
  • 9武磊,潘全科,潘玉霞,桑红燕.求解零空闲流水线调度问题的和声退火算法[J].计算机工程与应用,2010,46(30):221-225. 被引量：4
  • 10任文娟,潘全科,韩红燕.禁忌搜索算法解决零空闲流水线调度问题[J].计算机工程与设计,2010,31(23):5071-5074. 被引量：3

引证文献1

二级引证文献1

计算机应用研究
2011年 第3期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部