Applying a binary artificial bee colony algorithm to the max-cut problem
Xiang Chen, Geng Lin, Meiqin Xu · 2019
The max-cut problem (MCP) has many applications in different areas. This paper develops a hybrid binary artificial bee colony algorithm (HBABC) to solve MCP. First, a surjection mapping function is used to map a real vector to a binary vector. Then, the basic artificial bee colony algorithm is modified for solving the max-cut problem. In addition, to improve the performance of ABC, a local search procedure is employed. The HBABC is tested on 24 instances from the literature. Numerical results indicate that the HBABC is very efficient.