Abstract

Gradient-based traditional algorithms fail to locate optimal solutions for real-world problems with non-differentiable/discontinuous objective functions. But biologically inspired optimization algorithms, due to their unconventional random search capability, provide good solutions within finite time to multimodal and non-convex problems. The search capability of these methods largely depends on their exploration and exploitation potential. This paper presents a modified flower pollination algorithm (MFPA) in which (1) the local pollination of FPA is controlled by a scaling factor and (2) an intensive exploitation phase is added to tune the best solution. The effectiveness of MFPA is tested on some mathematical benchmarks and four large practical power system test cases.

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