The proliferation of distributed and renewable energy resources introduces additional operational challenges to power distribution systems.Transactive energy management,which allows networked neighborhood communities ...The proliferation of distributed and renewable energy resources introduces additional operational challenges to power distribution systems.Transactive energy management,which allows networked neighborhood communities and houses to trade energy,is expected to be developed as an effective method for accommodating additional uncertainties and security mandates pertaining to distributed energy resources.This paper proposes and analyzes a two-layer transactive energy market in which houses in networked neighborhood community microgrids will trade energy in respective market layers.This paper studies the blockchain applications to satisfy socioeconomic and technological concerns of secure transactive energy management in a two-level power distribution system.The numerical results for practical networked microgrids located at IllinoisTech−Bronzeville in Chicago illustrate the validity of the proposed blockchain-based transactive energy management for devising a distributed,scalable,efficient,and cybersecured power grid operation.The conclusion of the paper summarizes the prospects for blockchain applications to transactive energy management in power distribution systems.展开更多
Graph convolutional networks(GCNs)have received significant attention from various research fields due to the excellent performance in learning graph representations.Although GCN performs well compared with other meth...Graph convolutional networks(GCNs)have received significant attention from various research fields due to the excellent performance in learning graph representations.Although GCN performs well compared with other methods,it still faces challenges.Training a GCN model for large-scale graphs in a conventional way requires high computation and storage costs.Therefore,motivated by an urgent need in terms of efficiency and scalability in training GCN,sampling methods have been proposed and achieved a significant effect.In this paper,we categorize sampling methods based on the sampling mechanisms and provide a comprehensive survey of sampling methods for efficient training of GCN.To highlight the characteristics and differences of sampling methods,we present a detailed comparison within each category and further give an overall comparative analysis for the sampling methods in all categories.Finally,we discuss some challenges and future research directions of the sampling methods.展开更多
In order to explore the potential of profit margin improvement,a novel three-scale integrated optimization model of furnace simulation,cyclic scheduling,and supply chain of ethylene plants is proposed and evaluated.A ...In order to explore the potential of profit margin improvement,a novel three-scale integrated optimization model of furnace simulation,cyclic scheduling,and supply chain of ethylene plants is proposed and evaluated.A decoupling strategy is proposed for the solution of the three-scale model,which uses our previously proposed reactor scale model for operation optimization and then transfers the obtained results as a parameter table in the joint MILP optimization of plant-supply chain scale for cyclic scheduling.This optimization framework simplifies the fundamental mixed-integer nonlinear programming(MINLP)into several sub-models,and improves the interpretability and extendibility.In the evaluation of an industrial case,a profit increase at a percentage of 3.25%is attained in optimization compared to the practical operations.Further sensitivity analysis is carried out for strategy evolving study when price policy,supply chain,and production requirement parameters are varied.These results could provide useful suggestions for petrochemical enterprises on thermal cracking production.展开更多
Stochastic unit commitment is one of the most powerful methods to address uncertainty. However, the existingscenario clustering technique for stochastic unit commitment cannot accurately select representative scenario...Stochastic unit commitment is one of the most powerful methods to address uncertainty. However, the existingscenario clustering technique for stochastic unit commitment cannot accurately select representative scenarios,which threatens the robustness of stochastic unit commitment and hinders its application. This paper providesa stochastic unit commitment with dynamic scenario clustering based on multi-parametric programming andBenders decomposition. The stochastic unit commitment is solved via the Benders decomposition, which decouplesthe primal problem into the master problem and two types of subproblems. In the master problem, the committedgenerator is determined, while the feasibility and optimality of generator output are checked in these twosubproblems. Scenarios are dynamically clustered during the subproblem solution process through the multiparametric programming with respect to the solution of the master problem. In other words, multiple scenariosare clustered into several representative scenarios after the subproblem is solved, and the Benders cut obtainedby the representative scenario is generated for the master problem. Different from the conventional stochasticunit commitment, the proposed approach integrates scenario clustering into the Benders decomposition solutionprocess. Such a clustering approach could accurately cluster representative scenarios that have impacts on theunit commitment. The proposed method is tested on a 6-bus system and the modified IEEE 118-bus system.Numerical results illustrate the effectiveness of the proposed method in clustering scenarios. Compared withthe conventional clustering method, the proposed method can accurately select representative scenarios whilemitigating computational burden, thus guaranteeing the robustness of unit commitment.展开更多
基金funded in part by Grant No.RG-15-135-43 from the Deanship of Scientific Research(DSR)at King Abdulaziz University in Saudi Arabia.
文摘The proliferation of distributed and renewable energy resources introduces additional operational challenges to power distribution systems.Transactive energy management,which allows networked neighborhood communities and houses to trade energy,is expected to be developed as an effective method for accommodating additional uncertainties and security mandates pertaining to distributed energy resources.This paper proposes and analyzes a two-layer transactive energy market in which houses in networked neighborhood community microgrids will trade energy in respective market layers.This paper studies the blockchain applications to satisfy socioeconomic and technological concerns of secure transactive energy management in a two-level power distribution system.The numerical results for practical networked microgrids located at IllinoisTech−Bronzeville in Chicago illustrate the validity of the proposed blockchain-based transactive energy management for devising a distributed,scalable,efficient,and cybersecured power grid operation.The conclusion of the paper summarizes the prospects for blockchain applications to transactive energy management in power distribution systems.
基金supported by the National Natural Science Foundation of China(61732018,61872335,61802367,61876215)the Strategic Priority Research Program of Chinese Academy of Sciences(XDC05000000)+1 种基金Beijing Academy of Artificial Intelligence(BAAI),the Open Project Program of the State Key Laboratory of Mathematical Engineering and Advanced Computing(2019A07)the Open Project of Zhejiang Laboratory,and a grant from the Institute for Guo Qiang,Tsinghua University.Recommended by Associate Editor Long Chen.
文摘Graph convolutional networks(GCNs)have received significant attention from various research fields due to the excellent performance in learning graph representations.Although GCN performs well compared with other methods,it still faces challenges.Training a GCN model for large-scale graphs in a conventional way requires high computation and storage costs.Therefore,motivated by an urgent need in terms of efficiency and scalability in training GCN,sampling methods have been proposed and achieved a significant effect.In this paper,we categorize sampling methods based on the sampling mechanisms and provide a comprehensive survey of sampling methods for efficient training of GCN.To highlight the characteristics and differences of sampling methods,we present a detailed comparison within each category and further give an overall comparative analysis for the sampling methods in all categories.Finally,we discuss some challenges and future research directions of the sampling methods.
基金the National Natural Science Foundation of China for its financial support(U1462206,21991100,21991104)。
文摘In order to explore the potential of profit margin improvement,a novel three-scale integrated optimization model of furnace simulation,cyclic scheduling,and supply chain of ethylene plants is proposed and evaluated.A decoupling strategy is proposed for the solution of the three-scale model,which uses our previously proposed reactor scale model for operation optimization and then transfers the obtained results as a parameter table in the joint MILP optimization of plant-supply chain scale for cyclic scheduling.This optimization framework simplifies the fundamental mixed-integer nonlinear programming(MINLP)into several sub-models,and improves the interpretability and extendibility.In the evaluation of an industrial case,a profit increase at a percentage of 3.25%is attained in optimization compared to the practical operations.Further sensitivity analysis is carried out for strategy evolving study when price policy,supply chain,and production requirement parameters are varied.These results could provide useful suggestions for petrochemical enterprises on thermal cracking production.
基金the Science and Technology Project of State Grid Corporation of China,Grant Number 5108-202304065A-1-1-ZN.
文摘Stochastic unit commitment is one of the most powerful methods to address uncertainty. However, the existingscenario clustering technique for stochastic unit commitment cannot accurately select representative scenarios,which threatens the robustness of stochastic unit commitment and hinders its application. This paper providesa stochastic unit commitment with dynamic scenario clustering based on multi-parametric programming andBenders decomposition. The stochastic unit commitment is solved via the Benders decomposition, which decouplesthe primal problem into the master problem and two types of subproblems. In the master problem, the committedgenerator is determined, while the feasibility and optimality of generator output are checked in these twosubproblems. Scenarios are dynamically clustered during the subproblem solution process through the multiparametric programming with respect to the solution of the master problem. In other words, multiple scenariosare clustered into several representative scenarios after the subproblem is solved, and the Benders cut obtainedby the representative scenario is generated for the master problem. Different from the conventional stochasticunit commitment, the proposed approach integrates scenario clustering into the Benders decomposition solutionprocess. Such a clustering approach could accurately cluster representative scenarios that have impacts on theunit commitment. The proposed method is tested on a 6-bus system and the modified IEEE 118-bus system.Numerical results illustrate the effectiveness of the proposed method in clustering scenarios. Compared withthe conventional clustering method, the proposed method can accurately select representative scenarios whilemitigating computational burden, thus guaranteeing the robustness of unit commitment.
