The traveling salesperson problem (TSP) is one of the most iconic hard optimization tasks.
With frequency fitness assignment (FFA), a new approach to optimization has recently been …

Unlike other NP-hard problems, the constraints on the traveling tournament problem are so
pressing that it's hardly possible to randomly generate a valid solution, for example, to use in …

Local optima are a menace that can trap optimisation processes. Frequency fitness
assignment (FFA) is an concept aiming to overcome this problem. It steers the search …

We introduce moptipy, a toolbox for implementing, experimenting with, and applying
optimization algorithms. It features mechanisms for executing fully reproducible experiments …

At the time of writing, there is no known deterministic time algorithm to uniformly sample
initial valid solutions for the traveling tournament problem, severely impeding any …

The classical compact double-round robin traveling tournament problem (TTP) asks us to
schedule the games of n teams in a tournament such that each team plays against every …

At the time of writing, there is no known deterministic-time algorithm to sample valid initial
solutions with uniform random distribution for the HP protein folding model, because …

We consider a two-dimensional orthogonal bin packing problem (2BP) where rectangular
items are to be placed into rectangular bins such that their edges are parallel to those of the …

The Frequency Fitness Assignment (FFA) method steers evolutionary algorithms by
objective rareness instead of objective goodness. Does this mean the size of the …

The Quadratic Assignment Problem (QAP) is one of the classical HP-hard tasks from
operations research with a history of more than 65 years. It is often approached with …