| 2021 | CMA-ES with coordinate selection for high-dimensional and ill-conditioned functions. | Hiroki Shimizu, Masashi Toyoda |
| 2021 | Realistic utility functions prove difficult for state-of-the-art interactive multiobjective optimization algorithms. | Seyed Mahdi Shavarani, Manuel Lpez-Ibez, Joshua D. Knowles |
| 2021 | Distance-based subset selection revisited. | Ke Shang, Hisao Ishibuchi, Yang Nan |
| 2021 | Greedy approximated hypervolume subset selection for many-objective optimization. | Ke Shang, Hisao Ishibuchi, Weiyu Chen |
| 2021 | Monte Carlo elites: quality-diversity selection as a multi-armed bandit problem. | Konstantinos Sfikas, Antonios Liapis, Georgios N. Yannakakis |
| 2021 | Negative learning ant colony optimization for the minimum positive influence dominating set problem. | Albert Lpez Serrano, Teddy Nurcahyadi, Salim Bouamama, Christian Blum |
| 2021 | Evolutionary algorithms in high-dimensional radio access network optimization. | Dmitriy Semenchikov, Anna Filippova, Dmitriy Volf, Nikolai A. Kovrizhnykh, Maxim Mironov, Jinying Zou, Ronghui Luo, Yuanming Zhu, Dapeng Chai, Huang Wei |
| 2021 | On sampling error in evolutionary algorithms. | Dirk Schweim, David Wittenberg, Franz Rothlauf |
| 2021 | Using knowledge of human-generated code to bias the search in program synthesis with grammatical evolution. | Dirk Schweim, Erik Hemberg, Dominik Sobania, Una-May O'Reilly, Franz Rothlauf |
| 2021 | Improving the generalisation of genetic programming models with evaluation time and asynchronous parallel computing. | Aliyu Sani Sambo, R. Muhammad Atif Azad, Yevgeniya Kovalchuk, Vivek Padmanaabhan Indramohan, Hanifa Shah |
| 2021 | BR-NS: an archive-less approach to novelty search. | Achkan Salehi, Alexandre Coninx, Stphane Doncieux |
| 2021 | Learning assignment order in an ant colony optimiser for the university course timetabling problem. | James Sakal, Jonathan E. Fieldsend, Edward C. Keedwell |
| 2021 | Linear regression strategy for differential evolution. | Jos L. Sainz-Pardo |
| 2021 | GLEAM: genetic learning by extraction and absorption of modules. | Anil Kumar Saini, Lee Spector |
| 2021 | Optimization of multi-objective mixed-integer problems with a model-based evolutionary algorithm in a black-box setting. | Krzysztof L. Sadowski, Dirk Thierens, Peter A. N. Bosman |
| 2021 | MAEDyS: multiagent evolution via dynamic skill selection. | Enna Sachdeva, Shauharda Khadka, Somdeb Majumdar, Kagan Tumer |
| 2021 | Untitled record | Jean Ruppert, Marharyta Aleksandrova, Thomas Engel |
| 2021 | Towards effective GP multi-class classification based on dynamic targets. | Stefano Ruberto, Valerio Terragni, Jason H. Moore |
| 2021 | Setup of fuzzy hybrid particle swarms: a heuristic approach. | Nicolas Roy, Charlotte Beauthier, Timoto Carletti, Alexandre Mayer |
| 2021 | Representations for evolutionary algorithms. | Franz Rothlauf |
| 2021 | A genetic algorithm approach for the Euclidean Steiner tree problem with soft obstacles. | Manou Rosenberg, Tim French, Mark Reynolds, Lyndon While |
| 2021 | An evolutionary approach to interpretable learning. | Jake Robertson, Ting Hu |
| 2021 | The tiebreaking space of constructive heuristics for the permutation flowshop minimizing makespan. | Marcus Ritt, Alexander J. Benavides |
| 2021 | Design of specific primer sets for SARS-CoV-2 variants using evolutionary algorithms. | Alejandro Lopez Rincon, Carmina A. Perez Romero, Lucero Mendoza Maldonado, Eric Claassen, Johan Garssen, Aletta D. Kraneveld, Alberto Tonda |
| 2021 | Error function learning with interpretable compositional networks for constraint-based local search. | Florian Richoux, Jean-Franois Baffier |