A hybrid algorithm based on tabu search and ant colony optimization for k-minimum spanning tree problems

This paper considers an efficient approximate algorithm for solving k-minimum spanning tree problems which is one of the combinatorial optimization in networks. A new hybrid algorithm based on tabu search and ant colony optimization is provided. Results of numerical experiments show that the proposed method updates some of the best known values with very short time and that the proposed method provides a better performance with solution accuracy over existing algorithms.

[1]  M. Fischetti,et al.  Weighted k-cardinality trees , 1992 .

[2]  R. Ravi,et al.  Spanning trees short or small , 1994, SODA '94.

[3]  Carlos Eduardo Ferreira,et al.  Decomposing Matrices into Blocks , 1998, SIAM J. Optim..

[4]  Yueh-Min Huang,et al.  Ant colony-based algorithm for constructing broadcasting tree with degree and delay constraints , 2008, Expert Syst. Appl..

[5]  Çagdas Hakan Aladag,et al.  The effect of neighborhood structures on tabu search algorithm in solving course timetabling problem , 2009, Expert Syst. Appl..

[6]  Yan Zhe,et al.  Ant colony optimization for nonlinear AVO inversion of network traffic allocation optimization , 2010 .

[7]  Horst W. Hamacher,et al.  Integer programming approaches tofacilities layout models with forbidden areas , 1998 .

[8]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[9]  Shyi-Ming Chen,et al.  Parallelized genetic ant colony systems for solving the traveling salesman problem , 2011, Expert Syst. Appl..

[10]  Jen-Shiang Chen,et al.  Hybrid tabu search for re-entrant permutation flow-shop scheduling problem , 2008, Expert Syst. Appl..

[11]  Guangzhou Zeng,et al.  Study of genetic algorithm with reinforcement learning to solve the TSP , 2009, Expert Syst. Appl..

[12]  Tomohiro Hayashida,et al.  An approximate solution method based on tabu search for k-minimum spanning tree problems , 2010, Int. J. Knowl. Eng. Soft Data Paradigms.

[13]  Akhil Kumar,et al.  Efficient quorumcast routing algorithms , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[14]  Matteo Fischetti,et al.  Weighted k-cardinality trees: Complexity and polyhedral structure , 1994, Networks.

[15]  Dorit S. Hochbaum,et al.  AnO(logk)-approximation algorithm for thek minimum spanning tree problem in the plane , 2006, Algorithmica.

[16]  Temel Öncan,et al.  A tabu search heuristic for the generalized minimum spanning tree problem , 2008, Eur. J. Oper. Res..

[17]  Hossein Miar Naimi,et al.  New robust and efficient ant colony algorithms: Using new interpretation of local updating process , 2009, Expert Syst. Appl..

[18]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[19]  Christian Blum,et al.  New metaheuristic approaches for the edge-weighted k-cardinality tree problem , 2005, Comput. Oper. Res..

[20]  Hassan M. Emara,et al.  Using Ant Colony Optimization algorithm for solving project management problems , 2009, Expert Syst. Appl..