• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Asian Journal of Industrial Engineering >A Mathematical Model for Vehicle Routing Problem in a Flexible Supply Network
【24h】

A Mathematical Model for Vehicle Routing Problem in a Flexible Supply Network

机译：柔性供应网络中车辆路径问题的数学模型

获取原文
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

The development of robust supply chains requires careful attention to both the location of individual supplier facilities and the opportunities for effective transportation among them. Here, we propose a supply chain which considers multiple depots, multiple vehicles, multiple products and multiple customers, with multi time periods. The supplier receives the order and forwards it to depots of multiple products. The depots investigate the capacity level and accept/refuse supplying the order. Considering the location of the customers, the depots decide upon sending the suitable vehicles. Each vehicle has its specific traveling time and cost. We present a mathematical model for the allocation of orders to depots and vehicles minimizing the total cost. We also provide a Lingo encoding and use it to solve an illustrating example to show the effectiveness of the proposed model.
机译：强大的供应链的发展需要仔细注意单个供应商设施的位置以及在其中进行有效运输的机会。在这里，我们提出了一条考虑多个时间段的多个仓库，多个车辆，多个产品和多个客户的供应链。供应商收到订单并将其转发到多个产品的仓库。仓库调查容量水平并接受/拒绝提供订单。考虑到客户的位置，仓库决定发送合适的车辆。每辆车都有其特定的行驶时间和费用。我们提出了一个数学模型，用于将订单分配给仓库和车辆，从而将总成本降至最低。我们还提供了一种Lingo编码，并使用它来解决一个说明性示例，以显示所提出模型的有效性。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号