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
Affiliations:
Graduate School of Engineering, Hiroshima University, Japan 739-8527;Graduate School of Engineering, Hiroshima University, Japan 739-8527;Graduate School of Engineering, Hiroshima University, Japan 739-8527;Graduate School of Engineering, Hiroshima University, Japan 739-8527
Venue:
MDAI '09 Proceedings of the 6th International Conference on Modeling Decisions for Artificial Intelligence
Year:
2009

Citing 6
Cited 0

Spanning Trees---Short or Small

SIAM Journal on Discrete Mathematics
Tabu Search

Tabu Search
Decomposing Matrices into Blocks

SIAM Journal on Optimization
New metaheuristic approaches for the edge-weighted k-cardinality tree problem

Computers and Operations Research
Ant colony system: a cooperative learning approach to the traveling salesman problem

IEEE Transactions on Evolutionary Computation
Ant system: optimization by a colony of cooperating agents

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.