Optimal power flow analysis using Lévy flight spider monkey optimisation algorithm
by Ajay Sharma; Harish Sharma; Annapurna Bhargava; Nirmala Sharma; Jagdish Chand Bansal
International Journal of Artificial Intelligence and Soft Computing (IJAISC), Vol. 5, No. 4, 2016

Abstract: Optimal power flow (OPF) is the most requisite tool in the power system analysis. The OPF is relatively a difficult constrained optimisation problem and broadly solved by conventional as well as modern intelligent methods. In this paper the authors proposed a Lévy flight spider monkey optimisation (LFSMO) algorithm to solve the standard OPF problem for IEEE 30-bus system, which is proposed to improve the exploitation capability of spider monkey optimisation (SMO) algorithm. The performance of LFSMO is evaluated by testing it over 25 benchmark functions.

Online publication date: Thu, 05-Jan-2017

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Artificial Intelligence and Soft Computing (IJAISC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com