Abstract

This paper introduces a sine-based position update strategy into Bacterial Foraging Algorithm (BFA). In solving many optimization problems, BFA produces an acceptable accurate solution but it presents a slow convergence speed towards the global solution. On the other hand, a sine-based position update strategy from the Sine Cosine Algorithm (SCA) utilizes an elitism in its position update equation. The elitism strategy contains a promising solution that guiding search agents toward global optima with relatively a faster speed. In this proposed technique, the sine-based position update strategy is incorporated prior to the reproduction phase of the BFA. With the consideration of the advantages of the elitism, it helps the BFA to converge faster and hence acquires better accuracy of the final solution. The proposed algorithm is tested on several CEC2014 benchmark functions that have various fitness landscapes and features. For solving a real world problem, it is applied to optimize a dynamic model of a Twin Rotor System. Result of the test shows that the proposed algorithm significantly outperforms the original BFA for both convergence speed and accuracy performances. On the other hand, result of the modelling shows that the proposed algorithm acquires the dynamic model for the Twin Rotor System with a significant smaller error.

Full Text
Paper version not known

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.