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: | Mudarmeen Munlin |
---|---|
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
|
Similar Items
-
Evolution of Knapsack Ciphersystems
by: Georgii Ivanovich Borzunov, et al.
Published: (2015-03-01) -
Adaptation of a Mosquito Swarm Algorithm to Solve a Binary Knapsack Problem
by: Ruqaya Sha’ban, et al.
Published: (2018-12-01) -
Knapsack Problem Solution based on Knapsack Packing Tree Search
by: Mikhail Andreevich Kupriyashin, et al.
Published: (2014-02-01) -
A Feature-Independent Hyper-Heuristic Approach for Solving the Knapsack Problem
by: Xavier Sánchez-Díaz, et al.
Published: (2021-10-01) -
On а Recursive-Parallel Algorithm for Solving the Knapsack Problem
by: Vladimir V. Vasilchikov
Published: (2018-04-01)