.png){kind=icon}
返回
A continuous-time supply-driven inventory-constrained routing problem
.png){kind=icon}
OA
AI
DOI：10.1016/j.omega.2019.102151.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We address an inventory routing problem (IRP) in which routing and inventory decisions are dictated by supply rather than demand. Moreover, inventory is held in containers that act as both a storage container and a movable transport unit. This problem emanates from logistics related to biogas transportation in which biogas is transported in containers from many suppliers to a single facility. We present a novel and compact formulation for the supply-driven IRP which addresses the routing decisions in continuous-time in which inventory levels within the containers are continuous. Valid inequalities are included and realistic instances are solved to optimality. For all experiments, we found that the total transportation time is minimized when the storage capacity at each supplier is larger than or equal to the vehicle capacity. These routes are characterized by tours in which mostly single suppliers are visited. In 95% of the instances, the average content level of the exchanged containers exceeded 99.6%. (C) 2019 Elsevier Ltd. All rights reserved.
Keyword:
Inventory routing
Continuous time
Mixed-integer programming
Supply-driven
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
O
IF:
7.2
论文数:
3.7K
被引数:
1.4W
机构
引用论文
.png){kind=icon}
The inventory-routing problem of returnable transport items with time windows and simultaneous pickup and delivery in closed-loop supply chains闭环供应链中带时间窗和同时提货和交货的可回收运输物品的库存路径问题OAAI
OAAI分享收藏
查看更多内容