期刊文献+

变异蚁群优化算法在流水作业排序中的应用 被引量:3

Application of mutating ant colony optimization algorithm on flow-shop scheduling problem
下载PDF
导出
摘要 在采用蚁群算法求解流水作业排序中,针对蚁群算法存在的时间过长及过早收敛问题,使用解锁素及信息素挥发率作为启发式信息并引入局部优化,对蚁群系统加以改进。计算机仿真结果表明,改进后的蚁群系统对流水作业优化调度有较好的效果。 In solving FSSP,the unlocking element and the rate of pheromone evaporating as heuristic information and local optimization used are to develop the basic ACS(Ant Colony System) to solve the problems of premature convergence and two long time in it.And the results of simulation show that the advanced ACS is good at solving the FSSP.
作者 梅宏标 王坚
出处 《计算机工程与应用》 CSCD 北大核心 2007年第24期216-219,229,共5页 Computer Engineering and Applications
基金 国家高技术研究发展计划项目(863)(the National High-Tech Research and Development Plan of China under Grant No.2003AA414120) 上海市科技发展基金重大项目(No.04DZ11007) 上海市科技发展基金重点项目(No.JC14066)
关键词 蚁群算法组合算法排序优化算法 ant colony algorithm grouping algorithm scheduling optimization algorithm
  • 相关文献

参考文献13

  • 1Macro Dorigo Gianni Di Caro,Luca M Gambardella.Ant Alborithms for solving weapon-target at assignment problem[J].Applied Soft Computing,2002,2:39-47.
  • 2Dorigo M,Maniezzo V,Colorni A.Ant System:optimization cooperating agents[J].IEEE Transactions on Systems,Man,and Cyberneticspart B Cybernetics,1996,26(1):29-41.
  • 3Peeters P,Brussel H V,Valckenaers P.Pheromone based emergent shop floor control system for flexible flow shops[J].Artificial Intelligence in Engineering,2001,15:343-352.
  • 4Stutzle T,Darmstadt T U,Alexanderstr.An ant approach to the flow shop problem[EB/OL].http:// citeseer.nj.nec.com/273051.html.
  • 5Takao Okabe,Mikia Maeda.On the fuzzy scheduling for flow shop jobs by using genetic algorithm[J].IEEE Trans actions on Evolutionary Computation,1999,5:528-534.
  • 6Chi Bin,Xing Fei,Ye Qingkai.Flow-shop scheduling problem based improved adaptive genetic algorithms[J].Universitatis Pekinensis,2003,3(3):39.
  • 7汪镭,吴启迪.蚁群算法在连续空间寻优问题求解中的应用[J].控制与决策,2003,18(1):45-48. 被引量:100
  • 8Stutzle T,Hoos H.Max-Min ant system and local search for the traveling salesman problem[J].IEEE International Conference on Evolutionary Computation,1997:309-314.
  • 9Ricardo M de A Silla,Geber L Ramalho.Ant system for the set coveting problem[J].IEEE Transactions on Evolutionary Computation,2001 (1):3129-3134.
  • 10Bern Meyer.Constraint handling and stochastic ranking in ACO[J].IEEE Transactions on Evolutionary Computation,2005 (5):2683-2690.

二级参考文献26

  • 1王颖,谢剑英.一种自适应蚁群算法及其仿真研究[J].系统仿真学报,2002,14(1):31-33. 被引量:232
  • 2蒋建国,夏娜,于春华.基于能力向量发挥率和拍卖的联盟形成策略[J].电子学报,2004,32(F12):215-217. 被引量:20
  • 3[1]Dorigo M, Gambardella L M. Ant colony system: A cooperative learning approach to the travelling salesman problem[J]. IEEE Trans Evol Comp,1997,1(1):53-66.
  • 4[2]Dorigo M, Maniezzo V, Colorni A. Ant system: Optimization by a colony of cooperating agents[J]. IEEE Trans SMC: Part B,1996,26(1):29-41.
  • 5[3]Gambardella L M, Dorigo M. Solving symmetric and asymmetric TSPs by ant colonies[A]. Proc IEEE Int Conf Evol Comp[C]. Piscataway, 1996.622-627.
  • 6[4]Boryczka U, Boryczka M. Generative policies in ant systems for scheduling[A]. 6th European Congr Intell Tech Soft Comp[C]. Bruxelles,1998.1:382-386.
  • 7[5]Boryczka U. Learning with delayed rewards in ant sys-tems for the job-shop scheduling problem[A]. First Int Conf Rough Sets Current Trends Comp[C]. Bruxelles,1998.271-274.
  • 8[6]Gambardella L M, Taillard E D, Dorigo M. Ant colonies for the quadratic assignment problem[J]. J Oper Res Soci,1999,50(2):167-176.
  • 9[7]Maniezzo V,Dorigo M,Colorni A.Algodesk:An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem[J]. European J Oper Res,1995,81(1):188-204.
  • 10[8]Maniezzo V. Exact and approximate nondeterministic tree-search procedures for the quadratic assignment problem[J]. Infor J Comp,1999,11(4):358-369.

共引文献125

同被引文献28

引证文献3

二级引证文献8

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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