TY - GEN
T1 - Cat swarm optimization with different transfer functions for solving set covering problems
AU - Crawford, Broderick
AU - Soto, Ricardo
AU - Berrios, Natalia
AU - Olguín, Eduardo
AU - Misra, Sanjay
N1 - Publisher Copyright:
© Springer International Publishing Switzerland 2016.
PY - 2016
Y1 - 2016
N2 - This work presents a study of a new binary cat swarm optimization. The cat swarm algorithm is a recent swarm metaheuristic technique based on the behaviour of discrete cats. We test the proposed binary cat swarm optimization solving the set covering problem which is a well-known NP-hard discrete optimization problem with many practical applications, such as: political districting, information retrieval, production planning in industry, sector location and fire companies, among others. To tackle the mapping from a continuous search space to a discrete search space we use different transfer functions, S-shaped family and V-shaped family, which are investigated in terms of convergence speed and accuracy of results. The experimental results show the effectiveness of our approach where the binary cat swarm algorithm produce competitive results solving a portfolio of set covering problems from the OR-Library.
AB - This work presents a study of a new binary cat swarm optimization. The cat swarm algorithm is a recent swarm metaheuristic technique based on the behaviour of discrete cats. We test the proposed binary cat swarm optimization solving the set covering problem which is a well-known NP-hard discrete optimization problem with many practical applications, such as: political districting, information retrieval, production planning in industry, sector location and fire companies, among others. To tackle the mapping from a continuous search space to a discrete search space we use different transfer functions, S-shaped family and V-shaped family, which are investigated in terms of convergence speed and accuracy of results. The experimental results show the effectiveness of our approach where the binary cat swarm algorithm produce competitive results solving a portfolio of set covering problems from the OR-Library.
KW - Binary cat swarm optimization
KW - Metaheuristic
KW - Set covering problem
UR - http://www.scopus.com/inward/record.url?scp=84978196601&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-42092-9_18
DO - 10.1007/978-3-319-42092-9_18
M3 - Conference contribution
AN - SCOPUS:84978196601
SN - 9783319420912
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 228
EP - 240
BT - Computational Science and Its Applications - 16th International Conference, ICCSA 2016, Proceedings
A2 - Misra, Sanjay
A2 - Gervasi, Osvaldo
A2 - Torre, Carmelo M.
A2 - Taniar, David
A2 - Stankova, Elena
A2 - Rocha, Ana Maria A.C.
A2 - Wang, Shangguang
A2 - Murgante, Beniamino
A2 - Apduhan, Bernady O.
PB - Springer Verlag
T2 - 16th International Conference on Computational Science and Its Applications, ICCSA 2016
Y2 - 4 July 2016 through 7 July 2016
ER -