Abstract
The storage of fresh agricultural products is a combinatorial problem that should be solved to to maximize number of items in the storage and also maximize the total profit without exceed the capacity of storage. The problem can be addressed as a knapsack problem that can be classified as NP-hard problem. We propose a genetic algorithm (GA) based on sub-population determination to address the problem. Sub-population GA can naturally divide the population into a set of sub-population with certain mechanism in order to obtain a better result. GA based on sub-population is applied by generating a set of sub-population which is happened in the process of initializing population. A special migration mechanism is developed to maintain population diversity. The experiment shows GA based on sub-population determination provide better results comparable to those achieved by classical GA.
| Original language | English |
|---|---|
| Pages (from-to) | 826-835 |
| Number of pages | 10 |
| Journal | IAES International Journal of Artificial Intelligence |
| Volume | 11 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - Sept 2022 |
Keywords
- Agricultural product
- Genetic algorithm
- Knapsack problem
- Migration
- Sub-population
Fingerprint
Dive into the research topics of 'Optimization of agricultural product storage using real-coded genetic algorithm based on sub-population determination'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver