A finite-time projection neural network to solve the joint optimal dispatching problem of CHP and wind power
This paper constructs an optimal scheduling model for combined heat and power generation units with heat storage and wind power generation considering carbon transaction costs and optimizes the output of each unit to reduce wind curtailment rate, carbon emissions, and total operating costs. In the c...
Saved in:
Published in | Neural computing & applications Vol. 34; no. 10; pp. 7405 - 7417 |
---|---|
Main Authors | , |
Format | Journal Article |
Language | English |
Published |
London
Springer London
01.05.2022
Springer Nature B.V |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | This paper constructs an optimal scheduling model for combined heat and power generation units with heat storage and wind power generation considering carbon transaction costs and optimizes the output of each unit to reduce wind curtailment rate, carbon emissions, and total operating costs. In the case of considering transmission loss, the optimal scheduling model subject to actual operation constraints is expressed as a non-convex optimization problem. Based on a sufficient condition, the equivalent problem transformed from the original optimization problem is expressed as a convex problem, and a finite-time reduced-dimensional projection neural network with time-varying parameters is proposed to solve the problem. The proposed neural network can reach convergence in a limited time. The Lyapunov function is used to prove the convergence of the algorithm. Finally, the effectiveness of the designed neural network is verified by numerical simulation. Compared with reduced-dimensional projection neural network and finite-time fixed-parameter reduced-dimensional projection neural network, our neural network has a faster convergence speed. |
---|---|
Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
ISSN: | 0941-0643 1433-3058 |
DOI: | 10.1007/s00521-021-06867-x |