.png){kind=icon}
返回
Inventory routing with continuous moves
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2005.05.036.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The typical inventory routing problem deals with the repeated distribution of a single product from a single facility with an unlimited supply to a set of customers that can all be reached with out-and-back trips. Unfortunately, this is not always the reality. We introduce the inventory routing problem with continuous moves to study two important real-life complexities: limited product availabilities at facilities and customers that cannot be served using out-and-back tours. We need to design delivery tours spanning several days, covering huge geographic areas, and involving product pickups at different facilities. We develop an innovative randomized greedy algorithm, which includes linear programming based postprocessing technology, and we demonstrate its effectiveness in an extensive computational study. (c) 2005 Elsevier Ltd. All rights reserved.
Keyword:
VEHICLE
ALLOCATION
ALGORITHM
GREEDY
PERIOD
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
暂无机构信息
引用论文
Reduced white matter microstructural integrity correlates with cognitive deficits in minimal hepatic encephalopathy轻度肝性脑病中白质微结构完整性降低与认知缺陷相关.png)
Gut
GutIF0
PREAI
分享收藏
分享收藏
查看更多内容