期刊文献+

一种优化的蚁群算法 被引量:1

下载PDF
导出
摘要 蚁群算法是一种新型的启发式算法,它具有许多优良性质,被广泛用于求解组合优化问题,但基本蚁群算法也存在诸多不足。为使蚊群算法对应TSP问题的解更加优良,提出了一种改进的蚁群算法并对它进行了试验,结果表明改进算法是有效的,这也为蚁群算法的优化提供了一个新的途径。
作者 夏显清
出处 《软件导刊》 2010年第8期65-66,共2页 Software Guide
  • 相关文献

参考文献3

二级参考文献22

  • 1马振华 刘坤林 等.运筹学与最优化理论卷[M].北京:清华大学出版社,1998.254-278.
  • 2马振华 等.运筹学与最优化理论卷[M].清华大学出版社,1998.138-140.
  • 3A.Colorni,M.Dorigo and V.Maniezzo, "Distributed optimization by ant colonies" in Proc.First Europ.Conf.Artificial Life, F.Varela and P.Bourgine, Eds.Paris, France:Elsevier,1991,pp.134-142
  • 4A.Colorni,M.Dorigo and V.Maniezzo, "An investigation of some properties of an ant algorithm," in Proc. Parallel Problem Solving from Nature Conference(PPSN'92), R.Manner and B.Manderick Eds.Brussels, Belgium:Elsevier,1992,pp.509-520
  • 5M.Dorigo, "Optimization learning and natural algorithms," Ph.D.Thesis, Dip.Elettronica e Informazione, Politecnico di Milano, Italy, 1992.
  • 6Marco Dorigo, Vittorio Maniezzo, Alberto Colorni, "Ant System:Optimizaition by a Colony of Cooperating Agents". IEEE Transactions on Systems, Man and Cybernetics-part, Vol.26.NO.1.February 1996
  • 7V.Maniezzo, A.Colorni and M.Dorigo, "The ant system applied to the quadratic assignment problem," Tech.Rep.IRIDIA/94-28.Universite Libre de Bruxelles, Belgium, 1994
  • 8S.Goss,R,.Beckers, J.L. Denbourg, S. Aron and J.M. Pasteels, "How trail laying and trail following can solve foraging problems for ant colonies, " in Behavioral Mechanisms of Food Selection, R.N. Hughes Ed., NATO-ASI Series. Berlin:Springer-Verlag, vol.G20,1990.
  • 9A.Colorni, M.Dorigo, V.Maniezzo and M.Trubian, "Ant system for job-shop scheduling," JORBEL-Belgian J. Oper.Res., Statist.Comp.Sci., Vol.34,no.1,pp.39-53
  • 10Peter Merz and Bernd Freisleben, A Comparison of Memetic Algorithms, Tabu Search, and Ant Colonies for the Quadratic Assignment Problem",IEEE, Evolutionary Computation, 1999.CEC 99. Proceedings of the 1999 Congress on, 1999-2017 Vol.3

共引文献396

同被引文献10

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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