考虑生命周期的库存调度问题的多阶段随机规划方法

Alireza Paeizi, Ahmad Makui, M. Pishvaee
{"title":"考虑生命周期的库存调度问题的多阶段随机规划方法","authors":"Alireza Paeizi, Ahmad Makui, M. Pishvaee","doi":"10.1051/ro/2023122","DOIUrl":null,"url":null,"abstract":"Food waste and proper methods to deal with it are one of the main challenges of supply chain network management. The majority of studies on how to use mathematical models in the supply chain have focused on goods that are at their peak of freshness as soon as they are produced and deteriorate over time. While some products experience an increase in value at the start of their life cycle, this value eventually reaches its maximum level, and after this point, these products experience a decline in value before being eliminated from the consumption cycle. The objective of this study is to develop a comprehensive inventory-routing model suitable for supply chain networks where products exhibit an increase and decrease in value over time. By considering the randomness and dynamic uncertainty of market demands and the fact that each period has effects on the next period, The proposed model employs a multi-stage stochastic programming (MSSP) approach. By doing so, the model ensures a balanced flow between different components of the network while considering non-deterministic demand under various scenarios that are shown in a tree of scenarios. The utilization of MSSP leads to more reliable solutions compared to deterministic models, making it possible for chain stores to make well-informed decisions in their inventory management and distribution strategies. Ultimately, this approach results in cost savings for chain stores handling such products. This research makes a significant contribution to the existing literature by demonstrating the effectiveness of the proposed model on actual data and highlighting the benefits of using stochastic programming in supply chain optimization.","PeriodicalId":20872,"journal":{"name":"RAIRO Oper. Res.","volume":"68 1","pages":"2537-2559"},"PeriodicalIF":0.0000,"publicationDate":"2023-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A multi-stage stochastic programming approach for an inventory-routing problem considering life cycle\",\"authors\":\"Alireza Paeizi, Ahmad Makui, M. Pishvaee\",\"doi\":\"10.1051/ro/2023122\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Food waste and proper methods to deal with it are one of the main challenges of supply chain network management. The majority of studies on how to use mathematical models in the supply chain have focused on goods that are at their peak of freshness as soon as they are produced and deteriorate over time. While some products experience an increase in value at the start of their life cycle, this value eventually reaches its maximum level, and after this point, these products experience a decline in value before being eliminated from the consumption cycle. The objective of this study is to develop a comprehensive inventory-routing model suitable for supply chain networks where products exhibit an increase and decrease in value over time. By considering the randomness and dynamic uncertainty of market demands and the fact that each period has effects on the next period, The proposed model employs a multi-stage stochastic programming (MSSP) approach. By doing so, the model ensures a balanced flow between different components of the network while considering non-deterministic demand under various scenarios that are shown in a tree of scenarios. The utilization of MSSP leads to more reliable solutions compared to deterministic models, making it possible for chain stores to make well-informed decisions in their inventory management and distribution strategies. Ultimately, this approach results in cost savings for chain stores handling such products. This research makes a significant contribution to the existing literature by demonstrating the effectiveness of the proposed model on actual data and highlighting the benefits of using stochastic programming in supply chain optimization.\",\"PeriodicalId\":20872,\"journal\":{\"name\":\"RAIRO Oper. Res.\",\"volume\":\"68 1\",\"pages\":\"2537-2559\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-09-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"RAIRO Oper. Res.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1051/ro/2023122\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"RAIRO Oper. Res.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1051/ro/2023122","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

食物浪费及其处理方法是供应链网络管理面临的主要挑战之一。大多数关于如何在供应链中使用数学模型的研究都集中在那些刚生产出来就处于最新鲜状态的商品上,随着时间的推移,这些商品会变质。虽然有些产品在其生命周期开始时价值会增加,但这个价值最终会达到最大值,在此之后,这些产品的价值会下降,然后被淘汰出消费周期。本研究的目的是开发一个全面的库存路由模型,适用于供应链网络,其中产品的价值随着时间的推移而增加和减少。考虑到市场需求的随机性和动态不确定性,以及每一时期对下一时期的影响,该模型采用多阶段随机规划(MSSP)方法。通过这样做,该模型在考虑各种场景下的不确定性需求的同时,确保了网络不同组件之间的平衡流,这些场景显示在场景树中。与确定性模型相比,MSSP的使用带来了更可靠的解决方案,使连锁店能够在库存管理和分销策略方面做出明智的决策。最终,这种方法为处理此类产品的连锁店节省了成本。本研究通过证明所提出的模型在实际数据上的有效性,并突出了在供应链优化中使用随机规划的好处,对现有文献做出了重大贡献。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A multi-stage stochastic programming approach for an inventory-routing problem considering life cycle
Food waste and proper methods to deal with it are one of the main challenges of supply chain network management. The majority of studies on how to use mathematical models in the supply chain have focused on goods that are at their peak of freshness as soon as they are produced and deteriorate over time. While some products experience an increase in value at the start of their life cycle, this value eventually reaches its maximum level, and after this point, these products experience a decline in value before being eliminated from the consumption cycle. The objective of this study is to develop a comprehensive inventory-routing model suitable for supply chain networks where products exhibit an increase and decrease in value over time. By considering the randomness and dynamic uncertainty of market demands and the fact that each period has effects on the next period, The proposed model employs a multi-stage stochastic programming (MSSP) approach. By doing so, the model ensures a balanced flow between different components of the network while considering non-deterministic demand under various scenarios that are shown in a tree of scenarios. The utilization of MSSP leads to more reliable solutions compared to deterministic models, making it possible for chain stores to make well-informed decisions in their inventory management and distribution strategies. Ultimately, this approach results in cost savings for chain stores handling such products. This research makes a significant contribution to the existing literature by demonstrating the effectiveness of the proposed model on actual data and highlighting the benefits of using stochastic programming in supply chain optimization.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Erratum to: On interval-valued bilevel optimization problems using upper convexificators On the conformability of regular line graphs A new modified bat algorithm for global optimization A multi-stage stochastic programming approach for an inventory-routing problem considering life cycle On characterizations of solution sets of interval-valued quasiconvex programming problems
×
引用
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