Abstract
We propose a new binary version of hybrid symbiotic organisms search algorithm based on harmony search with greedy strategy for solving 0-1 knapsack problems. A greedy strategy is employed to repair the infeasible solution and optimise the feasible solution. The experiments are carried out in small-scale and large-scale knapsack problem instances. We report on computational experiments which are compared with the results achieved with other state-of-the-art approaches. The results attest the performance of our approach.
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.
