Solving Knapsack Problems Using Radius Particle Swarm Optimization Fuse with Simulated Annealing

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...

Full description

Bibliographic Details
Main Author: Mudarmeen Munlin
Format: Article
Language:English
Published: International Institute of Informatics and Cybernetics 2021-10-01
Series:Journal of Systemics, Cybernetics and Informatics
Subjects:
combined algorithm
simulated annelling
knapsack problem
radius particle swarm optimzation
Online Access:http://www.iiisci.org/Journal/PDV/sci/pdfs/SA722QJ21.pdf

Similar Items

Similar Items