期刊文献+

基于蚁群算法的三维管路优化 被引量:1

Optimization Approach for Pipe Line in 3-D Space Based on Ant Colony Algorithm
下载PDF
导出
摘要 针对目前凝汽器接颈部分管路设计主要采用经验设计方法却没有理论方面支持的问题,提出一种采用蚁群算法对凝汽器接颈部分管路进行优化的方法,以VC++为编程平台,并用Unigraphics NX5进行算法仿真. For solving the recent problem that the design of the pipe line in the condenser's throat mainly depends on the experience but lack of theory, a optimization method for the pipe line in the condenser's throat was introduced by using VC++programming platform and Unigraphics NX5 for algorithm simulation.
出处 《东华大学学报(自然科学版)》 CAS CSCD 北大核心 2008年第3期338-340,共3页 Journal of Donghua University(Natural Science)
关键词 蚁群算法 最短路径 管路优化 凝汽器 ant colony algorithm shortest path pipe line optimization condenser
  • 相关文献

参考文献5

  • 1DORIGO M,STUTZLET蚁群优化[M].张军,胡晓敏,罗旭耀,等译.北京:清华大学出版社,2007:63-111.
  • 2段海滨.蚁群算法原理及应用[M].北京:科学出版社,2005.12.
  • 3程世娟,卢伟,陈虬.基于蚁群算法的最短路径搜索方法研究[J].科学技术与工程,2007,7(21):5706-5708. 被引量:10
  • 4吴庆洪,张纪会,徐心和.具有变异特征的蚁群算法[J].计算机研究与发展,1999,36(10):1240-1245. 被引量:306
  • 5HOCAOGLU C, SANDERSON A C. Multi-Dimensional Path Planning Using Evolutionary Computation [ C]//IEEE World Congress on Computational Intelligence, 1998: 165 - 170.

二级参考文献5

  • 1[2]Colorm A,Dorigo M,Minieaao V.Distributed optimization by ant colonies.Proc of the First European Conf on Artificial Life,Paris,France Elsevier Publishing,1991:134-142
  • 2[3]Dorigo M,Cgmbardella L M.Ant colony system:a cooperative learning approach to the traveling salesman problem.IEEE Trans on Evolutionary Computation,1997,1 (1):53-66
  • 3[5]Colorni A.Ant system for job-shop scheduling.JORBEL,1994,34(1):39-53
  • 4[6]Dorigo M,Cgmbardella L M.Ant colony system:a cooperative learning approach to the traveling salesman problem.IEEE Trans on Evolutionary Computation,1997;1 (1):53-66
  • 5Daniel Costa,Alain Hertz,Clivier Dubuis. Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs[J] 1995,Journal of Heuristics(1):105~128

共引文献375

同被引文献2

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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