首页 文献索引 SCI期刊 AI助手
期刊目录筛选

期刊名:Evolutionary computation

缩写:EVOL COMPUT

ISSN:1063-6560

e-ISSN:1530-9304

IF/分区:3.4/Q2

文章目录 更多期刊信息

共收录本刊相关文章索引411
Clinical Trial Case Reports Meta-Analysis RCT Review Systematic Review
Classical Article Case Reports Clinical Study Clinical Trial Clinical Trial Protocol Comment Comparative Study Editorial Guideline Letter Meta-Analysis Multicenter Study Observational Study Randomized Controlled Trial Review Systematic Review
Arkadiy Dushatskiy,Marco Virgolin,Anton Bouter et al. Arkadiy Dushatskiy et al.
When it comes to solving optimization problems with evolutionary algorithms (EAs) in a reliable and scalable manner, detecting and exploiting linkage information, i.e., dependencies between variables, can be key. In this article, we present...
Jonata Tyska Carvalho,Stefano Nolfi Jonata Tyska Carvalho
Exposing an evolutionary algorithm that is used to evolve robot controllers to variable conditions is necessary to obtain solutions which are robust and can cross the reality gap. However, we do not yet have methods for analyzing and unders...
Richard Wehr,Scott R Saleska Richard Wehr
Territorial Differential Meta-Evolution (TDME) is an efficient, versatile, and reliable algorithm for seeking all the global or desirable local optima of a multivariable function. It employs a progressive niching mechanism to optimize even ...
Thomas H W Bäck,Anna V Kononova,Bas van Stein et al. Thomas H W Bäck et al.
Thirty years, 1993-2023, is a huge time frame in science. We address some major developments in the field of evolutionary algorithms, with applications in parameter optimization, over these 30 years. These include the covariance matrix adap...
Nikolaus Frohner,Bernhard Neumann,Giulio Pace et al. Nikolaus Frohner et al.
The traveling tournament problem is a well-known sports league scheduling problem famous for its practical hardness. Given an even number of teams with symmetric distances between their venues, a double round-robin tournament has to be sche...
Jakob Bossek,Christian Grimme Jakob Bossek
We contribute to the efficient approximation of the Pareto-set for the classical NP-hard multiobjective minimum spanning tree problem (moMST) adopting evolutionary computation. More precisely, by building upon preliminary work, we analyze t...
Fuda van Diggelen,Eliseo Ferrante,A E Eiben Fuda van Diggelen
In this paper, we compare Bayesian Optimization, Differential Evolution, and an Evolution Strategy employed as a gait-learning algorithm in modular robots. The motivational scenario is the joint evolution of morphologies and controllers, wh...
Anna V Kononova,Diederick Vermetten,Fabio Caraffini et al. Anna V Kononova et al.
We argue that results produced by a heuristic optimisation algorithm cannot be considered reproducible unless the algorithm fully specifies what should be done with solutions generated outside the domain, even in the case of simple bound co...
Cuie Yang,Jinliang Ding,Yaochu Jin et al. Cuie Yang et al.
Existing work on offline data-driven optimization mainly focuses on problems in static environments, and little attention has been paid to problems in dynamic environments. Offline data-driven optimization in dynamic environments is a chall...
Nilotpal Sinha,Kuan-Wen Chen Nilotpal Sinha
Evolution-based neural architecture search methods have shown promising results, but they require high computational resources because these methods involve training each candidate architecture from scratch and then evaluating its fitness, ...