The Inventory Routing Problem Under Uncertainty

Oper. Res. Pub Date : 2022-11-17 DOI:10.1287/opre.2022.2407
Zheng Cui, Daniel Zhuoyu Long, Jin Qi, Lianmin Zhang
{"title":"The Inventory Routing Problem Under Uncertainty","authors":"Zheng Cui, Daniel Zhuoyu Long, Jin Qi, Lianmin Zhang","doi":"10.1287/opre.2022.2407","DOIUrl":null,"url":null,"abstract":"In the inventory routing problem, the supplier acts as a central decision maker who determines the replenishment quantities and also, the delivery times and routes to all retailers. In “Inventory Routing Problem Under Uncertainty”, Cui et al. develop a novel framework for the uncertain inventory routing problem and allow ambiguity in the probability distribution of each retailer's uncertain demand. Adopting a service-level viewpoint, they minimize the risk of uncertain inventory levels violating a prespecified acceptable range. They quantify that risk using a new decision criterion, the service violation index, that accounts for how often and how severely the inventory requirement is violated. The solutions proposed here are adaptive in the sense that they vary with the realization of uncertain demand. They provide algorithms to solve the problem exactly and then, demonstrate the superiority of their solutions by comparing them with several benchmarks.","PeriodicalId":19546,"journal":{"name":"Oper. Res.","volume":"1 1","pages":"378-395"},"PeriodicalIF":0.0000,"publicationDate":"2022-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Oper. Res.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1287/opre.2022.2407","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

In the inventory routing problem, the supplier acts as a central decision maker who determines the replenishment quantities and also, the delivery times and routes to all retailers. In “Inventory Routing Problem Under Uncertainty”, Cui et al. develop a novel framework for the uncertain inventory routing problem and allow ambiguity in the probability distribution of each retailer's uncertain demand. Adopting a service-level viewpoint, they minimize the risk of uncertain inventory levels violating a prespecified acceptable range. They quantify that risk using a new decision criterion, the service violation index, that accounts for how often and how severely the inventory requirement is violated. The solutions proposed here are adaptive in the sense that they vary with the realization of uncertain demand. They provide algorithms to solve the problem exactly and then, demonstrate the superiority of their solutions by comparing them with several benchmarks.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
不确定条件下的库存路径问题
在库存路径问题中,供应商作为中心决策者,决定补货数量,以及交货时间和到所有零售商的路线。在“不确定性下的库存路径问题”中,Cui等人开发了不确定库存路径问题的新框架,并允许每个零售商不确定需求的概率分布存在歧义。采用服务水平的观点,它们将不确定库存水平违反预先指定的可接受范围的风险降至最低。他们使用一个新的决策标准来量化风险,即服务违反指数,该指数说明了违反库存需求的频率和严重程度。这里提出的解决方案是自适应的,因为它们随着不确定需求的实现而变化。他们提供了精确解决问题的算法,然后通过将其与几个基准进行比较来证明其解决方案的优越性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A web-based multi-criteria decision support system for benchmarking marketing decisions alternatives Integrated optimization of wagon flow routing and train formation plan Two-machine decentralized flow shop scheduling problem with inter-factory batch delivery system A simplified swarm optimization algorithm to minimize makespan on non-identical parallel machines with unequal job release times under non-renewable resource constraints Meta-frontier: literature review and toolkit
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1