首页> 外文期刊>Journal of Transport Literature >Transportation with volume discount: a case study of a logistic operator in Ghana
【24h】

Transportation with volume discount: a case study of a logistic operator in Ghana

机译:批量折扣运输:以加纳物流运营商为例

获取原文
           

摘要

Network models and integer programming are well known variety of decision making problems. A very useful and widespread area of application is the management and efficient use of scarce resources to increase productivity. These applications include operational problems such as the distributions of goods, production scheduling and machine sequencing, and planning problems such as capital budgeting facility allocation, portfolio selection, and design problems such as telecommunication and transportation network design. The transportation problem, which is one of network integer programming problems is a problem that deals with distributing any commodity from any group of 'sources' to any group of destinations or 'sinks' in the most cost effective way with a given 'supply' and 'demand' constraints. Depending on the nature of the cost function, the transportation problem can be categorized into linear and nonlinear transportation problem. We applied Karush-Kuhn-Tucker (KKT) optimality algorithm to solve our problem of transportation with volume discount for a logistic operator in Ghana.
机译:网络模型和整数编程是众所周知的各种决策问题。一个非常有用且广泛应用的领域是管理和有效利用稀缺资源以提高生产率。这些应用程序包括操作问题,例如货物分配,生产计划和机器排序,以及计划问题,例如资本预算设施分配,资产组合选择,以及设计问题,例如电信和运输网络设计。运输问题是网络整数编程问题之一,是一个问题,该问题涉及以给定的“供应”以最具成本效益的方式将任何商品从任何“来源”组分配到任何目的地或“汇”组。 “需求”约束。根据成本函数的性质,运输问题可以分为线性和非线性运输问题。我们应用Karush-Kuhn-Tucker(KKT)最优算法来解决加纳物流运营商的批量折扣运输问题。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号