Advertisement
Published in:
2014 | OriginalPaper | Chapter
Solving Unit Commitment Problem with Parallel Computing
Authors : Mikhail Sher, Avijit Banerjee
Published in: Proceedings of the Seventh International Conference on Management Science and Engineering Management
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
The Unit commitment problem (UCP) involves finding the least-cost dispatch of available generation resources to meet the electricity demands over an electrical grid. It is an important planning problem in the electric utility industry. The purpose of the UCP is to determine when to start up and when to shut down a particular generating unit and how to dispatch the committed units to meet the electricity demands and satisfy the relevant security constraints. This paper presents a procedure for modeling and solving large scale unit commitment problems (UCP) by using a parallel computing approach. We assume that the electricity demands are known, and a predetermined amount of reserve is used to guarantee the security of the system. A parallel computing version of the Lagrangian Relaxation technique is used to solve this problem efficiently.