Performance of population size on Knapsack problem
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...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
BİSKA Bilisim Company
2016-12-01
|
| Series: | New Trends in Mathematical Sciences |
| Subjects: | |
| Online Access: | https://ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8220 |