Metraipolis › archive › dc_08c042ca7ba1

Distributionally Robust Dynamic Inventory Control: Automatic Recovery under Martingale Demand — arXiv:2611.04961

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.04961
License (as archived)
CC0-1.0
Archived
2026-11-04T21:56:04.843Z
SHA-256 of the archived text
4a26ac0955b0de209a8f89d6aa0923206964530b67ee863d0eb5782c9deee8d8
Stable URL of this page
https://metraipolis.com/documento/dc_08c042ca7ba1

How to cite

Distributionally Robust Dynamic Inventory Control: Automatic Recovery under Martingale Demand — arXiv:2611.04961 — arXiv (en), https://arxiv.org/abs/2611.04961 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_08c042ca7ba1 (Metraipolis archive dc_08c042ca7ba1, sha256 4a26ac0955b0de209a8f89d6aa0923206964530b67ee863d0eb5782c9deee8d8)
BibTeX
@misc{dc08c042ca7ba1,
  title = {Distributionally Robust Dynamic Inventory Control: Automatic Recovery under Martingale Demand — arXiv:2611.04961},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.04961},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_08c042ca7ba1; sha256 4a26ac0955b0de209a8f89d6aa0923206964530b67ee863d0eb5782c9deee8d8},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.04961. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Problem definition: We study dynamic inventory control for battery-swapping stations that combine central replenishment with automatic local recovery. Central replenishment improves immediate battery availability but reduces the depleted-battery pool available for subsequent recovery, creating an intertemporal trade-off. Managing this trade-off is particularly challenging when historical demand data are limited and future demand is uncertain and temporally dependent. Methodology/results: We develop a time-consistent distributionally robust dynamic program under martingale demand ambiguity, using the latest observed demand as the next conditional mean without requiring a fully specified demand distribution. We establish an optimal order-up-to policy for every finite horizon and identify two critical recovery rates governing replenishment decisions. Under a regular penalty condition, we derive explicit finite-horizon policies and worst-case demand distributions, showing that sufficiently strong automatic recovery makes central replenishment unnecessary in nonterminal periods. Extensions to submartingale and supermartingale demand reveal contrasting behaviors, including eventual full-capacity replenishment under upward ambiguity and recovery-induced positive replenishment under downward ambiguity. Managerial implications: Numerical experiments demonstrate that the robust policy is particularly competitive when demand is highly dispersed and historical information is limited, whereas its advantage diminishes when demand becomes more predictable or the conditional-mean assumption becomes less reliable. Our findings also reveal that greater reliance on local recovery may compromise service availability, highlighting the importance of jointly considering demand information, recovery capability, and service requirements when making replenishment decisions.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.OC, nuovi lavori del giorno).
Categorie arXiv: Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2611.04961 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-04T21:40:34.543Z dalla pagina https://arxiv.org/list/math.OC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).