4.5 Article

Scenario construction and reduction applied to stochastic power generation expansion planning

Journal

COMPUTERS & OPERATIONS RESEARCH
Volume 40, Issue 1, Pages 9-23

Publisher

PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2012.05.005

Keywords

Stochastic programming; Scenario generation; Scenario reduction; Power generation expansion planning

Funding

  1. US Department of Energy's Office of Electricity Delivery and Energy Reliability

Ask authors/readers for more resources

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. (C) 2012 Elsevier Ltd. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.5
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

Article Energy & Fuels

Statistical metrics for assessing the quality of wind power scenarios for stochastic unit commitment

Didem Sari, Youngrok Lee, Sarah Ryan, David Woodruff

WIND ENERGY (2016)

Article Energy & Fuels

Day-ahead hourly electricity load modeling by functional regression

Yonghan Feng, Sarah M. Ryan

APPLIED ENERGY (2016)

Article Management

Hybrid robust and stochastic optimization for closed-loop supply chain network design using accelerated Benders decomposition

Esmaeil Keyvanshokooh, Sarah M. Ryan, Elnaz Kabir

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2016)

Article Operations Research & Management Science

Conditions under which adjustability lowers the cost of a robust linear program

Ali Haddad-Sisakht, Sarah M. Ryan

ANNALS OF OPERATIONS RESEARCH (2018)

Article Engineering, Electrical & Electronic

Optimizing Service Restoration in Distribution Systems With Uncertain Repair Time and Demand

Anmar Arif, Shanshan Ma, Zhaoyu Wang, Jianhui Wang, Sarah M. Ryan, Chen Chen

IEEE TRANSACTIONS ON POWER SYSTEMS (2018)

Article Engineering, Industrial

Closed-loop supply chain network design with multiple transportation modes under stochastic demand and uncertain carbon tax

Ali Haddadsisakht, Sarah M. Ryan

INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS (2018)

Article Engineering, Electrical & Electronic

Stochastic vs. deterministic scheduling of a combined natural gas and power system with uncertain wind energy

Dan Hu, Sarah M. Ryan

INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS (2019)

Article Computer Science, Interdisciplinary Applications

Land use optimization for nutrient reduction under stochastic precipitation rates

Gorkem Emirhuseyinoglu, Sarah M. Ryan

ENVIRONMENTAL MODELLING & SOFTWARE (2020)

Article Business, Finance

Reliability assessment of scenarios generated for stock index returns incorporating momentum

Xiaoshi Guo, Sarah M. Ryan

Summary: Stochastic programming models for portfolio optimization rely on scenario paths for returns derived from stochastic process models. This paper investigates a variant of the geometric Brownian motion process for stock index returns that incorporates index momentum. Based on this model, three different processes for generating scenarios on a rolling basis are devised, which differ according to how frequently the momentum parameter is updated and whether it is estimated according to a simple moving average or an exponentially weighted moving average of returns.

INTERNATIONAL JOURNAL OF FINANCE & ECONOMICS (2021)

Article Energy & Fuels

Quantifying the effect of uncertainty in the gas spot price on power system dispatch costs with estimated correlated uncertainties

Dan Hu, Sarah M. Ryan

ENERGY SYSTEMS-OPTIMIZATION MODELING SIMULATION AND ECONOMIC ASPECTS (2020)

Article Social Sciences, Mathematical Methods

Observational data-based quality assessment of scenario generation for stochastic programs

Didem Sari Ay, Sarah M. Ryan

COMPUTATIONAL MANAGEMENT SCIENCE (2019)

Article Energy & Fuels

Robust optimization vs. stochastic programming incorporating risk measures for unit commitment with uncertain variable renewable generation

Narges Kazemzadeh, Sarah M. Ryan, Mahdi Hamzeei

ENERGY SYSTEMS-OPTIMIZATION MODELING SIMULATION AND ECONOMIC ASPECTS (2019)

Proceedings Paper Energy & Fuels

Asymptotic Risk of Unit Commitment Schedule Due to Generating Unit Outages

Sarah M. Ryan, Jinchi Li, Narges Kazemzadeh

2018 IEEE INTERNATIONAL CONFERENCE ON PROBABILISTIC METHODS APPLIED TO POWER SYSTEMS (PMAPS) (2018)

Article Energy & Fuels

Statistical reliability of wind power scenarios and stochastic unit commitment cost

Didem Sari, Sarah M. Ryan

ENERGY SYSTEMS-OPTIMIZATION MODELING SIMULATION AND ECONOMIC ASPECTS (2018)

Proceedings Paper Energy & Fuels

Quantifying the Effect of Natural Gas Price Uncertainty on Economic Dispatch Cost Uncertainty

Dan Hu, Sarah M. Ryan

2017 IEEE POWER & ENERGY SOCIETY GENERAL MEETING (2017)

Article Computer Science, Interdisciplinary Applications

A unified exact approach for a broad class of vehicle routing problems with simultaneous pickup and delivery

Rafael Praxedes, Teobaldo Bulhoes, Anand Subramanian, Eduardo Uchoa

Summary: The Vehicle Routing Problem with Simultaneous Pickup and Delivery is a classical optimization problem that aims to determine the least-cost routes while meeting pickup and delivery demands and vehicle capacity constraints. In this study, a unified algorithm is proposed to solve multiple variants of the problem, and extensive computational experiments are conducted to evaluate the algorithm's performance.

COMPUTERS & OPERATIONS RESEARCH (2024)

Article Computer Science, Interdisciplinary Applications

An asynchronous parallel benders decomposition method for stochastic network design problems

Ragheb Rahmaniani, Teodor Gabriel Crainic, Michel Gendreau, Walter Rei

Summary: Benders decomposition (BD) is a popular solution algorithm for stochastic integer programs. However, existing parallelization methods often suffer from inefficiencies. This paper proposes an asynchronous parallel BD method and demonstrates its effectiveness through numerical studies and performance enhancement strategies.

COMPUTERS & OPERATIONS RESEARCH (2024)

Article Computer Science, Interdisciplinary Applications

Exact algorithms for a parallel machine scheduling problem with workforce and contiguity constraints

Giulia Caselli, Maxence Delorme, Manuel Iori, Carlo Alberto Magni

Summary: This study addresses a real-world scheduling problem and proposes four exact methods to solve it. The methods are evaluated through computational experiments on different types of instances and show competitive advantages on specific subsets. The study also demonstrates the generalizability of the algorithms to related scheduling problems with contiguity constraints.

COMPUTERS & OPERATIONS RESEARCH (2024)

Article Computer Science, Interdisciplinary Applications

An iteratively doubling binary search for the two-dimensional irregular multiple-size bin packing problem raised in the steel industry

Shaowen Yao, Chao Tang, Hao Zhang, Songhuan Wu, Lijun Wei, Qiang Liu

Summary: This paper examines the problem of two-dimensional irregular multiple-size bin packing and proposes a solution that utilizes an iteratively doubling binary search algorithm to find the optimal bin combination, and further optimizes the result through an overlap minimization approach.

COMPUTERS & OPERATIONS RESEARCH (2024)

Article Computer Science, Interdisciplinary Applications

Drop-and-pull container drayage with flexible assignment of work break for vehicle drivers

Decheng Wang, Ruiyou Zhang, Bin Qiu, Wenpeng Chen, Xiaolan Xie

Summary: Consideration of driver-related constraints, such as mandatory work break, in vehicle scheduling and routing is crucial for safety driving and protecting the interests of drivers. This paper addresses the drop-and-pull container drayage problem with flexible assignment of work break, proposing a mixed-integer programming model and an algorithm for solving realistic-sized instances. Experimental results show the effectiveness of the proposed algorithm in handling vehicle scheduling and routing with work break assignment.

COMPUTERS & OPERATIONS RESEARCH (2024)

Article Computer Science, Interdisciplinary Applications

Manipulating hidden-Markov-model inferences by corrupting batch data

William N. Caballero, Jose Manuel Camacho, Tahir Ekin, Roi Naveiro

Summary: This research provides a novel probabilistic perspective on the manipulation of hidden Markov model inferences through corrupted data, highlighting the weaknesses of such models under adversarial activity and emphasizing the need for robustification techniques to ensure their security.

COMPUTERS & OPERATIONS RESEARCH (2024)

Article Computer Science, Interdisciplinary Applications

Evolutionary multi-objective design of autoencoders for compact representation of histopathology whole slide images

Davood Zaman Farsa, Shahryar Rahnamayan, Azam Asilian Bidgoli, H. R. Tizhoosh

Summary: This paper proposes a multi-objective evolutionary framework for compressing feature vectors using deep autoencoders. The framework achieves high classification accuracy and efficient image representation through a bi-level optimization scheme. Experimental results demonstrate the effectiveness and efficiency of the proposed framework in image processing tasks.

COMPUTERS & OPERATIONS RESEARCH (2024)

Article Computer Science, Interdisciplinary Applications

Verifying new instances of the multidemand multidimensional knapsack problem with instance space analysis

Matthew E. Scherer, Raymond R. Hill, Brian J. Lunday, Bruce A. Cox, Edward D. White

Summary: This paper discusses instance generation methods for the multidemand multidimensional knapsack problem and introduces a primal problem instance generator (PPIG) to address feasibility issues in current instance generation methods.

COMPUTERS & OPERATIONS RESEARCH (2024)

Article Computer Science, Interdisciplinary Applications

Efficient iterative optimization to real-time train regulation in urban rail transit networks combined with Benders decomposition method

Yin Yuan, Shukai Li, Lixing Yang, Ziyou Gao

Summary: This paper investigates the design of real-time train regulation strategies for urban rail networks to reduce train deviations and passenger waiting times. A mixed-integer nonlinear programming (MINLP) model is used and an efficient iterative optimization (IO) approach is proposed to address the complexity. The generalized Benders decomposition (GBD) technique is also incorporated. Numerical experiments show the effectiveness and computational efficiency of the proposed method.

COMPUTERS & OPERATIONS RESEARCH (2024)

Article Computer Science, Interdisciplinary Applications

Unmanned surface vehicles (USVs) scheduling method by a bi-level mission planning and path control

Xinghai Guo, Netirith Narthsirinth, Weidan Zhang, Yuzhen Hu

Summary: This study proposes a bi-level scheduling method that utilizes unmanned surface vehicles for container transportation. By formulating mission decision and path control models, efficient container transshipment and path planning are achieved. Experimental results demonstrate the effectiveness of the proposed approach in guiding unmanned surface vehicles to complete container transshipment tasks.

COMPUTERS & OPERATIONS RESEARCH (2024)

Review Computer Science, Interdisciplinary Applications

Metaheuristics for bilevel optimization: A comprehensive review

Jose-Fernando Camacho-Vallejo, Carlos Corpus, Juan G. Villegas

Summary: This study aims to review the published papers on implementing metaheuristics for solving bilevel problems and performs a bibliometric analysis to track the evolution of this topic. The study provides a detailed description of the components of the proposed metaheuristics and analyzes the common combinations of these components. Additionally, the study provides a detailed classification of how crucial bilevel aspects of the problem are handled in the metaheuristics, along with a discussion of interesting findings.

COMPUTERS & OPERATIONS RESEARCH (2024)

Article Computer Science, Interdisciplinary Applications

Electric vehicle-based express service network design with recharging management: A branch-and-price approach

Xudong Diao, Meng Qiu, Gangyan Xu

Summary: In this study, an optimization model for the design of an electric vehicle-based express service network is proposed, considering limited recharging resources and power management. The proposed method is validated through computational experiments on realistic instances.

COMPUTERS & OPERATIONS RESEARCH (2024)

Article Computer Science, Interdisciplinary Applications

Bilevel optimization for the deployment of refuelling stations for electric vehicles on road networks

Ramon Piedra-de-la-Cuadra, Francisco A. Ortega

Summary: This study proposes a procedure to select candidate sites optimally for ensuring energy autonomy and reinforced service coverage for electric vehicles, while considering demand and budget restrictions.

COMPUTERS & OPERATIONS RESEARCH (2024)

Article Computer Science, Interdisciplinary Applications

Cutting Plane Approaches for the Robust Kidney Exchange Problem

Danny Blom, Christopher Hojny, Bart Smeulders

Summary: This paper focuses on a robust variant of the kidney exchange program problem with recourse, and proposes a cutting plane method for solving the attacker-defender subproblem. The results show a significant improvement in running time compared to the state-of-the-art, and the method can solve previously unsolved instances. Additionally, a new practical policy for recourse is proposed and its tractability for small to mid-size kidney exchange programs is demonstrated.

COMPUTERS & OPERATIONS RESEARCH (2024)

Article Computer Science, Interdisciplinary Applications

Generating linear programming instances with controllable rank and condition number

Anqi Li, Congying Han, Tiande Guo, Bonan Li

Summary: This study proposes a general framework for designing linear programming instances based on the preset optimal solution, and validates the effectiveness of the framework through experiments.

COMPUTERS & OPERATIONS RESEARCH (2024)