Multi-subpopulation coevolutionary algorithm with adaptive Cauchy-Polynomial mutation

In order to solve the difficulties of multiobjective optimization problems (MOPs) such as high dimensionality and complex calculation, this paper designs a multiobjective optimization algorithm of multi-subpopulation coevolution. In this paper, the MOPs is divided into several sub-problems, and multiple sub-populations are used to optimize the sub-problems separately, and an information exchange strategy is designed for coevolution among multiple subpopulations; Aiming at the problem of multiobjective particle swarm optimization easily falling into local optima, an adaptive Cauchy mutation is designed to enhance the diversity and convergence of the algorithm.