期刊文献+

混合蚁群算法及其在裂解深度建模中的应用 被引量:1

Hybrid Ant Colony Algorithm and Its Application in Modeling of Fragmental Furnace
下载PDF
导出
摘要 设计了一种新的混合蚁群算法,该算法以一种新的二进制蚁群算法为基础,混合PBIL算法及遗传算法的交叉操作和变异操作,从而大大提高了种群的多样性及算法的收敛速度,改善了全局最优解的搜索能力。通过函数优化测试表明该算法具有良好的收敛速度和稳定性,同时将该算法应用到裂解炉裂解深度的神经网络软测量建模中,取得了很好的应用效果。 A kind of new hybrid ant colony algorithm was designed. It used a new binary ant colony algorithm as foundation. Combining with PBIL and the crossover operation and the mutation operation of GA,it had a better ability of breaking away from the local minima. Its population polymorphism and speedy convergence rate were improved remarkably. Optimization simulation results based on typical functions show that the hybrid algorithm has the speedy convergence rate and stability. The availability of algorithm in optimizing neural network is proved by applying neural network in the modeling of depth of fragmentation for fragmental furnace.
出处 《化工自动化及仪表》 CAS 2008年第6期9-13,共5页 Control and Instruments in Chemical Industry
基金 国家"863"计划资助项目(2007AA04Z171) 上海市重点学科建设项目资助(B504) 上海市自然科学基金资助项目(06ZR14027)
关键词 蚁群算法 PBIL 神经网络 遗传算法 ant colony algorithm (ACA) population based incremental learning (PBIL) neural network genetic algorithm
  • 相关文献

参考文献10

  • 1COLORNI,DORIGO M,MANIEZZO,et al. Distributed Optimization by Ant Colonies [ C ]//Proceedings of the 1st European Conference on Artificial Life. 1991:134 -142.
  • 2DORIGO M. Optimization, learning and Natural Algorithms [ D ]. Italy: Department of Electronics,Politecnico di Milano, 1992.
  • 3DORIGO M,MANIEZZO V, COLORNI A. Ant System : Optimization by a Colony of Cooperating Agents[ J ]. IEEE Transaction on System, Man, and Cybernetics-Part B, 1996,26 ( 1 ) : 29 - 41.
  • 4BILCHEV G,PARMEE I C. The Ant Colony Metaphor for Searching Continuous Design Spaces[ C ]//FOGARTY T. AISB Workshop on Evolutionary Computing. 1995,993:25 - 39.
  • 5MONMARCHE N,VENTURINI G,SLIMANE M. On How Pachycondyla Apical is Ants Suggest a New Search Algorithm[J]. Future Generation Computer Systems ,2000,16 (8) :937 - 946.
  • 6DREO J,SIARRY P. Continuous Interacting Ant Colony Algorithm Based on Dense Hierarchy [ J ]. Future Generation Computer Systems,2004,20 (5) :841 - 856.
  • 7段海滨,马冠军,王道波,于秀芬.一种求解连续空间优化问题的改进蚁群算法[J].系统仿真学报,2007,19(5):974-977. 被引量:74
  • 8陈烨.用于连续函数优化的蚁群算法[J].四川大学学报(工程科学版),2004,36(6):117-120. 被引量:67
  • 9熊伟清,魏平.二进制蚁群进化算法[J].自动化学报,2007,33(3):259-264. 被引量:52
  • 10周树德,孙增圻.分布估计算法综述[J].自动化学报,2007,33(2):113-124. 被引量:209

二级参考文献108

  • 1王颖,谢剑英.一种自适应蚁群算法及其仿真研究[J].系统仿真学报,2002,14(1):31-33. 被引量:232
  • 2段海滨,王道波,朱家强,黄向华.蚁群算法理论及应用研究的进展[J].控制与决策,2004,19(12):1321-1326. 被引量:211
  • 3Macro Dorigo, Gianni Di Caro, Luca M Gambardella. Ant algorithms for discrete optimization[J]. Artificial Life,1999,5(3):137-172.
  • 4Shapiro J L. Drift and scaling in estimation of distribution algorithms. Evolutionary Computation, 2005, 13(1):99-123
  • 5Zhang Q, Miihlenbein H. On the convergence of a class of estimation of distribution algorithms. IEEE Transactions on Evolutionary Computation, 2004, 8(2): 127-136
  • 6Zhang Q. On the convergence of a factorized distribution algorithm with truncation selection[Online], available: http://cswww.essex.ac.uk/staff/zhang/EDAWEB/,May 10, 2006
  • 7Zhang Q. On stability of fixed points of limit models of univariate marginal distribution algorithm and factorized distribution algorithm. IEEE Transactions on Evolutionary Computation, 2004, 8(1): 80-93
  • 8Rastegax R, Meybodi M Ft. A study on the global convergence time complexity of estimation of distribution algorithms. Lecture Notes in Computer Science, 2005, 3641:441-450
  • 9Gao Y, Culberson J. Space complexity of estimation of distribution algorithms. Evolutionary Computation, 2005,13(1): 125-143
  • 10Pelikan M, Sastry K, Goldberg D E. Scalability of the Bayesian optimization algorithm. International Journal of Approximate Reasoning, 2002, 31(3): 221-258

共引文献387

同被引文献15

引证文献1

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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