ECTA 2026 Abstracts


Area 1 - Theory and Methods

Full Papers
Paper Nr: 17
Title:

Classifying with Scored Rule Sets Evolved with Evolutionary Computation

Authors:

Robin Nunkesser

Abstract: We investigate how evolutionary computation methods can be applied to learn scored rule sets—an interpretable hypothesis space for multiclass classification in which each human-readable if-then rule is annotated with a realvalued score vector over classes. We introduce three new evolutionary estimators: ruleGP adapts logicGP’s class-bound Pareto evolution with discretization-based atom generation; ruleNSGA-II evolves complete scored rule sets via NSGA-II multi-objective genetic programming; and rulePLCS applies a BioHEL-inspired sequential covering strategy with Minimum Description Length (MDL)-based fitness. We further propose Lossy Rule Compaction (LRC), a post-processing algorithm that substantially reduces the complexity of Michigan-style classifier systems such as ExSTraCS while preserving predictive performance. To enable systematic comparison, all methods—including a neural-logic integration (ruleNLN) and transformations of established methods (HS, RuleKit)—are evaluated within a unified benchmark under common metrics. Experiments on ten datasets show that the evolutionary estimators achieve competitive F1 scores while producing substantially more compact models, with ruleGP offering the best trade-off between predictive performance and interpretability.

Paper Nr: 22
Title:

Dependency-Aware Encoding Genetic Algorithm (DAE-GA) for Hyperspectral Image Segmentation

Authors:

Mzoxolo Mbini and Thambo Nyathi

Abstract: Watershed-based segmentation of hyperspectral imagery depends on five interdependent parameters, and standard evolutionary optimisers encode them as independent flat vectors, which waste a large share of the evaluation budget on physically inconsistent configurations. This study proposes a Dependency-Aware Encoding (DAE) that groups the chromosome into three physically motivated blocks (spectral scale, threshold size, and dimensionality-classifier couplings), enforced by a deterministic repair operator and semantically coupled mutation operators, so that every decoded configuration is valid. DAE-GA was compared with a standard real-valued GA, PSO, Differential Evolution, Bayesian optimisation, and random search on the Indian Pines, Salinas, and Pavia University benchmarks under an identical 750-evaluation budget. DAE-GA outperforms the standard GA by 1.4–1.8 percentage points in overall accuracy on all three datasets, with run-to-run variance roughly halved (Wilcoxon rank-sum, p < 0.05). An ablation traces this to budget recovery: flat encoding wastes 28–34% of evaluations on degenerate configurations, which DAE cuts to below 3%, yielding a 30–40% reduction in evaluations needed to converge. These results indicate that encoding a pipeline’s known physical dependencies directly into the chromosome, rather than leaving a GA to discover them through generic operators, accounts for most of the observed performance gap.

Paper Nr: 70
Title:

An Analysis of Local Optima Found by Continuous Descents on QUBO Problems

Authors:

Rita Arfoul, Sara Tari, Nicolas Dupin and Sébastien Verel

Abstract: Discrete methods are the main approach for tackling combinatorial optimization problems, and an extensive literature exists on the analysis of their behavior. While some recent studies have considered continuous methods for tackling such problems, with promising results, their behavior in this context has barely been studied. We propose a first step in this direction through an empirical study of the Quadratic Unconstrained Binary Optimization problem (QUBO), using a benchmark that provides diverse fitness landscape structures. We focus specifically on the behavior of continuous gradient descent methods in comparison with discrete Hill-Climbing (HC). These straightforward approaches provide a simple and thus ideal context for our study, allowing us to focus our analysis on local optima, their basins of attraction, and the differences induced by instance parameters. Moreover, descent methods are regularly used as components of more efficient continuous algorithms, and this focus can provide insights into the development of future approaches. Our results highlight the main features of gradient descent compared with classical Hill-Climbing for discrete optimization.

Paper Nr: 78
Title:

Extending a Random Bit-Climbing Algorithm for Constrained Large-Scale Multi-Objective Binary Optimization

Authors:

Kenshiro Yamaguchi and Hernán Aguirre

Abstract: Multi-objective evolutionary algorithms have been shown to be highly effective for solving multi-objective optimization problems. However, when the number of decision variables reaches hundreds or thousands and constraints are imposed on the decision space, conventional algorithms often have difficulty solving such problems efficiently. This paper proposes a bit-climbing algorithm, named C-moRBC-WP, for efficiently solving large-scale constrained multi-objective binary optimization problems. The proposed method extends the moRBC-WP bit climber by adding a constraint-handling mechanism appropriate for large-scale problems, which incorporates a weighted permutation to guide the search in the infeasible space based on the information of previously visited infeasible solutions that reduce the constraints violation. Experimental results on SAT-constrained MNK-Landscapes show that the proposed algorithm effectively reduces the constraint violation of infeasible solutions and finds feasible solutions rapidly and robustly. Furthermore, it achieves superior hypervolume convergence compared to representative binary MOEAs, demonstrating its effectiveness for problems with up to 1,000 variables.

Paper Nr: 103
Title:

ROCA: A Dynamic Metaheuristic Framework for Route Optimization Using Context-Aware Ant Colony Systems

Authors:

Vihaan Parikh

Abstract: The Traveling Salesman Problem (TSP) underlies routing and logistics, but most solvers assume static, numerically-constrained graphs. This assumption breaks down when costs and topology change dynamically, and when operator intent is expressed in language rather than as fixed numerical penalties. We introduce ROCA (Route Optimization using Context-Aware Ants), a dynamic metaheuristic extending Max–Min Ant System (MMAS) with three components: an edge-level Q-learning layer for credit assignment, a Natural Language Processing (NLP) module converting constraints and metadata into semantic modifiers, and a self-evolving mechanism adapting MMAS parameters via log-normal perturbation and elitist selection. On TSPLIB, street, and airport benchmarks, ROCA keeps mean tour cost within 10% of optimal in at least 90% of runs. On TSPLIB pr1002, self-evolution alone yields a significant cost reduction over Plain MMAS (Wilcoxon signed-rank test, Cliff’s δ), and on street and airport benchmarks it outperforms Plain MMAS in 76.7% of matched trials. ROCA enforces explicit and ambiguous language constraints with success rates of 92.4% and 89.4%.

Paper Nr: 141
Title:

Existence of Piecewise-Smooth Solutions for an Analytical PSO Model with Threshold Memory

Authors:

Oleg Lomachenko

Abstract: We study the existence of solutions for an analytical model of particle swarm optimization with memory of the best visited positions. In this model, particle motion is governed by differential equations, while personal and global attractors depend on the history of the swarm. The main question is whether these two components admit a consistent solution. Two theorems demonstrate a qualitative gap between exact memory and threshold memory. The first theorem shows that, with exact memory, a piecewise-smooth solution with locally finite switches may fail to exist even for a smooth convex objective function. The second theorem guarantees the existence of such a solution under a positive tolerance for any continuous objective function bounded below. The proof gives an explicit event-based construction with finitely many memory updates. These results reveal an obstacle to the analytical formulation with exact memory and justify threshold-based memory updates as a way to construct admissible solutions.

Paper Nr: 154
Title:

Benchmarking Zero-Cost Performance Predictors for Neural Architecture Search in Super-Resolution Image Restoration

Authors:

Sergio Sarmiento-Rosales, Jesus Leopoldo Llano-García, Angel Vazquez, Raúl Monroy and Víctor Adrían Sosa Hernández

Abstract: Zero-cost performance predictors can reduce Neural Architecture Search (NAS) evaluation cost, but systematic evidence for dense image-to-image super-resolution remains limited. To the best of our knowledge, this is the first systematic multi-predictor benchmark for super-resolution image restoration (SRIR) architectures under a unified TensorFlow/Keras implementation. We compare eleven zero-cost performance predictors plus the ParamScore size baseline, using C-index as the primary indicator. Strategic-50 is the primary complexity-balanced pool of 50 SRIR architectures, each represented by one standardized reference training run. With transformations selected post hoc, NWOT achieves the highest mean C-index (0.796; 95% CI 0.793–0.799), while L2Norm ranks the fixed best-validation architecture first under all 30 zero-cost initialization seeds at 15.5 ms median score-computation time. This Top-1 result is based on reference PSNR values obtained from one standardized training run per architecture. The secondary Pareto-20 pool was inherited from a predictor-guided bi-objective NSGA-III search that maximized predicted peak signal-to-noise ratio (PSNR) and minimized parameter count; L2Norm leads this re-ranking scenario with a C-index of 0.920. Cross-scenario method-rank Spearman correlation is 0.790 and two preferred transformations change. The evidence therefore distinguishes broad screening within Strategic-50, shortlist utility, and Pareto-conditioned re-ranking; full-pool preferred transformations remain descriptive rather than independently validated rules.

Short Papers
Paper Nr: 16
Title:

Observation-Driven Quantum-Inspired PSO with Enhanced Convergence Rates

Authors:

Tomas Bartu and Michal Bidlo

Abstract: In this paper, we investigate three quantum-inspired algorithms (the genetic algorithm, one existing particle swarm optimisation and our newly proposed quantum-inspired particle swarm optimisation) and compare their features in solving various instances of the knapsack problem. We propose a new variant of particle swarm optimisation, the main part of which is an alternative approach to representing the candidate solutions directly by the observed values of the quantum states. The experimental results show that, compared with the existing binary quantum-inspired PSO variant, the proposed method achieves consistently faster convergence on all tested large knapsack instances, while maintaining comparable final solution quality. Moreover, both quantum-inspired particle swarm approaches outperform the quantum-inspired genetic algorithm on large knapsack instances, both in the quality of the obtained solutions and in their ability to reach the optimum.

Paper Nr: 24
Title:

Evolution of Cellular Automata Using Totalistic Conditionally Matching Rules

Authors:

Michal Bidlo and Radek Veselský

Abstract: A new format of transition rules for binary cellular automata is presented denominated as Totalistic Conditionally Matching Rules. It will be shown that, in combination with Genetic Algorithm, this approach allows obtaining a rich variety of transition functions for a given task in the cellular automaton. The results will be analysed and a promising automaton will be identified for more advanced experiments. It will be shown that the selected cellular automaton not only allows perfectly fulfilling the task (to perform glider-like movement) for which it has originally been designed by evolution but this automaton is also able to perform other well described operations with different initial structures that were not explicitly evaluated during evolution. In particular we show that by colliding the original glider with suitable structures allows reflecting the glider, duplicating it or performing movement with several other structures by a higher speed while using a single transition function. In fact, a new binary cellular automaton will be presented within which one can arrange various structures in order to achieve some specific behaviour (like in the famous Conway's Game of Life).

Paper Nr: 65
Title:

A Hybrid Heuristic Approach to Urban Glass Waste Collection Optimization

Authors:

Tarek Boufar, Omar Rifki and Matthieu Basseur

Abstract: In urban areas, waste collection requires planning strategies that prevent container overflows while satisfying operational constraints. This paper introduces a novel formulation of the glass waste collection problem based on recurrent visits rather than fixed periodic schedules. Instead of imposing predetermined collection dates, our model minimizes the time intervals between consecutive visits through an objective function that penalizes overflow situations. Specifically, we employ an exponential penalty that grows sharply when the fill level exceeds the container's capacity. This formulation is particularly well suited to local search methods, as the search landscape offers limited global guidance and the problem is characterized by high combinatorial complexity. The problem is addressed through a combination of complementary mechanisms, each playing an important role in the solution. First, greedy heuristics generate an initial solution, providing a good starting point for local search. The problem is then solved using partial neighborhood local search strategies, enabling effective exploration of the search space. Additionally, the Lin–Kernighan–Helsgaun heuristic is employed to minimize route duration, thereby freeing capacity to include additional container visits. Experimental results show that the proposed approach effectively prevents critical container states and produces collection schedules that remain far from overflow situations.

Paper Nr: 75
Title:

A Simple Weight-Guided (1+1)-ES for Continuous Multi- and Many-Objective Optimization

Authors:

Yudai Tagawa, Hernán Aguirre, Arnaud Liefooghe, Sébastien Verel and Kiyoshi Tanaka

Abstract: Multi-objective evolutionary algorithms (MOEAs) have been widely used, but their performance is known to deteriorate as the number of objectives increases. In binary-encoded settings, a weight-guided multi-start local search has been reported to outperform strong population-based methods despite its simplicity, but whether this framework is also effective in continuous spaces remains unclear. In this paper, we extend this concept to continuous multi- and many-objective optimization and propose wgES, a method that uses a (1+1) evolution strategy (ES) with step-size adaptation based on the 1/5 success rule as its search engine. At each iteration, wgES randomly switches the reference weight and restarts the search from a non-dominated solution, aiming to achieve both broad coverage of the objective space and strong convergence in the decision space. We evaluate wgES on the 20 ZCAT benchmark problems with the number of objectives {2,3,4,5} and compare it against NSGA-III and MOEA/D using GD, IGD, and IGD+. The results show that which method performs best depends strongly on the indicator and the number of objectives, and that wgES is particularly strong for small numbers of objectives and for problems with degenerate Pareto fronts. These findings suggest that scalarization-based search, which does not enforce uniform coverage of the entire simplex, can complement reference-point-based methods.

Paper Nr: 76
Title:

An Across-Problem Comparison Method for Multi-objective Evolutionary Algorithms Based on Problem Features Effects of Using the Nadir Point as a Reference Point in MOEA/D as Case Study

Authors:

Teruhisa Nakashima and Hernán Aguirre

Abstract: multiobjective optimization problems, the shape of the Pareto front and the structure of the search space can differ substantially from one problem to another. Therefore, even if an algorithm performs well on a particular problem, it does not necessarily perform effectively on other problems. For this reason, it is important not only to compare average performance over multiple problems, but also to clarify under which problem characteristics an algorithm works effectively. This study proposes an across-problem comparison method for analyzing the performance of multiobjective evolutionary algorithms with respect to specific problem features. In the proposed method, problems are grouped according to features such as the number of objectives, Pareto-front shape, discontinuity, degeneracy, multimodality, and separability, and performance differences within each group are statistically evaluated. As a case study, we investigate the effect of using the nadir point as an additional reference point in MOEA/D when solving a large number of instances of the ZCAT test suite that include various Pareto shapes and level of difficulty. Using the proposed method, we compared two algorithms across various problem features and clearly identified the characteristics that caused performance differences. The results provided insights into each algorithm’s properties and suggested directions for performance improvement. Thus, across-problem analysis enables not only performance comparison between algorithms, but also a systematic understanding of how problem features affect algorithm performance.

Paper Nr: 77
Title:

Successive Distance Mean for ε-Dominance-Based Algorithms on Diverse Pareto Fronts

Authors:

Yu Takei and Hernán Aguirre

Abstract: This paper investigates the effect of the ε-transformation function on the design of ε-dominance-based multi-objective optimization. A class of multi- and many-objective evolutionary algorithms uses ε-dominance, an extension of Pareto dominance, to distinguish between non-dominated solutions in order to select a subset among them. Here, the transformation function that maps fitness values to determine ε- dominance is fundamental to obtaining a well-distributed sample that will serve as the basis for further exploration and exploitation. This transformation function is usually designed with the assumption that solutions are uniformly distributed in each of the axes of objective space. However, in practical problems, this is not always the case, and conventional ε-transformation functions become less suitable when the Pareto front geometry is highly non-uniform. This work proposes a Successive Distance Mean ε-transformation function that eliminates the assumption that solutions are uniformly distributed and reflects the current density of solutions. To reduce over-expansion caused by large gaps, we additionally use a trimmed mean of successive distances, excluding a fixed proportion of the largest distances. We use Repeated ε-Sampling and Adaptive ε-Hood algorithm as the base algorithm and investigate the effect of the proposed function on its performance solving instances of the ZCAT test suite. Results show that Successive Distance Mean improves performance in several complex or degenerate Pareto front cases and can accelerate convergence.

Paper Nr: 126
Title:

Towards Interpretable Mixture-of-Experts Soft Sensors with Cartesian Genetic Programming for Regime-Dependent Process Dynamics

Authors:

Anna Scholze, Michael Heider and Jörg Hähner

Abstract: This work presents an interpretable Mixture-of-Experts (MoE) framework for industrial soft sensor modeling based on Cartesian Genetic Programming (CGP). Industrial processes often exhibit heterogeneous and regime-dependent dynamics, which makes it difficult for a single global symbolic model to represent the complete process behavior accurately. To address this challenge, the proposed MoE-CGP framework trains separate CGP experts for predefined operating phases and uses hard gating to route each input sample to the corresponding expert. The approach is evaluated on a synthetic benchmark dataset designed to emulate multi-phase industrial process behavior and is compared against two global CGP baselines and a global LSTM baseline. The results show that MoE-CGP achieves improvements in the evaluated runs over global CGP models and reduces the performance gap to the LSTM while preserving explicit symbolic expert models. However, the absolute prediction errors also indicate that further optimization is required before the approach can be considered suitable for precision-critical deployment. Overall, the findings suggest that regime-specific symbolic modeling is a promising direction for interpretable soft sensors under heterogeneous process dynamics.

Paper Nr: 128
Title:

OR-Agent: Bridging Evolutionary Search and Structured Research for Automated Heuristic Design

Authors:

Qi Liu, Ruochen Hao, Can Li and Wanjing Ma

Abstract: Automating heuristic design in complex, experiment-driven domains requires more than iterative mutation of solution algorithms. Current LLM-based evolutionary methods often rely on stochastic mutation loops that lack long-term strategic planning and a formal mechanism to learn from historical failures, leading to inefficient exploration and redundant trials. To address this, we present OR-Agent, a multi-agent research framework designed for automated heuristic design in optimization problems with rich experimental environments. OR-Agent organizes heuristic search as tree-based workflow that explicitly models branching hypothesis generation and systematic backtracking. Furthermore, to address the lack of adaptive learning in current agents, we introduce a hierarchical, optimization-inspired reflection system in which short-term reflections act as verbal gradients, long-term reflections as verbal momentum, and memory compression as semantic weight decay — collectively forming a principled mechanism for governing research dynamics. Extensive experiments on classical combinatorial optimization problems (e.g., TSP, CVRP, bin packing) and simulation-based cooperative driving scenarios demonstrate that OR-Agent outperforms strong evolutionary search baselines. All code and experimental data are publicly available at https://github.com/qiliuchn/OR-Agent.

Paper Nr: 138
Title:

Best Practices for Bio-Inspired Meta-Heuristic Optimization Research: A Position Paper

Authors:

Mauro Castelli, Paolo Cazzaniga, Luca Manzoni, Luca Mariot, Giorgia Nadizar, Marco S. Nobile, Gloria Pietropolli and Andrea Tangherloni

Abstract: Optimization is one of the most widespread and fundamen- tal tasks in computer science, underpinning a vast range of compu- tational and real-world problems. Among the many approaches, bio- inspired meta-heuristics have proven particularly powerful for tackling complex, multi-modal, noisy, and non-convex optimization tasks. In re- cent years, these methods have gained growing attention beyond their traditional research community, fostering cross-disciplinary collaboration and innovation. However, the field has also suffered from frequent mis- use and inconsistent methodological practices. Many of the principles needed for sound research are already known to experienced researchers, yet they remain scattered, informal, or implicit [47]. This manuscript consolidates them into a concise and accessible set of guidelines for bio- inspired meta-heuristics, intended to prevent common pitfalls, support newcomers, and serve as a shared reference for authors and reviewers.

Paper Nr: 143
Title:

Towards Robustness and Uncertainty Quantification of Physical Symbolic Expressions for Genetic Programming

Authors:

Pravin Pandey and Sanaz Mostaghim

Abstract: Genetic Programming (GP) is a widely applied method to discover interpretable symbolic expressions from data, yet expression selection procedures do not guarantee that expressions are stable under data variability and robust to perturbation of numerical constants. In this paper, we propose an integration of average bootstrap error as an optimization objective along with predictive error, dimensional consistency, and expression complexity. This formulation penalizes expressions sensitive to data resampling and yields a per expression uncertainty estimate. After evolution, we perform a post-hoc robustness analysis on the fitted constants for each expression. We multiplicatively perturb every constant within a controlled neighborhood distance based on Structural Hamming Distance, and compute the predictive performance of perturbed expressions. A dual-front ranking mechanism compares expressions ranked by original GP objectives against those ranked by robustness objectives. Expressions with degraded rank are discarded, and a weighted score of objectives selects the top-K expressions.

Paper Nr: 164
Title:

Component-Wise Analysis on Genetic Algorithm Implementations for Combinatorial Optimisation: A Case Study on the Capacitated Vehicle Routing Problem

Authors:

Kazım Erdoğdu and Alexandros Tzanetos

Abstract: Randomised Optimisation Algorithms (ROAs) are widely used to solve complex optimisation problems due to their simple design and implementation and improved average-case performance. However, their effectiveness depends strongly on the design and interaction of their algorithmic components. Properly selecting algorithmic components is a very effortful task due to the increasing number of possible components, such as operators and mechanisms, found in the literature. Therefore, evaluating various combinations of components is essential to reveal their effects on the algorithm’s behaviour and performance. This study focuses on an established ROA, i.e., the Genetic Algorithm (GA), and investigates the behaviour of its components on a combinatorial problem, i.e., the capacitated Vehicle Routing Problem (VRP). The work considers alternative mechanisms for solution representation, route construction, parent selection, recombination, and mutation. A set of benchmark instances with different customer-distribution characteristics is used to evaluate the effect of these components on solution quality, convergence behaviour, and population diversity. The experimental results show that some component choices have a more consistent influence on performance, while others exhibit more instance-dependent behaviour. Overall, the study highlights the importance of analysing GA components not only individually, but also in terms of their compatibility with the solution representation and problem structure. The findings provide useful insight for the design of modular and reusable GA-based optimisation frameworks.

Paper Nr: 168
Title:

Leveraging Symmetry in Maude-Based Adaptive Multi-Formalism Models

Authors:

Lorenzo Capra

Abstract: We introduce an efficient analysis technique for realistic models of adaptive systems that brings together two approaches that rely on Maude: (1) a compositional, symmetry-aware method for building quotient transition systems (lumped Markov processes) in Rewritable (Stochastic) Petri nets (RwSPNs), based on algebraic operators and structured node labeling, and (2) a multiformalism modeling platform in which several formalisms can be combined within a single framework. The modular RwSPN methodology is seamlessly extended to this multiformalism context; promising initial findings from an edge-computing case study are reported. This work exploits a recently proposed technique to precisely compute Markov chain transition rates from Maude’s labeled transition systems.

Paper Nr: 74
Title:

When Feasible Solutions Become a Trap: Initialization Strategies for EDAs in the Traveling Tournament Problem

Authors:

Guilherme Nakahata, Claus Aranha and Florian Richoux

Abstract: The Traveling Tournament Problem is a highly constrained scheduling problem in which obtaining feasible and good quality schedules remains difficult for optimization methods. In this work, we study how initialization and feasibility influence the behavior of Estimation of Distribution Algorithms (EDA) using a Univariate EDA and a Tree-based EDA. Experiments were conducted using feasible, partially feasible, and infeasible initial solutions under different penalty intensities, and the behavior of local search was also investigated. Initialization had a stronger influence on the search process than the penalty intensity. Most of the improvements observed in the hybrid approaches originate from the local search component, particularly for the larger benchmark instances. These results provide evidence that learning effective probabilistic models for highly constrained scheduling problems remains challenging, and help clarify the importance of initialization and local search in this process.

Area 2 - Applications

Full Papers
Paper Nr: 118
Title:

Evolutionary Multi-Objective Unit Selection for Strategy Games: An Example in Warhammer 40,000

Authors:

Carlo Nübel, Cedrik Weißbrich and Sanaz Mostaghim

Abstract: While many game-playing AI methods focus on real-time decisionmaking within large action spaces, other scenarios, such as deck building or optimizing build orders in strategy games, require fundamentally different solution approaches. These problems often need to be solved before the actual gameplaying starts, but they can heavily determine the outcome of the game. In this paper we define the army-building problem in Warhammer 40,000 as a constrained multi-objective optimization problem. We propose a solution approach based on evolutionary optimization and formulate a custom stochastic repair mechanism that produces feasible and improved solutions. Preliminary experiments are carried out to analyze the effect of the repair mechanism on the optimization. First, a hyperparameter study is conducted, and then different variations of NSGA-II are compared in an ablation study using six different configurations of crossover and mutation operators, with and without the proposed repair mechanism. Results indicate that the performance is strongly dependent on the combination of parameters, more so than on specific values of individual parameters. The population size, however, is the most influential parameter. In addition, all configurations with the proposed repair operator outperform the configurations without. The Pareto-optimal armies outperform handcrafted baseline armies in terms of the objective values.

Short Papers
Paper Nr: 120
Title:

Evolving Memorization-Constrained Chess Opening Repertoires against Different Opponent Models

Authors:

Minhaj Ul Hassan, Hazeera Muhammad Hashim, Zainab Zahid and Syeda Saleha Raza

Abstract: Building a chess opening repertoire a human can realistically memorize, yet that holds up against opponents of widely varying skill, is a constrained optimization problem: only a few moves can be prepared in advance, yet every likely opponent reply must still have a prepared answer. We ask whether, when a repertoire is built automatically, getting the coverage requirement right matters more than the choice of search algorithm. We study a closure rule that forces the repertoire to answer every opponent reply played in at least 15% of observed Lichess games at any reached position, under a preparation budget of B committed moves per color. We compare five methods over 30 seeds at two budgets (B = 10 and B = 25), a most-played heuristic, random search, a greedy hillclimber, a genetic algorithm (STATIC) and a co-evolutionary variant (COEVOLVE), crossed with nine coverage rules. Training uses a CVaR- weighted fitness, while held-out evaluation measures expected score uniformly across three rating bands. The closure rule emerges as the dominant factor, worth a consistent +0.023 in held-out expected score at maximal effect size (A12 = 1.0, p < 7.5 × 10^−9). Co-evolution offers no significant benefit over Static (A12 = 0.45, p = 1.0) at 35× the computational cost, while the greedy hillclimber matches GA-quality solutions far faster, indicating a search space smooth enough for simple local search. A Stockfish check confirms the gains come from objectively sound play rather than from exploiting human error. For adversarial preparation problems of this kind, the coverage constraint matters more than the optimizer.

Paper Nr: 122
Title:

Interpretable Healthcare Synthetic Data Generation Using Cartesian Genetic Programming

Authors:

Nassim Bou Nasr, Yuri Lavinas, Ségolène Combettes and Sylvain Cussat-Blanc

Abstract: Synthetic tabular data generation is increasingly used in healthcare to augment limited datasets, enable data sharing, and support model development. Current state-of-the-art methods for tabular synthetic data generation are dominated by deep generative models, including GAN- and VAE-based approaches such as CTGAN and TVAE, and more recent diffusion-based models such as TabDDPM. These methods can reproduce complex data distributions with high fidelity, but they do so through black-box mechanisms: a trained generator consists of learned network parameters rather than an explicit, traceable procedure for producing each synthetic feature value. In a clinical setting, where data auditability and clinician trust are central concerns and regulatory frameworks increasingly call for explainable AI, this opacity is a meaningful limitation, independent of whatever fidelity scores the model achieves. In this paper, we propose a generator built from Cartesian Genetic Programming (CGP): a population of symbolic computational graphs evolved directly against a distributionalfidelity objective. Each evolved generator is a finite, explicit graph of mathematical operations that can be traced and audited feature by feature. We describe the genome representation, the (1 + λ) evolutionary search procedure, a mixed numerical/categorical fitness function based on Kolmogorov–Smirnov and total variation distance, and a multi-axis evaluation protocol covering fidelity, downstream classification utility, and privacy. We evaluate the proposed generator across three tabular datasets covering heart disease, fetal health, and wine quality, and analyze the tradeoff between symbolic interpretability and the performance of black-box deep generative baselines.

Paper Nr: 44
Title:

The Traveling Tournament Problem: Constraint Violations for Different Values of NoRepeat and MaxStreak

Authors:

Lukas Hassel, Guilherme Nakahata, Ruben Horn and Daan van den Berg

Abstract: We generate a large number of solutions for instances of the traveling tournament problem using uniform random sampling, while varying the parameter values for maxStreak and noRepeat simultaneously and count the number of constraint violations. Results show independence between these violations, we conjecture this might be due to the generation method only and discuss whether this independence holds in real algorithmic settings. We also discuss whether uniform sampling of solutions is possible for this problem, and as a consequence, whether `feasible' operators for mutation and crossover can exist at all for this problem. Possibly, all these issues are related and make some NP-hard problems, like the the traveling tournament problem, unsolvable with evolutionary algorithms.

Paper Nr: 49
Title:

Adaptive Hyper-Heuristic Control of Particle Swarm Optimisation for Multilevel Intensity Partitioning of Brain Magnetic Resonance Images

Authors:

Mzoxolo Mbini and Thambo Nyathi

Abstract: Segmenting a brain scan based solely on intensity is challenging because the histograms of brain tissue are multimodal, and population-based metaheuristics, such as particle swarm optimisation (PSO), tend to converge prematurely on this type of landscape. Recent PSO variants address this by wiring a fixed diversification or refinement mechanism directly into the velocity update; the mechanism then runs unconditionally every iteration, and any change to it means re-deriving the entire update rule. We propose HyPSO, a hyper-heuristic that leaves the PSO velocity update unchanged and places an adaptive controller atop the swarm. At fixed intervals, the controller chooses online from five lightweight hill-climbing variants, whichever has recently been most rewarding, and applies it to the swarm's global-best particle. On brain MRI, HyPSO significantly outperforms canonical PSO and several established variants in terms of structural similarity, is statistically indistinguishable from the two strongest and most structurally complex competitors, and costs noticeably less to run. Additionally, it surpasses our reimplementation of the most recent variant in the literature. Ablation isolates the controller's online learning, not merely the presence of local search, as the source of this gain. On the more heterogeneous BSDS500 images, HyPSO no longer keeps pace with the strongest competitors, a limitation we trace to the exploration ceiling of canonical PSO itself. HyPSO's case rests on brain MRI specifically, not on being the best thresholding method in general, and validation against expert-annotated tumour masks is the priority next step before any clinical claim is made.