An ALife-Inspired Evolutionary Algorithm for Dynamic Multiobjective Optimization Problems

  • Amato P
  • Farina M
N/ACitations
Citations of this article
17Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Several important applications require a time-dependent (on-line) in which either the objective function or the problem parameters or both vary with time. Several studies are available in the literature about the use of genetic algorithms for time dependent fitness landscape in single-objective optimization problems. But when dynamic multi-objective optimization is concerned, very few studies can be found. Taking inspiration from Artificial Life (ALife), a strategy is proposed ensuring the approximation of Pareto-optimal set and front in case of unpredictable parameters changes. It is essentially an ALife-inspired evolutionary algorithm for variable fitness landscape search. We describe the algorithm and test it on some test cases.

Cite

CITATION STYLE

APA

Amato, P., & Farina, M. (2006). An ALife-Inspired Evolutionary Algorithm for Dynamic Multiobjective Optimization Problems. In Soft Computing: Methodologies and Applications (pp. 113–125). Springer-Verlag. https://doi.org/10.1007/3-540-32400-3_9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free