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

Authors:
Hideki Katagiri;Tomohiro Hayashida;Ichiro Nishizaki;Qingqiang Guo
Affiliations:
Faculty of Engineering, Hiroshima University, 1-4-1 Kagamiyama, Higashi-hiroshima, Hiroshima 739-8527, Japan;Faculty of Engineering, Hiroshima University, 1-4-1 Kagamiyama, Higashi-hiroshima, Hiroshima 739-8527, Japan;Faculty of Engineering, Hiroshima University, 1-4-1 Kagamiyama, Higashi-hiroshima, Hiroshima 739-8527, Japan;Faculty of Engineering, Hiroshima University, 1-4-1 Kagamiyama, Higashi-hiroshima, Hiroshima 739-8527, Japan
Venue:
Expert Systems with Applications: An International Journal
Year:
2012

Citing 14
Cited 1

Spanning Trees---Short or Small

SIAM Journal on Discrete Mathematics
Decomposing Matrices into Blocks

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

Computers and Operations Research
Hybrid tabu search for re-entrant permutation flow-shop scheduling problem

Expert Systems with Applications: An International Journal
Ant colony-based algorithm for constructing broadcasting tree with degree and delay constraints

Expert Systems with Applications: An International Journal
New robust and efficient ant colony algorithms: Using new interpretation of local updating process

Expert Systems with Applications: An International Journal
Study of genetic algorithm with reinforcement learning to solve the TSP

Expert Systems with Applications: An International Journal
Using Ant Colony Optimization algorithm for solving project management problems

Expert Systems with Applications: An International Journal
The effect of neighborhood structures on tabu search algorithm in solving course timetabling problem

Expert Systems with Applications: An International Journal
Ant colony optimization for nonlinear AVO inversion of network traffic allocation optimization

Expert Systems with Applications: An International Journal
An approximate solution method based on tabu search for k-minimum spanning tree problems

International Journal of Knowledge Engineering and Soft Data Paradigms
Parallelized genetic ant colony systems for solving the traveling salesman problem

Expert Systems with Applications: An International Journal
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

A random fuzzy minimum spanning tree problem through a possibility-based value at risk model

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	12.05

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 with very short time and that the proposed method provides a better performance with solution accuracy over existing algorithms.