DocumentCode
2056617
Title
Discrete binary cat swarm optimization algorithm
Author
Sharafi, Yousef ; Khanesar, Mojtaba Ahmadieh ; Teshnehlab, Mohammad
Author_Institution
Comput. Dept., Islamic Azad Univ., Tehran, Iran
fYear
2013
fDate
25-26 Sept. 2013
Firstpage
1
Lastpage
6
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 problems; optimisation; BCSO; binary discrete optimization method; binary discrete particle swarm optimization; cat behavior; discrete binary cat swarm optimization algorithm; genetic algorithm; optimization problem; seeking mode; tracing mode; zero-one knapsack problem; Benchmark testing; Cats; Equations; Genetic algorithms; Optimization; Particle swarm optimization; Vectors; Binary Discrete Cat Swarm Optimization; Cat Swarm Optimization; Particle Swarm Optimization; Zero-one Knapsack Problem;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer,Control & Communication (IC4), 2013 3rd International Conference on
Conference_Location
Karachi
Print_ISBN
978-1-4673-6011-1
Type
conf
DOI
10.1109/IC4.2013.6653754
Filename
6653754
Link To Document