By Topic

A Variable-Dimension Optimization Approach to Unit Commitment Problem

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
$33 $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, Germany ; Erlich, I.

This paper proposes a variable-dimension optimization approach to address the high dimensionality issues in solving the unit commitment problem. This method introduces the concept of adaptive search space dimension. The proposed approach is implemented in particle swarm optimization algorithm. The optimization process starts with an arbitrary problem dimension, adapts with respect to the swarm progress and finally selects the optimal dimensional space. The efficiency of this method is tested on a ten-unit test system. The results are compared with binary programming and fixed duty cycle approaches. The simulation results show that the proposed method results in considerable reduction of problem dimension, faster convergence and improved quality of the final solution.

Published in:

Power Systems, IEEE Transactions on  (Volume:25 ,  Issue: 3 )