Designing efficient sorting networks has been a challenging combinatorial optimization problem since the early 1960’s. The application of evolutionary computing to this problem ...
We propose and study the Maximum Constrained Agreement Subtree (MCAST) problem, which is a variant of the classical Maximum Agreement Subtree (MAST) problem. Our problem allows us...
Sorting by reversals is an important problem in inferring the evolutionary relationship between two genomes. The problem of sorting unsigned permutation has been proven to be NP-ha...
Most applications of evolutionary algorithms (EAs) deal with static optimization problems. However, in recent years, there has been a growing interest in timevarying (dynamic) prob...
Rasmus K. Ursem, Thiemo Krink, Mikkel T. Jensen, Z...
Real life optimization problems often require finding optimal solution to complex high dimensional, multimodal problems involving computationally very expensive fitness function e...