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

基于蚁群算法的加权路径选择方案——智能大厦间导游

A Plan for Selecting Weighed Path Based on Ant Colony Optimization Algorithm——Traveling between Intelligent Buildings
下载PDF
导出
摘要 随着现代化小区规模日益增大,小区内能提供智能大厦位置查询与智能大厦间导游已日益凸显其重要性。通过对蚁群算法改进,解决其过早出现停滞现象以及加快搜索速度;同时通过对路径加权,选择出更加符合实际情况的优先路径。经测试后,效果明显。 As the scale of Morden Residential District（RD） growing up,to provide queries of the sites of Intelligent Buildings and guide of the RD is more and more meaningful.To solve the early stagnating state problem and accelerate the speed of searching by using the ant colony optimization algorithm.At the same time,To select a proper actual path by weighing it.Testing shows the result is good.
作者 宋奎 冉春玉 荆晶
机构地区 武汉理工大学计算科学与技术学院 首都师范大学信息工程学院
出处 《计算机工程与应用》 CSCD 北大核心 2006年第26期198-200,共3页 Computer Engineering and Applications
基金 湖北省建设科技开发项目(编号:K200333)
关键词 蚁群算法 智能大厦 加权路径 ant colony optimization（ACO） algorithm,intelligent building（IB）,weight path
分类号 TP301 [自动化与计算机技术—计算机系统结构]
  • 相关文献

参考文献6

  • 1Marco Dorigo M.Ant Colony System:A cooperative learning approach to the traveling salesman problem[J].IEEE Transactions on evolutionary computation,1997; 1 (1):53～66
  • 2Dorigo M,Maniezzo V,Colorni A.The Ant System:Optimization by a Colony of Cooperating Agents[J].IEEE Transaction on System,Man,and Cybernetics-Part B,1996 ;26 (1)
  • 3Thomas Stutzle,Holger H Hoos.MAX-MIN Ant System[J].Future Generation Computer Systems,2000; 16:889～914
  • 4Martin Middendorf,Frank Reischle,Hartmut Schmeck.Multi Colony Ant Algorithms[J].Journal of Heuristics,2002; 8:305～320
  • 5李开荣,陈宏建,陈崚.一种动态自适应蚁群算法[J].计算机工程与应用,2004,40(29):149-152. 被引量：20
  • 6毕军,付梦印,张宇河.一种改进的蚁群算法求解最短路径问题[J].计算机工程与应用,2003,39(3):107-109. 被引量：45

二级参考文献13

  • 1Dorigo M,Maniezzo V,Colorni A.Ant system:optimization by a colony of cooperating agents[J].IEEE Transactions on SMC, 1996 ;26 ( 1 ): 8～41
  • 2Dorigo M ,Gambardella L M.Ant colony system:a cooperative learning approach to the traveling salesman problem[J].IEEE Transactions on Evolutionary Computing, 1997; 1 ( 1 ): 53～56
  • 3Colorni A ,Dorigo M ,Maniezzo V.Ant colony system for job-shop scheduling[J].Belgian Journal of Operations Research Statistics and Computer Science, 1994;34( 1 ) :39～53
  • 4Maniezzo V.Exact and approximate nonditerministic tree search procedures for the quadratic assignment problem[J].Informs Journal of Computer, 1999; 11 (4) :358～369
  • 5Maniezzo V,Carbonaro A.An ANTS heuristic for the frequency assignment problem[J].Future Generation Computer Systems,2000;16(8):927～935
  • 6Gambardella L M,Dorigo M.HAS-SOP:an hybrid ant system for the sequential ordering problem[R].Technique Report,No IDSIA 97-11,IDSIA, Lugano, Switzerland, 1997
  • 7Gambardella L M,Dorigo M.Ant-Q :a reinforcement learning approach to the traveling salesman problem[C].In:Prieditis A,Russell S eds.Proceedings of the 12th International Conference on Machine Learning,Tahoe City, CA: Morgan Kaufmann, 1995: 252～260
  • 8Dorigo M,Luca M.A study of some properties of Ant-Q[R].Technical Report TR/IRIDIA/1996-4,IRIDIA,Université Libre de Brnxelles,1996
  • 9Stutzle T,Hoos H H.Improvements on the ant system:introducing the MAX-MIN ant system[C].In:Artificial Neural Networks and Genetic Algorithms, New York :Springer-Verlag, 1988: 245～249
  • 10Bilchev G,Parmee I C.Adaptive search strategies for heavily constrained design spaces[C].In:Proceedings of 22nd International Conference on Computer Aided Design' 95, Yelta: Ukraine, 1995:230～235

共引文献62

计算机工程与应用
2006年 第26期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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