Abstract
We propose a new evolutionary algorithm (EA) for single-objective 0/1 knapsack problem, which uses a single variation operator called masked mutation. The proposed EA outperforms the quantum-inspired evolutionary algorithm for 0/1 knapsack problem, which is shown to outperform Genetic Algorithms for 0/1 knapsack problem. The proposed EA generates profits that are equal to or nearly equal to that produced by the classical approximation algorithm for 0/1 knapsack problem.
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 callDisclaimer: 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.
