Next Article in Journal
HMM Adaptation for Improving a Human Activity Recognition System
Previous Article in Journal
LR Parsing for LCFRS
Article Menu

Export Article

Open AccessArticle
Algorithms 2016, 9(3), 59; doi:10.3390/a9030059

Binary Cockroach Swarm Optimization for Combinatorial Optimization Problem

1
School of Management, Information Technology, and Governance, University of KwaZulu-Natal, Durban 4000, South Africa
2
School of Computing, University of South Africa, Johannesburg 1710, South Africa
*
Author to whom correspondence should be addressed.
Academic Editor: Javier Del Ser Lorente
Received: 15 April 2016 / Revised: 5 July 2016 / Accepted: 12 July 2016 / Published: 2 September 2016
View Full-Text   |   Download PDF [1043 KB, uploaded 2 September 2016]   |  

Abstract

The Cockroach Swarm Optimization (CSO) algorithm is inspired by cockroach social behavior. It is a simple and efficient meta-heuristic algorithm and has been applied to solve global optimization problems successfully. The original CSO algorithm and its variants operate mainly in continuous search space and cannot solve binary-coded optimization problems directly. Many optimization problems have their decision variables in binary. Binary Cockroach Swarm Optimization (BCSO) is proposed in this paper to tackle such problems and was evaluated on the popular Traveling Salesman Problem (TSP), which is considered to be an NP-hard Combinatorial Optimization Problem (COP). A transfer function was employed to map a continuous search space CSO to binary search space. The performance of the proposed algorithm was tested firstly on benchmark functions through simulation studies and compared with the performance of existing binary particle swarm optimization and continuous space versions of CSO. The proposed BCSO was adapted to TSP and applied to a set of benchmark instances of symmetric TSP from the TSP library. The results of the proposed Binary Cockroach Swarm Optimization (BCSO) algorithm on TSP were compared to other meta-heuristic algorithms. View Full-Text
Keywords: evolutionary algorithms; swarm intelligence; continuous search space; binary search space; transfer function; traveling salesman problem; combinatorial optimization problem evolutionary algorithms; swarm intelligence; continuous search space; binary search space; transfer function; traveling salesman problem; combinatorial optimization problem
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).

Scifeed alert for new publications

Never miss any articles matching your research from any publisher
  • Get alerts for new papers matching your research
  • Find out the new papers from selected authors
  • Updated daily for 49'000+ journals and 6000+ publishers
  • Define your Scifeed now

SciFeed Share & Cite This Article

MDPI and ACS Style

Obagbuwa, I.C.; Abidoye, A.P. Binary Cockroach Swarm Optimization for Combinatorial Optimization Problem. Algorithms 2016, 9, 59.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top