Study On Dynamic Programming For Dynamic Zonal Pricing In Electricity Market

The problem of zone pricing in electricity market is one of the hot topics in power grid. The aim of the very problem is to seek the best dividing area method that can show the system obstruction status. That is to say, on the condition that power transmission is eliminated, both economy and fairness are guaranteed at the same time. Because this problem belongs to double-target optimization problem.which is complicated nonlinear multi-constrained.The key to solving this kind of problems is to look for better problem structure model and effective solution algorithm.Based on the research into dynamic programming algorithm and critical path strategy, the paper presents a dynamic programming algorithm system for solving postman problem and the critical path strategy appropriate for inventory decision. On this basis, this problem's effective mapping is achieved in postman problem, and dynamic programming algorithm is successfully applied to solving transmission pricing problem in electricity market. The main works are as follows:SPUCN (Shortest Path Problem of Uncertain Column Network) algorithm, which is based on dynamic programming, is presented for decision process of unfixed step number. This algorithm converts the UCN model into the ideal one which can be solute by basic equation of dynamic programming. The accuracy and theory of this algorithm is also proved.A new algorithm CMDPA (Chinese Mailman Decision Process Algorithm), which make it possible to solve Chinese Mailman Problem with Decision Process thought, is present. The algorithm CEPA (Convert Edge to Point Algorithm) is given for making the model of Chinese Postman Problem apply to decision-making, then, we give MDPMCA (Multistep Decision Process Model Convert Algorithm) to make this model meet the demand of the Multistep Decision Process. Pro tanto, we can use CMDPA to solve Chinese Mailman Problem. We prove the accuracy and theory of this algorithm. Additionally, we branch out Principle of Optimality at Chinese Postman Problem.Dynamic Programming is used to solve K postmenChinese postmen problem for the first time. And a novel model for decisionmaking of KPCPP and the computation models for solving the whole problem are proposed. An illustrative example is given to clarify concepts and methods. The accuracy of these algorithms and the relative theories are verified by mathematical language. Here we extend Dynamic Programming towards a wide range of Postmen Chinese Postmen Problems, which can be computation modeled in similar ways to Postmen Chinese Postmen Problems.A Critical Path Inventory Policy is presented in order to find solution for a kind of stochastic EOQ model, where F is limited. This paper gives BFA (Build FSM Algorithm) for making a model applicable in graph theory, then, BPA (Build PERT Algorithm) is given to convert the model meet the demand of critical path. Pro tanto, the policy can be used to solve the Problem. Finally, its validity is proved in theory and illustrated by an example, and the theory of algorithms is proved.In this paper, space approach of moving object in a kind of markov stochastic processes is researched. A state transfer function of markov stochastic model in space-time network is deduced by mathematic method firstly. The space-time network is defined as a three-dimensional space which is formed from moving objects and their trajectories, and the corresponding distance space is constructed. Then the fixed point theorem is presented. A self-mapping operator in the distance space is attained by the analysis of state transfer function. On the basis of the above theory, the moving object can be mapped from the former node to the target one by themselves. All of these are proved by theorems and emulational experiments. Moreover, we attempt to use the method of space decompounds with granularity in moving object. The moving object can be approached better through mapping of fixed point, and the requirements of moving objects are satisfied in real time. Relative experiments also validate the feasibility and validity of space approach idea.On the basis of transmission network, Because power transmission congestion commonly occur among certain regions frequently, while the inner parts of these regions seldom appear this problem, as a result of above work, a price mechanism of zone pricing based on dynamic programming algorithm is presented. To simulate real-time environment restricted by a kind of discrete, then on the basis of avoiding the influence of obstruction, dynamic zoning is reasonably carried out. Accordingly, the minimum sum of zone pricing cost is obtained. Simulation test and contrast experiment prove the high efficiency of the presented algorithm.