One of the problems brought up in the effective execution of genetic algorithms is that if they come under any influences according as the population size is large or small. In the case of small population size the opportunities of premature convergence are increased when the greatly powerful or no good individual is generated during search of the solution space. And searching the solution space in the case of large population size, the difficulties under the execution cause to searching all for one by one individual in every generation applied is limited, this gives the many interruptions to the convergence of final solution. Now this paper gives a suggestion to set up the adaptive population size which could compute the more correct solution and simplify the development of computation performance.