Combined heat and electricity operation with variable mass flow rates promotes flexibility,economy,and sustainability through synergies between electric power systems(EPSs)and district heating systems(DHSs).Such combi...Combined heat and electricity operation with variable mass flow rates promotes flexibility,economy,and sustainability through synergies between electric power systems(EPSs)and district heating systems(DHSs).Such combined operation presents a highly nonlinear and nonconvex optimization problem,mainly due to the bilinear terms in the heat flow model—that is,the product of the mass flow rate and the nodal temperature.Existing methods,such as nonlinear optimization,generalized Benders decomposition,and convex relaxation,still present challenges in achieving a satisfactory performance in terms of solution quality and computational efficiency.To resolve this problem,we herein first reformulate the district heating network model through an equivalent transformation and variable substitution.The reformulated model has only one set of nonconvex constraints with reduced bilinear terms,and the remaining constraints are linear.Such a reformulation not only ensures optimality,but also accelerates the solving process.To relax the remaining bilinear constraints,we then apply McCormick envelopes and obtain an objective lower bound of the reformulated model.To improve the quality of the McCormick relaxation,we employ a piecewise McCormick technique that partitions the domain of one of the variables of the bilinear terms into several disjoint regions in order to derive strengthened lower and upper bounds of the partitioned variables.We propose a heuristic tightening method to further constrict the strengthened bounds derived from the piecewise McCormick technique and recover a nearby feasible solution.Case studies show that,compared with the interior point method and the method implemented in a global bilinear solver,the proposed tightening McCormick method quickly solves the heat–electricity operation problem with an acceptable feasibility check and optimality.展开更多
Vehicle–bicycle conflict incurs a higher risk of traffic accidents,particularly as it frequently takes place at intersections.Mastering the traffic characteristics of vehicle–bicycle conflict and optimizing the desi...Vehicle–bicycle conflict incurs a higher risk of traffic accidents,particularly as it frequently takes place at intersections.Mastering the traffic characteristics of vehicle–bicycle conflict and optimizing the design of intersections can effectively reduce such conflict.In this paper,the conflict between right-turning motor vehicles and straight-riding bicycles was taken as the research object,and T-Analyst video recognition technology was used to obtain data on riding(driving)behavior and vehicle–bicycle conflict at seven intersections in Changsha,China.Herein,eight typical traffic characteristics of vehicle–bicycle conflict are summarized,the causes of vehicle–bicycle conflict are analyzed using 18 factors in three dimensions,the internal relationship between intersection design factors and traffic conflicts is explored,and the guiding of design optimization based on the width of bicycle lanes and the soft separation between vehicles and bicycles is discussed.The results showed that colored paved bicycle lanes were better,performing better at a width of 2.5 m compared to 1.5 m.However,the colored pavement was not suitable for the entire road and had to be set at the position,at which the trajectories of a bicycle and motor vehicle overlapped.Thus,a 2.5-m-wide bicycle lane provides good safety.However,there are still defects in the existing safety indicators,so it is necessary to develop new indicators to reflect real vehicle–bicycle conflict situations more comprehensively.展开更多
In this paper,we propose an analytical stochastic dynamic programming(SDP)algorithm to address the optimal management problem of price-maker community energy storage.As a price-maker,energy storage smooths price diffe...In this paper,we propose an analytical stochastic dynamic programming(SDP)algorithm to address the optimal management problem of price-maker community energy storage.As a price-maker,energy storage smooths price differences,thus decreasing energy arbitrage value.However,this price-smoothing effect can result in significant external welfare changes by reduc-ing consumer costs and producer revenues,which is not negligible for the community with energy storage systems.As such,we formulate community storage management as an SDP that aims to maximize both energy arbitrage and community welfare.To incorporate market interaction into the SDP format,we propose a framework that derives partial but sufficient market information to approximate impact of storage operations on market prices.Then we present an analytical SDP algorithm that does not require state discretization.Apart from computational efficiency,another advantage of the analytical algorithm is to guide energy storage to charge/discharge by directly comparing its current marginal value with expected future marginal value.Case studies indicate community-owned energy storage that maximizes both arbitrage and welfare value gains more benefits than storage that maximizes only arbitrage.The proposed algorithm ensures optimality and largely reduces the computational complexity of the standard SDP.Index Terms-Analytical stochastic dynamic programming,energy management,energy storage,price-maker,social welfare.展开更多
基金This work was supported by the Science and Technology Program of State Grid Corporation of China(522300190008).
文摘Combined heat and electricity operation with variable mass flow rates promotes flexibility,economy,and sustainability through synergies between electric power systems(EPSs)and district heating systems(DHSs).Such combined operation presents a highly nonlinear and nonconvex optimization problem,mainly due to the bilinear terms in the heat flow model—that is,the product of the mass flow rate and the nodal temperature.Existing methods,such as nonlinear optimization,generalized Benders decomposition,and convex relaxation,still present challenges in achieving a satisfactory performance in terms of solution quality and computational efficiency.To resolve this problem,we herein first reformulate the district heating network model through an equivalent transformation and variable substitution.The reformulated model has only one set of nonconvex constraints with reduced bilinear terms,and the remaining constraints are linear.Such a reformulation not only ensures optimality,but also accelerates the solving process.To relax the remaining bilinear constraints,we then apply McCormick envelopes and obtain an objective lower bound of the reformulated model.To improve the quality of the McCormick relaxation,we employ a piecewise McCormick technique that partitions the domain of one of the variables of the bilinear terms into several disjoint regions in order to derive strengthened lower and upper bounds of the partitioned variables.We propose a heuristic tightening method to further constrict the strengthened bounds derived from the piecewise McCormick technique and recover a nearby feasible solution.Case studies show that,compared with the interior point method and the method implemented in a global bilinear solver,the proposed tightening McCormick method quickly solves the heat–electricity operation problem with an acceptable feasibility check and optimality.
基金This work was supported in part by the Ministry of Education of the People’s Republic of China Project of Humanities and Social Sciences under Grant No.19YJCZH208,author X.X,http://www.moe.gov.cn/in part by the Philosophy and Social Science Foundation Project of Hunan Province under Grant No.15YBA406,author X.X,http://www.hnsk.gov.cn/+3 种基金in part by the Social Science Evaluation Committee Project of Hunan Province under Grant No.XSP18YBZ125,author X.X,http://www.hnsk.gov.cn/in part by the Social Sciences Federation Think Tank Project of Hunan Province under Grant No.ZK2019025,author X.X,http://www.hnsk.gov.cn/in part by the Education Bureau Research Foundation Project of Hunan Province under Grant No.20A531,author X.X,http://jyt.hunan.gov.cn/in part by the Science and Technology Project of Changsha City,under Grant No.kq2004092,author X.X,http://kjj.changsha.gov.cn/.
文摘Vehicle–bicycle conflict incurs a higher risk of traffic accidents,particularly as it frequently takes place at intersections.Mastering the traffic characteristics of vehicle–bicycle conflict and optimizing the design of intersections can effectively reduce such conflict.In this paper,the conflict between right-turning motor vehicles and straight-riding bicycles was taken as the research object,and T-Analyst video recognition technology was used to obtain data on riding(driving)behavior and vehicle–bicycle conflict at seven intersections in Changsha,China.Herein,eight typical traffic characteristics of vehicle–bicycle conflict are summarized,the causes of vehicle–bicycle conflict are analyzed using 18 factors in three dimensions,the internal relationship between intersection design factors and traffic conflicts is explored,and the guiding of design optimization based on the width of bicycle lanes and the soft separation between vehicles and bicycles is discussed.The results showed that colored paved bicycle lanes were better,performing better at a width of 2.5 m compared to 1.5 m.However,the colored pavement was not suitable for the entire road and had to be set at the position,at which the trajectories of a bicycle and motor vehicle overlapped.Thus,a 2.5-m-wide bicycle lane provides good safety.However,there are still defects in the existing safety indicators,so it is necessary to develop new indicators to reflect real vehicle–bicycle conflict situations more comprehensively.
基金supported in part by the Joint Funds of the National Natural Science Foundation of China(U2066214)in part by Shanghai Sailing Program(22YF1414500)in part by the Project(SKLD22KM19)funded by State Key Laboratory of Power System Operation and Control.
文摘In this paper,we propose an analytical stochastic dynamic programming(SDP)algorithm to address the optimal management problem of price-maker community energy storage.As a price-maker,energy storage smooths price differences,thus decreasing energy arbitrage value.However,this price-smoothing effect can result in significant external welfare changes by reduc-ing consumer costs and producer revenues,which is not negligible for the community with energy storage systems.As such,we formulate community storage management as an SDP that aims to maximize both energy arbitrage and community welfare.To incorporate market interaction into the SDP format,we propose a framework that derives partial but sufficient market information to approximate impact of storage operations on market prices.Then we present an analytical SDP algorithm that does not require state discretization.Apart from computational efficiency,another advantage of the analytical algorithm is to guide energy storage to charge/discharge by directly comparing its current marginal value with expected future marginal value.Case studies indicate community-owned energy storage that maximizes both arbitrage and welfare value gains more benefits than storage that maximizes only arbitrage.The proposed algorithm ensures optimality and largely reduces the computational complexity of the standard SDP.Index Terms-Analytical stochastic dynamic programming,energy management,energy storage,price-maker,social welfare.