Mathematical programming for single- and multi-location non-stationary inventory control
dc.contributor.advisor
Rossi, Roberto
dc.contributor.advisor
Archibald, Thomas
dc.contributor.author
Ma, Xiyuan
dc.date.accessioned
2023-06-14T12:38:16Z
dc.date.available
2023-06-14T12:38:16Z
dc.date.issued
2023-06-14
dc.description.abstract
Stochastic inventory control investigates strategies for managing and regulating
inventories under various constraints and conditions to deal with uncertainty in
demand. This is a significant field with rich academic literature which has broad
practical applications in controlling and enhancing the performance of inventory
systems. This thesis focuses on non-stationary stochastic inventory control and
the computation of near-optimal inventory policies for single- and two-echelon
inventory systems. We investigate the structure of optimal policies and develop
effective mathematical programming heuristics for computing near-optimal policy
parameters. This thesis makes three contributions to stochastic inventory control.
The first contribution concerns lot-sizing problems controlled under a staticdynamic
uncertainty strategy. From a theoretical standpoint, I demonstrate the
optimality of the non-stationary (s,Q) form for the single-item single-stocking
location non-stationary stochastic lot-sizing problem in a static-dynamic setting;
from a practical standpoint, I present a stochastic dynamic programming approach
to determine optimal (s,Q)-type policy parameters, and I introduce mixed integer
non-linear programming heuristics that leverage piecewise linear approximation of
the cost function. The numerical study demonstrates that the proposed solution
method efficiently computes near-optimal parameters for a broad class of problem
instances.
The second contribution is to develop computationally efficient approaches for
computing near-optimal policy parameters for the single-item single-stocking location
non-stationary stochastic lot-sizing problem under the static-dynamic uncertainty
strategy. I develop an efficient dynamic programming approach that,
starting from a relaxed shortest-path formulation, leverages a state space augmentation
procedure to resolve infeasibility with respect to the original problem.
Unlike other existing approaches, which address a service-level-oriented formulation,
this method is developed under a penalty cost scheme. The approach can
find a near-optimal solution to any instance of relevant size in negligible time by
implementing simple numerical integrations.
This third contribution addresses the optimisation of the lateral transshipment
amongst various locations in the same echelon from an inventory system. Under
a proactive transshipment setting, I introduce a hybrid inventory policy for twolocation
settings to re-distribute the stock throughout the system. The policy
parameters can be determined using a rolling-horizon technique based on a twostage
dynamic programming formulation and a mixed integer linear programme.
The numerical analysis shows that the two-stage formulation can well approximate
the optimal policy obtained via stochastic dynamic programming and that the
rolling-horizon heuristic leads to tight optimality gaps.
en
dc.identifier.uri
https://hdl.handle.net/1842/40664
dc.identifier.uri
http://dx.doi.org/10.7488/era/3425
dc.language.iso
en
en
dc.publisher
The University of Edinburgh
en
dc.relation.hasversion
Ma, X., Rossi, R., and Archibald, T. W. (2019). Stochastic inventory control: A literature review. IFAC-PaperOnline, 52(13):1490-1495
en
dc.relation.hasversion
Ma, X., Rossi, R., and Archibald, T. W. (2022). Approximations for nonstationary stochastic lot-sizing under (s,Q)-type policy. European Journal of Operational Research, 298(2):573-584
en
dc.subject
Mathematical programming
en
dc.subject
non-stationary inventory control
en
dc.subject
multi-location non-stationary inventory control
en
dc.subject
Stochastic inventory control
en
dc.subject
mathematical programming heuristics
en
dc.subject
static-dynamic uncertainty strategy
en
dc.subject
rolling-horizon technique
en
dc.subject
two-stage dynamic programming
en
dc.subject
mixed integer linear programme
en
dc.subject
rolling-horizon heuristic
en
dc.title
Mathematical programming for single- and multi-location non-stationary inventory control
en
dc.type
Thesis or Dissertation
en
dc.type.qualificationlevel
Doctoral
en
dc.type.qualificationname
PhD Doctor of Philosophy
en
Files
Original bundle
1 - 1 of 1
- Name:
- MaX_2023.pdf
- Size:
- 4.67 MB
- Format:
- Adobe Portable Document Format
- Description:
This item appears in the following Collection(s)

