By Topic

Enhanced adaptive particle swarm optimisation algorithm for dynamic economic dispatch of units considering valve-point effects and ramp rates

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Niknam, T. ; Dept. of Electron. & Electr. Eng., Shiraz Univ. of Technol., Shiraz, Iran ; Golestaneh, F.

In power systems, dynamic economic dispatch (DED) is one of the most significant non-linear problems showing non-convex characteristic because of the valve-point effects. In this study, an enhanced adaptive particle swarm optimisation (EAPSO) algorithm is proposed to solve the DED problem where the valve-point effects, ramp-rate limits and transmission power losses are taken into account. In the proposed optimisation algorithm, a mutation technique is devised to prevent premature phenomena and lead the swarm search space much more effectively; also a novel non-linear approach is designed to adjust the inertia weight factor dynamically according to the optimisation process performance. Social and cognitive factors are self-adaptively tuned, so the swarm can search the space smartly for global optimum solution. The efficiency of the proposed method is validated on three popular test systems in the area including 5, 10 and 30 thermal units. The results are compared with most of the other works in the area. The superiority of the method is shown over earlier methods.

Published in:

Generation, Transmission & Distribution, IET  (Volume:6 ,  Issue: 5 )