Document Type

Article

Publication Version

Accepted Manuscript

Publication Date

1-2013

Journal or Book Title

Computers and Operations Research

Volume

40

Issue

1

First Page

9

Last Page

23

DOI

10.1016/j.cor.2012.05.005

Abstract

A challenging aspect of applying stochastic programming in a dynamic setting is to construct a set of discrete scenarios that well represents multivariate stochastic processes for uncertain parameters. Often this is done by generating a scenario tree using a statistical procedure and then reducing its size while maintaining its statistical properties. In this paper, we test a new scenario reduction heuristic in the context of long-term power generation expansion planning. We generate two different sets of scenarios for future electricity demands and fuel prices by statistical extrapolation of long-term historical trends. The cardinality of the first set is controlled by employing increasing length time periods in a tree structure while that of the second set is limited by its lattice structure with periods of equal length. Nevertheless, some method of scenario thinning is necessary to achieve manageable solution times. To mitigate the computational complexity of the widely-used forward selection heuristic for scenario reduction, we customize a new heuristic scenario reduction method named forward selection in wait-and-see clusters (FSWC) for this application. In this method, we first cluster the scenarios based on their wait-and-see solutions and then apply fast forward selection within clusters. Numerical results for a twenty year generation expansion planning case study indicate substantial computational savings to achieve similar solutions as those obtained by forward selection alone.

Comments

NOTICE: This is the author’s version of a work that was accepted for publication in Computers & Operations Research. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Computers & Operations Research, 40 (2013): 9, doi: 10.1016/j.cor.2012.05.005. Posted with permission.

Copyright Owner

Elsevier

Language

en

File Format

application/pdf

Published Version

Share

COinS