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

Expert Systems with Applications

Volumn 39, Issue 5, 2012, Pages 5681-5686

  Katagiri, Hideki ^a   Hayashida, Tomohiro ^a   Nishizaki, Ichiro ^a   Guo, Qingqiang ^a  

^a HIROSHIMA UNIVERSITY   (Japan)

Author keywords

Ant colony optimization; Approximate solution; Hybrid algorithm; k Minimum spanning tree; Tabu search

Indexed keywords

ANT-COLONY OPTIMIZATION; APPROXIMATE ALGORITHMS; APPROXIMATE SOLUTION; HYBRID ALGORITHMS; K-MINIMUM SPANNING TREE; NUMERICAL EXPERIMENTS; SOLUTION ACCURACY; SPANNING TREE PROBLEMS;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMBINATORIAL OPTIMIZATION; NUMERICAL METHODS; PARALLEL ARCHITECTURES; TREES (MATHEMATICS);

TABU SEARCH;

EID: 84855888656     PISSN: 09574174     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.eswa.2011.11.103     Document Type: Article

References (26)

1. H. Abdallah, H.M. Emara, H.T. Dorrah, and A. Bahgat Using ant colony optimization algorithm for solving project management problems Expert Systems with Applications 36 2009 10004 100015
2. C.H. Aladag, G. Hocaoglu, and M.A. Basaran The effect of neighborhood structures on tabu search algorithm in solving course timetabling problem Expert Systems with Applications 36 2009 12349 12356
3. C. Blum, and M.J. Blesa New metaheuristic approaches for the edge-weighted k-cardinality tree problem Computers & Operations Research 32 2005 1355 1377
4. Börndorfer, R.; Ferreira, C.; & Martin, A. (1997). Matrix decomposition by branch-and-cut, Technical Report, Konrad-Zuse-Zentrum für Informationstechnik, Berlin.
5. R. Börndorfer, C. Ferreira, and A. Martin Decomposing matrices into blocks SIAM Journal on Optimization 9 1 1998 236 269
6. S.-M. Chen, and C.-Y. Chien Parallelized genetic ant colony systems for solving the traveling salesman problem Expert Systems with Applications 38 2011 3873 3883
7. J.-S. Chen, J.C.-H. Pan, and C.-K. Wu Hybrid tabu search for re-entrant permutation flow-shop scheduling problem Expert Systems with Applications 34 2008 1924 1930
8. S.Y. Cheung, and A. Kumar Efficient quorum-cast routing algorithms Proceedings of INFOCOM 1994 IEEE Society Press Los Alamitos, USA, Silver Spring, MD
9. M. Dorigo, and L.M. Gambardella Ant colony system: A cooperative learning approach to the traveling salesman problem IEEE Transactions on Evolutionary Computation 1 1 1997 53 66
10. M. Dorigo, V. Maniezzo, and A. Colorni Ant system: Optimization by a colony of cooperating agents IEEE Transactions on Systems, Man and Cybernetics: Part B 26 1 1996 29 41
11. M. Fischetti, H.W. Hamacher, K. Jörnsten, and F. Maffioli Weighted k-cardinality trees: Complexity and polyhedral structure Networks 24 1994 11 21
12. L.R. Foulds, H.W. Hamacher, and J. Wilson Integer programming approaches to facilities layout models with forbidden areas Annals of Operations Research 81 1998 405 417
13. Freitag, J. (1993). Minimal k-cardinality trees, Master thesis, Department of Mathematics, University of Kaiserslautern, Germany.
14. N. Garg, and D. Hochbaum An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane Algorithmica 18 1 1997 111 121
15. F. Glover, and M. Laguna Tabu search 1997 Kluwer Academic Publishers Dordrecht
16. Hamacher, H. W.; Jörnsten, K.; & Maffioli, F. (1991). Weighted k-cardinality trees, Technical Report 91.023, Politecnico di Milano, Dipartimento di Elettronica, Italy.
17. J. Jörnsten, and A. Løkketangen Tabu search for weighted k-cardinality trees Asia-Pacific Journal of Operational Research 14 2 1997 9 26
18. H. Katagiri, T. Hayashida, I. Nishizaki, and J. Ishimatsu An approximate solution method based on tabu search for k-minimum spanning tree problems International Journal of Knowledge Engineering and Soft Data Paradigms 2 2010 203 274
19. KCTLIB. (2003). .
20. F. Liu, and G. Zeng Study of genetic algorithm with reinforcement learning to solve the TSP Expert Systems with Applications 36 2 2009 6995 7001
21. S.-C. Li, Q.-S. Zhu, Z. Yan, and H.-L. Yan Ant colony optimization for nonlinear AVO inversion of network traffic allocation optimization Expert Systems with Applications 37 2010 8343 8347
22. M.V. Marathe, R. Ravi, S.S. Ravi, D.J. Rosenkrantz, and R. Sundaram Spanning trees short or small SIAM Journal on Discrete Mathematics 9 2 1996 178 200
23. H.M. Naimi, and N. Taherinejad New robust and efficient ant colony algorithms: Using new interpretation of local updating process Expert Systems with Applications 36 1 2009 481 488
24. T. Öncan, J.-F. Cordeau, and G. Laporte A tabu search heuristic for the generalized minimum spanning tree problem European Journal of Operational Research 191 2008 306 319
25. A.B. Philpott, and N.C. Wormald On the optimal extraction of ore from an open-cast mine 1997 University of Auckland New Zealand
26. S.-Y. Tseng, C.-C. Lin, and Y.-M. Huang Ant colony-based algorithm for constructing broadcasting tree with degree and delay constraints Expert Systems with Applications 35 2008 1473 1481