Using Quasi Random Sequences in Genetic Algorithms

摘要: The selection of initial points in a population-based heuristic optimization method is important since it affects the search for several iterations and often has an influence on final solution. If no priori information about problem available, population selected randomly using pseudo random numbers. Many times, however, more that are as evenly distributed possible than they imitate points. Therefore, we have studied use quasi sequences initialization genetic algorithm. Sample sequence designed to very good distribution properties. modified algorithms been tested by solving large number continuous benchmark problems from literature. numerical results three algorithm implementations different compared those traditional implementation promising.