摘要：AbstractGenetic algorithm(GA) has beend widely used to obtain solution in various optimization problems because of its robustness and convergence property. GA algorithm, however, has limitations; the computational time increases sharply as the complexity of the problem increases and the user’s arbitrary judgement is involved especially in its termination step. In order to solve these limitations, we suggest a modified reinforced GA using clustering based on the statistical estimation. In this method, the mathematical reliability is gradually increased for each generation to find the solution vector to be finally obtained. The similarity between each solution vector generated by GA is determined and the inefficient repetitive calculation is remarkably reduced. In addition, the statistical reliability of the obtained solution vectors can be calculated to reduce the randomness of the user in the conventional termination step.
