出版社：Academy & Industry Research Collaboration Center (AIRCC)
摘要：African Buffalo Optimization (ABO) is one of the most recent swarms intelligence basedmetaheuristics. ABO algorithm is inspired by the buffalo’s behavior and lifestyle. Unfortunately,the standard ABO algorithm is proposed only for continuous optimization problems. In thispaper, the authors propose two discrete binary ABO algorithms to deal with binary optimizationproblems. In the first version (called SBABO) they use the sigmoid function and probabilitymodel to generate binary solutions. In the second version (called LBABO) they use some logicaloperator to operate the binary solutions. Computational results on two knapsack problems (KPand MKP) instances show the effectiveness of the proposed algorithm and their ability toachieve good and promising solutions.
