Salvato in:
Dettagli Bibliografici
Autori principali: Hihat, Massil, Fermanian, Adeline
Natura: Preprint
Pubblicazione: 2024
Soggetti:
Accesso online:https://arxiv.org/abs/2411.19269
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866916498477416448
author Hihat, Massil
Fermanian, Adeline
author_facet Hihat, Massil
Fermanian, Adeline
contents We tackle online inventory problems where at each time period the manager makes a replenishment decision based on partial historical information in order to meet demands and minimize costs. To solve such problems, we build upon recent works in online learning and control, use insights from inventory theory and propose a new algorithm called GAPSI. This algorithm follows a new feature-enhanced base-stock policy and deals with the troublesome question of non-differentiability which occurs in inventory problems. Our method is illustrated in the context of a complex and novel inventory system involving multiple products, lost sales, perishability, warehouse-capacity constraints and lead times. Extensive numerical simulations are conducted to demonstrate the good performances of our algorithm on real-world data.
format Preprint
id arxiv_https___arxiv_org_abs_2411_19269
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Online Policy Selection for Inventory Problems
Hihat, Massil
Fermanian, Adeline
Optimization and Control
We tackle online inventory problems where at each time period the manager makes a replenishment decision based on partial historical information in order to meet demands and minimize costs. To solve such problems, we build upon recent works in online learning and control, use insights from inventory theory and propose a new algorithm called GAPSI. This algorithm follows a new feature-enhanced base-stock policy and deals with the troublesome question of non-differentiability which occurs in inventory problems. Our method is illustrated in the context of a complex and novel inventory system involving multiple products, lost sales, perishability, warehouse-capacity constraints and lead times. Extensive numerical simulations are conducted to demonstrate the good performances of our algorithm on real-world data.
title Online Policy Selection for Inventory Problems
topic Optimization and Control
url https://arxiv.org/abs/2411.19269