Performance of population size on Knapsack problem
David Opeoluwa Oyewola, Danladi Hakimi, Amuda Yusuph Yahaya, Gbolahan Bolarin · New Trends in Mathematical Science · 2016
In this paper, an investigation of a performance of population size on the genetic algorithm (GA) for a knapsack problem is considered.Population sizes between 10 and 200 chromosomes in the population are tested.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.