Multiobjective nondominated neighbor coevolutionary algorithm with elite population

Abstract

A nondominated neighbor coevolutionary algorithm (NNCA) with a novel coevolutionary mechanism is proposed for multiobjective optimization, where elite individuals are used to guide the search. All the nondominated individuals are divided into two subpopulations, namely, the elite population and the common population according to their crowding-distance values. The elite individual located in less-crowded region will have more chances to select more team members for its own team and thus this region can be explored more sufficiently. Therefore, the elite population will guide the search to the more promising and less-crowded region. Secondly, to avoid the `search stagnation' situation which means that algorithms fail to find enough nondominated solutions, a size guarantee mechanism (SGM) is proposed for elite population by emigrating some dominated individuals to the elite population when necessary. The SGM can prevent the algorithm from searching around limited nondominated individuals and being trapped into the `search stagnation' situation. In addition, several different kinds of crossover and mutation operator are used to generate offspring, which are benefits for the diversity property. Tests on 20 multiobjective optimization benchmark problems including five ZDT problems, five DTLZ problems and ten unconstrained CEC09 test problems show that NNCA is very competitive compared with seven the state-of-the-art multiobjective optimization algorithms.