The Black and White Coloring (BWC) problem is initially described in 1. There is an undirected graph G = (V, E), where V is a set containing n vertices, and E is a set containing l edges. The vertices ...
This study proposes an enhanced Black-kite Algorithm (BKA), termed SMNBKA-ICMIC, to improve optimization performance. The algorithm introduces four key improvements: ICMIC-based initialization to ...