International Journal of Interactive Mobile Technologies (iJIM) – eISSN: 1865-7923 – Vol. 15, No. 16, 2021 Short Paper—Systematic Review of Enhancement of Artificial Bee Colony Algorithm Using Ant Colony… Systematic Review of Enhancement of Artificial Bee Colony Algorithm Using Ant Colony Pheromone https://doi.org/10.3991/ijim.v15i16.24171 Abdul Hadi Alaidi(*), Chen Soong Der, Yeng Weng Leong Universiti Tenaga Nasional, Malaysia alaidi@uowasit.edu.iq Abstract—The artificial bee colony (ABC) is a well-studied algorithm devel- oped to solve continuous function optimization problems by Karboga and Akay in 2009. ABC has been proven to be more effective than other biological-inspired algorithms with good exploration. However, ABC suffers from low exploitation and slow convergence in some cases. The ABC algorithm study has risen signifi- cantly over the past decade, with many researchers trying to improve ABC perfor- mance and apply it to solve problems. One method to enhance ABC is to borrow exploration technique from other algorithms. Researchers use pheromone, which is a technique used by Ant Colony optimization algorithm, to enhance ABC and addressed several aspects of using a pheromone to enhance ABC. This systematic review aims to review and analysis articles about using pheromone to enhance ABC. Articles on related topics were systematically searched in four major data- bases, namely Scopus, Web of Science, Association for Computing Machinery ACM and Google Scholar. To ensure that all research articles were considered the start date is not restrictions the search carry out till February 2021. Five arti- cles were selected based on our inclusion and exclusion criteria for the systematic review. The results show that the use Pheromone to enhance ABC can increase the ABC exploitation ability and overcoming the late convergence. This paper also illustrates several potential pheromone using for future work. Keywords—artificial bee colony, pheromone, ant colony 1 Introduction The artificial bee colony (ABC) algorithm is a well-studied algorithm developed to handle continuous function optimization issues by Karboga and Akay in 2005 [1]. It mimics the foraging behaviors of a swarm of bees to find food. ABC successfully used in many fields like Management of energy for mobile devices [2], [3] and for routing of Mobile Agents on IoT [4], [5]. The artificial bee colony is divided into three groups: employed, onlookers, and scouts’ bees. First, employed bee’s exploration for food sources and share the knowledge with an onlooker bee. Using the knowledge given down from the employed bee, the onlooker bee seeks to identify a better food source in the neighborhood. The onlooker bees abandoned the food source and becomes a scout bee if and only if the food source enhancement exceed a defined limitation. A scout bee 172 http://www.i-jim.org mailto:alaidi@uowasit.edu.iq Short Paper—Systematic Review of Enhancement of Artificial Bee Colony Algorithm Using Ant Colony… and randomly seek for a new food source. In ABC, the exploitation is accomplished by both onlooker and employed bees, while the exploration process control by scout bees. In ABC, the employed bees used the equation (1) for searching neighbors by moving from an old position xij to the new position vij if and only if the fitness of new position’s is better than the fitness of the old position. v x x xij ij ij ij kj= + −φ ( ) (1) Where xi is the old position and vi is the new position of i th employed. ϕij is a random number between [˗1,1], j is an arbitrary integer number between 1 and dimension of the problem, while k is a random number between the number of bees employed and 1. On the other hand, the onlooker bee selects food depending on the probability that calculated by equation 2 and evaluate all employed bee p fit fit i i j SN j = =∑ 1 (2) Where fit is the fitness values of the solution of employed bee, and it calculates using equation 3 fit f x f x f x f x i i i i i = + ( ) ( ) ≥ + ( ) ( ) <      1 1 0 1 0 , , (3) Where f(xi) stands for the value of the objective function to be optimized. Like the employed bee, the onlooker bee uses equation 1 to update the position and explore the selected food source. The food source will be abandoned if it cannot be further enhanced within a pre-defined condition, then the employed randomly explore for a new food source and call it scout bee. Such a combination of exploration and exploitation search in ABC is important. It enables the algorithm to search over the solution space for high-quality solutions and prevent them from getting trapped in local optima. In ABC, the employed bees main- tain the current solution while the onlooker bees allow the best solution to be exploited. Furthermore, scout bees try to remove stagnating solutions and explore new solutions. ABC method has been successfully used to solve a wide range of hard combinational issues. One of these problems is the traveling salesman problem where the salesman attempts to find the shortest possible tour by visiting a set of customer cities. ABC is considered one of the best algorithms among other available algorithms to solve TSP [6]. Algorithm 1 shows the pseudo-code of the artificial bee colony algorithm. Algorithm 1 The standard Artificial bee colony (ABC). 1. Initialization Phase 2. REPEAT 3. Employed Bees Phase 4. Onlooker Bees Phase 5. Scout Bees Phase 6. Memorize the best solution achieved so far 7. UNTIL (Cycle = Maximum Cycle Number or a Maximum CPU time) iJIM ‒ Vol. 15, No. 16, 2021 173 Another non-deterministic algorithm used to solve the optimization issues is the Ant Colony Optimization algorithm (ACO). In 1992, Marco Dorigo proposed Ant Colony Optimization (ACO), which was inspired by ants seeking the shortest path between a source food and their colony [7], [8]. ACO seeks the optimal solution for the computa- tion problem by building one solution and adding this solution-to-solution component until the wanted solution is built. Ant colony optimization successfully applied to solve the travelling salesman problem. The accuracy of the ACO algorithm, on the other hand, decreases as the problem’s complexity rises. In nature, ants use pheromone as indirect communication between them. In ACO, pheromones are represented by numeric values, which are modified by every solution component; these values influence the move- ment of ants in the next iteration in a way that edges between nodes with large values (a high level of pheromone) are more likely to be visited. Besides, the ACO model allows to include heuristic information to guide ants to complete a feasible solution. In this study, a systematic literature review is carried out to characterize relevant studies regarding the use of pheromone to enhance the artificial bee colony. 2 Methodology In academic research, Systematic literature review (SLR) may use for validate mod- els thus improving methodological progress and consistency along with the ability to find gaps for further studies [9]. The main research questions addressed in this study are; 1. How to use pheromone to enhance ABC? 2. How to integrate ACO with ABC? 3. Is there any researcher used pheromone to increase the exploration of ABC? All articles with enhancing or improve artificial bee colony use pheromone was car- ried out were identified through four world-renown bibliographic databases: Scopus, Web of Science (WoS), Association for Computing Machinery (ACM), and Google Scholar (GS) using the search string in Table 1. Table 1. Search terms Bibliographic Database Search Terms Scopus TITLE (“Artificial bee colony”) AND ALL (pheromone AND (improve* OR enhance* OR exploration OR exploitation)) WoS #1 TS = (improve* OR enhance* OR exploration OR exploitation) #2 TS = (Artificial bee colony) #3 TS = (pheromone) #4 #1 AND #2 AND #3 ACM “artificial bee colony” AND pheromone AND (improve* OR enhance* OR exploration OR exploitation) GS allintitle: pheromone “Artificial bee colony” A published article is included if: (1) it is a peer-reviewed research article written in English; (2) it is on artificial bee colony and pheromone. No date restrictions are 174 http://www.i-jim.org Short Paper—Systematic Review of Enhancement of Artificial Bee Colony Algorithm Using Ant Colony… imposed. The search was conducted in February 2021 to ensure that all research articles were considered. 2.1 Selection of study This phase is starting with initial search that is generating 86 articles. After duplicate removal (seven articles) all studies were screened using the Rayyan. Three phases come after this one, the phases are screening, filtering as well as initiating of category for determining if the created articles might be involved in the review or not. In addition, the duplicated articles have been specified and removed from different data-bases. Title in addition to abstract scanning are used for determining the relevance regarding all articles, that have been later categorized in various folders on the basis of their simi- larities and attributes, while the second filtering phase is commenced through carrying out complete full-text reading related to the screened articles from the first phase, also the third phase included deep examination regarding articles for determining adequate main and sub-categories. Many comments and notes have been taken throughout the process. Figure 1 show the search, screening and selection process for suitable studies. 2.2 Using pheromone One of the Artificial bee colony problem is blindness search strategy for food source. [10], [11] use attraction pheromone and transition strategy to solve the blindness search. Honey bees primarily interact with each other in nature through behavioral communi- cation and communication with chemistry. Honey bees only dance to exchange infor- mation in the traditional artificial bee colony algorithm (conduct communication). To correspond with reality in nature and the ABC principle, it is vital and sensible to include chemical communication must be combined with behavioral communication. More specifically, the authors assume that each bee travel to a food source and deposits an attraction pheromone on solution, causing other bees to attract to the object where pheromone strength is higher than other This technique allows bees to look for food in a more efficient manner. Multidimensional Knapsack problem (MKPs) can define as given a set j = {o1, o2, …, on} of n items and knapsack with a set C = {c1, c2, … cm} of m dimension, the 0–1 Multidimensional Knapsack problem search for a subgroup of J in where the total profit of items included in the subgroup is maximized, while m resource constraint remains fulfilled. The following is the formulation of MKP_01: Maximize j n j jp x = ∑ 1 (4) Subject to j n ij j ir x c i m = ∑ ≤ = … 1 1, , x j nj ∈ = …{ , }, , ,0 1 1 iJIM ‒ Vol. 15, No. 16, 2021 175 Fig. 1. The process of searching, screening and selecting the suitable studies MKPs solved using the artificial bee colony with pheromone communication (ABCPUD-MKP) where transition probability value reflects a trade-off between pseudo utility and the strength of pheromones. That is, with a high probability, those items which consume fewer resources and have more benefit would be selected. Yet, if an item is used in several solutions, it is extremely attractive because of the high strength of pheromones [11] combine two strategies to update pheromone. The first 176 http://www.i-jim.org Short Paper—Systematic Review of Enhancement of Artificial Bee Colony Algorithm Using Ant Colony… one is to lay pheromone trails on each item pick which led to select objects that occur frequently in solution. The second method is to lay pheromone on each pair of different items. In addition, in ABCPUD-MKP employee bees are responsible for update pher- omone and scout bees use pheromone and some heuristic information as a guide for looking for new food sources. ABCPUD-MKP is a hybrid algorithm that uses two ways of communication between bees. The employee and onlooker bees progressively enhance their related solutions in solution neighbors as the iteration runs on the basis of the behavior com- munication process. The scout bees, on the other hand, devised new solutions in light of the chemical communication method, which uses the pheromone collected by bees to induct item selection. ABC-MKP is different than ABCPUD-MKP in two phases: the discovery of new solution and the production, dissemination and upgrading of pheromones used only by the ABCPUD-MKP. To generate a good quality solution, employee bees use the heuristic information and the transformation probability based on pheromone paths. [12] use a pheromone to enhance the convergence of artificial bee colony. In addition, to boost ABC’s efficiency in terms of local search capabilities. pheromone approach of ACO used and hybrid metaheuristic method developed as an enhanced version of ABC which called pABC. In the principle of the pABC algorithm, to make honey, bees’ objective is to fetch the finest food to the hive. Employed bees gather pollen from the flowers of related flowers in the neighbor area and bring the food they receive to the hive. Employed bees secrete pheromones between the flowers they visit in the process of gathering pollen. Subsequently, onlooker bees choose flowers based on the amount of pheromone quantity. The food in the pABC algorithm is composed of pollen obtained from various types of flowers. Ant colony optimization combined with the artificial bee colony by [13] (ABA) to design a fuzzy expert system with membership function and if-then rules. The author uses ant colony algorithm to evaluate the rule which is set using integer numbers in microarray gene expression data. Moreover, ACO used in parallel with ABC so actually there is no combining between ACO and ABC or using pheromone to enhance ABC. Another studies use ABC for gen selection and cancer classification proposed by [14]. Pheromone used to overcome the limitation of ABC exploitation by making bees com- municate and share their finding. Scout bees use pheromone as a guide when searching for new food source and pheromone update in all stages. Moreover, the amount of deposit pheromone is a function of fitness measures. 3 Discussion Using pheromone with an artificial bee colony will increase and balance exploration and exploitation. Moreover, using pheromone intends to speed up the convergence of the algorithm. However, there are many ways to use pheromone to enhance the artificial bee colony. Table 2 shows the difference in using pheromone to enhance artificial bee colony. The pheromone initializes in all algorithm is same where the initial value of pher- omone is a constant value and same for all different problem that algorithm solve. In addition, the bee will update pheromone after each stage except for [13] where in iJIM ‒ Vol. 15, No. 16, 2021 177 addition to update in all stages the best so far is also update the pheromone and in [12] the employee bee will update the pheromone after each cycle. Moreover, the deposit pheromone amount is different in all algorithms were in [14] used function of fitness to update pheromone while in [12] used objective function as accumulative to update pheromone. On other hand, [11] uses the solutions obtained at each iteration to increase pheromone while [13] selects the best path to update the pheromone. Table 2. Using pheromone comparison Method Pheromone Initialization Pheromone Update Pheromone Deposit Selection [14] Initial to constant value (tmax) Update pheromone in all bee stages Function of fitness measures Scout bee use pheromone to explore for new food source [11] Initial to constant value Update pheromone in all bee stages Use solutions acquired at every iteration to accumulate pheromone Construct new solutions using pheromone trails and heuristic information [13] Initial to constant value Local pheromone update rule and best so far update Updated on the selected best path Split the search space to ACO and ABC [12] Initial to small positive constant After each cycle all employed bees updating the phenomenon Pheromone amounts are determined as objective function 1-Selected from best candidate in terms of the attractiveness. 2-Use the probability distribution which is based on the pheromone amounts 4 Conclusion In this research, studies about using pheromone to enhance the artificial bee colony algorithm were systematically reviewed. The results reveal that using pheromone to enhance ABC is different in main three aspects. The first difference is how pheromone update and when it updates. Moreover, how pheromone deposit is the second main difference. The final main difference between the use of pheromone to enhance ABC is the mechanism used to select the new solution. In future work, an enhanced ABC using pheromone will be designed by changing the initial value and use the neighbor algo- rithm for initialization. The second update pheromone will be done in scout bee phase only. Moreover, the decrease of pheromone amount on the edge joins two parts by a constant factor. Then put a certain amount of pheromone on that particular edge. Finally, the selection mechanism will depend on pheromone OR neighbor list OR random which will increase the exploration and enhance the exploitation of Artificial bee colony. 5 Acknowledgment The authors significantly acknowledged the financial support from Universiti Tenaga Nasional under UNITEN-Iraq scholarships. 178 http://www.i-jim.org Short Paper—Systematic Review of Enhancement of Artificial Bee Colony Algorithm Using Ant Colony… 6 References [1] D. Karaboga and B. Basturk, “A powerful and efficient algorithm for numerical func- tion optimization: artificial bee colony (ABC) algorithm,” J. Glob. Optim., vol. 39, no. 3, pp. 459–471, 2007. https://doi.org/10.1007/s10898-007-9149-x [2] S. ArunKumar, B. V. Kumar, and M. Pandi, “Artificial bee colony optimization based energy-efficient wireless network interface selection for industrial mobile devices,” Comput. Commun., vol. 154, pp. 1–10, 2020. https://doi.org/10.1016/j.comcom.2020.01.067 [3] I. Hamad and M. Hasan, “A review: On using ACO based hybrid algorithms for path plan- ning of Multi-Mobile Robotics,” international journal of interactive mobile technologies, vol. 14, no. 18, pp. 145–156, 2020. https://doi.org/10.3991/ijim.v14i18.16371 [4] S. Yousefi, F. Derakhshan, and H. Karimipour, “Artificial Bee Colony-based Routing for Mobile Agents on the Internet of Things,” in 2020 IEEE Electric Power and Energy Confer- ence (EPEC), 2020, pp. 1–5. https://doi.org/10.1109/EPEC48502.2020.9320053 [5] J. Fang, “Clustering and Path Planning for Wireless Sensor Networks based on Improved Ant Colony Algorithm.,” International Journal of Online & Biomedical Engineering, vol. 15, no. 1, 2019. https://doi.org/10.3991/ijoe.v15i01.9784 [6] S. S. Choong, L.-P. Wong, and C. P. Lim, “An artificial bee colony algorithm with a mod- ified choice function for the traveling salesman problem,” Swarm Evol. Comput., vol. 44, pp. 622–635, 2019. https://doi.org/10.1016/j.swevo.2018.08.004 [7] M. Dorigo and M. Birattari, “Ant colony optimization,” in Encyclopedia of Machine Learning, Springer, 2010, pp. 36–39. https://doi.org/10.1007/978-0-387-30164-8_22 [8] H. Mustafa, “Mathematical Modeling of Cooperative E-Learning Performance in Face to Face Tutoring (Ant Colony System Approach),” International Journal of Advanced Corpo- rate Learning (iJAC), vol. 3, no. 4, pp. 13–20, 2010. https://doi.org/10.3991/ijac.v3i4.1471 [9] A. Cherp, V. Vinichenko, J. Jewell, E. Brutschin, and B. Sovacool, “Integrating techno-economic, socio-technical and political perspectives on national energy transitions: A meta-theoretical framework,” Energy Res. Soc. Sci., vol. 37, pp. 175–190, 2018. https://doi. org/10.1016/j.erss.2017.09.015 [10] H. Wei, J. Ji, Y. Qin, Y. Wang, and C. Liu, “{A novel artificial bee colony algorithm based on attraction pheromone for the multidimensional knapsack problems}—International Confer- ence on Artificial Intelligence and Computational Intelligence,” pp. 1–10, 2011. https://doi. org/10.1007/978-3-642-23887-1_1 [11] J. Ji, H. Wei, C. Liu, and B. Yin, “Artificial bee colony algorithm merged with pheromone communication mechanism for the 0–1 multidimensional knapsack problem,” Math. Probl. Eng., vol. 2013, 2013. https://doi.org/10.1155/2013/676275 [12] D. Ekmekci, “A Pheromonal Artificial Bee Colony -pABC- Algorithm for Optimization Problems,” in 2019 16TH INTERNATIONAL MULTI-CONFERENCE ON SYSTEMS, SIG- NALS & DEVICES (SSD), 2019, pp. 452–456. https://doi.org/10.1109/SSD.2019.8893259 [13] P. GaneshKumar, C. Rani, D. Devaraj, and T. A. A. Victoire, “Hybrid Ant Bee Algorithm for Fuzzy Expert System Based Sample Classification,” IEEE/ACM Trans. Comput. Biol. Bioinforma., vol. 11, no. 2, pp. 347–360, 2014, doi: 10.1109/TCBB.2014.2307325. https://doi.org/10.1109/TCBB.2014.2307325. [14] J. M. Moosa, R. Shakur, M. Kaykobad, and M. S. Rahman, “Gene selection for cancer classification with the help of bees,” BMC Med. Genomics, vol. 9, no. 2, Aug. 2016, doi: https://doi.org/10.1186/s12920-016-0204-7. iJIM ‒ Vol. 15, No. 16, 2021 179 https://doi.org/10.1016/j.erss.2017.09.015 https://doi.org/10.1016/j.erss.2017.09.015 https://doi.org/10.1007/978-3-642-23887-1_1 https://doi.org/10.1007/978-3-642-23887-1_1 https://doi.org/10.1109/TCBB.2014.2307325. https://doi.org/10.1186/s12920-016-0204-7. 7 Authors Abdul Hadi Mohammed Alaidi finish hi master in. computer science from Bridge- port university, USA. He is currently PhD student at Universiti Tenaga Nasional, Malaysia. alaidi@uowasit.edu.iq Chen Soong Der currently working as Associate Professor at Universiti Tenaga Nasional, Malaysia. He has completed his Ph.D. in Image Enhancement from the same University. He is a professional member of the Institute of Electrical and Electronics Engineers. Yeng Weng Leong currently working as Senior Lecturer at Universiti Tenaga Nasional, Malaysia. He has completed his Ph.D. from Kanazawa University, Japan. Article submitted 2021-05-27. Resubmitted 2021-06-28. Final acceptance 2021-06-28. Final version pub- lished as submitted by the authors. 180 http://www.i-jim.org http://alaidi@uowasit.edu.iq