Incorporating the Confusion Effect into the Simulated Evolution of Crowded Selfish Herds

Author(s):  
Wen-Chi Yang
1986 ◽  
Vol 34 (5) ◽  
pp. 1372-1380 ◽  
Author(s):  
Laurie Landeau ◽  
John Terborgh
Keyword(s):  

2017 ◽  
Vol 42 (4) ◽  
pp. 339-358 ◽  
Author(s):  
Krzysztof Krawiec ◽  
Paweł Liskowski

Abstract Genetic programming (GP) is a variant of evolutionary algorithm where the entities undergoing simulated evolution are computer programs. A fitness function in GP is usually based on a set of tests, each of which defines the desired output a correct program should return for an exemplary input. The outcomes of interactions between programs and tests in GP can be represented as an interaction matrix, with rows corresponding to programs in the current population and columns corresponding to tests. In previous work, we proposed SFIMX, a method that performs only a fraction of interactions and employs non-negative matrix factorization to estimate the outcomes of remaining ones, shortening GP’s runtime. In this paper, we build upon that work and propose three extensions of SFIMX, in which the subset of tests drawn to perform interactions is selected with respect to test difficulty. The conducted experiment indicates that the proposed extensions surpass the original SFIMX on a suite of discrete GP benchmarks.


Author(s):  
Michael Mutingi

As problem complexity continues to increase in industry, developing efficient solution methods for solving hard problems, such as heterogeneous vehicle routing and integrated cell formation problems, is imperative. The focus of this chapter is to develop from the classical simulated evolution algorithm, a Fuzzy Simulated Evolution Algorithm (FSEA) that incorporates the concepts of fuzzy set theory, evolution, and constructive perturbation. The aim is to improve the search efficiency of the algorithm by enhancing the major phases of the algorithm through initialization, evaluation, selection, and reconstruction. Illustrative examples are provided to demonstrate the candidate application areas and to show the strength of the algorithm. Computational experiments are conducted based on benchmark problems in the literature. Results from the computational experiments demonstrate the strength of the algorithm. It is anticipated that the application of the FSEA metaheuristic can be extended to other hard large scale problems.


Sign in / Sign up

Export Citation Format

Share Document