A Modified Jaya Algorithm for Mixed-Variable Optimization Problems

Journal of Intelligent Systems

Singh Prem¹  Chaudhary Himanshu¹ 

[1] Mechanical Engineering Department, Malaviya National Institute of Technology, Jaipur, Rajasthan,India;

关键词: modified jaya algorithm;    mixed variables;    constraint handling;    penalty function;    balancing;   

DOI  :  10.1515/jisys-2018-0273

来源: DOAJ

【 摘 要 】

Mixed-variable optimization problems consist of the continuous, integer, and discrete variables generally used in various engineering optimization problems. These variables increase the computational cost and complexity of optimization problems due to the handling of variables. Moreover, there are few optimization algorithms that give a globally optimal solution for non-differential and non-convex objective functions. Initially, the Jaya algorithm has been developed for continuous variable optimization problems. In this paper, the Jaya algorithm is further extended for solving mixed-variable optimization problems. In the proposed algorithm, continuous variables remain in the continuous domain while continuous domains of discrete and integer variables are converted into discrete and integer domains applying bound constraint of the middle point of corresponding two consecutive values of discrete and integer variables. The effectiveness of the proposed algorithm is evaluated through examples of mixed-variable optimization problems taken from previous research works, and optimum solutions are validated with other mixed-variable optimization algorithms. The proposed algorithm is also applied to two-plane balancing of the unbalanced rigid threshing rotor, using the number of balance masses on plane 1 and plane 2. It is found that the proposed algorithm is computationally more efficient and easier to use than other mixed optimization techniques.

【 授权许可】

Unknown