Comparative analysis of genetic crossover operators in knapsack problem
| Autor: | D Hakimi, D.O. Oyewola, Y Yahaya, G Bolarin |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2016 |
| Předmět: | |
| Zdroj: | Journal of Applied Sciences and Environmental Management, Vol 20, Iss 3 (2016) |
| Druh dokumentu: | article |
| ISSN: | 2659-1502 2659-1499 |
| DOI: | 10.4314/jasem.v20i3.13 |
| Popis: | The Genetic Algorithm (GA) is an evolutionary algorithms and technique based on natural selections of individuals called chromosomes. In this paper, a method for solving Knapsack problem via GA (Genetic Algorithm) is presented. We compared six different crossovers: Crossover single point, Crossover Two point, Crossover Scattered, Crossover Heuristic, Crossover Arithmetic and Crossover Intermediate. Three different dimensions of knapsack problems are used to test the convergence of knapsack problem. Based on our experimental results, two point crossovers (TP) emerged the best result to solve knapsack problem. Keywords: Genetic Algorithm, Crossover, Heuristic, Arithmetic, Intermediate, Evolutionary Algorithm |
| Databáze: | Directory of Open Access Journals |
| Externí odkaz: |
|