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
ETEA: A euclidean minimum spanning tree-Based evolutionary algorithm for multiobjective optimization
Authors
Bui L. T.
Coello C. A. C.
+11 more
Deb K
Jinhua Zheng
Knowles J. D.
Kuhn H. W.
Li M.
Miqing Li
Shengxiang Yang
Van Veldhuizen D. A.
Xiaohui Liu
Zitzler E.
Šeda M
Publication date
1 May 2014
Publisher
'MIT Press - Journals'
Doi
Cite
Abstract
© the Massachusetts Institute of TechnologyAbstract The Euclidean minimum spanning tree (EMST), widely used in a variety of domains, is a minimum spanning tree of a set of points in the space, where the edge weight between each pair of points is their Euclidean distance. Since the generation of an EMST is entirely determined by the Euclidean distance between solutions (points), the properties of EMSTs have a close relation with the distribution and position information of solutions. This paper explores the properties of EMSTs and proposes an EMST-based Evolutionary Algorithm (ETEA) to solve multiobjective optimization problems (MOPs). Unlike most EMO algorithms that focus on the Pareto dominance relation, the proposed algorithm mainly considers distance-based measures to evaluate and compare individuals during the evolutionary search. Specifically in ETEA, four strategies are introduced: 1) An EMST-based crowding distance (ETCD) is presented to estimate the density of individuals in the population; 2) A distance comparison approach incorporating ETCD is used to assign the fitness value for individuals; 3) A fitness adjustment technique is designed to avoid the partial overcrowding in environmental selection; 4) Three diversity indicators-the minimum edge, degree, and ETCD-with regard to EMSTs are applied to determine the survival of individuals in archive truncation. From a series of extensive experiments on 32 test instances with different characteristics, ETEA is found to be competitive against five state-of-the-art algorithms and its predecessor in providing a good balance among convergence, uniformity, and spread.Engineering and Physical Sciences Research Council (EPSRC) of the United Kingdom under Grant EP/K001310/1, and the National Natural Science Foundation of China under Grant 61070088
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
De Montfort University Open Research Archive
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:dora.dmu.ac.uk:2086/9975
Last time updated on 16/10/2019
Crossref
See this paper in CORE
Go to the repository landing page
Download from data provider
info:doi/10.1162%2Fevco_a_0010...
Last time updated on 05/06/2019
University of Birmingham Research Portal
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:pure.atira.dk:openaire_cri...
Last time updated on 14/12/2019
University of Birmingham Research Portal
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:pure.atira.dk:publications...
Last time updated on 14/12/2019
Sustaining member
Brunel University Research Archive
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:bura.brunel.ac.uk:2438/773...
Last time updated on 15/12/2013