Zobrazeno 1 - 10
of 86
pro vyhledávání: '"mating pool"'
Publikováno v:
Mathematics, Vol 12, Iss 19, p 3075 (2024)
The key problem to solving constrained multi-objective optimization problems (CMOPs) is how to achieve a balance between objectives and constraints. Unfortunately, most existing methods for CMOPs still cannot achieve the above balance. To this end, t
Externí odkaz:
https://doaj.org/article/ee74b7a90bfe4b078eb37c7b1bcde880
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Evolutionary Intelligence. 16:229-245
A random-permutation technique and the features of the genetic algorithm (GA) are combined together to develop a novel heuristic for solving generalized travelling salesman problem. Here, the random-permutation technique is used to find the sequence
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::841b8b2c3c8eb8bdf9364f359ec8a78e
https://doi.org/10.1007/s12065-021-00651-5
https://doi.org/10.1007/s12065-021-00651-5
Publikováno v:
IEEE Transactions on Evolutionary Computation. 25:754-768
In recent years, numerous efficient and effective multimodal multiobjective evolutionary algorithms (MMOEAs) have been developed to search for multiple equivalent sets of Pareto optimal solutions simultaneously. However, some of the MMOEAs prefer con
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4abf0d571c189d13229f6dab1a7554af
https://doi.org/10.1109/tevc.2021.3064508
https://doi.org/10.1109/tevc.2021.3064508
Autor:
Wei Fang, Junchao Fang
Publikováno v:
CEC
In evolutionary many-objective optimization, achieving better balance between convergence and diversity of the population is a crucial way to improve the efficiency of the algorithm. However, diversity measure may select the individuals having good d
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ebd3633344c07a158d9291acd44983a7
https://doi.org/10.1109/cec45853.2021.9504935
https://doi.org/10.1109/cec45853.2021.9504935
Autor:
Michał K. Tomczyk, Miłosz Kadziński
Publikováno v:
GECCO
We propose a novel algorithm, called iMOEA-HA, for interactive evolutionary multiple objective optimization. It combines, in an original way, the state-of-the-art paradigms postulated in evolutionary multiple objective optimization and multiple crite
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b372a591c41f5a7e2c5516b20349f0d9
https://doi.org/10.1145/3449639.3459294
https://doi.org/10.1145/3449639.3459294
Publikováno v:
Information Sciences. 497:106-128
In evolutionary multi-objective optimization, it is crucial for the evolutionary algorithm to maintain a good balance between convergence and diversity. The recently proposed Two_Arch2 algorithm provides a new perspective to solve this problem. Howev
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::71612fe99b1447da3f6060f6a3309502
https://doi.org/10.1016/j.ins.2019.05.028
https://doi.org/10.1016/j.ins.2019.05.028
Publikováno v:
Neurocomputing. 339:77-93
In MOEA/D-DE, the appropriate value of the mating restriction probability varies with the evolutionary process. Furthermore, different subproblems have been solved in different degree during the evolution, so different subproblems have distinct requi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5f76744783272c1b21b9e336aa957d8b
https://doi.org/10.1016/j.neucom.2019.02.002
https://doi.org/10.1016/j.neucom.2019.02.002
Publikováno v:
Applied Soft Computing. 76:294-312
Traditional multi-objective evolutionary algorithms have encountered difficulties when handling many-objective problems. This is due to the loss of selection pressure incurred by the growing size of objective space. A variety of environmental selecti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a0de56f0da1f054a8db9bbfe17f86e22
https://doi.org/10.1016/j.asoc.2018.12.011
https://doi.org/10.1016/j.asoc.2018.12.011
Publikováno v:
Soft Computing. 23:12729-12744
An effective way to analyze and apprehend structural properties of networks is to find their most critical nodes. This paper studies a bi-objective critical node detection problem, denoted as Bi-CNDP. In this variant, we do not make any assumptions o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::986f2b66016423151aaa145b1864f11c
https://doi.org/10.1007/s00500-019-03824-8
https://doi.org/10.1007/s00500-019-03824-8