When using an evolutionary algorithm on an unknown problem, properties like the number of global/local optima must be guessed for properly picking an algorithm and its parameters. It is the aim of current paper to put forward an EA-based method for real-valued optimization to provide an estimate on the number of optima a function exhibits, or at least of the ones that are in reach for a certain...

The modification of message that meets the sufficient conditions for collision is found in the last step of differential attack proposed by Wang et all. (2005) on MD4 hash algorithm. Here we show how this attack phase, finding a collision starting from the list of sufficient conditions for the collision, can be implemented using a combination of two algorithms evolutionary algorithm and hill cl...

The aim of this paper is to present a new method for optimization of SVM multiple kernels. The kernel substitution can be used to define many other types of learning machines distinct from SVMs. We introduced a new hybrid method which uses in the first level an evolutionary algorithm based on wasp behaviour and on the co-mutation operator LR − Mijn and in the second level a SVM algorithm which ...

the imperialist competitive algorithm (ica) that was recently introduced has shown its good performance in optimization problems. this algorithm is inspired by competition mechanism among imperialists and colonies, in contrast to evolutionary algorithms. this paper presents optimization of bead geometry in welding process using of ica. therefore, two case studies from literature are presented t...

To demonstrate our approaches we will use Sudoku puzzles, which are an excellent test bed for evolutionary algorithms. The puzzles are accessible enough for people to enjoy. However the more complex puzzles require thousands of iterations before an evolutionary algorithm finds a solution. If we were attempting to compare evolutionary algorithms we could count their iterations to solution as an ...

This paper proposes an algorithm for Public Key Cryptography (PKC) using the hybrid concept of two evolutionary algorithms, Particle Swarm Optimization (PSO) and Genetic Algorithm (GA) respectively. PSO alone are fast and easy to implement, they follow the procedures of common evolutionary algorithm and posses memory feature which is absent in GA making it more valuable. In GA whole population ...

This work details early research aimed at applying the powerful resource allocation mechanism deployed in Stochastic Diffusion Search (SDS) to the Differential Evolution (DE), effectively merging a nature inspired swarm intelligence algorithm with a biologically inspired evolutionary algorithm. The results reported herein suggest that the hybrid algorithm, exploiting information sharing between...

This paper presents a new multi-objective hybrid model that makes cooperation between the strength of research of neighborhood methods presented by the tabu search (TS) and the important exploration capacity of evolutionary algorithm. This model was implemented and tested in benchmark functions (ZDT1, ZDT2, and ZDT3), using a network of computers. KeywordsMetaheuristics; hybrid method; intensif...

In this paper we present experimental results of self-adaptive differential evolution algorithm hybridized with a local search method. The results of the proposed hybrid algorithm are evaluated on a set of benchmark functions provided by the IEEE Congress on Evolutionary Computation (CEC 2008) special session on Large Scale Global Optimization. Performance comparison of our algorithm with other...

The learning automata operate in unknown random environments and progressively improve their performance via a learning process. The learning automata are very useful for optimization of multi-modal functions when the function is unknown and only noise-corrupted evaluations are available. In this paper we propose a new hybrid algorithm for noisy optimization. This model is obtained by combining...