Abstract
Knapsack problem is a classical combinatorial optimisation problem. This paper presents greedy continuous particle swarm optimisation (GCPSO) algorithm to solve the knapsack problem. First, the greedy strategy is introduced into the process of particles' initialisation based on standard particle swarm optimisation (SPSO). This strategy guarantees the particle swarm has a better beginning in a degree. Second, based on the analysis of the characteristics of the knapsack problem's solution space, and in terms of the binary code in evolutionary computation, the paper presents multi-state coding. To some extent, the multi-state coding reduces the data redundancy when encoding the solution of the knapsack problem. In experiments, the authors used discrete particle swarm algorithm as well as continuous particle swarm algorithm to find solutions for the knapsack problem. The experimental results show that the GCPSO algorithm provides better solution for the knapsack problems.
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 Computer Applications in Technology
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.
