Inventory Control Using a Lévy Process for Evaluating Total Costs under Intermittent Demand
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866916814352547840 |
|---|---|
| author | Koide, Ryoya Ono, Yurika Ishigaki, Aya |
| author_facet | Koide, Ryoya Ono, Yurika Ishigaki, Aya |
| contents | Products with intermittent demand are characterized by a high risk of sales losses and obsolescence due to the sporadic occurrence of demand events. Generally, both point forecasting and probabilistic forecasting approaches are applied to intermittent demand. In particular, probabilistic forecasting, which models demand as a stochastic process, is capable of capturing uncertainty. An example of such modeling is the use of Lévy processes, which possess independent increments and accommodate discontinuous changes (jumps). However, to the best of our knowledge, in inventory control using Lévy processes, no studies have investigated how the order quantity and reorder point affect the total cost. One major difficulty has been the mathematical formulation of inventory replenishment triggered at reorder points. To address this challenge, the present study formulates a reorder-point policy by modeling cumulative demand as a drifted Poisson process and introducing a stopping time to represent the timing at which the reorder point is reached. Furthermore, the validity of the proposed method is verified by comparing the total cost with that obtained from a case where an ARIMA model is combined with a reorder-point policy. As a main result, while the total cost under ARIMA-based forecasting increases linearly over time, the Lévy process-based formulation provides an analytical expression for the total cost, revealing that random demand fluctuations cause the expected total cost to grow at a rate faster than linear. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_22524 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Inventory Control Using a Lévy Process for Evaluating Total Costs under Intermittent Demand Koide, Ryoya Ono, Yurika Ishigaki, Aya Optimization and Control Data Structures and Algorithms Probability 60G51, 90B05, 93E20 I.2.6; G.3 Products with intermittent demand are characterized by a high risk of sales losses and obsolescence due to the sporadic occurrence of demand events. Generally, both point forecasting and probabilistic forecasting approaches are applied to intermittent demand. In particular, probabilistic forecasting, which models demand as a stochastic process, is capable of capturing uncertainty. An example of such modeling is the use of Lévy processes, which possess independent increments and accommodate discontinuous changes (jumps). However, to the best of our knowledge, in inventory control using Lévy processes, no studies have investigated how the order quantity and reorder point affect the total cost. One major difficulty has been the mathematical formulation of inventory replenishment triggered at reorder points. To address this challenge, the present study formulates a reorder-point policy by modeling cumulative demand as a drifted Poisson process and introducing a stopping time to represent the timing at which the reorder point is reached. Furthermore, the validity of the proposed method is verified by comparing the total cost with that obtained from a case where an ARIMA model is combined with a reorder-point policy. As a main result, while the total cost under ARIMA-based forecasting increases linearly over time, the Lévy process-based formulation provides an analytical expression for the total cost, revealing that random demand fluctuations cause the expected total cost to grow at a rate faster than linear. |
| title | Inventory Control Using a Lévy Process for Evaluating Total Costs under Intermittent Demand |
| topic | Optimization and Control Data Structures and Algorithms Probability 60G51, 90B05, 93E20 I.2.6; G.3 |
| url | https://arxiv.org/abs/2506.22524 |