Binary string GAs, also known as Binary-coded genetic algorithms (BCGAs) are robust search algorithms that have been successfully used to solve several challenging problems but are computationally expensive in solving continuous and large scale optimization problems