Abstract
We 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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Additional information
The authors are indebted to the anonymous referees for their valuable comments for improving the quality of presentation of the paper. The authors thank Michael J. Wax for making available the C++ source code for GA on the Internet.
Rights and permissions
About this article
Cite this article
Bhatia, A., Basu, S. Tackling 0/1 knapsack problem with gene induction. Soft Computing 8, 1–9 (2003). https://doi.org/10.1007/s00500-002-0240-4
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00500-002-0240-4