@article{article_526544, title={Performance of population size on Knapsack problem}, journal={New Trends in Mathematical Sciences}, volume={4}, pages={253–258}, year={2016}, author={Oyewola, David and Hakimi, Danladi and Yahaya, Amuda Yusuph and Bolarin, Gbolahan}, keywords={Population,parameter,chromosome,genetic algorithm}, abstract={<p class="MsoNormal" style="text-align:justify;text-justify:inter-ideograph; text-indent:36.0pt;tab-stops:center 240.0pt right 475.0pt">In order to obtain meaningful information about the performance of the population size, a considerable number of independent runs of the GA are performed. Accurate model parameters values are obtained in reasonable computational time. Further increase of the population size, does not improve the solution accuracy. Moreover, the computational time is increased significantly. <span style="font-family:"Times New Roman","serif"; mso-no-proof:yes"> <o:p> </o:p> </span> </p>}, number={4}, publisher={Mustafa BAYRAM}