Multiple single objective pareto sampling

2004 The 2003 Congress on Evolutionary Computation, 2003. CEC '03. 234 citations

Abstract

We detail a new nonPareto evolutionary multiobjective algorithm, multiple single objective Pareto sampling (MSOPS), that performs a parallel search of multiple conventional target vector based optimisations, e.g. weighted min-max. The method can be used to generate the Pareto set and analyse problems with large numbers of objectives. The method allows bounds and discontinuities of the Pareto set to be identified and the shape of the surface to be analysed, despite not being able to visualise the surface easily. A new combination metric is also introduced that allows the shape of the objective surface that gives rise to discontinuities in the Pareto surface to be analysed easily.

Keywords

Pareto principleClassification of discontinuitiesMathematical optimizationSurface (topology)Pareto interpolationSet (abstract data type)Sampling (signal processing)Multi-objective optimizationMetric (unit)Pareto optimalAlgorithmComputer scienceMathematicsGeneralized Pareto distributionStatisticsEngineeringGeometry

Affiliated Institutions

Related Publications

Handbook of Genetic Algorithms

This book sets out to explain what genetic algorithms are and how they can be used to solve real-world problems. The first objective is tackled by the editor, Lawrence Davis. Th...

1991 7308 citations

Publication Info

Year
2004
Type
article
Volume
4
Pages
2678-2684
Citations
234
Access
Closed

Social Impact

Social media, news, blog, policy document mentions

Citation Metrics

234
OpenAlex
35
Influential
143
CrossRef

Cite This

E.J. Hughes (2004). Multiple single objective pareto sampling. The 2003 Congress on Evolutionary Computation, 2003. CEC '03. , 4 , 2678-2684. https://doi.org/10.1109/cec.2003.1299427

Identifiers

DOI
10.1109/cec.2003.1299427

Data Quality

Data completeness: 77%