By Topic

A new approach for solving the unit commitment problem by adaptive particle swarm optimization

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 $13
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)
Pappala, V.S. ; Inst. of Electr. power Syst., Univ. Duisburg-Essen, Duisburg ; Erlich, I.

This paper presents a new approach for formulating the unit commitment problem which results in a considerable reduction in the number of decision variables. The scheduling variables are coded as integers representing the operation periods of a generating unit. The unit commitment problem is solved using a new parameter free adaptive particle swarm optimization (APSO) approach. This algorithm provides solutions to the major demerits of PSO such as parameter tuning, selection of optimal swarm size and problem dependent penalty functions. The constrained optimization problem is solved using adaptive penalty function approach. The penalty terms adapt to the performance of the swarm. So no additional penalty coefficient tuning is required. This paper describes the proposed algorithm with the new variable formulation and presents test results on a ten unit test system. The results demonstrate the robustness of the new algorithm in solving the unit commitment problem.

Published in:

Power and Energy Society General Meeting - Conversion and Delivery of Electrical Energy in the 21st Century, 2008 IEEE

Date of Conference:

20-24 July 2008