Multi-objective artificial bee colony-based optimal PMU placement with considering zero injection bus in power network
by Manas Ranjan Nayak; Kaveri Mahapatra; Pravat Kumar Rout
International Journal of Computer Aided Engineering and Technology (IJCAET), Vol. 9, No. 1, 2017

Abstract: A novel multi-objective discrete artificial bee colony-based optimisation algorithm is proposed for the optimal phasor measurement units placement problem. The proposed algorithm is designed to incorporate a binary mutation step for efficient exploration and exploitation of any undiscovered region in the search space. A fuzzy-based mechanism is used to evaluate the best compromised solution from the final Pareto optimal set obtained by non-dominated sorting and crowding distance mechanism. A combination of two diverse objectives, i.e., minimisation of number of phasor measurement units and maximisation of N − 1 measurement reliability are taken into consideration with complete system observability. The simulation results are obtained both with and without inclusion of the zero injection effect in the observability analysis on IEEE standard systems and are compared with the recently published papers to demonstrate the effectiveness of the proposed algorithm. All the programmes are implemented in standard MATLAB environment version R2010a.

Online publication date: Wed, 07-Dec-2016

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 Computer Aided Engineering and Technology (IJCAET):
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