Bhatia, A.K.Basu, S.K.2025-03-042025-03-04200314337479https://dl.bhu.ac.in/ir/handle/123456789/88153We propose a gene induction approach for genetic algorithms. It is more robust compared to the traditional approach in genetic algorithms. The approach was applied to 0/1 knapsack problem. It found near optimal results in all the representative problem instances reported in the literature, while traditional approaches failed in a number of instances because of preponderance of infeasible individuals in the population. In combination with a heuristic mutation operator, our method provided better results for all the problem instances investigated. © Springer-Verlag 2003.0/1 knapsack problemConstrained optimizationGenetic algorithmHeuristic mutationArticlehttps://doi.org/10.1007/s00500-002-0240-4