The Stochastic Multistage Fixed Charge Transportation Problem: Worst-Case Analysis of the Rolling Horizon Approach
Luca Bertazzi (luca.bertazziunibs.it)
Abstract: We introduce the Stochastic multistage ﬁxed charge transportation problem in which a producer has to ship an uncertain load to a customer within a deadline. At each time period, a ﬁxed transportation price can be paid to buy a transportation capacity. If the transportation capacity is used, the supplier also pays an uncertain unit transportation price. A unit inventory cost is charged for the quantity that remains to be sent. The aim is to determine the transportation capacities to buy and the quantity to send at each time period in order to minimize the expected total cost. We prove that this problem is NP-hard, we propose a multistage stochastic optimization model formulation, and we determine optimal policies for particular cases, having deterministic unit transportation prices or load. Rolling horizon is a classical heuristic approach for solving multistage stochastic programming models. Our aim is to provide the worst–case analysis of this approach, applied to this NP-hard problem and to polynomially solvable particular cases. Numerical results are also provided.
Keywords: Fixed charge transportation problem, Multistage stochastic programming, Rolling horizon, Worst-case analysis.
Category 1: Stochastic Programming
Category 2: Applications -- OR and Management Sciences (Supply Chain Management )
Citation: Article title: A Stochastic Multi-stage Fixed Charge Transportation Problem: Worst-Case Analysis of the Rolling Horizon Approach Journal title: European Journal of Operational Research Authors: Luca Bertazzi and Francesca Maggioni Accepted manuscript available online: 8-DEC-2017 DOI information: 10.1016/j.ejor.2017.12.004 http://www.sciencedirect.com/science/article/pii/S037722171731086X
Entry Submitted: 08/29/2016
Modify/Update this entry
|Visitors||Authors||More about us||Links|
Search, Browse the Repository
Give us feedback
|Optimization Journals, Sites, Societies|