Dynamic Multiobjective Evolutionary Algorithm With Two Stages Evolution Operation

2015 
Multiobjective optimization problems occur in many situations and aspects of the engineering optimization field. In reality, many of the multiobjective optimization problems are dynamic in nature, i.e. their Pareto fronts change with the time or environment parameter; these optimization problems most often are called dynamic multiobjective optimization problem (DMOP). The major problems in solving DMOP are how to track and predict the Pareto optimization solutions and how to get the uniformly distributed Pareto fronts, which change with the time parameter. In this paper, a new dynamic multi-objective optimization evolutionary algorithm with two stages evolution operation is proposed for solving the kind of dynamic multiobjective optimization problem in which the Pareto optimal solutions change with time parameter continuously and slowly. At the first stage, when the time parameter has been changed, we use a new core distribution estimation algorithm to generate the new evolution population in the next env...
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    19
    References
    1
    Citations
    NaN
    KQI
    []