An Artificial Fish Swarm Algorithm for the Multicast Routing Problem

[1]  Roger F. Malina,et al.  Hidden Order: How Adaptation Builds Complexity by John H. Holland (review) , 2017 .

[2]  J. Kruskal.  On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[3]  G. D. Smith,et al.  Solving the Graphical Steiner Tree Problem Using Genetic Algorithms , 1993 .

[4]  Masumi Ishikawa,et al.  Improving the Performance of Particle Swarm Optimization with Diversive Curiosity , 2008 .

[5]  J. Plesnik.  WORST-CASE RELATIVE PERFORMANCES OF HEURISTICS FOR THE STEINER PROBLEM IN GRAPHS , 1991 .

[6]  Victor J. Rayward-Smith,et al.  On finding steiner vertices , 1986, Networks.

[7]  Peter B. Gibbons,et al.  An algorithm for the steiner problem in graphs , 1982, Networks.

[8]  John E. Beasley,et al.  OR-Library: Distributing Test Problems by Electronic Mail , 1990 .

[9]  George Markowsky,et al.  A fast algorithm for Steiner trees , 1981, Acta Informatica.

[10]  Richard T. Wong,et al.  A dual ascent approach for steiner tree problems on a directed graph , 1984, Math. Program..

[11]  Liu Qing.  Artificial fish swarm algorithm for multiple knapsack problem , 2010 .

[12]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[13]  Stefan Richter,et al.  A Faster Algorithm for the Steiner Tree Problem , 2006, STACS.

[14]  R. Prim.  Shortest connection networks and some generalizations , 1957 .

[15]  Peter J. Angeline,et al.  Evolutionary Optimization Versus Particle Swarm Optimization: Philosophy and Performance Differences , 1998, Evolutionary Programming.

[16]  Reinhard Männer,et al.  Optimization of Steiner Trees Using Genetic Algorithms , 1989, International Conference on Genetic Algorithms.

[17]  Weiguo Liu.  A lower bound for the steiner tree problem in directed graphs , 1990, Networks.

[18]  Zhou Jing.  An optimization method of multistage stations locating in oil transportation based on fish-swarm algorithm , 2008 .

[19]  Dario Landa Silva,et al.  Particle swarm optimization for the Steiner tree in graph and delay-constrained multicast routing problems , 2013, J. Heuristics.

[20]  Siti Mariyam Shamsuddin,et al.  Particle Swarm Optimization: Technique, System and Challenges , 2011 .

[21]  Qing Liu,et al.  An artificial fish swarm algorithm for steiner tree problem , 2009, 2009 IEEE International Conference on Fuzzy Systems.

[22]  Jian Huang,et al.  A novel particle swarm optimization for the Steiner tree problem in graphs , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

[23]  V. J. Rayward-Smith,et al.  The computation of nearly minimal Steiner trees in graphs , 1983 .

[24]  Yalong Zhang,et al.  Fish swarm optimization method for the two-dimensional guillotine cutting problem , 2011 .

[25]  Miran Brezocnik,et al.  Emergence of intelligence in next-generation manufacturing systems , 2003 .

[26]  John E. Beasley.  An algorithm for the steiner problem in graphs , 1984, Networks.

[27]  M. Dror,et al.  Directed Steiner Tree Problem On A Graph: Models, Relaxations And Algorithms , 1990 .

[28]  Qing Liu,et al.  Application of an Artificial Fish Swarm Algorithm in Symbolic Regression , 2013, IEICE Trans. Inf. Syst..

[29]  Qing Liu,et al.  A particle swarm optimization for steiner tree problem , 2010, 2010 Sixth International Conference on Natural Computation.

[30]  Yee Leung,et al.  A genetic algorithm for the multiple destination routing problems , 1998, IEEE Trans. Evol. Comput..

[31]  S. E. Dreyfus,et al.  The steiner problem in graphs , 1971, Networks.

[32]  Yao Yuxia,et al.  Global convergence proof of artificial fish swarm algorithm for solving combinatorial optimization problems , 2012 .