GENETIC ALGORITHMS FOR ERROR-BOUNDED POLYGONAL APPROXIMATION

2000 ◽  
Vol 14 (03) ◽  
pp. 297-314 ◽  
Author(s):  
YUNG-NIEN SUN ◽  
SHU-CHIEN HUANG
Keyword(s):  
Genetic Algorithms ◽  
Approximation Algorithm ◽  
Genetic Evolution ◽  
Optimal Solutions ◽  
Polygonal Approximation ◽  
Genetic Operators ◽  
The Given ◽  
Number Of Segments ◽  
Crossover And Mutation ◽  
Error Condition

A new polygonal approximation algorithm, employing the concept of genetic evolution, is presented. In the proposed method, a chromosome is used to represent a polygon by a binary string. Each bit, called a gene, represents a point on the given curve. Three genetic operators, including selection, crossover, and mutation, are designed to obtain the approximated polygon whose error is bounded by a given norm. Many experiments show that the convergence is guaranteed and the optimal or near-optimal solutions can be obtained. Compared with the Zhu–Seneviratne algorithm,24 the proposed algorithm successfully reduced the number of segments under the same error condition in the polygonal approximation.

scholarly journals Structural Topology Optimization in Linear and Nonlinear Elasticity Using Genetic Algorithms

1995 ◽  
Author(s):  
Couro Kane ◽  
François Jouve ◽  
Marc Schoenauer
Keyword(s):  
Genetic Algorithms ◽  
Topology Optimization ◽  
Structural Topology Optimization ◽  
Structural Topology ◽  
Optimal Solutions ◽  
Mutation Operators ◽  
Geometrical Effects ◽  
Displacement Constraints ◽  
Crossover And Mutation ◽  
Linear And Nonlinear Elasticity

Abstract In this paper, structural topology optimization is addressed through Genetic Algorithms. A set of designs is evolved following the Darwinian survival-of-fittest principle. The standard crossover and mutation operators are tailored for the needs of 2D topology optimization. The genetic algorithm based on these operators is experimented on plane stress problems of cantilever plates: the goal is to optimize the weight of the structure under displacement constraints. The main advantage of this approach is that it can both find out alternative optimal solutions, as experimentally demonstrated on a problem with multiple solutions, and handle different kinds of mechanical model: some results in elasticity with large displacements are presented. In that case, the nonlinear geometrical effects of the model lead to non viable solutions, unless some constraints are imposed on the stress field.

Genetic Algorithms (GAs) and Their Mathematical Foundations

2021 ◽  
pp. 54-65
Keyword(s):  
Genetic Algorithms ◽  
Building Block ◽  
Mutation Operator ◽  
Optimal Solutions ◽  
Mathematical Foundations ◽  
Crossover And Mutation

In this chapter, the authors back GA procedures using old mathematical facts. More rigorous working of mathematical facts about GAs are raised in this chapter. In fact, there are a large number of similarities in the population of strings. The authors see how GA exploits these similarities to generate good solutions. So, in this whole procedure they show which schema or pattern will grow and which pattern will die or be lost as generation passes by due to the effect of selection, crossover, and mutation operator. The study of this building block hypothesis, leads to better understanding of GA. It will also help us to reach optimal solutions in much less time.

Improved Genetic Algorithms for Software Testing Cases Generation

2013 ◽  
Vol 380-384 ◽  
pp. 1464-1468
Author(s):  
Shun Kun Yang ◽  
Fu Ping Zeng
Keyword(s):  
Genetic Algorithms ◽  
Software Testing ◽  
Fitness Function ◽  
Automatic Generation ◽  
Improved Genetic Algorithm ◽  
Dynamic Adjustment ◽  
Genetic Operators ◽  
Adaptive Genetic Algorithms ◽  
Crossover And Mutation ◽  
Testing Coverage

In order to realize the adaptive Genetic Algorithms to balance the contradiction between algorithm convergence rate and algorithm accuracy for automatic generation of software testing cases, improved Genetic Algorithms is proposed for different aspects. Orthogonal method and Equivalence partitioning are employed together to make the initial testing population more effective with more reasonable coverage; Genetic operators of Crossover and Mutation is defined adaptively by the dynamic adjustment according to multi-objective Fitness function, which can guide the testing process more properly and realize the biggest testing coverage to find more defects as far as possible. Finally, the improved Genetic Algorithm are compared and analyzed by testing one benchmark program to verify its feasibility and effectiveness.

scholarly journals Software Systems Clustering Using Estimation of Distribution Approach

2016 ◽  
Vol 8 (2) ◽  
pp. 99-113 ◽  
Author(s):  
Mahjoubeh Tajgardan ◽  
Habib Izadkhah ◽  
Shahriar Lotfi
Keyword(s):  
Genetic Algorithms ◽  
Probabilistic Models ◽  
Evolutionary Process ◽  
Solution Space ◽  
Building Blocks ◽  
Genetic Operators ◽  
Software Clustering ◽  
Mutation Operators ◽  
Estimation Of Distribution ◽  
Crossover And Mutation

AbstractSoftware clustering is usually used for program understanding. Since the software clustering is a NP-complete problem, a number of Genetic Algorithms (GAs) are proposed for solving this problem. In literature, there are two wellknown GAs for software clustering, namely, Bunch and DAGC, that use the genetic operators such as crossover and mutation to better search the solution space and generating better solutions during genetic algorithm evolutionary process. The major drawbacks of these operators are (1) the difficulty of defining operators, (2) the difficulty of determining the probability rate of these operators, and (3) do not guarantee to maintain building blocks. Estimation of Distribution (EDA) based approaches, by removing crossover and mutation operators and maintaining building blocks, can be used to solve the problems of genetic algorithms. This approach creates the probabilistic models from individuals to generate new population during evolutionary process, aiming to achieve more success in solving the problems. The aim of this paper is to recast EDA for software clustering problems, which can overcome the existing genetic operators’ limitations. For achieving this aim, we propose a new distribution probability function and a new EDA based algorithm for software clustering. To the best knowledge of the authors, EDA has not been investigated to solve the software clustering problem. The proposed EDA has been compared with two well-known genetic algorithms on twelve benchmarks. Experimental results show that the proposed approach provides more accurate results, improves the speed of convergence and provides better stability when compared against existing genetic algorithms such as Bunch and DAGC.

scholarly journals Adjust genetic algorithm parameter by fuzzy system

2015 ◽  
Vol 37 ◽  
pp. 190
Author(s):  
Tayebe Noshadi ◽  
Marzieh Dadvar ◽  
Nastaran Mirza ◽  
Shima Shamseddini
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Fuzzy Logic ◽  
Fuzzy System ◽  
Fuzzy Systems ◽  
Genetic Evolution ◽  
Optimal Solutions ◽  
Heuristic Rules ◽  
Parallel Genetic Algorithms ◽  
Genetic Algorithm Parameter

Genetic algorithm is one of the random searches algorithm. Genetic algorithm is a method that uses genetic evolution as a model of problem solving. Genetic algorithm for selecting the best population, but the choices are not as heuristic information to be used in specific issues. In order to obtain optimal solutions and efficient use of fuzzy systems with heuristic rules that we would aim to increase the efficiency of parallel genetic algorithms using fuzzy logic immigration, which in fact do this by optimizing the parameters compared with the use of fuzzy system is done.

scholarly journals Tuning Genetic Algorithm Parameters to Improve Convergence Time

2011 ◽  
Vol 2011 ◽  
pp. 1-7 ◽  
Author(s):  
Maria Angelova ◽  
Tania Pencheva
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Optimization Method ◽  
Convergence Time ◽  
Generation Gap ◽  
Genetic Operators ◽  
Time Saving ◽  
Fermentation Processes ◽  
Highly Nonlinear ◽  
Crossover And Mutation

Fermentation processes by nature are complex, time-varying, and highly nonlinear. As dynamic systems their modeling and further high-quality control are a serious challenge. The conventional optimization methods cannot overcome the fermentation processes peculiarities and do not lead to a satisfying solution. As an alternative, genetic algorithms as a stochastic global optimization method can be applied. For the purpose of parameter identification of a fed-batch cultivation ofS. cerevisiaealtogether four kinds of simple and four kinds of multipopulation genetic algorithms have been considered. Each of them is characterized with a different sequence of implementation of main genetic operators, namely, selection, crossover, and mutation. The influence of the most important genetic algorithm parameters—generation gap, crossover, and mutation rates has—been investigated too. Among the considered genetic algorithm parameters, generation gap influences most significantly the algorithm convergence time, saving up to 40% of time without affecting the model accuracy.

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.

scholarly journals Study on Selection Methods of Parents and Crossover in Genetic Algorithm

2021 ◽  
pp. 280-285
Author(s):  
Dr. K. Santhi ◽  
Dr. V. Vinodhini
Keyword(s):  
Genetic Algorithms ◽  
Optimization Technique ◽  
Population Based ◽  
Complex Problem ◽  
Genetic Operators ◽  
Mutation Operators ◽  
The People ◽  
Population Based Search ◽  
Crossover And Mutation ◽  
Selection Of

Genetic Algorithms are the population based search and optimization technique that mimic the process of Genetic and Natural Evolution. Genetic algorithms are very effective way of finding an Optimized solution to a complex problem. Performance of genetic algorithms mainly depends on various factors such as selection of efficient parents and type of genetic operators which involve crossover and mutation operators etc. This paper will help the people to acquire the knowledge about various strategies of selecting parents and description about standard crossover operators.

scholarly journals Optimization of Vehicle Routing Problem with Time Window (VRPTW) for Food Product Distribution Using Genetics Algorithm

2017 ◽  
Vol 2 (2) ◽  
Author(s):  
Rayandra Yala Pratama ◽  
Wayan Firdaus Mahmudy
Keyword(s):  
Genetic Algorithms ◽  
Population Size ◽  
Vehicle Routing ◽  
Mutation Rate ◽  
Vehicle Routing Problem ◽  
Time Window ◽  
Food Distribution ◽  
Genetic Operators ◽  
Routing Problem ◽  
Crossover And Mutation

Food distribution process is very important task because the product can expire during distribution and the further the distance the greater the cost. Determining the route will be more difficult if all customers have their own time to be visited. This problem is known as the Vehicle Routing Problem with Time Windows (VRPTW). VRPTW problems can be solved using genetic algorithms because genetic algorithms generate multiple solutions at once. Genetic algorithms generate chromosomes from serial numbers that represent the customer number to visit. These chromosomes are used in the calculation process together with other genetic operators such as population size, number of generations, crossover and mutation rate. The results show that the best population size is 300, 3,000 generations, the combination of crossover and mutation rate is 0.4:0.6 and the best selection method is elitist selection. Using a data test, the best parameters give a good solution that minimize the distribution route.

Enhanced Artificial Intelligent Method for Representing the Photonic Crystal Fiber Profile Index

2018 ◽  
Vol 1 (1) ◽  
pp. 2-19
Author(s):  
Mahmood Sh. Majeed ◽  
Raid W. Daoud
Keyword(s):  
Genetic Algorithms ◽  
Photonic Crystal ◽  
Photonic Crystal Fiber ◽  
New Method ◽  
Proper Solution ◽  
Artificial Intelligent ◽  
Crystal Fiber ◽  
Fitness Value ◽  
First Pass ◽  
Crossover And Mutation

A new method proposed in this paper to compute the fitness in Genetic Algorithms (GAs). In this new method the number of regions, which assigned for the population, divides the time. The fitness computation here differ from the previous methods, by compute it for each portion of the population as first pass, then the second pass begin to compute the fitness for population that lye in the portion which have bigger fitness value. The crossover and mutation and other GAs operator will do its work only for biggest fitness portion of the population. In this method, we can get a suitable and accurate group of proper solution for indexed profile of the photonic crystal fiber (PCF).

Sign in / Sign up

Export Citation Format

Share Document