...
首页> 外文期刊>Entropy >Stochastic Reorder Point-Lot Size (r,Q) Inventory Model under Maximum Entropy Principle
【24h】

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

机译:最大熵原理下的随机再订货点批量(r,Q)库存模型

获取原文

摘要

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.
机译:本文考虑了随机需求下具有延期损失的销售组合的连续审查再订货点-批量(r,Q)库存模型。此外,为了反映缺乏有关需求分布的完整信息的实际情况,我们假设只有均值和方差的估计可用。与通常将提前期需求假定为高斯或根据所谓的minimax程序获得的典型方法相反,我们采取了不同的观点。也就是说,我们采用最大熵原理来建模提前期需求分布。特别地,我们考虑在给定的均值和方差下使所有分布上的熵最大化的密度。为了最小化每个时间单位的预期总成本,我们然后提出了一种精确的算法和一种启发式程序。启发式方法利用特设的一阶泰勒多项式获得的总成本函数的近似表达式。我们最终以双重目标进行了数值实验。一方面,我们检查了近似解过程的效率。另一方面,我们研究了最大熵原理在逼近实际提前期需求分布方面的性能。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号