scholarly journals Representation Invariant Genetic Operators

2010 ◽  
Vol 18 (4) ◽  
pp. 635-660 ◽  
Author(s):  
Jonathan E. Rowe ◽  
Michael D. Vose ◽  
Alden H. Wright
Keyword(s):  
Genetic Algorithm ◽  
Group Action ◽  
Search Space ◽  
Complete Characterization ◽  
Genetic Operators ◽  
Invariance Properties ◽  
Mutation Operators ◽  
High Level ◽  
Crossover And Mutation

A genetic algorithm is invariant with respect to a set of representations if it runs the same no matter which of the representations is used. We formalize this concept mathematically, showing that the representations generate a group that acts upon the search space. Invariant genetic operators are those that commute with this group action. We then consider the problem of characterizing crossover and mutation operators that have such invariance properties. In the case where the corresponding group action acts transitively on the search space, we provide a complete characterization, including high-level representation-independent algorithms implementing these operators.

OPTIMIZING FUZZY CLUSTER ENSEMBLE IN STRING REPRESENTATION

2013 ◽  
Vol 27 (02) ◽  
pp. 1350005 ◽  
Author(s):  
HOSEIN ALIZADEH ◽  
BEHROUZ MINAEI-BIDGOLI ◽  
HAMID PARVIN
Keyword(s):  
Genetic Algorithm ◽  
Objective Function ◽  
Search Space ◽  
Fuzzy Cluster ◽  
Suggested Model ◽  
Cluster Ensembles ◽  
Mutation Operators ◽  
Candidate Solution ◽  
Nonlinear Objective Function ◽  
Crossover And Mutation

In this paper, we present a novel optimization-based method for the combination of cluster ensembles. The information among the ensemble is formulated in 0-1 bit strings. The suggested model defines a constrained nonlinear objective function, called fuzzy string objective function (FSOF), which maximizes the agreement between the ensemble members and minimizes the disagreement simultaneously. Despite the crisp primary partitions, the suggested model employs fuzzy logic in the mentioned objective function. Each row in a candidate solution of the model includes membership degrees indicating how much data point belongs to each cluster. The defined nonlinear model can be solved by every nonlinear optimizer; however; we used genetic algorithm to solve it. Accordingly, three suitable crossover and mutation operators satisfying the constraints of the problem are devised. The proposed crossover operators exchange information between two clusters. They use a novel relabeling method to find corresponding clusters between two partitions. The algorithm is applied on multiple standard datasets. The obtained results show that the modified genetic algorithm operators are desirable in exploration and exploitation of the big search space.

Optimization of Genetic Operators for Scheduling Problems

2007 ◽  
Vol 11 (9) ◽  
pp. 1092-1098 ◽  
Author(s):  
António Ferrolho ◽  
◽  
Manuel Crisóstomo ◽  
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Job Scheduling ◽  
Software Tool ◽  
Scheduling Problems ◽  
Genetic Operators ◽  
Mutation Operators ◽  
Crossover And Mutation

Genetic algorithms (GA) can provide good solutions for scheduling problems. But, when a GA is applied to scheduling problems various crossovers and mutations operators can be applicable. This paper presents and examines a new concept of genetic operators for scheduling problems. A software tool called hybrid and flexible genetic algorithm (HybFlexGA) was developed to examine the performance of various crossover and mutation operators by computing simulations of job scheduling problems.

Minimization of total trim loss occurring in pipe cutting in shipbuilding with genetic algorithm

2021 ◽  
pp. 147509022199169
Author(s):  
Abdullah Türk ◽  
Dursun Saral ◽  
Murat Özkök ◽  
Ercan Köse
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Search Space ◽  
Cutting Process ◽  
Genetic Operators ◽  
Critical Stage ◽  
Different Types ◽  
Trim Loss ◽  
Pipe Systems

Outfitting is a critical stage in the shipbuilding process. Within the outfitting, the construction of pipe systems is a phase that has a significant effect on time and cost. While cutting the pipes required for the pipe systems in shipyards, the cutting process is usually performed randomly. This can result in large amounts of trim losses. In this paper, we present an approach to minimize these losses. With the proposed method it is aimed to base the pipe cutting process on a specific systematic. To solve this problem, Genetic Algorithms (GA), which gives successful results in solving many problems in the literature, have been used. Different types of genetic operators have been used to investigate the search space of the problem well. The results obtained have proven the effectiveness of the proposed approach.

Simulation of the Pressure-Bearing Capacity Test Model in Architectural Decoration Design

2014 ◽  
Vol 716-717 ◽  
pp. 391-394
Author(s):  
Li Mei Guo ◽  
Ai Min Xiao
Keyword(s):  
Genetic Algorithm ◽  
Bearing Capacity ◽  
Test Method ◽  
Test Model ◽  
Improved Genetic Algorithm ◽  
Good Convergence ◽  
Mutation Operators ◽  
Process Pressure ◽  
Calculation Process ◽  
Crossover And Mutation

in architectural decoration process, pressure-bearing capacity test is the foundation of design, and is very important. To this end, a pressure-bearing capacity test method in architectural decoration design is proposed based on improved genetic algorithm. The selection, crossover and mutation operators in genetic algorithm are improved respectively. Using its fast convergence characteristics eliminate the pressure movement in the calculation process. The abnormal area of pressure-bearing existed in buildings which can ensure to be tested is added, to obtain accurate distribution information of the abnormal area of pressure-bearing. Simulation results show that the improved genetic algorithm has good convergence, can accurately test the pressure-bearing capacity in architectural decoration.

Global Path Planning for Full-Area Coverage Robotic Systems by Employing an Active Genetic Algorithm

2011 ◽  
Vol 328-330 ◽  
pp. 1881-1886
Author(s):  
Cen Zeng ◽  
Qiang Zhang ◽  
Xiao Peng Wei
Keyword(s):  
Genetic Algorithm ◽  
Path Planning ◽  
High Performance ◽  
Search Space ◽  
Area Coverage ◽  
Robotic Systems ◽  
Genetic Operators ◽  
A Algorithm ◽  
Coverage Path Planning ◽  
Search Spaces

Genetic algorithm (GA), a kind of global and probabilistic optimization algorithms with high performance, have been paid broad attentions by researchers world wide and plentiful achievements have been made.This paper presents a algorithm to develop the path planning into a given search space using GA in the order of full-area coverage and the obstacle avoiding automatically. Specific genetic operators (such as selection, crossover, mutation) are introduced, and especially the handling of exceptional situations is described in detail. After that, an active genetic algorithm is introduced which allows to overcome the drawbacks of the earlier version of Full-area coverage path planning algorithms.The comparison between some of the well-known algorithms and genetic algorithm is demonstrated in this paper. our path-planning genetic algorithm yields the best performance on the flexibility and the coverage. This meets the needs of polygon obstacles. For full-area coverage path-planning, a genotype that is able to address the more complicated search spaces.

Evolved Synthesis of Digital Circuits

2011 ◽  
pp. 609-617 ◽  
Author(s):  
Laurentiu Ionescu ◽  
Alin Mazare ◽  
Gheorghe Serban ◽  
Emil Sofron
Keyword(s):  
Target Function ◽  
Living Organism ◽  
Digital Circuit ◽  
Evolvable Hardware ◽  
Genetic Operators ◽  
Rules And Principles ◽  
Evaluation Module ◽  
The Individual ◽  
High Level ◽  
Crossover And Mutation

Traditionally physical systems have been designed by engineers using complex collections of rules and principles. The design process is top-down in nature and begins with a precise specification. This contrasts very strongly with the mechanisms which have produced the extraordinary diversity and sophistication of living creatures. In this case the ‘‘designs’’ are evolved by a process of natural selection. The design starts as a set of instructions encoded in the DNA whose coding regions are first transcribed into RNA in the cell nucleus and then later translated into proteins in the cell cytoplasm. The DNA carries the instructions for building molecules using sequences of amino acids. Eventually after a number of extraordinarily complex and subtle biochemical reactions an entire living organism is created. The survivability of the organism can be seen as a process of assembling a larger system from a number of component parts and then testing the organism in the environment in which it finds itself (Miller, 2000). The main target of the evolvable hardware is to build a digital circuit using bio inspired methods like genetic algorithms. Here the potential solutions are coded like configuration vectors which command interconnection between logical cells inside the reconfigurable circuit. All configuration vectors represent the genotype and one single configuration vector is the individual with its own characteristics (like chromosome). The individuals are generated by genetic operators like crossover or mutation. One individual give one solution circuit which is tested in evaluation module. The circuit obtained from the individual consist the phenotype. The circuit behavior is compared with target functions, which we desire to implement. The result is fitness: if the circuit approximates the behavior of the target function, we have a good fitness for the individual which generate the circuit. Then each individual whit its fitness gets into selection module where the future parents in crossover and mutation are decided. Finally we have a circuit solution which implements the target function. We have an evolved synthesis of digital circuit – a method like assemble and test. This method can be useful because explore the design space beyond the limits imposed by traditional design methods. Two research directions are developed in evolvable hardware. In extrinsic evolvable hardware the individuals are obtained from software implementation on computer and phenotype consist in high level abstract circuits like SPICE object files or FPGA configuration files (.bit). The intrinsic evolution, on the other hand, supposes that entire evolution process is inside one or more chips (FPGA): the hardware implementation of evolved hardware. The challenge is to design an intrinsic evolution because can be used for applications like robots control system. But this involves implementation of the software based algorithms in hardware modules.

scholarly journals Genetic Algorithm: Reviews, Implementations, and Applications

2020 ◽  
Vol 10 (6) ◽  
pp. 57
Author(s):  
Tanweer Alam ◽  
Shamimul Qamar ◽  
Amit Dixit ◽  
Mohamed Benaida
Keyword(s):  
Genetic Algorithm ◽  
Natural Selection ◽  
Behavioral Science ◽  
Random Search ◽  
Statistical Investigation ◽  
Adaptive Technology ◽  
Mutation Operators ◽  
Engineering Pedagogy ◽  
Crossover And Mutation ◽  
Investigation Process

Nowadays genetic algorithm (GA) is greatly used in engineering pedagogy as adaptive technology to learn and solve complex problems and issues. It is a meta-heuristic approach that is used to solve hybrid computation challenges. GA utilizes selection, crossover, and mutation operators to effectively manage the searching system strategy. This algorithm is derived from natural selection and genetics concepts. GA is an intelligent use of random search supported with historical data to contribute the search in an area of the improved outcome within a coverage framework. Such algorithms are widely used for maintaining high-quality reactions to optimize issues and problems investigation. These techniques are recognized to be somewhat of a statistical investigation process to search for a suitable solution or prevent an accurate strategy for challenges in optimization or searches. These techniques have been produced from natural selection or genetics principles. For random testing, historical information is provided with intelligent enslavement to continue moving the search out from the area of improved features for processing of the outcomes. It is a category of heuristics of evolutionary history using behavioral science-influenced methods like an annuity, gene, preference, or combination (sometimes refers to as hybridization). This method seemed to be a valuable tool to find solutions for problems optimization. In this paper, the author has explored the GAs, its role in engineering pedagogies, and the emerging areas where it is using, and its implementation.

A Genetic Algorithm Based Procedure for Extracting Optimal Solutions From a Morphological Chart

2007 ◽  
Author(s):  
Santosh Tiwari ◽  
Joshua Summers ◽  
Georges Fadel
Keyword(s):  
Genetic Algorithm ◽  
Optimization Problem ◽  
Mathematical Representation ◽  
Optimal Solutions ◽  
Proof Of Concept ◽  
Optimization Framework ◽  
Mutation Operators ◽  
Novel Approach ◽  
Morphological Chart ◽  
Crossover And Mutation

A novel approach using a genetic algorithm is presented for extracting globally satisfycing (Pareto optimal) solutions from a morphological chart where the evaluation and combination of “means to sub-functions” is modeled as a combinatorial multi-objective optimization problem. A fast and robust genetic algorithm is developed to solve the resulting optimization problem. Customized crossover and mutation operators specifically tailored to solve the combinatorial optimization problem are discussed. A proof-of-concept simulation on a practical design problem is presented. The described genetic algorithm incorporates features to prevent redundant evaluation of identical solutions and a method for handling of the compatibility matrix (feasible/infeasible combinations) and addressing desirable/undesirable combinations. The proposed approach is limited by its reliance on the quantifiable metrics for evaluating the objectives and the existence of a mathematical representation of the combined solutions. The optimization framework is designed to be a scalable and flexible procedure which can be easily modified to accommodate a wide variety of design methods that are based on the morphological chart.

THE DYNAMICS OF A CHANGING RANGE GENETIC ALGORITHM UNDER STABILIZING SELECTION

2009 ◽  
Vol 20 (07) ◽  
pp. 1063-1079
Author(s):  
ADIL AMIRJANOV
Keyword(s):  
Genetic Algorithm ◽  
Population Biology ◽  
Equations Of Motion ◽  
Search Space ◽  
Stabilizing Selection ◽  
Genetic Operators ◽  
Space Size ◽  
Final Population ◽  
Unique System ◽  
Average Fitness

The formalism is presented for modeling of a genetic algorithm (GA) with an adjustment of a search space size. The formalism for modeling of GA with an adjustment of a search space size assumes that the environment and the population form a unique system. In this paper, the formalism is applied to a problem which exhibits an interesting dynamics reminiscent of stabilizing selection in population biology. The equations of motion was derived that expressed the macroscopic statistical properties of population after reproductive genetic operators and an adjustment of a search space size in terms of those prior to the operation. Predictions of the theory are compared with experiments and are shown to predict the average fitness and the variance fitness of the final population accurately.

Sign in / Sign up

Export Citation Format

Share Document