Abstract
AbstractIn the multiconstraint zero-one knapsack problem one has to decide on how to make efficient use of an entity which consumes multiple resources. The problem is known to be NP-hard, so heuristic solution procedures come into consideration.The purpose of this paper is to analyse different operators within genetic algorithms for solving the multiconstraint zero-one knapsack problem and to compare the results with those of recent investigations of other modern heuristic concepts presented in the literature. Numerical experiences emphasize that one has to incorporate local search improvement operators into simple genetic algorithms to obtain competitive results.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: INFOR: Information Systems and Operational Research
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
