论文信息 - An approach of ant algorithm for solving minimum routing cost spanning tree problem

An approach of ant algorithm for solving minimum routing cost spanning tree problem

Minimum routing cost spanning tree problem-MRCT is one of classical problems in network designing. In this paper, we will introduce a new approach of applying, conducting implementation experiments and analyzing some aspects of using ant algorithm for MRCT problem.

[1] Manuel López-Ibáñez,et al. Ant colony optimization , 2010, GECCO '10.

[2] Manuel Ricardo,et al. A fast algorithm for computing minimum routing cost spanning trees , 2008, Comput. Networks.

[3] Kun-Mao Chao,et al. Spanning trees and optimization problems , 2004, Discrete mathematics and its applications.

[4] Xin-She Yang,et al. Nature-Inspired Metaheuristic Algorithms , 2008 .

[5] William H. Press,et al. Numerical recipes: the art of scientific computing, 3rd Edition , 2007 .

[6] William H. Press,et al. Numerical Recipes 3rd Edition: The Art of Scientific Computing , 2007 .

[7] Matteo Fischetti,et al. Exact algorithms for minimum routing cost trees , 2002, Networks.

[8] Xin-She Yang,et al. Nature-Inspired Metaheuristic Algorithms: Second Edition , 2010 .

[9] Vic Grout,et al. Principles of Cost Minimisation in Wireless Networks , 2005, J. Heuristics.

[10] J. E. Glynn,et al. Numerical Recipes: The Art of Scientific Computing , 1989 .

[11] Walter J. Gutjahr,et al. Mathematical runtime analysis of ACO algorithms: survey on an emerging issue , 2007, Swarm Intelligence.

[12] Frank Neumann,et al. Design and Management of Complex Technical Processes and Systems by Means of Computational Intelligence Methods Runtime Analysis of a Simple Ant Colony Optimization Algorithm Runtime Analysis of a Simple Ant Colony Optimization Algorithm , 2022 .