A jaya algorithm for discrete optimization problems

Abstract

This study describes the discrete optimization algorithm based on Jaya algorithm. Originally, the Jaya algorithm is developed for continuous optimization problems. In the proposed algorithm, continuous domain of variables is converted into discrete domain applying bound constraint of middle point of corresponding two consecutive discrete values. The effectiveness of proposed algorithm is demonstrated through standard truss examples taken from the literature and optimum values are compared with discrete optimization algorithms. The proposed algorithm is computationally more efficient for the discrete optimization problems as tested by numerical example.