Random mechanisms including mutations are an internal part of evolutionary algorithms, which based on the fundamental ideas Darwin’s theory evolution as well Mendel’s genetic heritage. In this paper, we debate whether pseudo-random processes needed for algorithms or deterministic chaos, is not a random process, can be suitably used instead. Specifically, compare performance 10 driven by chaotic...

In this paper, an evolutionary artificial immune system for multi-objective optimization which combines the global search ability of evolutionary algorithms and immune learning of artificial immune systems is proposed. A new selection strategy is developed based upon the concept of clonal selection principle to maintain the balance between exploration and exploitation. In order to maintain a di...

in this study, a multi-objective genetic algorithm (moga) is utilized to extract interpretable and compact fuzzy rule bases for modeling nonlinear multi-input multi-output (mimo) systems. in the process of non- linear system identi cation, structure selection, parameter estimation, model performance and model validation are important objectives. furthermore, se- curing low-level and high-level ...

Deadline-constrained scheduling in project management is a NP-hard optimisation problem with major relevance in software engineering and other real-life situations dealing with the planning of activities that must be completed before specific dates. This article introduces efficient parallel versions for two evolutionary algorithms (genetic algorithm and hybrid evolutionary algorithm), to solve...

There are two types of digital filters including Infinite Impulse Response (IIR) and Finite Impulse Response (FIR). IIR filters attract more attention as they can decrease the filter order significantly compared to FIR filters. Owing to multi-modal error surface, simple powerful optimization techniques should be utilized in designing IIR digital filters to avoid local minimum. Imperialist compe...

Optimizing the database queries is one of hard research problems. Exhaustive search techniques like dynamic programming is suitable for queries with a few relations, but by increasing the number of relations in query, much use of memory and processing is needed, and the use of these methods is not suitable, so we have to use random and evolutionary methods. The use of evolutionary methods, beca...

With the rapid development of the internet, the amount of information and data which are produced, are extremely massive. Hence, client will be confused with huge amount of data, and it is difficult to understand which ones are useful. Data mining can overcome this problem. While data mining is using on cloud computing, it is reducing time of processing, energy usage and costs. As the speed of ...