A New Genetic Algorithm Based on Optimal Solution Orientation
Many researchers have indicated that standard genetic algorithm suffers from the dilemma---premature or non-convergence. Most researchers focused on finding better search strategies, and designing various new heuristic methods. It seemed effective. From another view, we can transform search space with a samestate-mapping. A special genetic algorithm applied to the new search space would achieve better performance. Thus, we present a new genetic algorithm based on optimal solution orientation. In this paper, a new genetic algorithm based on optimum solution orientation is presented. The algorithm is divided into "optimum solution orientation" phase and "highly accurately searching in local domain of global optimal solution" phase. Theoretical analysis and experiments indicate that OSOGA can find the "optimal" sub domain effectively. Cooperating with local search algorithm, OSOGA can achieve highly precision solution with limited computing resources.
Liangchi Zhang, Chunliang Zhang and Tielin Shi
Q. Wang et al., "A New Genetic Algorithm Based on Optimal Solution Orientation", Advanced Materials Research, Vols. 139-141, pp. 1779-1784, 2010