An Iterative Neighborhood Local Search Algorithm for Capacitated Centered Clustering Problem

The Capacitated Centered Clustering Problem (CCCP) is NP-hard and has many practical applications. In recent years, many excellent CCCP solving algorithms have been proposed, but their ability to search in the neighborhood space of clusters is still insufficient. Based on the adaptive Biased Random-Key Genetic Algorithm (A-BRKGA), this paper proposes an efficient iterative neighborhood search algorithm A-BRKGA_INLS. The algorithm uses shift and swap heuristics to search neighborhood space iteratively to enhance the quality of solutions. The computational experiments were conducted in 53 instances. A-BRKGA_INLS improves the best-known solutions in 23 instances and matches the best-known solutions in 15 instances. Moreover, it achieves better average solutions on multiple instances while spending the same time as the A-BRKGA+CS.