Dynamic Economic Scheduling with Self-Adaptive Uncertainty in Distribution Network Based on Deep Reinforcement Learning

Traditional optimal scheduling methods are limited to accurate physical models and parameter settings, which aredifficult to adapt to the uncertainty of source and load, and there are problems such as the inability to make dynamicdecisions continuously. This paper proposed a dynamic economic scheduling method for distribution networksbased on deep reinforcement learning. Firstly, the economic scheduling model of the new energy distributionnetwork is established considering the action characteristics of micro-gas turbines, and the dynamic schedulingmodel based on deep reinforcement learning is constructed for the new energy distribution network system with ahigh proportion of new energy, and the Markov decision process of the model is defined. Secondly, Second, for thechanging characteristics of source-load uncertainty, agents are trained interactively with the distributed networkin a data-driven manner. Then, through the proximal policy optimization algorithm, agents adaptively learn thescheduling strategy and realize the dynamic scheduling decision of the new energy distribution network system.Finally, the feasibility and superiority of the proposed method are verified by an improved IEEE 33-node simulationsystem.

The Dynamic Centre of the New Global Economic Landscape

Competition used to be a steady,slow-moving phenomenon,dominated by the giant companies of the Western world.Two-thirds of the companies listed on the Fortune Global 500 in the 1960s were still there 15 years later.New competitors were easy to spot because they were well known,

Inequality of Realization of a Stochastic Dynamics Based on the Erdos Discrepancy Problem

This paper proposes a stochastic dynamics model in which people who are endowed with different discount factors chose to buy the capital stock periodically with different periodicities and are exposed to randomness at arithmetic progression times. We prove that the realization of a stochastic equilibrium may render to the people quite unequal benefits. Its proof is based on Erdös Discrepancy Problem that an arithmetic progression sum of any sign sequence goes to infinity, which is recently solved by Terence Tao [1]. The result in this paper implies that in some cases, the sources of inequality come from pure luck.

Data-driven Optimal Dynamic Dispatch for Hydro-PV-PHS Integrated Power Systems Using Deep Reinforcement Learning Approach

To utilize electricity in a clean and integrated manner,a zero-carbon hydro-photovoltaic(PV)-pumped hydro storage(PHS)integrated power system is studied,considering the uncertainties of PV and load demand.It is a challenge for operators to develop a dynamic dispatch mechanism for such a system,and traditional dispatch methods are difficult to adapt to random changes in the actual environment.Therefore,this study proposes a real-time dynamic dispatch strategy considering economic operation and complementary regulatory ability.First,the dynamic dispatch of a hydro-PV-PHS integrated power system is presented as a multi-objective optimization problem and the weight factor between different goals is effectively calculated using information entropy.Afterwards,the dispatch model is converted into the Markov decision process,where the dynamic dispatch decision is formulated as a reinforcement learning framework.Then,a deep deterministic policy gradient(DDPG)is deployed towards the online decision for dispatch in continuous action spaces.Finally,a case study is applied to evaluate the performance of the proposed method based on a real hydroPV-PHS integrated power system in China.Simulations show that the system agent reduces the power volatility of supply by 26.7%after hydropower regulating and further relieves power fluctuation at the point of common coupling(PCC)to the upperlevel grid by 3.28%after PHS participation.The comparison results verify the effectiveness of the proposed method.

Reserve Constrained Dynamic Economic Dispatch with Valve-point Effect:A Two-stage Mixed Integer Linear Programming Approach

This paper proposes a deterministic two-stage mixed integer linear programming(TSMILP)approach to solve the reserve constrained dynamic economic dispatch(DED)problem considering valve-point effect(VPE).In stage one,the nonsmooth cost function and the transmission loss are piecewise linearized and consequently the DED problem is formulated as a mixed integer linear programming(MILP)problem,which can be solved by commercial solvers.In stage two,based on the solution obtained in stage one,a range compression technique is proposed to make a further exploitation in the subspace of the whole solution domain.Due to the linear approximation of the transmission loss,the solution obtained in stage two dose not strictly satisfies the power balance constraint.Hence,a forward procedure is employed to eliminate the error.The simulation results on four test systems show that TSMILP makes satisfactory performances,in comparison with the existing methods.

Function S-rough sets and two law forecast

Function S-rough sets has the properties of dynamics, heredity, and memory. Function S-rough sets is penetrated and crossed with the issue of economic law forecast, then a new forecast model based on function S-rough sets namely the two law forecast model is proposed, which includes upper law forecast model and lower law forecast model; and its＇ implement algorithm is given. Finally, the validity of the model is demonstrated by the forecast for region economic development of Hainan Province.

An Efficient Multi-objective Approach Based on Golden Jackal Search for Dynamic Economic Emission Dispatch

Dynamic Economic Emission Dispatch(DEED)aims to optimize control over fuel cost and pollution emission,two conflicting objectives,by scheduling the output power of various units at specific times.Although many methods well-performed on the DEED problem,most of them fail to achieve expected results in practice due to a lack of effective trade-off mechanisms between the convergence and diversity of non-dominated optimal dispatching solutions.To address this issue,a new multi-objective solver called Multi-Objective Golden Jackal Optimization(MOGJO)algorithm is proposed to cope with the DEED problem.The proposed algorithm first stores non-dominated optimal solutions found so far into an archive.Then,it chooses the best dispatching solution from the archive as the leader through a selection mechanism designed based on elite selection strategy and Euclidean distance index method.This mechanism can guide the algorithm to search for better dispatching solutions in the direction of reducing fuel costs and pollutant emissions.Moreover,the basic golden jackal optimization algorithm has the drawback of insufficient search,which hinders its ability to effectively discover more Pareto solutions.To this end,a non-linear control parameter based on the cosine function is introduced to enhance global exploration of the dispatching space,thus improving the efficiency of finding the optimal dispatching solutions.The proposed MOGJO is evaluated on the latest CEC benchmark test functions,and its superiority over the state-of-the-art multi-objective optimizers is highlighted by performance indicators.Also,empirical results on 5-unit,10-unit,IEEE 30-bus,and 30-unit systems show that the MOGJO can provide competitive compromise scheduling solutions compared to published DEED methods.Finally,in the analysis of the Pareto dominance relationship and the Euclidean distance index,the optimal dispatching solutions provided by MOGJO are the closest to the ideal solutions for minimizing fuel costs and pollution emissions simultaneously,compared to the latest published DEED solutions.