...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Applied mathematics and computation >A combinatorial approximation algorithm for supply chain network flow-problem
【24h】

A combinatorial approximation algorithm for supply chain network flow-problem

机译：供应链网络流动问题的组合近似算法

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

摘要

In this paper we develop a new combinatorial approximation algorithm for a supply chain network containing the manufacturers, retailers and consumers. Given any positive epsilon, an epsilon-optimal supply chain network flow problem is to find a product flow whose congestion value is no more than (1 + epsilon.) times the minimum congestion by shipping products from manufacturers to retailers and from retailers to consumers. We propose a new combinatorial approximation algorithm with the application of simplicial decomposition to find the optimal proportions for current product flow and the minimum-cost flows while a tighter computation bound is achieved in decreasing the values of congestion and the potential function. Numerical computations for variants of the combinatorial approximation algorithm are conducted on three-tiered supply chain networks where significant savings in computations are gained from the proposed algorithm. (c) 2006 Elsevier Inc. All rights reserved.
机译：在本文中，我们为包含制造商，零售商和消费者的供应链网络开发了一种新的组合近似算法。给定任何正ε值，ε最优供应链网络流量问题是找到一种拥塞值不超过（1 +ε）乘以从制造商到零售商以及从零售商到消费者的最小拥塞的产品流。我们提出了一种新的组合逼近算法，该算法应用简单分解来找到当前产品流和最小成本流的最佳比例，同时在减小拥塞和潜在函数的值方面实现了更严格的计算范围。在三层供应链网络上进行了组合近似算法变体的数值计算，从该算法中可以节省大量计算成本。 （c）2006 Elsevier Inc.保留所有权利。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号