In this chapter, we present a series of computational results for the solution of the D-OPGen and S-OPGen problem with the aim of documenting the performance of the solution approaches presented in the previous chapters. In Section 8.1, we start with a description of the problem instances considered for the computations by specifying the power generation system, followed by the presentation of the generated scenario trees. Subsequently, we computationally investigate the incorporation of facets determined for the stochastic switching polytope of Chapter 4 as cutting planes to a branchand-cut algorithm. The main focus of this chapter lies on the investigation on the computational behavior of the SD-BB algorithm whose development and implementation has been described in the previous two chapters. In this context, we perform a systematic calibration of the applied methods and parameters with the aim of obtaining general suggestions for the setting. On this basis the algorithm is applied to instances of larger size where we scale the basic characteristics which define a problem instance of the S-OPGen problem.


Wind Power Planning Horizon Test Instance Lagrangian Relax Scenario Tree 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Vieweg+Teubner Verlag | Springer Fachmedien Wiesbaden GmbH 2011

Authors and Affiliations

  • Debora Mahlke

There are no affiliations available

Personalised recommendations