Polynomial mutationDistribution index self-adaptationDIFFERENTIAL EVOLUTIONPARAMETER CONTROLOPTIMIZATIONALGORITHMINDICATORSADAPTATIONEvolutionary multi-objective optimization is a field that has experienced a rapid growth in the last two decades. Although an important number of new multi-objective evolutionary ...
gained at most once but allows them to be lost any number of times, is widely used for tumor phylogenetics as well as species phylogenetics, for example analyses of low-homoplasy retroelement insertions across the vertebrate tree of life. This motivated us to implement our algorithm in a softwar...
Algorithm 4 Pseudo code for the tournament selection method Set t=tournament size Set T= randomly picked t solutions from the HM Return index of the best solution from T 3.3 Polynomial mutation One of the Genetic Algorithms (GAs) operators is mutation which is used to modify some features of...
A novel real-coded population-based extremal optimization algorithm with polynomial mutation: A non-parametric statistical study on continuous optimization problems. Neurocomputing 2016, 174, 577-587. [CrossRef]Zeng, G.Q.; Chen, J.; Li, L.M.; Chen, M.R.; Wu, L.; Dai, Y.X.; Zheng,...
The algorithm learns structurally optimal polynomial expressions (polynomial expressions where both the architecture and the error function have been minimised over a dataset), through the use of specialised mutation and crossover operators. The algorithm also optimises the learning process by using an ...
An efficient hybrid real-coded genetic algorithm (RCGA) with a new hybrid strategy combined with a self-adaptive mutation is first developed. Then, the enhanced RCGA is applied to construct the EPR procedure for compression index. To highlight the performance of the RCGA in the proposed ...
Fischer, S. (2004) A polynomial upper bound for a mutation-based algorithm on the two-dimensional Ising model. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO’04). Springer, Berlin, pp. 1100-1112Fischer, S.: A Polynomial Upper Bound for a Mutation-Based Algorithm on...
The i CSPM algorithm incorporates the island model into CS and uses an exploration function based on the Highly Disruptive Polynomial Mutation (HDP). It has been empirically proven that i CSPM performs better than popular optimization algorithms (e.g., CS and island-based Genetic algorithm (i ...
•An efficient genetic algorithm with a new hybrid strategy combined with a self-adaptive mutation is first developed.•A new approach for evaluating the compressibility of remoulded clays using the EPR and optimization methods is proposed.•The EPR-based modelling of compression index gives a ...
(1991) used repeated exchange mutation. They choose the probability...Heuristic combinatorial optimization by simulated Darwinian evolution: A polynomial time algorithm for the traveling salesman problem, Biological Cybernetics 65 - Ambati, Ambati, et al. - 1991...