Dynamic Behavior Analysis of Membrane-Inspired Evolutionary Algorithms
نویسندگان
چکیده
منابع مشابه
Dynamic Behavior Analysis of Membrane-Inspired Evolutionary Algorithms
Abstract: A membrane-inspired evolutionary algorithm (MIEA) is a successful instance of a model linking membrane computing and evolutionary algorithms. This paper proposes the analysis of dynamic behaviors of MIEAs by introducing a set of population diversity and convergence measures. This is the first attempt to obtain additional insights into the search capabilities of MIEAs. The analysis is ...
متن کاملPreference-inspired co-evolutionary algorithms
The simultaneous optimisation of many objectives (say, in excess of 3), in order to obtain a full and satisfactory set of trade-off solutions to support a posteriori decision-making, remains challenging. To solve many-objective optimisation problems (MaOPs), a novel class of algorithms, namely, preferenceinspired co-evolutionary algorithms (PICEAs) is proposed based on a concept of co-evolving ...
متن کاملAnalysis on the Convergence of Quantum-inspired Evolutionary Algorithms
This article deals with the convergence of quantum-inspired evolutionary algorithms with one quantum individual and multiple observations. Applying the theory and analytical techniques in non-homogeneous Markov chain, we obtain the conclusion that quantuminspired evolutionary algorithms could converge in probability under some mild conditions imposed on the probability amplitude of the Q-bit in...
متن کاملSurvey of Quantum-Inspired Evolutionary Algorithms
This paper presents a concise survey of a new class of metaheuristics, drawing their inspiration from both: biological evolution and unitary evolution of quantum systems. In the first part of the paper, general concepts behind quantum-inspired evolutionary algorithms have been presented. In the second part, a state of the art of this field has been discussed and a literature review has been con...
متن کاملOn the Analysis of Dynamic Restart Strategies for Evolutionary Algorithms
Since evolutionary algorithms make heavy use of randomness it is typically the case that they succeed only with some probability. In cases of failure often the algorithm is restarted. Of course, it is desirable that the point of time when the current run is considered to be a failure and therefore the algorithm is stopped and restarted is determined by the algorithm itself rather than by the us...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computers Communications & Control
سال: 2014
ISSN: 1841-9844,1841-9836
DOI: 10.15837/ijccc.2014.2.794