Zobrazeno 1 - 10
of 14
pro vyhledávání: '"and Edgar Covantes Osuna"'
Publikováno v:
IEEE Access, Vol 12, Pp 158878-158907 (2024)
Achieving uniform Pareto front (PF) approximations across various PF geometries and dimensions is a significant challenge. Most multi-objective evolutionary algorithms (MOEAs) that adapt a reference set to guide the evolutionary process, do not prior
Externí odkaz:
https://doaj.org/article/a10e69643b324bc8b1c546327fe4f584
Autor:
Jesús Guillermo Falcón-Cardona, Edgar Covantes Osuna, Carlos A. Coello Coello, Hisao Ishibuchi
Publikováno v:
Swarm and Evolutionary Computation. 79:101308
Publikováno v:
Theoretical Computer Science. 832:123-142
Parent selection in evolutionary algorithms for multi-objective optimisation is usually performed by dominance mechanisms or indicator functions that prefer non-dominated points. We propose to refine the parent selection on evolutionary multi-objecti
Autor:
Edgar Covantes Osuna, Dirk Sudholt
Publikováno v:
IEEE Transactions on Evolutionary Computation. 24:581-592
Many real-world optimization problems lead to multimodal domains and require the identification of multiple optima. Crowding methods have been developed to maintain population diversity, to investigate many peaks in parallel and to reduce genetic dri
Publikováno v:
CEC
Reference sets are widely used by many multi-objective evolutionary algorithms (MOEAs) to decompose the objective space, define search directions, or calculate quality indicators (QIs) embedded into the selection mechanisms. Well-known MOEAs adopt th
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030720612
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2243cdd0a3015fb6630d509d87cb0ddc
https://doi.org/10.1007/978-3-030-72062-9_62
https://doi.org/10.1007/978-3-030-72062-9_62
Publikováno v:
Advances in Computational Intelligence ISBN: 9783030898168
MICAI (1)
MICAI (1)
Reference sets generated with uniformly distributed weight vectors on a unit simplex are widely used by several multi-objective evolutionary algorithms (MOEAs). They have been employed to tackle multi-objective optimization problems (MOPs) with four
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::472d5f95d6648c77536130cbe9f5cb78
https://doi.org/10.1007/978-3-030-89817-5_28
https://doi.org/10.1007/978-3-030-89817-5_28
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030720612
EMO
EMO
Recently, an increasing number of state-of-the-art Multi-objective Evolutionary Algorithms (MOEAs) have incorporated the so-called pair-potential functions (commonly used to discretize a manifold) to improve the diversity within their population. A r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ccfafe7a292eeb3b1fefd8f9ea0081ab
https://doi.org/10.1007/978-3-030-72062-9_32
https://doi.org/10.1007/978-3-030-72062-9_32
Autor:
Dirk Sudholt, Edgar Covantes Osuna
Publikováno v:
Evolutionary computation. 30(1)
Niching methods have been developed to maintain the population diversity, to investigate many peaks in parallel and to reduce the effect of genetic drift. We present the first rigorous runtime analyses of restricted tournament selection (RTS), embedd
Autor:
Edgar Covantes Osuna, Dirk Sudholt
Clearing is a niching method inspired by the principle of assigning the available resources among a niche to a single individual. The clearing procedure supplies these resources only to the best individual of each niche: the winner. So far, its analy
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d796873abfcdde168a565944abdd76f0
https://eprints.whiterose.ac.uk/130670/1/whiterose-runtime-analysis-clearing.pdf
https://eprints.whiterose.ac.uk/130670/1/whiterose-runtime-analysis-clearing.pdf