Innovative Applications of O.R.
Parallel computing applied to the stochastic dynamic programming for long term operation planning of hydrothermal power systems

https://doi.org/10.1016/j.ejor.2013.02.024Get rights and content

Abstract

In this paper, parallel processing techniques are employed to improve the performance of the stochastic dynamic programming applied to the long term operation planning of electrical power system. The hydroelectric plants are grouped into energy equivalent reservoirs and the expected cost functions are modeled by a piecewise linear approximation, by means of the Convex Hull algorithm. In order to validate the proposed methodology, data from the Brazilian electrical power system is utilized.

Highlights

► We analyze to parallelization process of the Stochastic Dynamic Programming (SDP). ► This is applied to the long term hydrothermal system operation planning. ► We examine this approach applied to the Brazilian Power System. ► The parallel processing strategy adopted reduces significantly the computing time. ► This can be use by utilities/government to determine the optimal operation planning.

Introduction

The electric power system operation planning aims at determining the hydro and thermoelectric generation targets, which minimizes the expected operation cost of the whole system in a given horizon (i.e. 5 years), while minimum quality and reliability standards are met in Pereira (1989).

In hydrothermal systems operation planning, such a goal is attained by dispatching hydroelectric power plants as much as possible, whereas other energy resources, such as thermal, are used to match the demand and, consequently, improving the overall system reliability.

The Brazilian Power System (BPS) is an example of a large scale hydrothermal system, with almost 75% of its installed capacity based on hydroelectric generation. In the BPS the operation planning is categorized according to the study horizon, which range from the dispatch (a week ahead) to the long term operation planning (5 years ahead). In the hydrothermal dispatch category, the constraints are represented in detail, as the reservoir operational restrictions are known, while the stochasticity of the water inflow has little impact. The uncertainty of the water inflows becomes more significant as the considered horizon increases, for instance, in the long term operation planning (see Maceira et al., 2002).

Other aspects also influences the long term operation planning (LTOP), such as spatial and temporal coupling. A common practice in large watersheds is erecting several hydro dams in the same river basin in order to increase the electricity production (Grygier and Stedinger, 1985). This implies that the operation of an upstream reservoir interferes in the operation of a downstream one (see Xi et al., 1999, Terry et al., 1986). Hence, spatial coupling among reservoirs need to be taken into account. Moreover, the decision to use hydro resources in the present may incur a higher operational cost in the following months, due to the need of dispatching expensive thermal generators or even shedding load (Silva, 2001).

In a general manner, the dynamic programming is a technique used to solve sequential optimization problems by enumerating states that are likely to happen in each stage (see Bellman, 1957, Ferrero et al., 1998). In the dynamic programming sense, the optimum operation policy consists of a series of decisions made in each stage, so an objective can be reached. In this way, present decisions will have direct impact on future ones. In the hydrothermal system operation planning problem, possible water storage levels in each reservoir represent states and a month a stage, while the shares of hydro and thermal generation are decisions. The objective is to minimize the expected operation cost during the planning horizon. However, the inclusion of water inflows turns the original problem into a stochastic one, which can be tackled by the Stochastic Dynamic Programming (SDP) (Archibald et al., 2006, Zambelli et al., 2006).

A drawback that can be readily seen from the SDP approach is the curse of dimensionality caused by the exponential increase of the computational effort experienced whenever the number of states (e.g., water reservoirs) increases. A common practice in mitigating such a hurdle consists in aggregating a large number of reservoirs into equivalent ones as presented by Arvanitidis and Rosing, 1970a, Arvanitidits and Rosing, 1970b.

In addition to the aforementioned equivalent reservoir method, recent advances in parallel computing architectures also come to play a fundamental role in making the LTOP solvable within practical time limits (Silva and Finardi, 2003).

A significant example to be considered is the Brazilian hydrothermal system. In the mid 1970s, with the increased amount of generation and transmission interconnections of the BPS, the SDP approach used in the optimal LTOP problem was replaced by a Stochastic Dual Dynamic Programming (SDDP) algorithm together with a Bender’s Decomposition approach (Pereira and Pinto, 1985), in order to overcome the SDP computational burden. Since then the SDP was considered to be impractical to be used to solve the operation planning problem and the SDDP algorithm is still in use today with some attempts to improve the SDDP is presented like the ones seen in Shapiro (2011) and Shapiro et al. (2013).

Many attempts to reduce the computational time of Dynamic Programming applications can be seen on Rodriguez et al. (1996) and Stivala et al. (2010). A broad set of solutions concerning power system applications have been recently proposed using parallel processing. Among them, there can be highlighted some applications in the hydrothermal system operation planning. Tang and Luh, 1995, Pinto, 2011 and Pinto et al. (2009), present a parallel processing approach to solve the short-term operation planning. Considering the long-term horizon Añó et al. (1999) present an attempt to optimal operation of large scale systems considering individual power plants representation. Additionally, another parallel approach is proposed by Silva and Finardi (2003) for the SDDP method to solve the BPS operation planning problem.

In this paper, two parallel programming approaches are adopted to reduce the computational time of the SDP applied to the LTOP problem. The proposed methodology makes use of the Convex Hull algorithm for modeling the expected cost-to-go function (ECF), as reported by Dias et al. (2010) to solve the LTOP problem. A case study based on the Brazilian hydrothermal system is presented.

The paper is outlined as follows. Section 2 presents the hydrothermal systems stochastic dynamic programming Problem formulation. In Section 3, the Convex Hull algorithm is presented applied to the SDP problem solution. Section 4 details the parallelization strategies for the LTOP problem and in Section 5 the proposed methodology is tested with two real systems study case, based on the Brazilian hydrothermal system. Finally conclusions are drawn in Section 6.

Section snippets

Stochastic dynamic programming

Dynamic programming (DP) is a multistage decision procedure aiming at optimizing a given problem. In the DP sense, the global optimum is achieved by optimizing a sequence of small subproblems as presented by Bellman (1957). The DP solves the problem starting from the last to the first stage in a recursive manner, where the decision in each stage depends on its consequences in future stages. In the LTOP problem each stage is usually represented by a month (Silva, 2001).

Since the operation

SDP based on Convex Hull

The Convex Hull (CH) algorithm calculates, given a finite set of points, the boundary of the minimal convex set containing all those points (Cormen et al., 2001). Many Convex Hull algorithms were proposed, as Incremental, Gift Wrap, Divide and Conquer, and QuickHull (Barber et al., 1996). The latter was employed by Dias et al. in order to tackle the SDP expected cost-to-go functions modeling, by means of the algorithm shown in Fig. 1.

Following the dynamic programming approach, the modeling of

Parallel Convex Hull – SDP Algorithm

To solve the LTOP problem two distinct computing phases are required: backward iteration process by the SDP approach and a final simulation. In the backward phase, the future operational costs, i.e. cost-to-go functions, are computed for each stage, starting from the last one. In the final simulation, in turn, the expected operational cost of the hydrothermal system can be calculated for any initial conditions at each stage, by means of the cost-to-go functions obtained in the backward phase –

Application to the Brazilian Power System

In order to validate an implementation of the proposed SDP algorithm, many open-source libraries have been employed, such as CLP1 (primal–dual simplex method for solving the individual linear programming problems), Qhull2 (quick hull algorithm for generating the cost-to-go functions) and MPICH23 (implementation for the Message Passing Interface – MPI – for interprocess communication).

The

Conclusions and future works

This paper presented the parallelization of the Stochastic Dynamic Programming (SDP) and the Convex Hull algorithm methodology with applications to the Brazilian Electrical Power System.

Results show that the parallelization strategies adopted in this paper, namely the static and dynamic task scheduling, were capable of considerably speeding up the solution of the Stochastic Dynamic Programming (SDP) problem associated with a large hydrothermal systems, such as the Brazilian Power System. Such

Acknowledgments

The authors would like to thank the Brazilian National Council for Scientific and Technological Development—CNPq, Coordination for the Improvement of Higher Level Personnel – CAPES, FAPERJ and FAPEMIG for financial support.

Also, the authors gratefully acknowledge the referees, as well as the Editor, for their invaluable contributions to improve this paper.

References (33)

  • N.V. Arvanitidis et al.

    Composite representation of a multireservoir hydroelectric power system

    Power Apparatus and Systems, IEEE Transactions on.

    (1970)
  • N.V. Arvanitidis et al.

    Optimal operation of multireservoir systems using a composite representation

    Power Apparatus and Systems, IEEE Transactions on.

    (1970)
  • C.B. Barber et al.

    The quickhull algorithm for convex hulls

    ACM Transactions on Mathematical Software

    (1996)
  • R. Bellman

    Dynamic Programming

    (1957)
  • T.H. Cormen et al.

    Introduction to Algorithms

    (2001)
  • B.H. Dias et al.

    Stochastic dynamic programming applied to hydrothermal power systems operation planning based on the convex hull algorithm

    Mathematical Problems in Engineering

    (2010)
  • Cited by (42)

    • A gradient-based algorithm for non-smooth constrained optimization problems governed by discrete-time nonlinear equations with application to long-term hydrothermal optimal scheduling control

      2022, Journal of Computational and Applied Mathematics
      Citation Excerpt :

      Generally speaking, long-term hydrothermal scheduling can be defined as water releases from reservoirs for an interval, which ranges between one to a few years [21–23]. The long-term hydrothermal optimal scheduling problem aims at determining the thermoelectric and hydro generation targets, which minimizes the expected running cost of the whole hydrothermal power system in a given horizon, while minimum quality and reliability standards are met [24–27]. In long-term hydrothermal optimal scheduling problem, such a goal is obtained by dispatching hydroelectric power plants as much as possible, whereas other energy resources, such as thermal, are used to match the demand and improve the overall hydrothermal power system reliability [28–31].

    View all citing articles on Scopus
    View full text