Abstract

This paper focuses on developing an exponentially weighted sine cosine algorithm that helps achieve faster convergence and better global optimal solutions. The proposed algorithm has been achieved by incorporating exponential weight functions in the position updation equations that change during each algorithm iteration. Further, a comparison of the proposed algorithm with the traditional technique is made on various benchmark functions-selecting these functions of multiple categories such as unimodal, multimodal, and composite. The optimization results indicated that the proposed exponentially weighted algorithm performed superior to the traditional and other adaptive weighted algorithms. The best performance is proper for most functions concerning mean, best, and standard deviation values. Moreover, the conventional technique has reached the worst global minima values for most of the test functions than the proposed algorithm.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call