In this paper, we focus on the real-time interactions among multiple utility companies and multiple users and formulate real-time pricing(RTP) as a two-stage optimization problem. At the first stage, based on cost function, we propose a continuous supply function bidding mechanism to model the utility companies’ profit maximization problem, by which the analytic expression of electricity price is further derived. At the second stage, considering that individually optimal solution may not be socially optimal, we employ convex optimization with linear constraints to model the price anticipating users’ daily payoff maximum. Substitute the analytic expression of electricity price obtained at the first stage into the optimization problem at the second stage. Using customized proximal point algorithm(C-PPA), the optimization problem at the second stage is solved and electricity price is obtained accordingly. We also prove the existence and uniqueness of the Nash equilibrium in the mentioned twostage optimization and the convergence of C-PPA. In addition, in order to make the algorithm more practical, a statistical approach is used to obtain the function of price only through online information exchange, instead of solving it directly. The proposed approach offers RTP, power production and load scheduling for multiple utility companies and multiple users in smart grid. Statistical approach helps to protect the company’s privacy and avoid the interference of random factors, and C-PPA has an advantage over Lagrangian algorithm because the former need not obtain the objection function of the dual optimization problem by solving an optimization problem with parameters. Simulation results show that the proposed framework can significantly reduce peak time loading and efficiently balance system energy distribution.
In this paper,we present an extrapolated parallel subgradient projection method with the centering technique for the convex feasibility problem,the algorithm improves the convergence by reason of using centering techniques which reduce the oscillation of the corresponding sequence.To prove the convergence in a simply way,we transmit the parallel algorithm in the original space to a sequential one in a newly constructed product space.Thus,the convergence of the parallel algorithm is derived with the help of the sequential one under some suitable conditions.Numerical results show that the new algorithm has better convergence than the existing algorithms.