Stochastic Reorder Point-Lot Size (r,Q) Inventory Model under Maximum Entropy Principle

This paper takes into account the continuous-review reorder point-lot size (r,Q) inventory model under stochastic demand, with the backorders-lost sales mixture. Moreover, to reflect the practical circumstance in which full information about the demand distribution lacks, we assume that only an esti...

Full description

Bibliographic Details
Main Author: Davide Castellano
Format: Article
Language:English
Published: MDPI AG 2015-12-01
Series:Entropy
Subjects:
Online Access:http://www.mdpi.com/1099-4300/18/1/16
id doaj-cc67fbf52c7146d79a62db291cfd7a5f
record_format Article
spelling doaj-cc67fbf52c7146d79a62db291cfd7a5f2020-11-25T00:19:56ZengMDPI AGEntropy1099-43002015-12-011811610.3390/e18010016e18010016Stochastic Reorder Point-Lot Size (r,Q) Inventory Model under Maximum Entropy PrincipleDavide Castellano0Dipartimento di Ingegneria Civile e Industriale, Università di Pisa, Largo Lucio Lazzarino, Pisa 56122, ItalyThis paper takes into account the continuous-review reorder point-lot size (r,Q) inventory model under stochastic demand, with the backorders-lost sales mixture. Moreover, to reflect the practical circumstance in which full information about the demand distribution lacks, we assume that only an estimate of the mean and of the variance is available. Contrarily to the typical approach in which the lead-time demand is supposed Gaussian or is obtained according to the so-called minimax procedure, we take a different perspective. That is, we adopt the maximum entropy principle to model the lead-time demand distribution. In particular, we consider the density that maximizes the entropy over all distributions with given mean and variance. With the aim of minimizing the expected total cost per time unit, we then propose an exact algorithm and a heuristic procedure. The heuristic method exploits an approximated expression of the total cost function achieved by means of an ad hoc first-order Taylor polynomial. We finally carry out numerical experiments with a twofold objective. On the one hand we examine the efficiency of the approximated solution procedure. On the other hand we investigate the performance of the maximum entropy principle in approximating the true lead-time demand distribution.http://www.mdpi.com/1099-4300/18/1/16maximum entropy principleinventorystochasticoptimizationheuristics(r,Q) policy
collection DOAJ
language English
format Article
sources DOAJ
author Davide Castellano
spellingShingle Davide Castellano
Stochastic Reorder Point-Lot Size (r,Q) Inventory Model under Maximum Entropy Principle
Entropy
maximum entropy principle
inventory
stochastic
optimization
heuristics
(r,Q) policy
author_facet Davide Castellano
author_sort Davide Castellano
title Stochastic Reorder Point-Lot Size (r,Q) Inventory Model under Maximum Entropy Principle
title_short Stochastic Reorder Point-Lot Size (r,Q) Inventory Model under Maximum Entropy Principle
title_full Stochastic Reorder Point-Lot Size (r,Q) Inventory Model under Maximum Entropy Principle
title_fullStr Stochastic Reorder Point-Lot Size (r,Q) Inventory Model under Maximum Entropy Principle
title_full_unstemmed Stochastic Reorder Point-Lot Size (r,Q) Inventory Model under Maximum Entropy Principle
title_sort stochastic reorder point-lot size (r,q) inventory model under maximum entropy principle
publisher MDPI AG
series Entropy
issn 1099-4300
publishDate 2015-12-01
description This paper takes into account the continuous-review reorder point-lot size (r,Q) inventory model under stochastic demand, with the backorders-lost sales mixture. Moreover, to reflect the practical circumstance in which full information about the demand distribution lacks, we assume that only an estimate of the mean and of the variance is available. Contrarily to the typical approach in which the lead-time demand is supposed Gaussian or is obtained according to the so-called minimax procedure, we take a different perspective. That is, we adopt the maximum entropy principle to model the lead-time demand distribution. In particular, we consider the density that maximizes the entropy over all distributions with given mean and variance. With the aim of minimizing the expected total cost per time unit, we then propose an exact algorithm and a heuristic procedure. The heuristic method exploits an approximated expression of the total cost function achieved by means of an ad hoc first-order Taylor polynomial. We finally carry out numerical experiments with a twofold objective. On the one hand we examine the efficiency of the approximated solution procedure. On the other hand we investigate the performance of the maximum entropy principle in approximating the true lead-time demand distribution.
topic maximum entropy principle
inventory
stochastic
optimization
heuristics
(r,Q) policy
url http://www.mdpi.com/1099-4300/18/1/16
work_keys_str_mv AT davidecastellano stochasticreorderpointlotsizerqinventorymodelundermaximumentropyprinciple
_version_ 1725369697976713216