期刊文献+

蚁群算法在搜索引擎系统中的应用研究 被引量:3

Research and Application of Ant Colony Algorithm in Searching Engine System
在线阅读 下载PDF
导出
摘要 蚁群算法是Marco Dorigo等学者在真实蚂蚁觅食行为的启发下提出的一种群智能优化算法。为了优化搜索引擎系统中的搜索代价,文中采用理论分析和实验相结合的方式,研究了蚁群算法在搜索引擎系统中的应用。提出了基于蚁群算法的搜索引擎算法,并设计了适合该算法的搜索引擎系统。从理论上阐述了蚁群算法的开放性和自我动态调整性对搜索引擎系统的适应,在此基础上分析了蚁群搜索引擎算法的优点。实验仿真证明了该算法的有效性和优越性。 Ant colony algorithm is a new swarm intelligence optimization algorithm proposed by Marco Dorigo. It is the action ants searching food that illuminate the professor. With the purpose to optimize the cost of searching engine, the author studied the application of ant colony algorithm in searching engine system. Propose a new ant searching engine algorithm based on ant colony optimization. For the opening and self - adjusted characteristic of ant colony algorithm, in theory,think that this algorithm is suit for distributed searching system. Simulation results also show that the algorithm is valid and effective.
出处 《计算机技术与发展》 2009年第12期21-24,28,共5页 Computer Technology and Development
基金 江苏省自然科学基金基础研究项目(08KJB52007)
关键词 蚁群算法 搜索引擎 启发式算法 群智能 ant colony algorithm searching engine heuristic algorithm swarm intelligence
  • 相关文献

参考文献9

二级参考文献54

  • 1郝晋,石立宝,周家启.具有随机扰动特性的蚁群算法[J].仪器仪表学报,2001,22(z1):350-352. 被引量:8
  • 2Dorigo M, Optimization, learning and natural algorithms, Ph. D, Thesis, Dipartimento di Elettronica, Politecnico di Milano, Italy, 1992.
  • 3Colomi A. Dorigo M., Maniezzo V. Distributed optimization by ant colonies[A]. Proc. 1st European Conf. Artificial Life[C]. Pans,France: Elsevier, 1991 : 134 - 142.
  • 4Colomi A., Dorigo M., Maniezzo V. An investigation of some properties of an ant algorithm [ A ]. Proc. of Parallel Problem ,Solving from Nature (PPSN)[C]. France: Elsevier, 1992:509-520.
  • 5Colomi A., Dorigo M., Maniezzo V. Tmbian M., Belgian J. Ant system for job shop scheduling [ J ]. Operations. Research. Statistics and Computer. Science, 1994, 34( 1 ) : 39 - 53.
  • 6Costa D. Hertz A. and Dubuis O. Imbedding of a sequential algorithm within an evolutionary algorithm for coloring problem in graphs [ J ].Journal of Heuristics, 1995, ( 1 ) : 105 - 128.
  • 7Ying Wang and Jian ying Xie, Ant Colony Optimization For Multicast Routing [ A ], IEEE, Circuits and Systems, 2000. IEEE APCCAS2000. The 2000 IEEE Asia-Pa-cific conferenceon,2000,(12).
  • 8Lu guo ying, Zhang su bing and Liu ze min. Distributed Dynamic Routing Using Ant Algorithm for Telecommu-nication Networks[ A ],IEEE, Comnmnication Technology Proceedings,2000[C]. WCC-IC-CI2000, International Conferenceon. 2000.2(13).
  • 9Griselda Navarro Varela and MarkC, Sinclair, Antcolony Optimlsafion For Virtual-Wavelength-Path Routing and Waveletagth Allocation[ A],IEEE, Evolufion-aryComputation[C], 1999. CEC99. Proceedings of the 1999 Congesson, 1999,3:1816.
  • 10Nspster Home Page. http://www.napster. com.

共引文献70

同被引文献21

  • 1车万翔,刘挺,秦兵,李生.基于改进编辑距离的中文相似句子检索[J].高技术通讯,2004,14(7):15-19. 被引量:66
  • 2唐利,蓝强.对网络搜索引擎的比较研究[J].重庆文理学院学报(自然科学版),2006,5(4):98-102. 被引量:5
  • 3李晓明,闫宏飞,王维民.搜索引擎原理[M].北京:科学出版社,2005:123-124.
  • 4EngelbrechtAP.计算群体智能基础[M].谭营,译.北京:清华大学出版社,2009.
  • 5BARILAN J. Comparing rankings of search results on the Web [ J ]. Information Processing and Management, 2004 (41) :1511 - 1519.
  • 6SILVA A S Da, VELOSO E A, GOLGHER P B, et al. Co B Web A Crawler for the Brazilian Web [ C ]. String Processing and Information Retrieval Symposium, 1999.
  • 7VU L, HAUSWIRTH M, ABEREER K. QoS- based Service Selection and Ranking with Trust and Reputation Management [ C 1. OTM Confederated International Con- ferences. Chvpre, France: [ s.n. ] : 2005.466- 483.
  • 8YANG J J, KORFHAGER. Query Optimization in Infor- mation Retrieval Using Genetic Algorithms [ C ]. Proceed- ings of the Fifth International Conference on Genetic Al- gorithms, 1993. 603 - 611.
  • 9姜小伟.粒子群算法在查询优化中的应用[D].哈尔滨:哈尔滨理工大学,2010.
  • 10KENNEDY J, EBERHART R C. Particle Swarm Optimi- zation[A]. In: Proceedings of IEEE International Con- ference on Neutral Networks[ C]. Australia, 1995, (4) : 1942 - 1948.

引证文献3

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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