A Transition Control Mechanism for Artificial Bee Colony (ABC) Algorithm

Artificial Bee Colony (ABC) algorithm inspired by the complex search and foraging behaviors of real honey bees is one of the most promising implementations of the Swarm Intelligence- (SI-) based optimization algorithms. Due to its robust and phase-divided structure, the ABC algorithm has been successfully applied to different types of optimization problems. However, some assumptions that are made with the purpose of reducing implementation difficulties about the sophisticated behaviours of employed, onlooker, and scout bees still require changes with the more literal procedures. In this study, the ABC algorithm and its well-known variants are powered by adding a new control mechanism in which the decision-making process of the employed bees managing transitions to the dance area is modeled. Experimental studies with different types of problems and analysis about the parallelization showed that the newly proposed approach significantly improved the qualities of the final solutions and convergence characteristics compared to the standard implementations of the ABC algorithms.


Introduction
Some species especially those living as swarms, societies, or colonies perform complicated behaviours in foraging, feeding, and surviving. When the behaviour of a specific individual is analyzed, it is seen that the mentioned behaviour of the individual is so simple compared to the complete task and it requires obeying only fundamental rules [1][2][3]. is property of a swarm to do with the combination of simple tasks of individuals in an order has gained the researchers' attention and various problem-solving techniques were proposed by utilizing bird, fish, wolf, and cat swarms or insect colonies including ants, termites, and bees [4][5][6].
e ABC algorithm that mimics the food foraging behaviours of real honey bee colonies is one of the most innovative and efficient contributions to the nature-inspired optimization algorithms [4,5,7]. At the beginning, the ABC algorithm was proposed for solving constrained and unconstrained numerical optimization problems, but it has been successfully applied to the combinatorial optimization problems in recent years. Although the ABC algorithm was capable of handling different types of problems with the standard working schema of it and proved its superiority compared with other evolutionary computational techniques, researchers from various fields presented new approaches for the ABC algorithm in order to further increase the convergence performance and qualities of the final solutions [4,5].
When the studies about the ABC algorithm are investigated, it can be seen that all of these studies are roughly classified into three groups. In the first group of the studies, the ABC algorithm is tried to be strengthened by modifying the existing models that are related to the generation of initial and candidate food sources or solutions, calculation of selection probabilities, and so on. Tsai et al. integrated the Newtonian law of universal gravitation into the onlooker bee phase of the ABC algorithm and proposed interaction ABC, IABC, algorithm [8]. Zhu and Kwong proposed gbestguided ABC, GABC, algorithm in which the food sources chosen by the onlooker bees are modified with the corresponding parameters of the global best food source in addition to the parameters of the randomly determined food source [9]. Akay and Karaboga used a probabilistic model for deciding whether a parameter is changed or not in the original search equation of the standard ABC algorithm and analyzed the performance of the proposed ABC algorithm on solving high-dimensional unconstrained optimization problems and constrained engineering problems [10]. Gao et al. introduced two ABC algorithm variants named ABC/ best/1 and ABC/best/2 [11]. For both ABC/best/1 and ABC/ best/2, the best food source is used as a guide when an employed or onlooker is sent from hive to find a candidate solution [11]. Xiang and An modified initial food source generation schema of the standard ABC algorithm with chaotic initialization and changed the roulette wheel selection mechanism with a reverse roulette wheel-based selection mechanism in order to sustain population diversity [12]. Luo et al. changed the probabilistic selection approach of the onlooker bee phase and proposed a new ABC algorithm variant called converge-onlookers ABC, COABC, algorithm [13]. Each onlooker bee in the OABC algorithm is sent to the vicinity of the global best food source to further increase the exploitation characteristics of the ABC algorithm [13]. Gao et al. changed the search equation, parameter utilization, and determination procedure of the basic ABC algorithm and named this modified variant as the OCABC algorithm [14]. For the OCABC algorithm, an employed or an onlooker produces candidate solution by using two randomly chosen food sources rather than using only one random food source [14]. In addition to this major change, they used the test and prediction abilities of the orthogonal learning approach to identify the related parameters being changed for generating new candidates [14]. In another study, Gao et al. brought advantages of different search mechanisms and multipopulation techniques together and introduced a new ABC algorithm called the ILABC algorithm [15]. In the ILABC algorithm, search equations used in the employed and onlooker bee phases are changed and the whole colony is divided into small subcolonies [15]. For each subcolony, the search equation of the employed bee phase is powered with the best solutions of the subcolony while the search equation of the onlooker bee phase is powered with the global best solution of the whole colony [15]. Qin et al. investigated the performance of the ABC algorithm when the number of employed and onlooker bees is changed with linear and nonlinear time-varying strategies [16]. Tran et al. remodeled the arithmetic crossover operator by controlling the candidate generation schema of the standard ABC algorithm and proposed enhanced ABC, for short EABC, algorithm [17].
e second group of studies mainly focuses on the hybridization of the ABC algorithm with other well-known population-based optimization techniques or local search approaches. Kang et al. combined the ABC algorithm with the Nelder-Mead simplex method for solving inverse analysis problems and introduced the Hybrid Simple ABC, HSABC, algorithm [18]. e HSABC algorithm was used as a parameter identification method for concrete damfoundation systems and the results obtained by the HSABC algorithm were better than the results obtained by the standard ABC and real-coded genetic algorithm (RCGA) [18]. Ozturk and Karaboga hybridized the ABC algorithm with the Levenberg-Marquardt (LM) algorithm for finding optimal weight set of the neural networks [19]. In the proposed approach called the ABC-LM algorithm, the ABC algorithm is responsible for initial training of the neural network. e weight set determined by the ABC algorithm is used for further training by the LM algorithm [19]. Duan et al. proposed a new hybrid approach by utilizing the ABC algorithm and the Quantum Evolutionary algorithm (QEA) for solving continuous optimization problems [20]. In the proposed model, employed and onlooker bee phases of the ABC algorithm are modified with the candidate generation schema of the traditional QEA [20]. Zhao et al. integrated the ABC algorithm and genetic algorithm (GA) for a novel hybrid swarm intelligent approach called HSIGA [21]. e main idea of the HSIGA is based on information sharing between populations of two algorithms. Both GA and ABC algorithm start optimization with random individuals simultaneously, and selected individuals from two populations are crossovered at the end of the each cycle [21]. Finally, obtained offsprings are transferred to the population of GA. Kang et al. increased solving capabilities of the ABC algorithm with the Hookee Jeeves pattern search approach and introduced the Hookee Jeeves ABC, HJABC, algorithm [22]. Yan et al. used the crossover operator of the GA in the search equation of the ABC algorithm and names this new variant as the hybrid ABC, HABC, algorithm [23]. Mao et al. improved the performance of the standard ABC algorithm by combining it with the opposition-based learning, S-type subpopulation grouping and sensitivity-phenomenon option techniques [24].
ABC algorithm, like other population-based metaheuristics, is intrinsically suitable for running on distributed or shared memory-based parallel architectures. e studies in the third group are directly related with the parallelization of the ABC algorithm. Narasimhan parallelized the ABC algorithm in a manner that the whole colony is divided into equal-sized subcolonies and these subcolonies are assigned to the different processors [25]. At the end of each cycle, improved individuals are copied to the memory locations that are accessible to all the processors for increasing the utilization from the more qualified solutions [25]. Banharnsakun et al. used a distributed memory-based system for testing their parallel implementation of the ABC algorithm. In this parallelization approach, local best food sources between two randomly determined compute nodes are exchanged after completion of a predetermined number of cycles [26]. Parpinelli et al. investigated different parallelization approaches of the ABC algorithm including masterslave, multihive with migration and hybrid hierarchical [27]. Basturk and Akay first investigated the parallel ABC algorithm in which each bee works synchronously [28]. Secondly, they proposed a coarse-grained parallel model for the ABC algorithm and analyzed its performance on solving numerical optimization problems and training neural networks [29]. Karaboga and Aslan analyzed performance of the parallelized ABC algorithm by using newly proposed emigrant creation strategies [30]. ey also investigated performance of the parallelized ABC algorithm on solving the motif discovery problem [31].

Computational Intelligence and Neuroscience
When the studies about the ABC algorithm are considered, it can be generalized that proposed modifications and hybridizations aim at changing source search and consumption characteristics of the employed, onlooker, and scout bees. However, intelligent behaviours seen in bee colonies are not limited with the search and consumption operations. Actually, search and consumption characteristics of the individuals in the colony are implicitly managed with the decisions about the transition to the dance area made by employed bees. In this study, a new model for the decision-making process of the employed bees called the transition control mechanism is introduced and integrated to the workflow of the standard ABC algorithm and its variants. e serial and parallelized implementations of the proposed ABC algorithm are tested on solving numerical benchmark problems with different number of parameters and wireless sensor deployment problem. e results from the experimental studies showed that modeling the decisionmaking process of the employed bees significantly improves convergence speed and quality of the final solutions of the ABC algorithm and has a decreasing effect on the execution time of the algorithm. e rest of the paper is organized as follows: fundamental steps of the ABC algorithm and bee phases are described in Section 2. e transition control mechanism and its adaptation to the ABC algorithm are summarized in Section 3. Section 4 presents the results of the experimental studies. Finally, the conclusion is given in Section 5.

Artificial Bee Colony Algorithm
Some species living together like ants, fish, and birds in nature are capable of performing complex behaviours that are actually defined as a composition of simple operations carried out by individuals without requiring any centralized management or monitoring mechanism [1][2][3]5]. ese types of complex or intelligent behaviors have also been seen in the foraging habits of the real honey bee colonies. e intelligent foraging model in a bee colony consists of three fundamental components called food sources and employed and unemployed foragers. An employed forager is associated with a specific food source and responsible for carrying nectar to the hive. An employed forager also shares information about the food source such as nectar quality, distance, and direction with unemployed foragers [1][2][3]5]. Unemployed foragers can be classified into two groups of bees. e first group of unemployed foragers is composed of onlooker bees [1][2][3]5]. Onlooker bees wait on the hive and watch various dances performed by employed foragers before selecting a food source. Selection of a food source by an onlooker is not a random procedure directly. ere is a relationship between choosability of a food source by onlookers and nectar quality of it. Another group of unemployed foragers is composed of scout bees. Scout bees wait on the hive like onlookers, but they fly from hive randomly or with the effect of internal or external triggers to find new food sources [1][2][3]5]. By considering all of these specialized situations of a bee colony, Karaboga introduced a new swarm intelligence-based probabilistic optimization algorithm named ABC [1][2][3]5].
In the ABC algorithm, positions of the food sources found and consumed by bees correspond to the possible solutions of the problem being optimized and nectar amount of a food source is directly related to the appropriateness of the solution [1][2][3]5].
In the vast majority of the population-based optimization algorithms, a set of solutions is first created randomly and tried to be optimized until completion of a predetermined number of iterations, generations, or cycles [1][2][3]5]. In the ABC algorithm, initialization of the optimization process is also devoted to the generation a set of solutions or food sources randomly by sending scout bees from the hive. e jth parameter of the ith food source within SN different food sources or solutions is determined randomly using equation (1) [1,2,[32][33][34]. In equation (1), x ij is the jth parameter of D different parameters in ith food source represented by x i , and x min j and x max j are lower and upper bounds of the jth parameter. Finally, rand (0, 1) is a random number between 0 and 1 [32,33,35]: (1) After the discoveries of initial food sources by scout bees, these food sources are related with the employed bees for gathering nectars. In the ABC algorithm, each food source is assigned to only one employed bee and the location information of the food source is memorized by the associated employed bee. When an employed bee leaves from the hive, she tries to find another food source within the neighborhood of the memorized one. e search operation carried out by an employed bee for finding a new food source is modeled as in equation (2) for the ABC algorithm [1,2,32,33,35]: where v ij is the jth parameter of the candidate food source v i whose parameters are the same with the parameter values of the food source x i except the jth one. x ij and x kj are the jth parameters of the x i and x k food sources, and ϕ ij is a random number between −1 and 1 [1,2,32,33,35]. In addition to these, it should be noted that j and k are randomly determined indexes and k must be different than i. If the fit(v i ) fitness value of the v i food source calculated as in equation (3) for a minimization problem using the obj(v i ) objective function value is higher than the fit(x i ) fitness value of the x i food source, the employed bee applies a greedy selection procedure between these food sources and a trial counter defined as trial i is set to zero. Otherwise, x i food source is still memorized by the employed bee and its trial counter is incremented by one to show that it is not improved in the current cycle [1,2,32,33,35]:

Computational Intelligence and Neuroscience
When all the employed bees turn back to the hive, they share the information about the visited food sources in their minds with the onlooker bees. Onlooker bees apply a selection procedure in which choosability chance of a food source increases with the fitness value of the same food source. e relationship between the fitness values of the sources and their choosabilities is modeled in the ABC algorithm by the assigned selection probabilities to all of these sources.
e selection probability of the x i food source defined as p(x i ) is calculated by dividing the fit(x i ) fitness value of the x i food source with the sum of fitness values as given in equation (4) below. With the completion of the probabilistic food source selection, onlooker bees leave the hive and join the foraging as done by employed bees [1,2,32,33,35]: If the foraging characteristics of the employed and onlooker bees are investigated, it is clearly seen that utilization or exploitation of the existing food sources is more dominant than the exploration of new ones. However, exploration and exploitation processes should be managed in a balanced manner that satisfies acceptable convergence speed and solution diversity. is subtle balance between exploration and exploitation is maintained in the ABC algorithm by comparing the trial counters that are incremented or set to zero according to the improvements of the food sources with a specific control parameter named limit. If there is a food source for which its trial counter exceeds the limit parameter value at most, this food source is abandoned and the employed bee of the abandoned food source becomes the scout bee for finding a food source by using equation (1) [1,2,32,33,35]. Although there is no restriction on the values being assigned to the limit parameter, it can be calculated using the following equation by using the number of parameters and food sources [1,2,32,33,35]: Ø a × SN × D⌉ and a ∈ Q + .

(5)
By considering the detailed descriptions of the employed, onlooker, and scout bees, mathematical models for generating new and candidate food sources and fundamental steps of the ABC algorithm can be given as shown in Algorithm 1.

Transition Control Mechanism for Employed Bees of the ABC Algorithm
In the standard implementation of the ABC algorithm, an employed bee visits a new food source that is near to the location of the previously visited one. She applies a greedy selection between them and then turns back to the hive for sharing information about the memorized food source with the onlooker bees. However, in a real honey bee colony, information sharing procedures between employed and onlooker bees are not so straightforward and they are actually managed with nondeterministic behaviours of the employed bees. Even though all of the employed foragers turn back to the hive, some of them decide to visit dancing area for sharing information with the onlooker bees, while others leave the hive directly without informing any onlooker. For understanding how the mentioned characteristics of employed bees change the bee density on the dance area, Figure 1 can be further investigated. As seen from Figure 1, the employed bees that visit the sources numbered 3, 4, 8, and 11 share the information about these food sources with the onlooker bees on the dance area. However, the employed bees that visit the sources numbered 2 and 6 do not share the information about these food sources with onlooker bees even though they turn back to the hive near or at the same time when compared to the other employed bees. Although the reason lying behind this type of decision made by an employed bee cannot be known directly, it has an important effect on the source selection procedure of the onlooker bees. If a group of employed bees leave the hive without introducing the visited food sources while the remaining employed bees do, the entire set of food sources that will be utilized by the onlooker bees is reduced to a specified set of food sources. In the first sense, the reduction of the entire set of food sources to a specified set of food sources can be thought as a drawback for the selection process of the onlooker bees, but the specialized set of solutions, in which only food sources introduced by the employed bees on the dance area can be found, contains more eligible sources than the extracted ones. In this situation, the chance of an onlooker to do with the utilization from more suitable solution or solutions is increased significantly.
If the decision-making mechanism of the employed bees that manages whether she visits the dance area or not is modeled and integrated to the standard implementation of the ABC algorithm, the search characteristics and complex behaviours of employed bees are reflected more robustly and the waste of computing resources with weak food sources is minimized. e proposed approach in this study that is also called the transition control mechanism for short tl directly focuses on the modeling of the given properties of the employed bees. In the tl mechanism, when the employed bee phase is completed, the decision whether an employed bee goes through the dance area or not is made by comparing the fitness value of the memorized food source with the average fitness value of the entire set of food sources. If the fitness value of the food source is less than the average fitness value, the employed bee associated with that food source is not directed to the dance area. e average fitness value obtained by dividing the sum of the fitness values of the food sources to the number of employed bees can be adjusted by multiplying it with a constant value ranging between 0 and 1. is constant value in tl is named as the transition factor (tf ). While the size of the reduced set of food sources increases with the lower values of the tf parameter, qualities of the transitioned sources can be enhanced with the higher values of it. In tl, calculation of the average fitness value and its adjustment with the tf parameter can be made by using equation (6). In equation (6), tlDecision i shows the transition decision of the employed bees related with the x i food source. If tlDecision i 4 Computational Intelligence and Neuroscience

Scout bee
Onlooker bee Employed bee (1) Initialization: (2) Assign value to limit parameter (3) Generate SN initial food sources by using equation (1) (4) Assign value to maximum fitness evaluation (MFE) parameter and set evalCounter to 0 (5) Repeat (6) //Employed bee phase (7) for i ⟵ 1, . . . , SN do (8) if evalCounter < MFE then (9) Generate new solution x new around the x i by using equation (2) (10) Calculate fitness value of new solution fit(x new ) (11) if fit(x new ) > fit(x i ) then (12) Change x i with x new (13) end if (14) evalCounter ⟵ evalCounter + 1 (15) end if (16) end for (17) //Onlooker bee phase (18) sentBees ⟵ 0, current ⟵ 0 (19) Find probability values of each food source by using equation (4) (20) while sentBees ≠ SN and evalCounter < MFE do (21) if p current > rand(0, 1) then (22) sentBees ⟵ sentBees + 1 (23) Generate new solution x new around the x current by using equation (2)  (24) Calculate fitness value of new solution fit(x new ) (25) if fit(x new ) > fit(x current ) then (26) Change x current with x new (27) end if (28) evalCounter ⟵ evalCounter + 1 (29) end if (30) current � (current + 1) mod SN (31) end while (32) //Scout bee phase (33) if evalCounter < MFE then (34) Determine the abandoned food source with limit value (35) Generate a new source for this abandoned food source by using equation (1)  Computational Intelligence and Neuroscience value is equal to 1, the employed bee related with the x i food source moves towards dance area. Otherwise, she flies from hive without informing any onlooker: When tl is applied to the ABC algorithm, from now on, the ABC algorithm powered by the tl is called the tlABC algorithm, it should be noticed that the reduced set of food sources for the onlooker bee phase can contain only one solution. For the candidate generation model of the ABC algorithm, a food source except the used one is needed at least. By considering the limitation stemmed from the candidate generation schema, the tlABC algorithm tries to improve the transitioned food source with a randomly determined food source when the number of food sources in the reduced set after transition control is equal to one. For detailed description of the transition control approach and its usage with the ABC algorithm, fundamental steps given in Algorithm 2 can be analyzed.

Experimental Studies
For analyzing the effect of the newly proposed mechanism called transition control on the solution quality, convergence characteristics, and finally execution time of the ABC algorithm, experimental studies carried out were divided into three different groups. Standard implementation of the ABC algorithm and its transition-controlled variant, tlABC, were compared over a set of well-known numerical benchmark problems in the first group of the experimental studies. Also, possible contributions of the tl mechanism were analyzed over the well-known variants of the ABC algorithm including GABC [9], ABC/best/1 [11], ABC/best/2 [11], CABC [14], and EABC [17] in the first group of the studies. e ABC algorithm can be parallelized for working on distributed or shared memory-based architectures by applying a limited set of modifications. By considering this advantage, parallelization of the ABC algorithm powered by new approach should also be investigated. In the second group of the experimental studies, ABC and tlABC algorithms were parallelized by dividing the whole colony into subcolonies running simultaneously for utilizing from the computational power of a multicore system and tested for solving numerical problems used in the previous group of the experiments. In the final group of the experimental studies, performances of the standard ABC and tlABC algorithms were compared through solving an NP-hard problem called wireless sensor deployment. In the wireless sensor deployment problem, positions of the wireless sensor nodes are determined in a manner that the coverage of the network will be maximized as much as possible.
Results of the experimental studies in this group also helped analyze transition control mechanism for a different type of problem.

Solving Numerical Optimization Problems with
Transition-Controlled ABC Algorithms. In order to analyze the effect of the transition controlling on the search and convergence characteristics of the standard ABC algorithm, nine different benchmark functions are chosen [10]. f 1 , sphere function, is a continuous benchmark function and has one global minimum. f 2 , step function, is similar to the f 1 function except that it is not continuous. f 3 , Schwefel function, contains multiple peaks and valleys. f 4 , Rosenbrock's valley function, is one of the most commonly used benchmark problems to analyze the convergence characteristics of the optimization algorithms. For this function, the global minimum is located at the end of a long, narrow, and flat valley. f 5 , Dixon-Price function, is another unimodal and continuous function. f 6 , Rastrigin function, is based on the sphere function but it has many local minimas distributed to the search space. f 7 , Griewank function, is the multimodal benchmark problem and local minimas change with the dimensionality. f 8 , Ackley function, contains an exponential term that generates many local minimas. Finally, f 9 , penalized, is a compute-expensive problem and requires calculations of a fundamental trigonometric function. For all of the benchmark problems except f 3 , the global minimum value is equal to 0. Global minimum of the f 3 function is related with the number of parameters. Given that the number of parameters is equal to D, global minimum value of f 3 can be found as −D × 418.9829. Lower and upper bounds of the parameters and formulations of the functions are given in Table 1.
In all experiments, the size of the colony is determined as 100 and the whole colony is equally divided between employed and onlooker bees [10]. All of the nine benchmark functions are tested with dimensions 10, 100, and 500. Maximum fitness evaluation, MFE, is taken equal to 100,000 and 1,000,000, respectively, for understanding short-and long-term response of the proposed model. For a detailed investigation how the transition factor changes the results of the tlABC algorithm, four different values of tf including 0.25, 0.50, 0.75, and 1.00 are used. e limit parameter value is calculated by considering the number of parameters (D) and number of food sources (SN) as SN × D [10]. Each of the experiments is repeated 30 times with different random seeds by using a system that is equipped with a four-core Intel ® i5 750 processor running 2.66 GHz with 4 GB of RAM. e mean best values produced by the algorithms and standard deviations over 30 runs are given in Tables 2-7.
From the results given in Table 2, it can easily seen that standard ABC and tlABC algorithms are capable of finding the global optimum values for the f 2 , f 3 , f 6 , and f 7 functions. e mean best objective function values of f 8 and f 9 are all same for ABC and tlABC with tf � 0.25, tf � 0.50, tf � 0.75, and tf � 1.00, while the tlABC algorithm produces a better mean best objective function values for f 1 , f 4 , and f 5 . When difficulties of the problems are changed by increasing the number of parameters, effectiveness of the tl model becomes more apparent. e results in Table 3 prove the obtained improvements with the tlABC algorithm. For the f 3 , f 4 , f 5 , f 6 , f 7 , f 8 , and f 9 functions, the tlABC algorithm produces better results compared to the standard ABC algorithm. While the mean best objective function values of the f 2 function are all the same for ABC and tlABC algorithms, the standard ABC algorithm is better than the tlABC algorithm for only f 1 function. By considering mean best objective function values given in Table 4, it can be generalized that the value of the tf parameter should be chosen very close or equal to 1.00. For all of the nine benchmark functions with 500 parameters, the tlABC algorithm produces better results than the ABC algorithm by setting the tf parameter value to 1.0. e results in Tables 5-7 provide important information about the solving capabilities of the tlABC algorithm and effect of the tl model on high number of fitness evaluations. When Table 5 that shows the results on optimizing 10-dimensional problems until completion of 1,000,000 fitness evaluations is analyzed, it is seen that there is no difference between ABC and tlABC algorithms in terms of mean best objective function values for f 1 , f 2 , f 3 , f 6 , f 7 , and f 9 functions. While the only 10-dimensional function for which ABC outperforms tlABC algorithm is f 5 , tlABC with tf � 0.50 and tlABC with tf � 1.00 outperforms the standard ABC algorithm and other tlABC variants for f 4 and f 8 , respectively. Although the number of parameters is increased 10 times compared to the previous experimental case, there are only three functions for which ABC and tlABC algorithms produce different mean best objective function values from each other. While the tlABC algorithm obtains better results than the ABC algorithm for f 4 and f 8 functions, the ABC algorithm outperforms the tlABC algorithm for the f 1 function. Finally, when Table 7 that shows the results on optimizing 500-dimensional problems until (1) //Onlooker bee phase (2) tf ⟵ assign a value to tf parameter ranging between 0 and 1 (3) tlDecisions ⟵ 0, 0, . . . , 0 { } //generate a 1 × SN vector filled with 0 (4) tlCounter ⟵ 0 //a counter used to count transitioned employed bees (5) for j ⟵ 1, . . . , SN do (6) tlDecisions[i] ⟵ assign value by using equation (6)  (7) if tlDecisions[i] �� 1 then (8) tlCounter ⟵ tlCounter + 1 (9) end if (10) end for (11) Find probability values of each food source by using equation (4)  (12) if tlCounter > 1 then (13) sentBees ⟵ 0 (14) current ⟵ get the first transitioned food source index by using tlDecisions (15) while sentBees ≠ SN and evalCounter < MFE do (16) if p current > rand(0, 1) then (17) sentBees ⟵ sentBees + 1 (18) x k ⟵ randomly select a transitioned food source except than x current (19) Generate new solution x new around the x current by using equation (2)  (20) Calculate fitness value of new solution fit( end if (24) evalCounter ⟵ evalCounter + 1 (25) end if (26) current ⟵ get the next transitioned food source index by using tlDecisions (27) end while (28) else (29) sentBees ⟵ 0, current ⟵ 1 (30) current ⟵ get transitioned food source index by using tlVector (31) while sentBees ≠ SN and evalCounter < MFE do (32) sentBees ⟵ sentBees + 1 (33) x k ⟵ randomly select a food source except than x current (34) Generate new solution x new around the x current by using equation (2)  Computational Intelligence and Neuroscience completion of 1,000,000 evaluations is considered, it is seen that the tlABC algorithm produces better results than the ABC algorithm on eight of nine benchmark functions. For f 3 , f 6 , and f 8 functions, the tlABC with tf � 1.00 outperforms the ABC algorithm and tlABC algorithm with other tf values, while tlABC with tf � 0.75 produces better results than the standard and other tlABC algorithms used in comparison for f 1 and f 3 functions. In addition, tlABC with tf � 0.25 is best among other variants for f 4 and f 5 functions while tlABC with tf � 0.50 outperforms the standard ABC and other tlABC algorithms with different tf values for the f 7 function.
Although mean best values produced by the tlABC algorithm with different values of tf are generally better than the standard implementation of the same algorithm, mentioned efficiency of the tlABC algorithm should also be proven with statistical methods. So, in order to determine that the difference between algorithms is whether significant or not, a nonparametric test called Wilcoxon signed-rank test is used with the significance level of 0.05 (p ≤ 0.05). e results of the test are given in Tables 8 and 9 for the most challenging situation that contains 500-dimensional functions. When the results given in Table 9 for 100,000 function evaluations are considered, it is concluded that the difference between ABC and tlABC with tf � 1.00 is significant in favor of the tlABC algorithm for all of the nine benchmark functions. While the difference between ABC and tlABC is also significant in favor of the tlABC algorithm with tf � 0.75 for f 3 and f 4 functions, the difference between these algorithms is not meaningful for other functions.  Computational Intelligence and Neuroscience e results of the Wilcoxon signed-rank test obtained by analyzing best objective function values found after completion of 1,000,000 fitness evaluations for 500-dimensional functions in Table 8 also showed that the differences between ABC and tlABC algorithms are significant in favor of tlABC algorithms for f 1 , f 7 , and f 9 functions. While the tlABC algorithm with tf � 1.00 is still statistically significant compared to the ABC algorithm for f 3 , f 6 , and f 8 , the only function for which the ABC algorithm is statistically significant than tlABC with tf � 1.00 is f 4 . e difference between ABC and tlABC with tf � 0.75 algorithm is not meaningful for f 2 , f 4 , f 5 , f 6 , and f 8 functions. Finally, the tlABC with tf � 0.75 is statistically significant than the ABC algorithm for the f 3 function in addition to the f 1 , f 7 , and f 9 functions.
By controlling employed bee transitions with newly proposed model, the chance of utilizing more qualified solution or solutions in the onlooker bee phase increased compared to the standard workflow of the algorithm. For analyzing the effect of the tl model on the convergence characteristics of the ABC algorithm, the graphics given in Figure 2 can be examined for 500-dimensional f 1 , f 3 , f 4 , f 5 , f 6 , f 7 , f 8 , and f 9 functions. For all of the convergence graphics in Figure 2, the x and y coordinates correspond to the fitness evaluations and mean best objective function values, respectively. From the graphics, it can be generalized that the tf parameters less than 1.00 cannot produce a remarkable change on the convergence performance of the tlABC algorithm compared to the standard ABC  Computational Intelligence and Neuroscience implementation at the first 50,000, fitness evaluations. However, when the tf parameter value is set to 1.00, convergence speed of the tlABC algorithm increases significantly compared to the standard ABC and other tlABC algorithms for all of the illustrated benchmark functions. e positive contribution of the tl mechanism on the convergence speed can also be proven by counting the consumed fitness evaluations until reaching the predetermined threshold objective function value [14]. With this purpose, the number of fitness evaluations consumed to reach the determined threshold is recorded for each 30 independent runs. If the required number of fitness evaluations is less than or equal to 1,000,000 the algorithm is accepted as successful for the mentioned run. e threshold values of the 500-dimensional f 1 , f 2 , and f 7 functions are determined as 1.0e − 06, while the threshold values of the 500-dimensional f 8 and f 9 functions are set to 1.0e − 02. For the 500-dimensional f 4 function, −1.0e + 5 is chosen as the threshold value. Finally, the threshold values of the 500dimensional f 4 , f 5 , and f 6 functions are determined as 1.0e + 04, 1.0e + 03, and 1.0e + 02, respectively. In Table 10, success rates (Sr) of the algorithms and mean fitness evaluations (Me) of the runs found as successful are summarized. When Table 10 is analyzed, it is clearly seen that there is a certain correspondence between the convergence curves in Figure 2 (Sr and Me values). For all of the nine benchmark  functions, the tl mechanism-based ABC algorithms require less fitness evaluations compared to the standard ABC algorithm.
As mentioned before, the tl mechanism controls the transition decisions of the employed bees to the dance area. Because of the reason that transition decisions are the common part of the employed bee phases of all ABC-based optimization techniques, it can be successfully used with the variants of the ABC algorithm in addition to the standard ABC algorithm. For investigating the possible contributions of the tl mechanism on the solving capabilities of the ABC variants, it is integrated to the workflows of the five wellknown ABC algorithms including GABC [9], ABC/best/1 [11], ABC/best/2 [11], CABC [14], and EABC [17]. GABC,    ABC/best/1, ABC/best/2, CABC, EABC, and their tl-based variants tlGABC, tlABC/best/1, tlABC/best/2, tlCABC, and tlEABC algorithms are tested with the benchmark functions given in Table 1. In all experiments, the size of the colony is determined as 100 and number of parameters is set to 500, while the maximum fitness evaluation is taken equal to 100,000. e value of the tf parameter is taken equal to 1.0 and the limit parameter value is calculated as (SN × D). Each of the experiments is repeated 30 times with different random seeds on the system previously introduced. e mean best values produced by the algorithms and standard deviations over 30 runs are given in Table 11.
From the results given in Table 11, it is clearly seen that all of the tl-based ABC variants are capable of producing better mean best objective function values compared to their standard implementations. Although the tl mechanism improves the solving capabilities of the tested ABC variants, its effect changes according to the problem being solved and existing properties of the algorithms. While the improving effect of the tl mechanism on the performances of the ABC variants are similar for f 1 , f 2 , f 6 , f 7 , and f 8 functions, the tl mechanism significantly increases the solving capabilities of the ABC/best/1 and CABC algorithms for the f 3 function; CABC and EABC algorithms for f 4     Computational Intelligence and Neuroscience ABC/best/1, CABC, and EABC algorithms for the f 9 function. In order to investigate that the tl mechanism is also capable of generating a statistical difference between GABC, ABC/best/1, ABC/best/2, CABC, EABC, and their tl-based variants, the results of the Wilcoxon signed-rank test with the significance level 0.05 (p ≤ 0.05) given in Table 12 can also be analyzed. e results in Table 12 showed that the superiority of the mean best objective function values obtained by the tl model-based GABC, ABC/best/1, ABC/best/ 2, CABC, and EABC algorithms is statistically proven against the mean best objective function values obtained by the standard implementations of the same algorithm for all of the nine benchmark functions. In order to investigate how the tl mechanism changes the convergence characteristics of the GABC, ABC/best/1, ABC/ best/2, CABC, and EABC algorithms, the graphics in Figure 3 should be controlled. From the graphics given in Figure 3, it can be said that the tl mechanism also improves the convergence curves of the tested ABC algorithms compared to their fundamental implementations. Although GABC, ABC/best/1, ABC/best/2, CABC, and EABC algorithms modify several states of the standard ABC algorithm and have different exploration and exploitation characteristics, the tl mechanism improves their solving capabilities all of them in terms of qualities of the final solutions and convergence speeds.

Solving Numerical Optimization Problems with Parallel
Transition-Controlled ABC Algorithm. Driven by the increasing number of cores in a single processing unit and decreasing the setup costs of distributed memory-based systems, parallelization of the well-known techniques or their improved variants becomes a necessity. In order to analyze the possible contributions of the tl mechanism on the parallel implementations, a set of experimental studies is also carried out. For parallelization of the tlABC and standard ABC algorithms, one of the most commonly used approach that is based on dividing the whole colony into equally sized subcolonies and evaluating them on a unique compute node or core is utilized. However, this parallelization approach can deteriorate the required population diversity and lead to early convergence to local minimas. In order to address these drawbacks stemmed from the parallelization, subcolonies, or subpopulations, send-receive individuals based on the chosen neighborhood topologies. For the experiments, ring migration topology in which the ith subcolony sends its emigrant to the ((i + 1)%N)th subcolony where N shows the number of subcolonies, cores, or computing nodes is used. e best food source of the current subcolony is chosen as an emigrant, and this emigrant source is exchanged with the worst food source in the neighbor subcolony.
For tlABC with tf � 1.00 and ABC algorithms, the colony size is equal to 200 and maximum evaluation number is chosen as 200,000 and 500,000 for solving the 500-dimensional functions given in Table 1. e number of subcolonies for parallel ABC, p-ABC, algorithm and parallel tlABC, p-tlABC, algorithm is determined as 4 by considering the four-core processor of the running environment. ABC, p-ABC, tlABC, and p-tlABC algorithms are written in C programming language, and built-in functions of the pthreads library are used for parallelization and require synchronization between subcolonies. After completing 25 successive employed-onlooker-scout bee phase triple, a subcolony sends its current best solution to the neighbor subcolony and the received emigrant is replaced with the local worst solution. Each of the experiments is repeated 30 times with different random seeds and mean best objective function values and standard deviations are recorded and presented in Tables 13 and 14.
When the results given in Tables 13 and 14 are investigated, the superiority of the tlABC with tf � 1.00 algorithm can be easily seen. For all of the nine benchmark functions, the tlABC algorithm produced better results compared to the ABC, p-ABC, and p-tlABC algorithms with the completion of 200,000 or 500,000 fitness evaluations. However, it should be noted that the p-tlABC algorithm are the second best for all of the benchmark functions considering the results in Table 13. When the number of fitness evaluations is increased 2.5 times compared to the first test scenario, the p-tlABC algorithm loses its advantages over the standard serial ABC algorithm especially for the f 4 , f 5 , and f 9 functions, while it produces better results for f 2 , f 3 , f 6 , and f 8 functions than the serial ABC algorithm. Finally, from the results in Table 14, it is seen that the p-tlABC algorithm still preserves its superiority compared to the p-ABC algorithm for all of the used benchmark functions.
Although the mean best objective function values of the p-tlABC algorithm showed that the tl mechanism protects its contribution against serial and parallel implementations of the standard ABC algorithm, these improvements should also be statistically validated. In Tables 15 and 16, the p-tlABC algorithm is compared with the ABC, p-ABC, and tlABC algorithms by using the Wilcoxon signed-rank test with the significance level of 0.05 (p ≤ 0.05). From the test results, the difference between p-ABC and p-tlABC algorithms is meaningful and in favor of the p-tlABC algorithm for all of the benchmark functions used in the experiments. When Table 15 is considered, the p-tlABC algorithm proves its superiority over ABC algorithm also with the statistically significant differences. With the increased total number of evaluations, the difference between ABC and p-tlABC algorithms starts to be negligible especially for the f 1 and f 2 functions. e difference between ABC and p-tlABC algorithms is significant in favor of the p-tlABC algorithm for f 3 , f 6 , and f 8 functions, while the difference between these algorithms is significant in favor of the ABC algorithm for f 4 , f 5 , f 7 , and f 9 functions when the termination criterion is determined as the 500,000 fitness evaluations. e final extraction from the statistical test results is that the difference between serial and parallel implementation of the tlABC algorithms is significant in favor of the serial tlABC algorithm for all of the functions.
One of the important contributions by parallelizing an algorithm is to decrease total execution times as possible. In order to analyze how the execution times of the parallelized ABC algorithms change compared to the their serial Computational Intelligence and Neuroscience        Tables 17 and 18. When the results given in the tables are investigated, it should be first noticed that average execution times of the tlABC algorithm is less than the average execution times of the standard ABC algorithm. Although common parameters including colony size and maximum number of fitness evaluations and search   equations used in employed and onlooker bee phases are the same for ABC and tlABC algorithms, the difference between average execution times of the ABC and tlABC algorithms in favor of the tlABC algorithm is originated from the quasideterministic structure of the tl mechanism. e onlooker bee phase of the standard ABC algorithm is nearly completed when all of the onlookers select sources. However, selection of a food source by an onlooker is a probabilistic process and the time required for selection cannot be estimated easily. In addition to this, the selection procedure is performed over all food sources introduced by the employed bees. If the majority of the food sources do not have high fitness values, only selection of the food sources can require more computations compared to the candidate generation and fitness calculation. But, in the tl mechanism, there is only one employed bee transitioned to the dance area or transitioned employed bees have more selection probabilities compared to the extracted ones. Another comparison between serial and parallel implementations of the ABC algorithms can be made over commonly used metrics called speedup and efficiency. e speedup value can be defined as a ratio between execution times of the serial and parallel implementations of the considered algorithm, and its maximum value is equal to the number of cores or computing units. e efficiency value can be found by dividing speedup metric to the number of cores or computing units, and its maximum value can be 1.0. When the speedup and efficiency values given in Tables 19  and 20 for 200,000 and 500,000 evaluations are analyzed, there is only one function for which the efficiency value is less than 0.50.
A final comparison between serial and parallel implementations of ABC and tlABC algorithms is made over the convergence curves of them given in Figure 4. By considering the graphics represented in Figure 4, it can be generalized that serial tlABC with tf � 1.00 has the most robust convergence characteristics among the ABC, p-ABC, and p-tlABC algorithms. However, it should be noticed that the p-tlABC algorithm obtains a few quicker convergence especially for the f 4 , f 5 , f 7 , and f 9 functions within the first half of the 50,000 fitness evaluations. In the p-tlABC algorithm, each subcolony gets chance to utilize more qualified solutions with the tl model. Although increased number of solutions being utilized in the onlooker bee phase compared to the single colony configuration accelerates the convergence speed of the p-tlABC algorithm, the diversity in a subcolony is not enough to change the transitioned food sources for the subsequent evaluations.

Solving Sensor Deployment Problem with Transition-Controlled ABC Algorithm.
A wireless sensor network contains hundreds or sometimes thousands of stationary or mobile sensor nodes. Each sensor node is usually capable of sending-receiving information obtained from the environment being monitored or targets being tracked. Although sensor nodes are versatile devices, they have limited sensing, computing, and storage capabilities and required power for detecting, and communication is maintained with a small battery. By considering all of these restrictions, the settlement of a wireless sensor network should be made in a manner that the coverage area of the sensor network or its lifetime is maximized. e area that is successfully covered by the sensor network or its utilization time is directly related with the exact positions of the sensor nodes.
Assume that the area being tracked is equally divided into small grids or rectangular subareas; P is a corner point of a grid, and this point is located at the (x, y) coordinate. e decision whether the point P is covered by the sensor s i positioned at (x i , y i ) can be made by comparing the Euclidean distance between sensor s i and point P, dis(P, s i ), with the detection range, r, of the same sensor. If the Euclidean distance dis(P, s i ) is less than the r value, it can be said that the point P is covered by the sensor s i . Given that c i shows the set of points that are successfully covered by the sensor s i and the size of the area in which S different sensor nodes are deployed is A, the coverage ratio (CR) of the wireless sensor network can be calculated as shown in the following equation: When the ABC algorithm is used to find optimal or near optimal sensor deployment, a possible deployment is related with a food source and coverage rate of the deployment is matched with the objective function of the solution. In    Computational Intelligence and Neuroscience addition to these, it should be noted that a solution or a food source for the deployment problem consisting of S wireless sensors is represented with a vector of 2 × S elements for two-dimensional terrains and 3 × S elements for threedimensional terrains. e solving capabilities of the serial and parallel implementations of the ABC and tlABC algorithms on the deployment problem are tested for locating 100 mobile sensors in an area of 10,000(100 × 100)m 2 . e colony size is 20, and the value of the limit parameters is equal to 100. For parallel implementations of ABC and tlABC algorithms, the whole colony is divided into two equal subcolonies and only two cores of the previously mentioned running environment are used. e ring migration topology is chosen as a neighborhood topology. e migration is carried out after completing 25 successive employed-onlooker-scout bee phase triples. Finally, the tf parameter of the tlABC algorithm is set to 1.00. Each of the experiments is repeated 20 times with different random seeds until completion of 2,000 and 10,000 evaluations. e best, mean, and worst coverage values and standard deviations are recorded and then summarized at Table 21. e results given in Table 21 also represent that the tlABC algorithm with tf � 1.00 produces better deployments than other serial and parallel variants of the ABC algorithm considering the best, mean, and worst coverage values for both 2,000 and 10,000 fitness evaluations. Although the differences between tlABC algorithm and others are relatively small, the complexity of the deployment problem causes a long stagnation period that cannot easily be skipped with the current workflow of the ABC algorithm. However, the tlABC algorithm enters that period with the more robust solutions and slightly improves its current best solution until reaching the defined termination criteria.
Average execution times of the ABC-based deployment techniques in terms of seconds are presented in Table 22. Because of the colony size is chosen quite small compared to the previous experimental cases, average execution times of standard and tl model-based ABC algorithms are relatively close to each other. However, when the differences between fitness values of the colonies are apparent as in the case for which the termination criteria is equal to 2,000 fitness evaluations, the tl model slightly reduces the average execution times with its quasi-deterministic selection procedure.
Finally, ABC and tlABC algorithms are compared on the basis of their convergence characteristics. As seen from the graphical representation given in Figure 5, the best convergence performance belongs to the serial tlABC algorithm. In addition to this, the effect of the information sharing on the convergence speed of the parallelized algorithms can be easily seen. With the distributions of the emigrant food sources between subcolonies, mean best coverage values of both p-ABC and p-tlABC algorithms increase gradually.

Conclusion
In this study, a new approach that models the decisionmaking mechanism of the employed foragers is introduced. e model called the transition control mechanism, for short tl, is integrated to the standard serial and parallel implementations of the ABC algorithm in addition to the wellknown ABC variants. e possible contributions of the tl mechanism on the performance of the ABC algorithm are analyzed by solving numerical and combinatorial optimization problems. Experimental studies showed that the transition control mechanism significantly improved the searching capabilities of the standard and modified ABC algorithms. For the standard ABC algorithm, all of the employed bees are directed to the dance area in order to inform onlooker bees waiting on the hive. However, in a real honey bee colony, some of the employed bees leave the hive without visiting the dance area while some of them stay in the hive to interact with the onlooker bees. By adding the

22
Computational Intelligence and Neuroscience mentioned characteristics of the employed bees with the tl mechanism to the existing structure of the ABC algorithms, relationship between different group of bees are simulated more conveniently. In future, more efficient transition control mechanisms that determine whether an employed bee is directed to the dance area or not can be further studied.

Data Availability
No data were used to support this study.

Conflicts of Interest
e author declares no conflicts of interest.   Computational Intelligence and Neuroscience 23