Abstract

In this paper, a new dynamic multi-objective optimization evolutionary algorithm is proposed for tracking the Pareto-optimal set of time-changing multi-objective optimization problems effectively. In the proposed algorithm, to select individuals which are best suited for a new time from the historical optimal sets, an orthogonal predictive model is presented to predict the new individuals after the environment change is detected. Also, to converge to optimal front more quickly, an modified multi-objective optimization evolutionary algorithm based on decomposition is adopted. The proposed method has been extensively compared with other three dynamic multi-objective evolutionary algorithms over several benchmark dynamic multi-objective optimization problems. The experimental results indicate that the proposed algorithm achieves competitive results.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call