...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Discrete Applied Mathematics >An asymptotic 98.5%-effective lower bound on fixed partition policies for the inventory-routing problem
【24h】

An asymptotic 98.5%-effective lower bound on fixed partition policies for the inventory-routing problem

机译：固定路由策略针对库存路由问题的渐近98.5％有效下限

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

We consider the Inventory-Routing Problem where n geographically dispersed retailers must be supplied by a central facility. The retailers experience demand for a product at a deterministic rate and incur holding costs for keeping inventory. Distribution is performed by a fleet of capacitated vehicles. The objective is to minimize the average transportation and inventory costs per unit time over the infinite horizon. In this paper, we focus on the set of fixed partition policies. In a fixed partition policy, the retailers are partitioned into disjoint and collectively exhaustive sets. Each set of retailers is served independently of the others and at its optimal replenishment rate. We derive a deterministic (O(n)) lower bound on the cost of the optimal fixed partition policy. A probabilistic analysis of the performance of this bound demonstrates that it is asymptotically 98.5%-effective. That is, as the number of retailers increases, the lower bound is very close to the cost of the optimal fixed partition policy. (C) 2003 Elsevier B.V. All rights reserved.
机译：我们考虑库存路由问题，其中n个地理位置分散的零售商必须由中央机构提供。零售商以确定的速度体验对产品的需求，并因保持库存而产生持有成本。分发是由一支载有能力的车辆执行的。目的是使无限期内单位时间内的平均运输和库存成本最小化。在本文中，我们集中于固定分区策略集。在固定的划分策略中，零售商被划分为不相交的和集体穷举的集合。每组零售商均以最佳补充率独立于其他零售商提供服务。我们得出最佳固定分区策略成本的确定性（O（n））下限。对该绑定的性能进行的概率分析表明，该绑定的渐近有效率为98.5％。也就是说，随着零售商数量的增加，下限非常接近最佳固定分区策略的成本。 （C）2003 Elsevier B.V.保留所有权利。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号