Abstract
An effective solution methodology for solving large-scale unit commitment problems is proposed. In order to model the line losses, the second-order network model is introduced into the conventional unit commitment problem. The proposed solution methodology consists of three key steps: (1) a transformed problem formulation that is based on a mixed-integer convex programming problem, (2) an improved solution method that is a combination of a modified branch-and-bound method and an interior point method, and (3) some accelerating strategies to speed up the proposed solution method. During the branch-and-bound process, the best first search and depth first search strategy are combined to expedite the required computation. In order to achieve the goal of obtaining a fast, near-optimal feasible solution of large-scale unit commitment problems, some accelerating strategies are developed. An effective scheme to partition the study period is also presented. The proposed solution methodology is applied to several test systems, including a 10-unit system and modified IEEE 118-bus system with 54 thermal units. Numerical study results indicate that the proposed solution methodology is fast and effective in dealing with various constraints and is promising for solving large-scale unit commitment problems. The proposed solution methodology finds better unit commitment solutions than most other methods. In addition, the solutions obtained by the proposed solution methodology are close to the optimal total operational cost. Especially for 60-unit and 80-unit unit commitment problems, the proposed solution methodology finds the best solutions.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.