• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>International journal of production economics >Optimal algorithm for the demand routing problem in multicommodity flow distribution networks with diversification constraints and concave costs
【24h】

Optimal algorithm for the demand routing problem in multicommodity flow distribution networks with diversification constraints and concave costs

机译：具有多样化约束和凹成本的多商品流分配网络中需求路由问题的最优算法

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

摘要

Distribution problems are of high relevance within the supply chain system. In real life situations various different commodities may flow in the distribution process. Furthermore, the connection between production and demand centres makes use of complex mesh networks that can include diversification constraints to avoid overcharged paths. In addition, the consideration in certain situations of economies of scale gives rise to non-linear cost functions that make it difficult to deal with an optimal routing scheme. This problem is well represented by the multicommodity flow distribution networks with diversification constraints and concave costs (MFDCC) problem. Here we present an optimal algorithm based on the Kuhn-Tucker optimality conditions of the problem and capable of supplying optimal distribution routes in such complex networks. The algorithm follows an iterative procedure. Each iteration constructive solutions are checked with respect to the Kuhn-Tucker optimality conditions. Solutions consider a set of paths transporting all the demand allowed by its diversification constraint (saturated paths), a set of empty paths, and an indicator path transporting the remaining demand to satisfy the demand equation. The algorithm reduces the total cost in the network in a monotonic sequence to the optimum. The algorithm was tested in a trial library and the optimum was reached for all the instances. The algorithm showed a major dependency with respect to the number of nodes and arcs of the graph, as well as the density of arcs in the graph.
机译：分销问题在供应链系统中具有高度相关性。在现实生活中，各种不同的商品可能会在分配过程中流动。此外，生产中心和需求中心之间的连接利用了复杂的网格网络，该网络可以包含多样化的约束条件，以避免路径收费过高。另外，在某些规模经济情况下的考虑导致了非线性成本函数，这使得难以处理最优路由方案。具有多样化约束和凹成本（MFDCC）问题的多商品流分配网络很好地代表了这个问题。在这里，我们提出了一种基于问题的Kuhn-Tucker最优性条件并且能够在这种复杂网络中提供最优分配路线的最优算法。该算法遵循迭代过程。关于Kuhn-Tucker最优性条件，检查每次迭代的构造解。解决方案考虑一组路径，该路径用于传输其多样化约束所允许的所有需求（饱和路径），一组空路径以及用于传输剩余需求以满足需求方程的指标路径。该算法将网络中的单调序列的总成本降至最佳。该算法在试用库中进行了测试，并且针对所有实例均达到了最佳效果。该算法显示出与图的节点和弧的数量以及图中的弧密度有关的主要依赖性。

著录项

  • 来源
    《International journal of production economics》 |2013年第1期|313-324|共12页
  • 作者

    Pablo Cortes; Jesus Munuzuri; Jose Guadix; Luis Onieva;

  • 作者单位

    Ingenieria de Organization. Escuela Tecnica Superior de Ingenieria. University of Seville c/Camino de los Descubrimientos, s E-41092 Sevilla, Spain;

    Ingenieria de Organization. Escuela Tecnica Superior de Ingenieria. University of Seville c/Camino de los Descubrimientos, s E-41092 Sevilla, Spain;

    Ingenieria de Organization. Escuela Tecnica Superior de Ingenieria. University of Seville c/Camino de los Descubrimientos, s E-41092 Sevilla, Spain;

    Ingenieria de Organization. Escuela Tecnica Superior de Ingenieria. University of Seville c/Camino de los Descubrimientos, s E-41092 Sevilla, Spain;

  • 收录信息
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

    Demand routing; Concave cost; Distribution network; Kuhn Tucker conditions;

    机译：需求路由;凹面成本;分销渠道;库恩塔克条件;

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号