Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Yuri Cossich Lavinas"'
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030720612
EMO
EMO
Finding good solutions for Multi-objective Problems (MOPs) is considered a hard problem, especially when considering MOPs with constraints. Thus, most of the works in the context of MOPs do not explore in-depth how different constraints affect the pe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::161c67ec930d61998447d4f0357c37db
https://doi.org/10.1007/978-3-030-72062-9_44
https://doi.org/10.1007/978-3-030-72062-9_44
Publikováno v:
Theory and Practice of Natural Computing ISBN: 9783030904241
TPNC
TPNC
The Multi-Objective Evolutionary Algorithm based on Decomposition (MOEA/D) is a popular algorithm for solving Multi-Objective Problems (MOPs). The main component of MOEA/D is to decompose a MOP into easier sub-problems using a set of weight vectors.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::195eab51498a7b4c26bd64a9b1d3c7c2
https://doi.org/10.1007/978-3-030-90425-8_7
https://doi.org/10.1007/978-3-030-90425-8_7
Publikováno v:
CEC
Recent studies on resource allocation suggest that some subproblems are more important than others in the context of the MOEA/D, and that focusing on the most relevant ones can consistently improve the performance of that algorithm. These studies sha
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::545147acc2175feb531d7ba70c0237c8
https://doi.org/10.1109/cec48606.2020.9185527
https://doi.org/10.1109/cec48606.2020.9185527
Publikováno v:
GECCO (Companion)
The key characteristic of the Multi-Objective Evolutionary Algorithm Based on Decomposition (MOEA/D) is that a multi-objective problem is decomposed into multiple single-objective subproblems. In standard MOEA/D, all subproblems receive the same comp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::da8af37ad9397f81ac36e939a4b2c297
https://doi.org/10.1145/3319619.3321948
https://doi.org/10.1145/3319619.3321948
Publikováno v:
Theory and Practice of Natural Computing ISBN: 9783030344993
TPNC
TPNC
One of the main algorithms for solving Multi-Objective Optimization Problems is the Multi-Objective Evolutionary Algorithm Based on Decomposition (MOEA/D). It is characterized by decomposing the multiple objectives into a large number of single-objec
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e76ed7a7a07abf53fb7a64746fe82348
https://doi.org/10.1007/978-3-030-34500-6_9
https://doi.org/10.1007/978-3-030-34500-6_9
Publikováno v:
SMC
We perform an experimental study about the effect of the tournament size parameter from the Tournament Selection operator. Tournament Selection is a classic operator for Genetic Algorithms and Genetic Programming. It is simple to implement and has on
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f54ec91a987dfdfb595795b5c3f5fdeb
https://doi.org/10.1109/smc.2018.00617
https://doi.org/10.1109/smc.2018.00617
Publikováno v:
IJCCI (ECTA)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::854694b1e3195169bb2ea4f50d741555
https://doi.org/10.5220/0005072600490058
https://doi.org/10.5220/0005072600490058
Autor:
Daniele C. Uchoa Maia Rodrigues, Felipe Arruda Moura, Nicolò Oreste Pinciroli Pinciroli Vago, Yuri Cossich Lavinas, Sergio Augusto Cunha, Claus Aranha, Ricardo da Silva Torres
Publikováno v:
Scopus-Elsevier
ECMS
ECMS
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f5b685fca409e948034daa6d61c69da5
http://www.scopus.com/inward/record.url?eid=2-s2.0-85094939681&partnerID=MN8TOARS
http://www.scopus.com/inward/record.url?eid=2-s2.0-85094939681&partnerID=MN8TOARS