The full text of this article


Application of swarm intelligent techniques with mixed variables to solve optimal power flow problems
by S. Surender Reddy; B.K. Panigrahi
International Journal of Bio-Inspired Computation (IJBIC), Vol. 10, No. 4, 2017


Abstract: This paper proposes a new swarm based evolutionary algorithm called LBEST PSO with dynamically varying sub-swarms (LPSO DVS). Swarm based algorithms are meta-heuristic search methods whose mechanics are inspired by the collaborative behaviour of biological populations. The performance of four swarm based algorithms, i.e., particle swarm optimisation (PSO), fuzzy adaptive particle swarm optimisation (FAPSO), fitness distance ratio particle swarm optimisation (FDRPSO) and LPSO DVS are also compared with genetic algorithm (GA) and improved GA when applied to the power system optimal power flow (OPF) problem. OPF optimises the power system operating objective function, while satisfying the set of system operating constraints. The objective functions considered in this OPF problem are fuel cost (FC) minimisation, voltage stability enhancement index (VSEI) minimisation, transmission loss minimisation (LM) and voltage deviation (VD) minimisation. Simulation results for the IEEE 30 bus system are presented and the comparison is made among the numerical results obtained using the different evolutionary algorithms.

Online publication date: Fri, 03-Nov-2017


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 Bio-Inspired Computation (IJBIC):
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