Pruned genetic algorithm

Authors:
Seyyed Mahdi Hedjazi;Samane Sadat Marjani
Affiliations:
Dept. of Software Engineering, Islamic Azad University, Tehran, Iran;Dept. of Software Engineering, Islamic Azad University, Tehran, Iran
Venue:
AICI'10 Proceedings of the 2010 international conference on Artificial intelligence and computational intelligence: Part II
Year:
2010

Citing 6
Cited 0

A fast algorithm for active contours and curvature estimation

CVGIP: Image Understanding
An introduction to genetic algorithms

An introduction to genetic algorithms
Contemporary Evolution Strategies

Proceedings of the Third European Conference on Advances in Artificial Life
Performance Study of Mutation Operator in Genetic Algorithms on Anticipatory Scheduling

ICCIMA '07 Proceedings of the International Conference on Computational Intelligence and Multimedia Applications (ICCIMA 2007) - Volume 01
A Genetic Based Approach to the Type I Structure Identification Problem

Informatica
Experiments with Hybrid Genetic Algorithm for the Grey Pattern Problem

Informatica

Quantified Score

Hi-index	0.00

Visualization

Abstract

Genetic algorithm is known as one of the ways of resolving complicated problems and optimization issues. This algorithm works based on a search space and in this space it'd seeking for the optimum answer. In this algorithm, there exist agents and gorges which expand the search space with no logical reason. We can find the measures which take us away from the optimal answer by observing the trend of changes, and it can apply the changes in a way that increases the speed of reaching the answers. It's obvious these changes must be as much as they don't add time complexity or memory load to the system. In this paper, we represent a mechanism as a pruning operator in order to reach the answer more quickly and make it work optimal by omitting the inappropriate measures and purposeful decrease of search space.