Robust Optimization for Empty Repositioning Problems

Abstract

We develop a robust optimization framework for dynamic empty repositioning problems modeled using time-space networks. In such problems, uncertainty arises primarily from forecasts of future supplies and demands for assets at different time epochs. The proposed approach models such uncertainty using intervals about nominal forecast values and a limit on the system-wide scaled deviation from the nominal forecast values. A robust repositioning plan is defined as one in which the typical flow balance constraints and flow bounds are satisfied for the nominal forecast values, and the plan is recoverable under a limited set of recovery actions. A plan is recoverable when feasibility can be reestablished for any outcome in a defined uncertainty set. We develop necessary and sufficient conditions for flows to be robust under this definition for three types of allowable recovery actions. When recovery actions allow only flow changes on inventory arcs, we show that the resulting problem is polynomially solvable. When recovery actions allow limited reactive repositioning flows, we develop feasibility conditions that are independent of the size of the uncertainty set. A computational study establishes the practical viability of the proposed framework.

A two-stage robustness approach to evacuation planning with buses

“…One such approach is recoverable robustness (see [LLMS09,Sti08,EMS09]), which is a two-stage concept: We consider a (set of) recovery algorithm(s) that take a solution and modify it to become feasible in a given scenario. We aim at finding a solution for which a) these changes are moderate, and b) the resulting worst-case performance is good.…”

Robust Optimization: Concise Review of Current Status and Issues

“…Ben-Tal et al (2003) show that the robust counterpart can be cast as a conic optimization problem if the uncertainty set in itself is conic. Erera et al (2009) propose a closely-related scheme for a mixedinteger programming problem with right-hand side uncertainty.…”

Line planning in public transportation: models and methods

“…It turns out that hedging against all uncertainties is often much too conservative such that more applicable robustness concepts are needed for many real-world applications. In particular, for optimization of public transportation, new concepts to analyze robustness of a plan and to develop robust plans have been proposed; see the concepts of recovery robustness (Liebchen et al 2009;Erera et al 2009;Cicerone et al 2009) and of light robustness (Fischetti and Monaci 2009;Schöbel 2010).…”