Abstract
In this paper, the dynamic multi-objective optimization problem (DMOP) is first approximated by a series of static multi-objective optimization problems (SMOPs) by dividing the time period into several equal subperiods. In each subperiod, the dynamic multi-objective optimization problem is seen as a static multi-objective optimization problem by taking the time parameter fixed. Then, to decrease the amount of computation and efficiently solve the static problems, each static multi-objective optimization problem is transformed into a two-objective optimization problem based on two re-defined objectives. Finally, a new crossover operator and mutation operator adapting to the environment changing are designed. Based on these techniques, a new evolutionary algorithm is proposed. The simulation results indicate that the proposed algorithm can effectively track the varying Pareto fronts with time.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
