虚拟电厂(Virtual Power Plant, VPP)能够聚合发电侧的分布式能源以提高可再生能源消纳程度。由于可再生能源出力的不确定且成本缺乏竞争力,虚拟电厂在运营过程中往往存在弃风弃光现象。建立了一种碳交易机制下计及用电行为的虚拟电厂经济调度模型,使可再生能源能参与到碳交易中,并促进用户侧与发电侧的协同。针对该模型的双层性、非线性和半连续性,提出了一种综合线性逼近、KKT条件和透视变换理论的重构方法,将其转化为单层整数二阶锥模型实现求解。算例表明,促进可再生能源消纳有助于提高虚拟电厂的减排效益。同时,碳交易机制具有提高可再生能源消纳总量的能力,用户的响应则具有改善风能利用分布的能力,而采用合适的电价机制能够进一步发挥二者之间的协同效益。
Path determination is a fundamental problem of operations research. Current solutions mainly focus on the shortest and longest paths. We consider a more generalized problem; specifically, we consider the path problem with desired bounded lengths （DBL path problem）. This problem has extensive applications; however, this problem is much harder, especially for large-scale problems. An effective approach to this problem is equivalent simplification. We focus on simplifying the problem in acyclic networks and creating a path length model that simplifies relationships between various path lengths. Based on this model, we design polynomial algorithms to compute the shortest, longest, second shortest, and second longest paths that traverse any arc. Furthermore, we design a polynomial algorithm for the equivalent simplification of the is O（m）, where m is the number of arcs. DBL path problem. The complexity of the algorithm
