An artificial bee colony algorithm for the minimum routing cost spanning tree problem

Soft Computing

Volumn 15, Issue 12, 2011, Pages 2489-2499

  Singh, Alok ^a   Sundar, Shyam ^a  

^a UNIVERSITY OF HYDERABAD   (India)

Author keywords

Artificial bee colony algorithm; Constrained optimization; Heuristic; Minimum routing cost spanning tree; Swarm intelligence

Indexed keywords

ARTIFICIAL BEE COLONIES; COMPUTATIONAL BIOLOGY; COMPUTATIONAL RESULTS; COST SPANNING TREE PROBLEM; HEURISTIC; LOCAL SEARCH; MINIMUM ROUTING COST SPANNING TREE; SPANNING TREE; SWARM INTELLIGENCE; UNDIRECTED GRAPH;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; BIOINFORMATICS; CELLULAR AUTOMATA; CONSTRAINED OPTIMIZATION; COSTS; PARALLEL ARCHITECTURES;

TREES (MATHEMATICS);

EID: 81155134996     PISSN: 14327643     EISSN: 14337479     Source Type: Journal    
DOI: 10.1007/s00500-011-0711-6     Document Type: Article

References (21)

1. Aho AV, Hopcroft JE, Ullman JD (1983) Data structures and algorithms. Addison-Wesley, Reading, pp 232-233.
2. 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.
3. Campos R, Ricardo M (2008) A fast algorithm for computing the minimum routing cost spanning tree. Comput Netw 52: 3229-3247.
4. Fischetti M, Lancia G, Serafini P (2002) Exact algorithms for minimum routing cost trees. Networks 39: 161-173.
5. Grout V (2005) Principles of cost minimization in wireless networks. J Heuristics 11: 115-133.
6. Johnson DS, Lenstra JK, Roonoy Kan AHG (1978) The complexity of network design problem. Networks 8: 279-285.
7. 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.
8. 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.
9. Karaboga D (2005) An idea based on honey bee swarm for numerical optimization, Technical Report TR06. Computer Engineering Department, Erciyes University, Turkey.
10. 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.
11. 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.
12. Karaboga D, Basturk B (2008) On the performance of artificial bee colony (ABC) algorithm. Appl Soft Comput 8: 687-697.
13. Karaboga D, Basturk B (2009) A comparative study of artificial bee colony algorithm. Appl Math Comput 214: 108-132.
14. Picciotto S (1999) How to encode a tree. PhD thesis, University of California, San Diego.
15. Prim RC (1957) Shortest connection networks and some generalizations. Bell Syst Tech J 36: 1389-1401.
16. Raidl GR, Julstrom BA (2003) Edge-sets: an effective evolutionary coding of spanning trees. IEEE Trans Evol Comput 7: 225-239.
17. 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.
18. Singh A (2009) An artificial bee colony algorithm for the leaf-constrained minimum spanning tree problem. Appl Soft Comput 9: 625-631.
19. Wong R (1980) Worst case analysis of network design problem heuristics SIAM. J Algebraic Discrete Math 1: 51-63.
20. Wu BY, Chao KM (2004) Spanning trees and optimization problems, chapter 4. CRC Press, New York.
21. 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.