scispace - formally typeset
Open Access

SPEA2: Improving the Strength Pareto Evolutionary Algorithm For Multiobjective Optimization

About
The article was published on 2002-01-01 and is currently open access. It has received 1972 citations till now. The article focuses on the topics: Pareto principle & Multi-objective optimization.

read more

Content maybe subject to copyright    Report

Citations
More filters
Journal ArticleDOI

A grid-enabled asynchronous metamodel-assisted evolutionary algorithm for aerodynamic optimization

TL;DR: A Grid-enabled asynchronous metamodel-assisted evolutionary algorithm is presented and assessed on a number of aerodynamic shape optimization problems and the gain in CPU cost is demonstrated.
Book ChapterDOI

Learning reusable initial solutions for multi-objective order acceptance and scheduling problems with genetic programming

TL;DR: A two-stage learning/optimising (2SLO) system is proposed in this paper to solve the multi-objective OAS problem and the computational results show that 2SLO is more effective than the pure EMO method.
Journal ArticleDOI

Some efficient approaches for multi-objective constrained optimization of computationally expensive black-box model problems

TL;DR: Two heuristic approaches aiming to build proxy problem models, solvable by computationally efficient optimization methods, in order to quickly provide a sufficiently accurate approximation of the Pareto front are proposed.
Book ChapterDOI

Packing Optimization of Free-Form Objects in Engineering Design

TL;DR: Packing for engineering design involves the development and use of methods to determine the arrangement of a set of subsystems or components within some enclosure to achieve aSet of objectives without violating spatial or performance constraints.
Proceedings ArticleDOI

Fast Implementation of the Steady-State NSGA-II Algorithm for Two Dimensions Based on Incremental Non-Dominated Sorting

TL;DR: This work presents a fast implementation of a steady-state version of the NSGA-II algorithm for two dimensions based on a data structure which has O(N) complexity for single solution insertion and deletion in the worst case.
Related Papers (5)