Improved binary artificial bee colony algorithm

作     者：Rafet DURGUT Rafet DURGUT

作者机构：Computer Engineering DepartmentEngineering FacultyKarabuk UniversityKarabuk 78050Turkey 

出 版 物：《Frontiers of Information Technology & Electronic Engineering》 (信息与电子工程前沿（英文版）)

年 卷 期：2021年第22卷第8期

页      面：1080-1091页

核心收录：

学科分类：0810[工学-信息与通信工程] 0808[工学-电气工程] 0809[工学-电子科学与技术（可授工学、理学学位）] 08[工学] 081104[工学-模式识别与智能系统] 0839[工学-网络空间安全] 0835[工学-软件工程] 0811[工学-控制科学与工程] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

主　　题：Artificial bee colony Binary optimization Uncapacitated facility location problem(UFLP) 

摘      要：The artificial bee colony(ABC)algorithm is an evolutionary optimization algorithm based on swarm intelligence and inspired by the honey bees’food search behavior.Since the ABC algorithm has been developed to achieve optimal solutions by searching in the continuous search space,modification is required to apply it to binary optimization problems.In this study,we modify the ABC algorithm to solve binary optimization problems and name it the improved binary ABC(IbinABC).The proposed method consists of an update mechanism based on fitness values and the selection of different decision variables.Therefore,we aim to prevent the ABC algorithm from getting stuck in a local minimum by increasing its exploration ability.We compare the IbinABC algorithm with three variants of the ABC and other meta-heuristic algorithms in the literature.For comparison,we use the well-known OR-Library dataset containing 15 problem instances prepared for the uncapacitated facility location problem.Computational results show that the proposed algorithm is superior to the others in terms of convergence speed and robustness.The source code of the algorithm is available at https://***/rafetdurgut/ibinABC.