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

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.

Applying Optimized Support Vector Regression Models for Prediction of Tunnel Boring Machine Performance

“…The number of the onlooker bees or the employed bees is equal to the number of solutions in the population (Kang et al 2009). The ABC algorithm is an iterative algorithm and has three control parameters: colony size (number of employed bees or food source positions), maximum iteration number, and the limit value (Kang et al 2009;Karaboga and Basturk 2008;Singh 2009;Wang et al 2010). The ABC search method is used to optimize values of C, r and e parameters in SVR.…”

“…The artificial bee colony algorithm is a populationbased metaheuristic approach introduced by Karaboga (Singh 2009). In the ABC algorithm, the position of a food source represents a possible solution to the optimization problem, and the nectar amount of a food source corresponds to the quality (fitness) of the solution.…”

Bees algorithm for solving minimum routing cost spanning tree problem.

“…Thứ hai là các thuật toán meta-heuristic dạng quần thể như thuật toán bầy kiến [11], thuật toán di truyền [3,14], thuật toán bầy ong [12],... Có thể nhận xét rằng: Các thuật toán xấp xỉ và heuristic cho lời giải chất lượng chưa cao, các thuật toán meta-heuristic cho lời giải tốt hơn. Bài báo này trình bày thuật toán bầy ong giải bài toán MRCST, và với một số cải tiến cụ thể đã cải thiện được chất lượng của lời giải.…”

Optimal power flow using artificial bee colony algorithm with global and local neighborhoods

“…The swarm updating in ABC is due to two processes namely, the variation process and the selection process which are responsible for exploration and exploitation, respectively. The ABC algorithm has successfully been tested on almost all domains of science and engineering like electronics engineering (Chidambaram and Lopes 2009;Kavian et al 2012), electrical engineering (Jones and Bouffet 2008;Nayak et al 2009;Sulaiman et al 2012), computer science engineering (Karaboga and Cetinkaya 2011;Lam et al 2012;Lei et al 2010), mechanical engineering (Banharnsakun et al 2012;Pawar et al 2008;Xu and Duan 2010), civil engineering (Akay and Karaboga 2012;Li et al 2011;Mandal et al 2012), medical pattern classification and clustering problems (Karaboga et al 2008) and mathematical graph problems (Xing et al 2007;Singh 2009;Yeh and Hsieh 2011). Many of the recent modifications and applications of ABC algorithm can be studied in Bansal et al (2013b).…”