Abstract
This paper presents a continuous ACO approach to solve 0-1 knapsack problem. In this method, groups of candidate values of the components are constructed, and an amount of pheromone is initialised randomly for each candidate value a real random number between 0.1 and 0.9 in each candidate group. To solve binary knapsack problem for each object a candidate group is constructed where candidate value is either 0 or 1. Each ant selects a value from each group to construct a path or a solution. After certain number of generation, store the best solution in a temporary population. When temporary population size is equal to the number of ants, then temporary population will be considered as initial population by re-initialising fresh set of pheromone. This procedure will continue until the maximum generation defined is reached. In experimental section, we compare the results of standard test functions and 0-1 knapsack problem with existing literature.
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 of Computational Intelligence Studies
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.
