Advertisement
Published in:
2009 | OriginalPaper | Chapter
A Hybrid Algorithm Based on Tabu Search and Ant Colony Optimization for k-Minimum Spanning Tree Problems
Authors : Hideki Katagiri, Tomohiro Hayashida, Ichiro Nishizaki, Jun Ishimatsu
Published in: Modeling Decisions for Artificial Intelligence
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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 and that the proposed method provides a relatively better performance with solution accuracy over existing algorithms.