This paper considers an efficient approximate algorithm for solving
-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 and that the proposed method provides a relatively better performance with solution accuracy over existing algorithms.
Bitte loggen Sie sich ein, um Zugang zu diesem Inhalt zu erhalten