摘要

Unit commitment is an important and difficulty aspect of optimal operation of power systems. Because it belongs to be mixed variables programming that is difficult to find the optimal solution in mathematics. This paper presented a new method combining of neighbor search and interior point to solve unit commitment (UC) nondeterministic polynomial (NP)-hard problem. The structure of neighborhood is defined and a new way to adjust neighborhood was put forward in which various restrictions can be dealt with to ensure the result feasibility. The large and complex discrete space which is even difficult to obtain solutions will be replaced by a very small solution neighborhood. The advantages of interior point method, for example with good astringency and high precision, will be fully played to accelerate the speed of calculation. 100 units and 24 hours systems were tested to verify the presented method. The CPU time cost is only 4s while the financial cost is very low, which have shown the proposed method is very promising for large scale application.

全文