Solving Knapsack Problems Using Radius Particle Swarm Optimization Fuse with Simulated Annealing
We present a novel approach to fuse the Radius Particle Swarm Optimization and Simulated Annealing (RPSO-SA) to solve the Knapsack Problems (KPs). The features RPSO-SA create an innovative approach, which can generate high-quality solutions in shorter times and more stable convergence characteristic...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
International Institute of Informatics and Cybernetics
2021-10-01
|
| Series: | Journal of Systemics, Cybernetics and Informatics |
| Subjects: | |
| Online Access: | http://www.iiisci.org/Journal/PDV/sci/pdfs/SA722QJ21.pdf
|
| _version_ | 1828432667461287936 |
|---|---|
| author | Mudarmeen Munlin |
| author_facet | Mudarmeen Munlin |
| author_sort | Mudarmeen Munlin |
| collection | DOAJ |
| description | We present a novel approach to fuse the Radius Particle Swarm Optimization and Simulated Annealing (RPSO-SA) to solve the Knapsack Problems (KPs). The features RPSO-SA create an innovative approach, which can generate high-quality solutions in shorter times and more stable convergence characteristics. The RPSO takes advantage of group-swarm to keep the balance between the global exploration and the local exploitation. The SA gently improves the candidate solution by searching for optimal solutions within a local neighbourhood. The RPSO-SA combines the strong global search ability of RPSO and the strong local search ability of SA to reach faster optimal solution. In addition, there are two ways of accepting a new solution. The method has been tested against the knapsack problems. The results indicate that the combined approach outperforms individual implementations of radius particle swarm optimization and simulated annealing. |
| first_indexed | 2024-12-10T18:23:02Z |
| format | Article |
| id | doaj.art-cd12bf63b6d6410dacf42dfb1b249163 |
| institution | Directory Open Access Journal |
| issn | 1690-4524 |
| language | English |
| last_indexed | 2024-12-10T18:23:02Z |
| publishDate | 2021-10-01 |
| publisher | International Institute of Informatics and Cybernetics |
| record_format | Article |
| series | Journal of Systemics, Cybernetics and Informatics |
| spelling | doaj.art-cd12bf63b6d6410dacf42dfb1b2491632022-12-22T01:38:09ZengInternational Institute of Informatics and CyberneticsJournal of Systemics, Cybernetics and Informatics1690-45242021-10-011956368Solving Knapsack Problems Using Radius Particle Swarm Optimization Fuse with Simulated AnnealingMudarmeen MunlinWe present a novel approach to fuse the Radius Particle Swarm Optimization and Simulated Annealing (RPSO-SA) to solve the Knapsack Problems (KPs). The features RPSO-SA create an innovative approach, which can generate high-quality solutions in shorter times and more stable convergence characteristics. The RPSO takes advantage of group-swarm to keep the balance between the global exploration and the local exploitation. The SA gently improves the candidate solution by searching for optimal solutions within a local neighbourhood. The RPSO-SA combines the strong global search ability of RPSO and the strong local search ability of SA to reach faster optimal solution. In addition, there are two ways of accepting a new solution. The method has been tested against the knapsack problems. The results indicate that the combined approach outperforms individual implementations of radius particle swarm optimization and simulated annealing.http://www.iiisci.org/Journal/PDV/sci/pdfs/SA722QJ21.pdf combined algorithmsimulated annellingknapsack problemradius particle swarm optimzation |
| spellingShingle | Mudarmeen Munlin Solving Knapsack Problems Using Radius Particle Swarm Optimization Fuse with Simulated Annealing Journal of Systemics, Cybernetics and Informatics combined algorithm simulated annelling knapsack problem radius particle swarm optimzation |
| title | Solving Knapsack Problems Using Radius Particle Swarm Optimization Fuse with Simulated Annealing |
| title_full | Solving Knapsack Problems Using Radius Particle Swarm Optimization Fuse with Simulated Annealing |
| title_fullStr | Solving Knapsack Problems Using Radius Particle Swarm Optimization Fuse with Simulated Annealing |
| title_full_unstemmed | Solving Knapsack Problems Using Radius Particle Swarm Optimization Fuse with Simulated Annealing |
| title_short | Solving Knapsack Problems Using Radius Particle Swarm Optimization Fuse with Simulated Annealing |
| title_sort | solving knapsack problems using radius particle swarm optimization fuse with simulated annealing |
| topic | combined algorithm simulated annelling knapsack problem radius particle swarm optimzation |
| url | http://www.iiisci.org/Journal/PDV/sci/pdfs/SA722QJ21.pdf
|
| work_keys_str_mv | AT mudarmeenmunlin solvingknapsackproblemsusingradiusparticleswarmoptimizationfusewithsimulatedannealing |