Abstract
The 0-1 knapsack problem (KP01) is one of the classical NP-hard problems in operation research and has a number of engineering applications. In this paper, the BABC-DE (binary artificial bee colony algorithm with differential evolution), a modified artificial bee colony algorithm, is proposed to solve KP01. In BABC-DE, a new binary searching operator which comprehensively considers the memory and neighbour information is designed in the employed bee phase, and the mutation and crossover operations of differential evolution are adopted in the onlooker bee phase. In order to make the searching solution feasible, a repair operator based on greedy strategy is employed. Experimental results on different dimensional KP01s verify the efficiency of the proposed method, and it gets superior performance compared with other five metaheuristic algorithms.
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 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.
