Finding binary sequences with low autocorrelation is a very hard problem with many practical applications. In this paper we analyze several metaheuristic approaches to tackle the ...
— This paper describes the so-called Differential Ant-Stigmergy Algorithm (DASA), which is an extension of the Ant-Colony Optimization for a continuous domain. An experimental ev...
Peter Korosec, Jurij Silc, Klemen Oblak, Franc Kos...
Abstract-- This paper compares three different fitness diversity adaptations in Multimeme Algorithms (MmAs). These diversity indexes have been integrated within a MmA present in li...
—The noise-robust matching of two graphs is a hard combinatorial problem with practical importance in several domains. In practical applications, a unique solution for a given in...
AbstractThis paper presents a real-coded memetic algorithm that combines a high diversity global exploration with an adaptive local search method to the most promising individuals ...