Scenario tree generation for the optimization model of a parking lot for electric vehicles

2017 ◽  
Author(s):  
Alberto Borghetti ◽  
Fabio Napolitano ◽  
Saeed Rahmani-Dabbagh ◽  
Fabio Tossani
Keyword(s):  
Electric Vehicles ◽  
Optimization Model ◽  
Scenario Tree ◽  
Tree Generation ◽  
Parking Lot ◽  
Scenario Tree Generation

Simulation and optimization approaches to scenario tree generation

2004 ◽  
Vol 28 (7) ◽  
pp. 1291-1315 ◽  
Author(s):  
Nalan Gülpınar ◽  
Berç Rustem ◽  
Reuben Settergren
Keyword(s):  
Scenario Tree ◽  
Simulation And Optimization ◽  
Tree Generation ◽  
Scenario Tree Generation

On the Scenario-Tree Optimal-Value Error for Stochastic Programming Problems

2020 ◽  
Vol 45 (4) ◽  
pp. 1572-1595
Author(s):  
Julien Keutchayan ◽  
David Munger ◽  
Michel Gendreau
Keyword(s):  
Stochastic Programming ◽  
Large Scale ◽  
Probability Distributions ◽  
Approximation Error ◽  
Scenario Tree ◽  
Branching Structures ◽  
Tree Generation ◽  
Optimal Value ◽  
Scenario Trees ◽  
Scenario Tree Generation

Stochastic programming problems generally lead to large-scale programs if the number of random outcomes is large or if the problem has many stages. A way to tackle them is provided by scenario-tree generation methods, which construct approximate problems from a reduced subset of outcomes. However, it is well known that the number of scenarios required to keep the approximation error within a given tolerance grows rapidly with the number of random parameters and stages. For this reason, to limit the fast growth of complexity, scenario-tree generation methods tailored to problems must be developed. These will use more information about the problem than just the underlying probability distributions; namely, they will also take into account the objective function and the constraints. In this paper, we develop a general framework to build problem-driven scenario trees. We do so by studying how the optimal-value error arises as a sum of lower-level errors made at each node of the tree. We show how these small but numerous node errors depend on the specific features of the problem and how they can be controlled by designing scenario trees with appropriate branching structures and discretization points and weights. We illustrate our approach on two examples.

Clustering algorithms for scenario tree generation: Application to natural hydro inflows

2007 ◽  
Vol 181 (3) ◽  
pp. 1339-1353 ◽  
Author(s):  
Jesús Ma Latorre ◽  
Santiago Cerisola ◽  
Andrés Ramos
Keyword(s):  
Clustering Algorithms ◽  
Scenario Tree ◽  
Tree Generation ◽  
Scenario Tree Generation
Sign in / Sign up

Export Citation Format

Share Document