Pruned Genetic Algorithm

摘要

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.