期刊文献+

基于募集机制的连续蚁群系统及其应用 被引量:4

Recruitment mechanism based continuous ant colony optimization system and its application
下载PDF
导出
摘要 针对经典蚁群算法只适用于离散优化问题的不足,从蚂蚁觅食的生物学行为出发,以寻觅最优食物源为目标,运用蚁群的海量募集和成群募集两种机制,并结合蚂蚁的厌食现象,均衡地搜索,由此构建了适用于连续问题的蚁群优化系统(MG-CACO).经典函数的测试表明,MG-CACO的全局寻优效率高,稳健性良好,尤其对高维问题的适应性强.将MG-CACO用于二甲苯异构化装置的操作条件优化,效果令人满意,其全局寻优性能和稳定性均优于其他方法. Traditional ant colony algorithm is suitable for solving discrete optimization problem, but is rarely used for continuous optimization problem. A new ant colony optimization system called MG-CACO for solving continuous optimization was proposed based on the biological behavior of ant colony foraging. The mechanism of mass recruitment, group recruitment, and the phenomenon of anorexia were embedded into the ant colony optimization system. The performance of MG-CACO was demonstrated through two benchmark functions, the testing results indicated that MG-CACO has good stability and ability for finding the global optimal value. MG-CACO was successfully applied to the optimization of the equipment of xylene isomerization, with the obtained results being better than the reference methods.
出处 《浙江大学学报(工学版)》 EI CAS CSCD 北大核心 2006年第5期748-752,共5页 Journal of Zhejiang University:Engineering Science
基金 国家自然科学基金资助项目(20276063)
关键词 蚁群优化系统 海量募集 成群募集 厌食现象 二甲苯异构化 continuous ant colony system group recruitment mass recruitment the phenomenon of anorexia isomerization of xylene
  • 相关文献

参考文献11

  • 1COLORNI A, DORIGO M, MANIEZZO V. Distributed optimization by ant colonies [C]// Proceeding of 1st European Conference on Artificial Life. Paris:Elsevier Pubishing,1991:134 - 142.
  • 2GAMBARDELLA L M, DORIGO M. Ant-Q:a reinforcement learning approach to the traveling salesman problem [C] // Proceeding of 12th Machine Learning Conference. [S.l.]:Morgan Kaufmann Publishing,1995:252 - 260.
  • 3KINDT V T, MONMARCHE N, TERCINET F, et al.An Ant Colony Optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem [J].European Journal of Operational Research, 2002, 142(2):250 - 257.
  • 4YU I K, SONG Y H. A novel short-term generation scheduling technique of thermal units using ant colony search algorithms [J]. International Journal of Electrical Power and Energy Systems, 2001, 23(6):471 - 479.
  • 5汪镭,吴启迪.蚁群算法在连续空间寻优问题求解中的应用[J].控制与决策,2003,18(1):45-48. 被引量:100
  • 6杨勇,宋晓峰,王建飞,胡上序.蚁群算法求解连续空间优化问题[J].控制与决策,2003,18(5):573-576. 被引量:54
  • 7JAYARAMAN V K, KULKARNI B D, KARALE S,et al. Ant colony framework for optimal design and scheduling of batch plants [J]. Computers and Chemical Engineering, 2000, 24 : 1901 - 1912.
  • 8李志华,陈德钊,庄凌,胡上序.RBF-MCSR方法用于二甲苯异构化装置的建模[J].化工学报,2002,53(6):627-632. 被引量:8
  • 9BECKERS R, GOSS S, DENEUBOURG J L, et al.Colony size, communication and ant foraging strategy[J]. Psyche, 1989, 96:239-256.
  • 10SHI Y, EBERHART R C. Empirical study of particle swarm optimization [C]// Proceeding of 1999 Congress on Evolutionary Computation. New Jersey: IEEE Service Center,1999, 3:1945 - 1950.

二级参考文献39

  • 1汪树玉 杨德铨.优化原理、方法与工程应用[M].杭州:浙江大学出版社,1999..
  • 2[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.
  • 3[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.
  • 4[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.
  • 5[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.
  • 6[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.
  • 7[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.
  • 8[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.
  • 9[8]Maniezzo V. Exact and approximate nondeterministic tree-search procedures for the quadratic assignment problem[J]. Infor J Comp,1999,11(4):358-369.
  • 10[9]Maniezzo V, Colorni A. Ant system applied to the quadratic assignment problem[J]. IEEE Trans Knowl Data Eng,1999,11(5):769-778.

共引文献144

同被引文献54

引证文献4

二级引证文献91

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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