Abstract
nIn this paper, a binary artificial bee colony (BABC) algorithm is proposed to solve the 0-1 Knapsack problem. Unlike the original ABC algorithm, the proposed BABC represents a food source as a discrete binary variable and applies discrete operators to change the foraging trajectories of the employed bees, onlookers and scouts in the probability that a coordinate will take on a zero or one value. To verify the performance of the proposed algorithms, we made a comparison between algorithms of the proposed BABC with the standard binary particle swarm optimizer (BPSO) and the genetic algorithm (BGA). The comparison results showed that the proposed algorithms outperform the BPSO and BGA in terms of quality of solution found.
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: INTERNATIONAL JOURNAL ON Advances in Information Sciences and Service Sciences
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.
