Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
478455 | European Journal of Operational Research | 2012 | 8 Pages |
We propose a family of retrospective optimization (RO) algorithms for optimizing stochastic systems with both integer and continuous decision variables. The algorithms are continuous search procedures embedded in a RO framework using dynamic simplex interpolation (RODSI). By decreasing dimensions (corresponding to the continuous variables) of simplex, the retrospective solutions become closer to an optimizer of the objective function. We present convergence results of RODSI algorithms for stochastic “convex” systems. Numerical results show that a simple implementation of RODSI algorithms significantly outperforms some random search algorithms such as Genetic Algorithm (GA) and Particle Swarm Optimization (PSO).
► Formulation of mixed integer stochastic optimization (MISO) problems. ► Retrospective optimization using dynamic simplex interpolation (RODSI). ► Global convergence of RODSI algorithms for stochastic “convex” systems. ► Numerical analysis of RODSI performance.