real coded genetic algorithms
Recently Published Documents


TOTAL DOCUMENTS

138
(FIVE YEARS 10)

H-INDEX

25
(FIVE YEARS 0)

Author(s):  
Carlos Cervigon ◽  
J. Manuel Velasco ◽  
Clara Burgos-Simon ◽  
Rafael J. Villanueva ◽  
J. Ignacio Hidalgo

2021 ◽  
Author(s):  
Kazuhiro Maeda ◽  
Fred C. Boogerd ◽  
Hiroyuki Kurata

AbstractSummaryKinetic modeling is essential in understanding the dynamic behavior of biochemical networks, such as metabolic and signal transduction pathways. However, parameter estimation remains a major bottleneck in the development of kinetic models. We present RCGAToolbox, software for real-coded genetic algorithms (RCGAs), which accelerates the parameter estimation of kinetic models. RCGAToolbox provides two RCGAs: the unimodal normal distribution crossover with minimal generation gap (UNDX/MGG) and real-coded ensemble crossover star with just generation gap (REXstar/JGG), using the stochastic ranking method. The RCGAToolbox also provides user-friendly graphical user interfaces.Availability and implementationRCGAToolbox is available from https://github.com/kmaeda16/RCGAToolbox under GNU GPLv3, with application examples. The user guide is provided in the Supplementary Material. RCGAToolbox runs on MATLAB in Windows, Linux, and [email protected] informationSupplementary Material is available at Bioinformatics online.


2020 ◽  
Vol 2020 ◽  
pp. 1-17
Author(s):  
Ehtasham ul Haq ◽  
Ishfaq Ahmad ◽  
Ibrahim M. Almanjahie

In this paper, a comprehensive empirical study is conducted to evaluate the performance of a new real-coded crossover operator called Fisk crossover (FX) operator. The basic aim of the proposed study is to preserve population diversity as well as to avoid local optima. In this context, a new crossover operator is designed and developed which is linked with Log-logistic probability distribution. For its global performance, a realistic comparison is made between FX versus double Pareto crossover (DPX), Laplace crossover (LX), and simulated binary crossover (SBX) operators. Moreover, these crossover operators are also used in conjunction with three mutation operators called power mutation (PM), Makinen, Periaux, and Toivanen mutation (MPTM), and nonuniform mutation (NUM) for inclusive evaluation. The performance of probabilistic-based algorithms is tested on a set of twenty-one well-known nonlinear optimization benchmark functions with diverse features. The empirical results show a substantial dominance of FX over other crossover operators with authentication of performance index (PI). Moreover, we also examined the significance of the proposed crossover scheme by administrating ANOVA and Gabriel pairwise multiple comparison test. Finally, the statistically significant results of the proposed crossover scheme have a definite edge over the other schemes, and it is also expected that FX has a great potential to solve complex optimization problems.


2019 ◽  
Vol 134 (10) ◽  
Author(s):  
Hussam J. Khasawneh ◽  
Zaer S. Abo-Hammour ◽  
Mohammad I. Al Saaideh ◽  
Shaher M. Momani

2019 ◽  
Vol 11 (3) ◽  
pp. 1-11
Author(s):  
Omar Andres Carmona Cortes ◽  
Josenildo Costa da Silva

Unconstrained numerical problems are common in solving practical applications that, due to its nature, are usually devised by several design variables, narrowing the kind of technique or algorithm that can deal with them. An interesting way of tackling this kind of issue is to use an evolutionary algorithm named Genetic Algorithm. In this context, this work is a tutorial on using real-coded genetic algorithms for solving unconstrained numerical optimization problems. We present the theory and the implementation in R language. Five benchmarks functions (Rosenbrock, Griewank, Ackley, Schwefel, and Alpine) are used as a study case. Further, four different crossover operators (simple, arithmetical, non-uniform arithmetical, and Linear), two selection mechanisms (roulette wheel and tournament), and two mutation operators (uniform and non-uniform) are shown. Results indicate that non-uniform mutation and tournament selection tend to present better outcomes.


2019 ◽  
Vol 9 (16) ◽  
pp. 3379
Author(s):  
Hyun-Jun Hyung ◽  
Han Ul Yoon ◽  
Dongwoon Choi ◽  
Duk-Yeon Lee ◽  
Dong-Wook Lee

Because the internal structure, degree of freedom, skin control position and range of the android face are different, it is very difficult to generate facial expressions by applying existing facial expression generation methods. In addition, facial expressions differ among robots because they are designed subjectively. To address these problems, we developed a system that can automatically generate robot facial expressions by combining an android, a recognizer capable of classifying facial expressions and a genetic algorithm. We have developed two types (older men and young women) of android face robots that can simulate human skin movements. We selected 16 control positions to generate the facial expressions of these robots. The expressions were generated by combining the displacements of 16 motors. A chromosome comprising 16 genes (motor displacements) was generated by applying real-coded genetic algorithms; subsequently, it was used to generate robot facial expressions. To determine the fitness of the generated facial expressions, expression intensity was evaluated through a facial expression recognizer. The proposed system was used to generate six facial expressions (angry, disgust, fear, happy, sad, surprised); the results confirmed that they were more appropriate than manually generated facial expressions.


Sign in / Sign up

Export Citation Format

Share Document