A review of population-based metaheuristics for large-scale black-box global optimization—Part I

MN Omidvar, X Li, X Yao - IEEE Transactions on Evolutionary …, 2021‏ - ieeexplore.ieee.org
Scalability of optimization algorithms is a major challenge in co** with the ever-growing
size of optimization problems in a wide range of application areas from high-dimensional …

A review of population-based metaheuristics for large-scale black-box global optimization—Part II

MN Omidvar, X Li, X Yao - IEEE Transactions on Evolutionary …, 2021‏ - ieeexplore.ieee.org
This article is the second part of a two-part survey series on large-scale global optimization.
The first part covered two major algorithmic approaches to large-scale optimization, namely …

Evolutionary algorithms for parameter optimization—thirty years later

THW Bäck, AV Kononova, B van Stein… - Evolutionary …, 2023‏ - ieeexplore.ieee.org
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 …

[HTML][HTML] A model-based evolutionary algorithm for home health care scheduling

Y Clapper, J Berkhout, R Bekker, D Moeke - Computers & Operations …, 2023‏ - Elsevier
In this paper, for the first time a model-based evolutionary algorithm is presented for a real-
life Home Health Care Routing and Scheduling Problem (HHCRSP). The algorithm …

Optimal mixing evolutionary algorithms

D Thierens, PAN Bosman - Proceedings of the 13th annual conference …, 2011‏ - dl.acm.org
A key search mechanism in Evolutionary Algorithms is the mixing or juxtaposing of partial
solutions present in the parent solutions. In this paper we look at the efficiency of mixing in …

Parameter-less population pyramid

BW Goldman, WF Punch - Proceedings of the 2014 Annual Conference …, 2014‏ - dl.acm.org
Real world applications of evolutionary techniques are often hindered by the need to
determine problem specific parameter settings. While some previous methods have reduced …

Cooperative coevolution with knowledge-based dynamic variable decomposition for bilevel multiobjective optimization

X Cai, Q Sun, Z Li, Y **ao, Y Mei… - IEEE Transactions on …, 2022‏ - ieeexplore.ieee.org
Many practical multiobjective optimization problems have a nested bilevel structure in
variables, which can be modeled as bilevel multiobjective optimization problems (BLMOPs) …

Improving test case generation for rest apis through hierarchical clustering

D Stallenberg, M Olsthoorn… - 2021 36th IEEE/ACM …, 2021‏ - ieeexplore.ieee.org
With the ever-increasing use of web APIs in modern-day applications, it is becoming more
important to test the system as a whole. In the last decade, tools and approaches have been …

Partition crossover for pseudo-boolean optimization

R Tinós, D Whitley, F Chicano - … of the 2015 ACM conference on …, 2015‏ - dl.acm.org
A partition crossover operator is introduced for use with NK landscapes, MAX-kSAT and for
all k-bounded pseudo-Boolean functions. By definition, these problems use a bit …

A review on probabilistic graphical models in evolutionary computation

P Larrañaga, H Karshenas, C Bielza, R Santana - Journal of Heuristics, 2012‏ - Springer
Thanks to their inherent properties, probabilistic graphical models are one of the prime
candidates for machine learning and decision making tasks especially in uncertain domains …