A Fuzzy Genetic Algorithm Based on Binary Encoding for Solving Multidimensional Knapsack Problems
The fundamental problem in genetic algorithms is premature convergence, and it is strongly related to the loss of genetic diversity of the population. This study aims at proposing some techniques to tackle the premature convergence by controlling the population diversity. Firstly, a sexual selection...
Saved in:
Main Authors: | M. Jalali Varnamkhasti, L. S. Lee |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2012-01-01
|
Series: | Journal of Applied Mathematics |
Online Access: | http://dx.doi.org/10.1155/2012/703601 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Neurogenetic Algorithm for Solving Combinatorial Engineering Problems
by: M. Jalali Varnamkhasti, et al.
Published: (2012-01-01) -
A Memetic Lagrangian Heuristic for the 0-1 Multidimensional
Knapsack Problem
by: Yourim Yoon, et al.
Published: (2013-01-01) -
A Novel Discrete Global-Best Harmony Search Algorithm for Solving 0-1 Knapsack Problems
by: Wan-li Xiang, et al.
Published: (2014-01-01) -
An efficient binary spider wasp optimizer for multi-dimensional knapsack instances: experimental validation and analysis
by: Mohamed Abdel-Basset, et al.
Published: (2025-01-01) -
Machine Learning-Driven Optimization for Solution Space Reduction in the Quadratic Multiple Knapsack Problem
by: Diego Yanez-Oyarce, et al.
Published: (2025-01-01)