The artificial bee colony (ABC) algorithm is a swarm-based metaheuristic optimization technique, developed by inspiring foraging and dance behaviors of honey bee colonies. ABC consists of four phases named as initiali...The artificial bee colony (ABC) algorithm is a swarm-based metaheuristic optimization technique, developed by inspiring foraging and dance behaviors of honey bee colonies. ABC consists of four phases named as initialization, employed bee, onlooker bee and scout bee. The employed bees try to improve their solution in employed bees phase. If an employed bee cannot improve self-solution in a certain time, it becomes a scout bee. This alteration is done in the scout bee phase. The onlooker bee phase is placed where information sharing is done. Although a candidate solution improved by onlookers is chosen among the employed bee population according to fitness values of the employed bees, neighbor of candidate solution is randomly selected. In this paper, we propose a selection mechanism for neighborhood of the candidate solutions in the onlooker bee phase. The proposed selection mechanism was based on information shared by the employed bees. Average fitness value obtained by the employed bees is calculated and those better than the aver- age fitness value are written to memory board. Therefore, the onlooker bees select a neighbor from the memory board. In this paper, the proposed ABC-based method called as iABC were applied to both five numerical benchmark functions and an estimation of energy demand problem. Obtained results for the problems show that iABC is better than the basic ABC in terms of solution quality.展开更多
The gravitational search algorithm (GSA) is a population-based heuristic optimization technique and has been proposed for solving continuous optimization problems. The GSA tries to obtain optimum or near optimum solut...The gravitational search algorithm (GSA) is a population-based heuristic optimization technique and has been proposed for solving continuous optimization problems. The GSA tries to obtain optimum or near optimum solution for the optimization problems by using interaction in all agents or masses in the population. This paper proposes and analyzes fitness-based proportional (rou- lette-wheel), tournament, rank-based and random selection mechanisms for choosing agents which they act masses in the GSA. The proposed methods are applied to solve 23 numerical benchmark functions, and obtained results are compared with the basic GSA algorithm. Experimental results show that the proposed methods are better than the basic GSA in terms of solution quality.展开更多
Artificial bee colony (ABC) algorithm is one of the popular swarm intelligence algorithms. ABC has been developed by being inspired foraging and waggle dance behaviors of real bee colonies in 2005. Since its invention...Artificial bee colony (ABC) algorithm is one of the popular swarm intelligence algorithms. ABC has been developed by being inspired foraging and waggle dance behaviors of real bee colonies in 2005. Since its invention in 2005, many ABC models have been proposed in order to solve different optimization problems. In all the models proposed, there are only one scout bee and a constant limit value used as control parameters for the bee population. In this study, the performance of ABC algorithm on the numeric optimization problems was analyzed by using different number of scout bees and limit values. Experimental results show that the results obtained by using more than one scout bee and different limit values, are better than the results of basic ABC. Therefore, the control parameters of the basic ABC should be tuned according to given class of optimization problems. In this paper, we propose reasonable value ranges of control parameters for the basic ABC in order to obtain better results on the numeric optimization problems.展开更多
基金“Scientific Research Projects of Selcuk University”for the institutional support
文摘The artificial bee colony (ABC) algorithm is a swarm-based metaheuristic optimization technique, developed by inspiring foraging and dance behaviors of honey bee colonies. ABC consists of four phases named as initialization, employed bee, onlooker bee and scout bee. The employed bees try to improve their solution in employed bees phase. If an employed bee cannot improve self-solution in a certain time, it becomes a scout bee. This alteration is done in the scout bee phase. The onlooker bee phase is placed where information sharing is done. Although a candidate solution improved by onlookers is chosen among the employed bee population according to fitness values of the employed bees, neighbor of candidate solution is randomly selected. In this paper, we propose a selection mechanism for neighborhood of the candidate solutions in the onlooker bee phase. The proposed selection mechanism was based on information shared by the employed bees. Average fitness value obtained by the employed bees is calculated and those better than the aver- age fitness value are written to memory board. Therefore, the onlooker bees select a neighbor from the memory board. In this paper, the proposed ABC-based method called as iABC were applied to both five numerical benchmark functions and an estimation of energy demand problem. Obtained results for the problems show that iABC is better than the basic ABC in terms of solution quality.
基金supported by Scientific Research Project of Selçuk University
文摘The gravitational search algorithm (GSA) is a population-based heuristic optimization technique and has been proposed for solving continuous optimization problems. The GSA tries to obtain optimum or near optimum solution for the optimization problems by using interaction in all agents or masses in the population. This paper proposes and analyzes fitness-based proportional (rou- lette-wheel), tournament, rank-based and random selection mechanisms for choosing agents which they act masses in the GSA. The proposed methods are applied to solve 23 numerical benchmark functions, and obtained results are compared with the basic GSA algorithm. Experimental results show that the proposed methods are better than the basic GSA in terms of solution quality.
基金supported by the Selcuk University Scientific Projects Coordinatorship
文摘Artificial bee colony (ABC) algorithm is one of the popular swarm intelligence algorithms. ABC has been developed by being inspired foraging and waggle dance behaviors of real bee colonies in 2005. Since its invention in 2005, many ABC models have been proposed in order to solve different optimization problems. In all the models proposed, there are only one scout bee and a constant limit value used as control parameters for the bee population. In this study, the performance of ABC algorithm on the numeric optimization problems was analyzed by using different number of scout bees and limit values. Experimental results show that the results obtained by using more than one scout bee and different limit values, are better than the results of basic ABC. Therefore, the control parameters of the basic ABC should be tuned according to given class of optimization problems. In this paper, we propose reasonable value ranges of control parameters for the basic ABC in order to obtain better results on the numeric optimization problems.
