期刊文献+

基于最大最小蚁群算法求解最小点覆盖问题 被引量:4

Research of Minimum Vertex Covering Problem Based on Maximum and Minimum Ant Colony Algorithms
下载PDF
导出
摘要 最小点覆盖问题是组合优化中经典的NP完全问题.最大最小蚁群算法通过对信息素浓度的限定使其不会在好的顶点上变得更强,也不会使过弱的点被忽略从而避免了局部最优现象的出现.针对最小点覆盖问题使用最大最小蚁群算法进行求解,避免了蚁群算法求解最小点覆盖问题时出现的早期停滞现象,通过实验表明算法对最小点覆盖问题的可行性. The minimum vertex covering problem is a classical NP complete problem in combinatorial optimization.The maximum and minimum ant colony algorithm can limit the pheromone concentration so that it will not become stronger at the good vertex or ignore the weak point so as to avoid the occurrence of local optimality.The maximum and minimum ant colony algorithm is used to solve the minimum vertex covering problem,which avoids the early stagnation phenomenon when the ant colony algorithm is used to solve the minimum point covering problem.Experiments show that the algorithm is feasible and effective for the problem of minimum point coverage.
作者 吴佩雯 陈京荣 姬璐烨 WU Pei-wen;CHEN Jing-rong;JI Lu-ye(School of Mathematics and Physics,Lanzhou Jiaotong University,Lanzhou 730030,China)
出处 《兰州交通大学学报》 CAS 2020年第2期114-117,共4页 Journal of Lanzhou Jiaotong University
基金 国家自然科学基金(61463026,61463027) 甘肃省自然科学基金(1610RJZA038)。
关键词 最小点覆盖问题 最大最小蚁群算法 信息素浓度 minimum vertex covering problem max-min ant colony algorism pheromone concentration
  • 相关文献

参考文献4

二级参考文献44

  • 1王颖,谢剑英.一种自适应蚁群算法及其仿真研究[J].系统仿真学报,2002,14(1):31-33. 被引量:232
  • 2张军英,敖磊,贾江涛,高琳.求解TSP问题的改进蚁群算法[J].西安电子科技大学学报,2005,32(5):681-685. 被引量:25
  • 3D S Johnson.Approximation Algorithms for Combinatorial Problems[J].JCSS,1974;9:256~278
  • 4Dorigo M,Gambardella L M.Ant colony system:a cooperative learning approach to the traveling saleman problem[J].IEEE Trans on Evolutionary Computation,1997;1 ( 1 ):53~56
  • 5Gambardella L M,Dorigo M.Ant-Q:a reinforcement learning approach to the travelling salesman problem[C].In:Proc of the 12th Int Conf on Machine Learning,Tahoe City,CA:Morgan Kaufman,1995:252~260
  • 6Colorni A et al.Ant system for job-shop scheduling[J].JORBEL,1994;34( 1 ):39~53
  • 7Costa D,Hertz A.Ants can colour graphs[J].J of the Opnl Res Soc,1997;48(3):295~305
  • 8DiCaro G,Dorigo M.Mobile agents for adaptive routing[C].In:Proc of the 31th Haw aii Int Conf on system,Los Alamitos,CA:IEEE Computer Society Press,1998:74~83
  • 9Kaelbling L P,Littman L M,Moore A M.Reinforcement Learning:A Survey[J].Artif Intell Res,1996;4 ( 1 ):237~285
  • 10Kuntz P,Layzell P,Snyers D.A colony of ant-like agents for partitioning in VLSI technology[C].In:Proc of the 4th European Conf on Artificial Life,Boston:MIT Press,1997:417~424

共引文献30

同被引文献37

引证文献4

二级引证文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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