[:es]Laureano F. Escudero (Rey Juan Carlos University of Madrid), M. Araceli Garín (University of País Vasco), Juan F. Monge (Miguel Hernández University of Elche) and Aitziber Unzueta (University of País Vasco).
Abstract: Two matheuristic decomposition algorithms are introduced. The first one is a Progressive Hedging type so-named Regularized scenario Cluster Progressive Algorithm. The second one is a Frank-Wolfe PH type so-named Regularized scenario Cluster Simplicial Decomposition Progressive Algorithm. An extension of endogenous Type III uncertainty is considered for representing the decision dependent scenario probability and outlook. Its performance is tested in the time-consistent Expected Conditional Stochastic Dominance risk averse environment. As a result of the modeling, the typical risk neutral multistage mixed 0–1 linear stochastic problem under uncertainty is replaced with an enlarged model that is equivalent to the required mixed 0–1 bilinear model. Based on the special features of the problem, it is unrealistic to seek the optimal solution for large-scale instances. Feasible solutions and lower bounds on the solution value of the original model are provided. In total, 48 strategies are considered, each one consists of a combination of a regularization norm, a calibration type for the PH pseudo-gradient computation, and a set of value intervals of the influential variables on a representative endogenous uncertainty-based piecewise function in the scenarios. Computational results are reported for a large-scale extension of a well-known real-life pilot case for preparedness resource allocation planning aiming to natural disaster relief. The matheuristics outperform the plain use of a state-of-the-art solver.
Keywords: Stochastic programming; Exogenous and endogenous uncertainties; Time-consistent stochastic dominance; Mixed 0–1 bilinear optimization; Scenario cluster-based decomposition algorithms[:]
Categories: Scientific articles