scholarly journals Gene expression programming and genetic algorithms in impedance circuit identification

ACTA IMEKO ◽  
2012 ◽  
Vol 1 (1) ◽  
pp. 19 ◽  
Author(s):  
Fernando M. Janeiro ◽  
Pedro M. Ramos
Keyword(s):  
Gene Expression ◽  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Humidity Sensor ◽  
Gene Expression Programming ◽  
Hybrid Genetic Algorithm ◽  
Circuit Topology ◽  
Simulation Results ◽  
Viscosity Sensor

Impedance circuit identification through spectroscopy is often used to characterize sensors. When the circuit topology is known, it has been shown that the component values can be obtained by genetic algorithms. Also, gene expression programming can be used to search for an adequate circuit topology. In this paper, an improved version of the impedance circuit identification based on gene expression programming and hybrid genetic algorithm is presented to both identify the circuit and estimate its parameters. Simulation results are used to validate the proposed algorithm in different situations. Further validation is presented from measurements on a circuit that models a humidity sensor and also from measurements on a viscosity sensor.

Gene Expression Programming

2017 ◽  
pp. 269-292 ◽  
Author(s):  
Baddrud Zaman Laskar ◽  
Swanirbhar Majumder
Keyword(s):  
Gene Expression ◽  
Genetic Algorithm ◽  
Natural Selection ◽  
Genetic Programming ◽  
Soft Computing ◽  
Gene Expression Programming ◽  
Research Work ◽  
Genetic Operators ◽  
A New Technique ◽  
Work Done

Gene expression programming (GEP) introduced by Candida Ferreira is a descendant of genetic algorithm (GA) and genetic programming (GP). It takes the advantage of both the optimization and search technique based on genetics and natural selection as GA and its programmatic Darwinian counterpart GP. It is gaining popularity because; it has to some extent eradicated the ‘cons' of both while keeping in the ‘pros'. It is still a new technique not much explored since its introduction in 2001. In this chapter both GA and GP is first discussed followed by the elaborate discussion of GEP. This is followed up by the discussion on research work done is different fields using GEP as a tool followed up by GEP architectures. Finally, here GEP has been used for detection of age from facial features as a soft computing based optimization problem using genetic operators.

Towards a Hybrid Solver: Integration of a Genetic Algorithm Within “DSIDES”

2002 ◽  
Author(s):  
Shuiwei Xie ◽  
Warren F. Smith
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Linear Programming ◽  
Decision Support ◽  
Hybrid Genetic Algorithm ◽  
Systems Design ◽  
Nonlinear Problems ◽  
The Body ◽  
Hybrid Solver ◽  
Decision Based Design

In contributing to the body of knowledge for decision-based design, the work reported in this paper has involved steps towards building a hybrid genetic algorithm to address systems design. Highlighted is a work in progress at the Australian Defence Force Academy (ADFA). A genetic algorithm (GA) is proposed to deal with discrete aspects of a design model (e.g., allocation of space to function) and a sequential linear programming (SLP) method for the continuous aspects (e.g., sizing). Our historical Decision Based Design (DBD) tool has been the code DSIDES (Decision Support In the Design of Engineering Systems). The original functionality of DSIDES was to solve linear and non-linear goal programming styled problems using linear programming (LP) and sequential (adaptive) linear programming (SLP/ALP). We seek to enhance DSIDES’s solver capability by the addition of genetic algorithms. We will also develop the appropriate tools to deal with the decomposition and synthesis implied. The foundational paradigm for DSIDES, which remains unchanged, is the Decision Support Problem Technique (DSPT). Through introducing genetic algorithms as solvers in DSIDES, the intention is to improve the likelihood of finding the global minimum (for the formulated model) as well as the ability of dealing more effectively with nonlinear problems which have discrete variables, undifferentiable objective functions or undifferentiable constraints. Using some numerical examples and a practical ship design case study, the proposed GA based method is demonstrated to be better in maintaining diversity of populations, preventing premature convergence, compared with other similar GAs. It also has similar effectiveness in finding the solutions as the original ALP DSIDES solver.

scholarly journals Optimal Design of the Cement, Fly Ash, and Slag Mixture in Ternary Blended Concrete Based on Gene Expression Programming and the Genetic Algorithm

Materials ◽  
2019 ◽  
Vol 12 (15) ◽  
pp. 2448 ◽  
Author(s):  
Wang
Keyword(s):  
Gene Expression ◽  
Genetic Algorithm ◽  
Fly Ash ◽  
Gene Expression Programming ◽  
Design Strength ◽  
Carbon Pricing ◽  
Total Cost ◽  
Material Cost ◽  
Wide Range ◽  
Ternary Blended Concrete

Concrete producers and construction companies are interested in improving the sustainability of concrete, including reducing its CO2 emissions and the costs of materials while maintaining its mechanical properties, workability, and durability. In this study, we propose a simple approach to the optimal design of the fly ash and slag mixture in blended concrete that considers the carbon pricing, material cost, strength, workability, and carbonation durability. Firstly, the carbon pricing and the material cost are calculated based on the concrete mixture and unit prices. The total cost equals the sum of the material cost and the carbon pricing, and is set as the optimization’s objective function. Secondly, 25 various mixtures are used as a database of optimization. The database covered a wide range of strengths between 25 MPa and 55 MPa and a wide range of workability between 5 and 25 cm in slump. Gene expression programming is used to predict the concrete’s strength and slump. The ternary blended concrete’s carbonation depth is calculated using the efficiency factors of fly ash and slag. Thirdly, the genetic algorithm is used to find the optimal mixture under various constraints. We provide examples to illustrate the design of ternary blended concrete with different strength levels and environmental CO2 concentrations. The results show that, for a suburban region, carbonation durability is the controlling factor in terms of the design of the mixture when the design strength is less than 40.49 MPa, and the compressive strength is the controlling factor in the design of the mixture when the design strength is greater than 40.49 MPa. For an urban region, the critical strength for distinguishing carbonation durability control and strength control is 45.93 MPa. The total cost, material cost, and carbon pricing increase as the concrete’s strength increases.

RDF Query Path Optimization Using Hybrid Genetic Algorithms

2022 ◽  
Vol 12 (1) ◽  
pp. 1-16
Author(s):  
Qazi Mudassar Ilyas ◽  
Muneer Ahmad ◽  
Sonia Rauf ◽  
Danish Irfan
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Execution Time ◽  
Optimization Problems ◽  
Hybrid Genetic Algorithm ◽  
Solution Space ◽  
Path Optimization ◽  
Initial Population ◽  
Description Framework ◽  
The Cost

Resource Description Framework (RDF) inherently supports data mergers from various resources into a single federated graph that can become very large even for an application of modest size. This results in severe performance degradation in the execution of RDF queries. As every RDF query essentially traverses a graph to find the output of the Query, an efficient path traversal reduces the execution time of RDF queries. Hence, query path optimization is required to reduce the execution time as well as the cost of a query. Query path optimization is an NP-hard problem that cannot be solved in polynomial time. Genetic algorithms have proven to be very useful in optimization problems. We propose a hybrid genetic algorithm for query path optimization. The proposed algorithm selects an initial population using iterative improvement thus reducing the initial solution space for the genetic algorithm. The proposed algorithm makes significant improvements in the overall performance. We show that the overall number of joins for complex queries is reduced considerably, resulting in reduced cost.

Gene Expression Programming

2021 ◽  
pp. 427-446
Author(s):  
Baddrud Zaman Laskar ◽  
Swanirbhar Majumder
Keyword(s):  
Gene Expression ◽  
Genetic Algorithm ◽  
Natural Selection ◽  
Genetic Programming ◽  
Soft Computing ◽  
Gene Expression Programming ◽  
Research Work ◽  
Genetic Operators ◽  
A New Technique ◽  
Work Done

Gene expression programming (GEP) introduced by Candida Ferreira is a descendant of genetic algorithm (GA) and genetic programming (GP). It takes the advantage of both the optimization and search technique based on genetics and natural selection as GA and its programmatic Darwinian counterpart GP. It is gaining popularity because; it has to some extent eradicated the ‘cons' of both while keeping in the ‘pros'. It is still a new technique not much explored since its introduction in 2001. In this chapter both GA and GP is first discussed followed by the elaborate discussion of GEP. This is followed up by the discussion on research work done is different fields using GEP as a tool followed up by GEP architectures. Finally, here GEP has been used for detection of age from facial features as a soft computing based optimization problem using genetic operators.

Multi-Depot Vehicle Routing Problem with Hybrid Genetic Algorithm

2012 ◽  
Vol 479-481 ◽  
pp. 555-560 ◽  
Author(s):  
Li Wei Dang ◽  
Xiao Ming Sun
Keyword(s):  
Genetic Algorithm ◽  
Mathematical Model ◽  
Genetic Algorithms ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Hybrid Genetic Algorithm ◽  
Routing Problem ◽  
Transport Distance ◽  
Delivery Costs ◽  
Two Factors

About the multi-depot vehicle routing problem, considering the transport distance and the number of dispatching vehicles together can effectively reduce the total delivery costs. Firstly establish the corresponding mathematical model by taking the two factors into account. Secondly solve the model by using hybrid genetic algorithms. Thirdly demonstrate the effectiveness of the model and algorithm by an example

A HYBRID GENETIC ALGORITHM AND EXPECTATION MAXIMIZATION METHOD FOR GLOBAL GENE TRAJECTORY CLUSTERING

2005 ◽  
Vol 03 (05) ◽  
pp. 1227-1242 ◽  
Author(s):  
ZEKE S. H. CHAN ◽  
N. KASABOV ◽  
LESLEY COLLINS
Keyword(s):  
Gene Expression ◽  
Genetic Algorithm ◽  
Gene Expression Data ◽  
Expectation Maximization ◽  
Time Course ◽  
Human Fibroblasts ◽  
Hybrid Genetic Algorithm ◽  
Hill Climbing ◽  
Global Optimality ◽  
Expression Data

Clustering time-course gene expression data (gene trajectories) is an important step towards solving the complex problem of gene regulatory network modeling and discovery as it significantly reduces the dimensionality of the gene space required for analysis. Traditional clustering methods that perform hill-climbing from randomly initialized cluster centers are prone to produce inconsistent and sub-optimal cluster solutions over different runs. This paper introduces a novel method that hybridizes genetic algorithm (GA) and expectation maximization algorithms (EM) for clustering gene trajectories with the mixtures of multiple linear regression models (MLRs), with the objective of improving the global optimality and consistency of the clustering performance. The proposed method is applied to cluster the human fibroblasts and the yeast time-course gene expression data based on their trajectory similarities. It outperforms the standard EM method significantly in terms of both clustering accuracy and consistency. The biological implications of the improved clustering performance are demonstrated.

scholarly journals Adaptive representations for improving evolvability, parameter tuning, and parallelization of gene expression programming

2021 ◽  
Author(s):  
Nigel P. A. Browne
Keyword(s):  
Gene Expression ◽  
Genetic Algorithm ◽  
Genome Size ◽  
Parameter Optimization ◽  
Gene Expression Programming ◽  
Parameter Tuning ◽  
Trial And Error ◽  
New Mutation ◽  
Novel Method ◽  
Linear Chromosomes

Gene Expression Programming (GEP) is a genetic algorithm that evolves linear chromosomes encoding nonlinear (tree-like) structures. In the original GEP algorithm, the genome size is problem specific and is determined through trial and error. In this work, a novel method for adaptively tuning the genome size is presented. The approach introduces new mutation, transposition and recolI)bination operators that enable a population of heterogeneously structured chromosomes, something the original GEP algorithm does not support. This permits crossbreeding between normally incompatible individuals, speciation within a population, increases the evolvability of the representations and enhances parallel GEP. To test our approach an assortment of problems were used, including symbolic regression, classification and parameter optimization. Our experimental results show that our approach provides a solution for the problem of self-adaptively tuning the genome size of GEP's representation.

Sign in / Sign up

Export Citation Format

Share Document