CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
research
PSA based multi objective evolutionary algorithms
Authors
C.A. Coello Coello
C.A. Coello Coello
+18 more
E. Zitzler
G. Avigad
H. Sato
J. Heinonen
J.J. Durillo
K. Deb
K. Deb
K.C. Tan
L.S. Batista
M. Laumanns
M. Wineberg
O. Schütze
O. Schütze
P. Loridan
P.A.N. Bosman
P.A.N. Bosman
Q. Zhang
S. Salomon
Publication date
1 January 2014
Publisher
'Springer Science and Business Media LLC'
Doi
Cite
Abstract
It has generally been acknowledged that both proximity to the Pareto front and a certain diversity along the front, should be targeted when using evolutionary multiobjective optimization. Recently, a new partitioning mechanism, the Part and Select Algorithm (PSA), has been introduced. It was shown that this partitioning allows for the selection of a well-diversified set out of an arbitrary given set, while maintaining low computational cost. When embedded into an evolutionary search (NSGA-II), the PSA has significantly enhanced the exploitation of diversity. In this paper, the ability of the PSA to enhance evolutionary multiobjective algorithms (EMOAs) is further investigated. Two research directions are explored here. The first one deals with the integration of the PSA within an EMOA with a novel strategy. Contrary to most EMOAs, that give a higher priority to proximity over diversity, this new strategy promotes the balance between the two. The suggested algorithm allows some dominated solutions to survive, if they contribute to diversity. It is shown that such an approach substantially reduces the risk of the algorithm to fail in finding the Pareto front. The second research direction explores the use of the PSA as an archiving selection mechanism, to improve the averaged Hausdorff distance obtained by existing EMOAs. It is shown that the integration of the PSA into NSGA-II-I and Δ p -EMOA as an archiving mechanism leads to algorithms that are superior to base EMOAS on problems with disconnected Pareto fronts. © 2014 Springer International Publishing Switzerland
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
Crossref
See this paper in CORE
Go to the repository landing page
Download from data provider
info:doi/10.1007%2F978-3-319-0...
Last time updated on 01/04/2019
White Rose Research Online
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:eprints.whiterose.ac.uk:98...
Last time updated on 02/02/2021
White Rose Research Online
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:eprints.whiterose.ac.uk:98...
Last time updated on 02/08/2016