This paper introduces an enhanced version of the Grasshopper Optimization Algorithm with the aim to improve upon problems with slow convergence and the original algorithm not being suited to solving binary optimization problems. The solutions presented are to make use of q-Gaussian mutation in order to jump out of local optimum, thereby leading to faster convergence and the V4 transform function to map continuous values to binary values. The enhanced algorithm is applied to the optimization of feature selection. The proposed algorithm is tested against four other binary optimization algorithms and assessed on three different datasets. The results display that the proposed algorithm exceeds the compared techniques in terms of accuracy and minimizing features selected.