A dynamic multi-objective evolutionary algorithm using center and multi-direction prediction strategies

Dynamic multi-objective optimization problems have been popular because of its extensive application. The difficulty of solving the problem focuses on the moving PS as well as PF dynamically. A large number of efficient strategies have been put forward to deal with such problems by speeding up convergence and keeping diversity. Prediction strategy is a common method which is widely used in dynamic optimization environment. However, how to increase the efficiency of prediction is always a key but difficult issue. In this paper, a new prediction model is designed by using the rank sums of individuals, and the position difference of individuals in the previous two adjacent environments is defined to identify the present change type. The proposed prediction strategy depends on environment change types. In order to show the effectiveness of the proposed algorithm, the comparison is carried out with five state-of-the-art approaches on 20 benchmark instances of dynamic multi-objective problems. The experimental results indicate the proposed algorithm can get good convergence and distribution in dynamic environments.