z-logo
open-access-imgOpen Access
Capacity Expansion Problem by Monte Carlo Sampling Method
Author(s) -
Takayuki Shiina
Publication year - 2009
Publication title -
journal of advanced computational intelligence and intelligent informatics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.172
H-Index - 20
eISSN - 1343-0130
pISSN - 1883-8014
DOI - 10.20965/jaciii.2009.p0697
Subject(s) - monte carlo method , computer science , variance reduction , mathematical optimization , importance sampling , function (biology) , monte carlo integration , quasi monte carlo method , sampling (signal processing) , rejection sampling , separable space , mathematics , algorithm , hybrid monte carlo , markov chain monte carlo , statistics , mathematical analysis , evolutionary biology , biology , filter (signal processing) , computer vision
We consider the stochastic programming problem with recourse in which the expectation of the recourse function requires a large number of function evaluations, and its application to the capacity expansion problem. We propose an algorithm which combines an L-shaped method and a Monte Carlo method. The importance sampling technique is applied to obtain variance reduction. In the previous approach, the recourse function is approximated as an additive form in which the function is separable in the components of the stochastic vector. In our approach, the approximate additive form of the recourse function is perturbed to define the new density function. Numerical results for the capacity expansion problem are presented.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom