Abstract

In this paper, we present a new algorithm binary discrete optimization method based on cat swarm optimization (CSO). BCSO is a binary version of CSO generated by observing the behaviors of cats. As in CSO, BCSO consists of two modes of operation: tracing mode and seeking mode. The BCSO presented in this paper is implemented on a number of benchmark optimization problems and zero-one knapsack problem. The obtained results are compared with a number of different optimization problems including genetic algorithm and different versions of binary discrete particle swarm optimization. It is shown that the proposed method greatly improves the results obtained by other binary discrete optimization problems.

Keywords:
Knapsack problem Discrete optimization Binary number Multi-swarm optimization Algorithm Benchmark (surveying) Metaheuristic Continuous optimization Optimization problem Mathematical optimization Particle swarm optimization Meta-optimization Computer science Tracing Swarm behaviour Genetic algorithm Mathematics

Metrics

84
Cited By
9.90
FWCI (Field Weighted Citation Impact)
20
Refs
0.98
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Metaheuristic Optimization Algorithms Research
Physical Sciences →  Computer Science →  Artificial Intelligence
Extremum Seeking Control Systems
Physical Sciences →  Engineering →  Control and Systems Engineering
Advanced Multi-Objective Optimization Algorithms
Physical Sciences →  Computer Science →  Computational Theory and Mathematics
© 2026 ScienceGate Book Chapters — All rights reserved.