Abstract
Given a connected, weighted, and undirected graph, the minimum routing cost spanning tree problem seeks a spanning tree of minimum routing cost on this graph, where routing cost of a spanning tree is defined as the sum of the costs of the paths connecting all possible pairs of distinct vertices in that spanning tree. This problem has several important applications in networks design and computational biology. In this paper, we have proposed an artificial bee colony (ABC) algorithm-based approach for this problem. We have compared our approach against four best methods reported in the literature—two genetic algorithms, a stochastic hill climber and a perturbation-based local search. Computational results show the superiority of our ABC approach over other approaches.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aho AV, Hopcroft JE, Ullman JD (1983) Data structures and algorithms. Addison-Wesley, Reading, pp 232–233
Basturk B, Karaboga D (2006) An artificial bee colony (ABC) algorithm for numeric function optimization, IEEE Swarm Intelligence Symposium 2006, May 12–14, 2006. Indianapolis, Indiana, USA
Campos R, Ricardo M (2008) A fast algorithm for computing the minimum routing cost spanning tree. Comput Netw 52:3229–3247
Fischetti M, Lancia G, Serafini P (2002) Exact algorithms for minimum routing cost trees. Networks 39:161–173
Grout V (2005) Principles of cost minimization in wireless networks. J Heuristics 11:115–133
Johnson DS, Lenstra JK, Roonoy Kan AHG (1978) The complexity of network design problem. Networks 8:279–285
Julstrom BA (2002) A genetic algorithm and two hill climbers for the minimum routing cost spanning tree problem. In: Arabnia HR, Mun Y (eds) Proceedings of the international conference on artificial intelligence, vol III, CSREA Press, pp 934–940
Julstrom BA (2005) The Blob code is competitive with edge-sets in genetic algorithms for the minimum routing cost spanning tree problem. In: Beyer HG et al (eds) Proceedings of the genetic and evolutionary computation conference 2005 (GECCO-2005), vol 1, pp 585–590, ACM Press
Karaboga D (2005) An idea based on honey bee swarm for numerical optimization, Technical Report TR06. Computer Engineering Department, Erciyes University, Turkey
Karaboga D, Basturk B (2007a) A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. J Glob Optim 39:459–471
Karaboga D, Basturk B (2007b) Artificial bee colony (ABC) optimization algorithm for solving constrained optimization problems. Lecture Notes in Artificial Intelligence, Springer, Berlin, vol 4529, pp 789–798
Karaboga D, Basturk B (2008) On the performance of artificial bee colony (ABC) algorithm. Appl Soft Comput 8:687–697
Karaboga D, Basturk B (2009) A comparative study of artificial bee colony algorithm. Appl Math Comput 214:108–132
Picciotto S (1999) How to encode a tree. PhD thesis, University of California, San Diego
Prim RC (1957) Shortest connection networks and some generalizations. Bell Syst Tech J 36:1389–1401
Raidl GR, Julstrom BA (2003) Edge-sets: an effective evolutionary coding of spanning trees. IEEE Trans Evol Comput 7:225–239
Singh A (2008) A new heuristic for the minimum routing cost spanning tree problem. In: Proceedings of the 11th international conference on information technology (ICIT-2008), 9–13, IEEE CS Press
Singh A (2009) An artificial bee colony algorithm for the leaf-constrained minimum spanning tree problem. Appl Soft Comput 9:625–631
Wong R (1980) Worst case analysis of network design problem heuristics SIAM. J Algebraic Discrete Math 1:51–63
Wu BY, Chao KM (2004) Spanning trees and optimization problems, chapter 4. CRC Press, New York
Wu BY, Lancia G, Bafna V, Chao KM, Ravi R, Tang CY (1999) A polynomial time approximation schemes for minimum routing cost spanning trees. SIAM J Comput 29:761–768
Acknowledgments
We thank Prof. Bryant A. Julstrom for providing the random data set. We also thank two anonymous reviewers for their valuable comments and suggestions which helped in improving the content of this paper. We are grateful to the Department of Science and Technology, Government of India, for their financial support to carry out this research work.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Singh, A., Sundar, S. An artificial bee colony algorithm for the minimum routing cost spanning tree problem. Soft Comput 15, 2489–2499 (2011). https://doi.org/10.1007/s00500-011-0711-6
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00500-011-0711-6