期刊文献+

精英策略蚁群算法在求解TSP问题中的应用 被引量:5

在线阅读 下载PDF
导出
摘要 针对经典蚁群算法收敛速度慢的现象,引进精英策略的概念。改进后的算法具有较快的寻优速度和较好的全局搜索能力,算法复杂度为O(NC^*n^*n^*m)。
出处 《中国民航大学学报》 CAS 2007年第A01期106-107,共2页 Journal of Civil Aviation University of China
  • 相关文献

参考文献2

二级参考文献54

  • 1Garey M R,Johnson D S.Computers and Intractability:A Guide to the Theory of NP-Completeness[M].San Francisco:Freeman W H,1979.
  • 2Lawer E,Lenstra J,Ronnooy K A,et al.The Traveling Salesman Problem[M].New York:Wiley-International Publication,1985.
  • 3Hopfield J J,Tank D W.Neural Computation of Decision in Optimization Problem[J].Biol Cybern,1985,52(1):141-152.
  • 4Wilson V,Pawlay G S.On the Stability of the TSP Problem Algorithm of Hopfield and Tank[J].Biol Cybern,1988,58(1):63-70.
  • 5Xu X,Tsai W T.Effective Neural Algorithms for the Traveling Salesman Problem[J].Neural Network,1991,4(1):193-205.
  • 6Wang S,Tsai C M.Hopfield Nets with Time-varying Energy Function for Solving the Traveling Salesman Problem[A].Int J Conf on Neural Networks[C].Seattle,Washington,1991:807-812.
  • 7Aiyer S V B,Niranjan M,Fallside F.A Theoretical Investigation into the Performance of the Hopfield Model[J].IEEE Trans on Neural Networks,1990,1(2):204-215.
  • 8Ackley D H,Hinton G E,Sejnowski T J.A Learning Algorithm for Boltzmann Machines[J].Cognitive Science,1985,9(1):147-169.
  • 9Tang Z,Jin H H,Murao K,et al.A Gradient Ascent Learning for Hopfield Networks[J].Trans of IEICE of Japan,2000,J83-A(3):319-331.
  • 10Shi Y H,Eberhart R C.A Modified Particle Swarm Optimizer[A].IEEE Int Conf on Evolutionary Computation[C].Anchorage,1998:69-73.

共引文献127

同被引文献27

  • 1孙力娟,王良俊,王汝传.改进的蚁群算法及其在TSP中的应用研究[J].通信学报,2004,25(10):111-116. 被引量:38
  • 2赵霞.MAX-MIN蚂蚁系统算法及其收敛性证明[J].计算机工程与应用,2006,42(8):70-72. 被引量:10
  • 3黄挚雄,张登科,黎群辉.蚁群算法及其改进形式综述[J].计算技术与自动化,2006,25(3):35-38. 被引量:22
  • 4章琦,庞小红,吴智铭.约束法蚁群算法在多目标VRP中的研究[J].计算机仿真,2007,24(3):262-265. 被引量:2
  • 5Dorigo M, Vittorio M, Alberto C. The Ant System: Optimization by a Colony of Cooperating Agents. IEEETrans. Systems, Man, and Cybernetics-Part B, 1996,26(1): 1-12.
  • 6Dorigo M, Gambardella LM. Ant Colonies for the Traveling Biosystem, 1997,43(2):73-81.
  • 7Naimihm T. New Robust and Efficient Ant Colony Algorithms: using new interpretation of local updating process. Expert Systems with Applications, 2009(36):481- 488.
  • 8Bazaraa M. Computerized layout design:A branch and bound approach [ J ]. AIIE Transactions, 1975 (7) :432 - 438.
  • 9Tam K Y. Genetic algorithms, function optimization, and fa- cility layout design [ J ]. European Journal of Operational Re- search, 1992 (51 ) :629 - 644.
  • 10Tam K Y. A simulated annealing algorithm forallocating space to manufacturing cells [ J ]. International Journal of Production Research, 1992 (30) :63 - 87.

引证文献5

二级引证文献19

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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