Evolving Dynamic Multi-Objective Optimization Problems with Objective Replacement

Authors:
Sheng-Uei Guan;Qian Chen;Wenting Mo
Affiliations:
Department of Electrical and Computer Engineering, National University of Singapore, Singapore, Singapore 119260;Department of Electrical and Computer Engineering, National University of Singapore, Singapore, Singapore 119260;Department of Electrical and Computer Engineering, National University of Singapore, Singapore, Singapore 119260
Venue:
Artificial Intelligence Review
Year:
2005

Citing 14
Cited 7

Genetic algorithms with sharing for multimodal function optimization

Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
Genetic algorithms + data structures = evolution programs (3rd ed.)

Genetic algorithms + data structures = evolution programs (3rd ed.)
Multiple Objective Optimization with Vector Evaluated Genetic Algorithms

Proceedings of the 1st International Conference on Genetic Algorithms
Genetic Algorithms for Multiobjective Optimization: FormulationDiscussion and Generalization

Proceedings of the 5th International Conference on Genetic Algorithms
A Spatial Predator-Prey Approach to Multi-objective Optimization: A Preliminary Study

PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
A Variant of Evolution Strategies for Vector Optimization

PPSN I Proceedings of the 1st Workshop on Parallel Problem Solving from Nature
Approximating the Nondominated Front Using the Pareto Archived Evolution Strategy

Evolutionary Computation
Comparison of Multiobjective Evolutionary Algorithms: Empirical Results

Evolutionary Computation
Multiobjective evolutionary algorithms: a comparative case studyand the strength Pareto approach

IEEE Transactions on Evolutionary Computation
Kalman-extended genetic algorithm for search in nonstationaryenvironments with noisy fitness evaluations

IEEE Transactions on Evolutionary Computation
Dynamics of infinite populations evolving in a landscape of uni and bimodal fitness functions

IEEE Transactions on Evolutionary Computation
A fast and elitist multiobjective genetic algorithm: NSGA-II

IEEE Transactions on Evolutionary Computation
Multiobjective optimization and multiple constraint handling with evolutionary algorithms. I. A unified formulation

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Multiobjective optimization and multiple constraint handling with evolutionary algorithms. II. Application example

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans

An adaptable transport protocol based on Genetic Algorithms

International Journal of Information and Communication Technology
Cooperative co-evolution of GA-based classifiers based on input decomposition

Engineering Applications of Artificial Intelligence
Dynamic multi-objective optimization based on membrane computing for control of time-varying unstable plants

Information Sciences: an International Journal
Multi-swarm co-evolutionary paradigm for dynamic multi-objective optimisation problems

International Journal of Intelligent Information and Database Systems
Benchmarks for dynamic multi-objective optimisation algorithms

ACM Computing Surveys (CSUR)
Solution attractor of local search in travelling salesman problem: concept, construction and application

International Journal of Metaheuristics
A classification scheme for agent based approaches to dynamic optimization

Artificial Intelligence Review

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper studies the strategies for multi-objective optimization in a dynamic environment. In particular, we focus on problems with objective replacement, where some objectives may be replaced with new objectives during evolution. It is shown that the Pareto-optimal sets before and after the objective replacement share some common members. Based on this observation, we suggest the inheritance strategy. When objective replacement occurs, this strategy selects good chromosomes according to the new objective set from the solutions found before objective replacement, and then continues to optimize them via evolution for the new objective set. The experiment results showed that this strategy can help MOGAs achieve better performance than MOGAs without using the inheritance strategy, where the evolution is restarted when objective replacement occurs. More solutions with better quality are found during the same time span.