Sub-Dividing Genetic Method for Optimization Problems

07/22/2013
by   Masoumeh Vali, et al.
0

Nowadays, optimization problem have more application in all major but they have problem in computation. Computation global point in continuous functions have high calculation and this became clearer in large space .In this paper, we proposed Sub- Dividing Genetic Method(SGM) that have less computation than other method for achieving global points . This method userotation mutation and crossover based sub-division method that sub diving method is used for minimize search space and rotation mutation with crossover is used for finding global optimal points. In experimental, SGM algorithm is implemented on De Jong function. The numerical examples show that SGM is performed more optimal than other methods such as Grefensstette, Random Value, and PNG.

READ FULL TEXT

page 13

page 15

research
07/22/2013

Rotational Mutation Genetic Algorithm on optimization Problems

Optimization problem, nowadays, have more application in all major but t...
research
12/12/2018

Selection of Random Walkers that Optimizes the Global Mean First-Passage Time for Search in Complex Networks

We design a method to optimize the global mean first-passage time (GMFPT...
research
02/04/2005

Sub-structural Niching in Estimation of Distribution Algorithms

We propose a sub-structural niching method that fully exploits the probl...
research
07/22/2013

New Optimization Approach Using Clustering-Based Parallel Genetic Algorithm

In many global Optimization Problems, it is required to evaluate a globa...
research
07/22/2013

A New Approach for Finding the Global Optimal Point Using Subdividing Labeling Method (SLM)

In most global optimization problems, finding global optimal point inthe...
research
07/21/2013

A New Optimization Approach Based on Rotational Mutation and Crossover Operator

Evaluating a global optimal point in many global optimization problems i...

Please sign up or login with your details

Forgot password? Click here to reset