Improved Jaya Algorithm with Inertia Weight Factor
摘要
The newly established Jaya algorithm has a simple structure and just requires a small set of control parameters to be optimized. Though it has scope of improvement in terms of outcome accuracy with a fast convergence speed, intensification (exploitation), and diversification (exploration). This work suggests an enhanced variant of the Jaya algorithm, named “W-Jaya,” by setting up a time-varying inertia weight factor with it. This method offers high-quality solutions in a reasonable timeframe. Further, W-Jaya tested with 10 constrained and 20 unconstrained test problems taken from the literature. Finally, the comparison and results show that the proposed W-Jaya has obtained desire goals successfully in an effective manner.