Robust Optimization for Empty Repositioning Problems

@article{Erera2009RobustOF,
  title={Robust Optimization for Empty Repositioning Problems},
  author={A. Erera and J. C. Morales and M. Savelsbergh},
  journal={Oper. Res.},
  year={2009},
  volume={57},
  pages={468-483}
}
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 systemwide scaled deviation from the nominal forecast values. A robust repositioning plan is defined as one in which the typical flow… Expand
134 Citations
Vehicle Repositioning under Uncertainty
  • PDF
Large Scale Evacuation Transportation Systems : Robust Models and Real Time Operations
  • 1
  • PDF
The sample average approximation method for empty container repositioning with uncertainties
  • 63
A Robust Rolling Horizon Framework for Empty Repositioning
  • PDF
Robust planning models for uncertain emergency evacuation problem
  • 1
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 35 REFERENCES
A Robust Optimization Approach to Inventory Theory
  • 518
  • PDF
Real-Time Optimization of Containers and Flatcars for Intermodal Operations
  • 79
  • PDF
Dynamic and Stochastic Models for the Allocation of Empty Containers
  • 377
The Price of Robustness
  • 3,016
  • PDF
A Stochastic Model of the Dynamic Vehicle Allocation Problem
  • W. Powell
  • Engineering, Computer Science
  • Transp. Sci.
  • 1986
  • 127
Robust discrete optimization and network flows
  • 1,512
  • Highly Influential
  • PDF
Two-Stage Robust Network Flow and Design Under Demand Uncertainty
  • 331
  • PDF
An Adaptive Dynamic Programming Algorithm for Dynamic Fleet Management, I: Single Period Travel Times
  • 197
  • PDF
...
1
2
3
4
...