首页> 外文期刊>International Journal of Production Research >Cooperative inventory planning in a distribution network
【24h】

Cooperative inventory planning in a distribution network

机译:分销网络中的合作库存计划

获取原文
获取原文并翻译 | 示例
       

摘要

This study addresses the problem of optimal ordering and collaborative inventory management in a distribution network as a two-stage decision problem. In the first stage, when demand is uncertain, the retailers (sellers) order the products from a warehouse. Then, when demand becomes known with certainty, retailers may exchange their products to better match local demands. Sellers should determine their optimal order quantities for the first stage, and quantities and prices of products exchanged in the second stage. This paper proposes to build sellers' coalitions and solve the two-stage decision problem as a cooperative game. Stability of a sellers' coalition can be achieved only if the benefits resulting from collaboration are maximised and distributed according to an allocation policy that is both efficient and rational. The profit maximisation problem is formulated as a stochastic optimisation problem with recourse. Using the scenario method, this problem is approximated by a deterministic linear problem for which the existence of a solution is guaranteed. The proposed pricing policy guarantees the rational allocation of benefits under the scenario approximation. An industrial example supports the modelling approach and is used to evaluate the profitability of the exchange practice in the case of real data.
机译:这项研究解决了分销网络中作为两个阶段决策问题的最优订购和协作库存管理问题。在第一阶段,当需求不确定时,零售商(卖方)从仓库订购产品。然后,当确定确定需求后,零售商可以交换产品以更好地满足当地需求。卖方应确定其在第一阶段的最佳订购数量,并在第二阶段确定所交换产品的数量和价格。本文提出建立卖方联盟,以合作博弈的方式解决两阶段决策问题。只有根据有效和合理的分配政策,最大程度地分配和分配协作产生的收益,才能实现卖方联盟的稳定。利润最大化问题被表述为有追索权的随机优化问题。使用方案方法,可以通过确定性线性问题来近似此问题,对于该问题,解决方案的存在是有保证的。拟议的定价政策可保证在情景近似下合理分配利益。一个工业示例支持建模方法,并用于评估真实数据情况下交易实践的盈利能力。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号