首页> 外文期刊>Computers & Industrial Engineering >A genetic algorithm-Taguchi based approach to inventory routing problem of a single perishable product with transshipment
【24h】

A genetic algorithm-Taguchi based approach to inventory routing problem of a single perishable product with transshipment

机译:基于遗传算法-Taguchi的易变质产品易转运库存路由问题

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

摘要

In this paper we present a model of inventory routing problem with transshipment in the presence of a single perishable product. In this problem, vehicle routing and inventory decisions are made simultaneously over the planning horizon to meet customer's demand under maximum level policy. Products are deteriorated at the exponential rate during the time they are stored in the depot or customer's warehouse. Due to the NP-hard nature of the model, we propose a genetic algorithm based approach to solve the problem. Moreover, the proposed algorithm parameters are determined using Taguchi design approach to achieve the best solution. Besides, a numerical example is used to illustrate the validity of the model. To the best of our knowledge, this is the first study that incorporates perishability of the products into inventory routing problem with transshipment, in which the products stocked in the depot or warehouses spoil due to their nature and also environmental issues.
机译:在本文中,我们提出了在存在单个易腐产品的情况下具有转运的库存路由问题模型。在此问题中,车辆规划和库存决策在计划范围内同时进行,以满足最高级别策略下的客户需求。产品在存放在仓库或客户的仓库中的时间里呈指数级下降。由于该模型具有NP难性,我们提出了一种基于遗传算法的方法来解决该问题。此外,使用田口设计方法确定所提出的算法参数以实现最佳解决方案。此外,通过数值例子说明了模型的有效性。据我们所知,这是第一项将产品的易腐性纳入转运过程中的库存路由问题的研究,其中由于性质和环境问题,仓库或仓库中的产品变质了。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号