Dynamic group optimization algorithm with embedded chaos

Recently, a new algorithm named dynamic group optimization (DGO) has been proposed, which is developed to mimic the behaviors of animal and human group socializing. However, one of the major drawbacks of the DGO is the premature convergence. Therefore, in order to deal with this challenge, we introduce chaos theory into the DGO algorithm and come up with a new chaotic dynamic group optimization algorithm (CDGO) that can accelerate the convergence of DGO. Various chaotic maps are used to adjust the update of solutions in CDGO. Extensive experiments have been carried out, and the results have shown that CDGO can be a very promising tool for solving optimization algorithms. We also demonstrated good results based on real world data, where, in particular, solving multimedia data clustering problems.