Robust Optimization of Vaccine Distribution Problem with Demand Uncertainty

Faiqul Fikri, B. P. Silalahi, J. Jaharuddin
{"title":"Robust Optimization of Vaccine Distribution Problem with Demand Uncertainty","authors":"Faiqul Fikri, B. P. Silalahi, J. Jaharuddin","doi":"10.31764/jtam.v8i2.20035","DOIUrl":null,"url":null,"abstract":"This study proposes a multi objective optimization model for vaccine distribution problems using the Maximum Covering Location Problem (MCLP) model. The objective function of the MCLP model in this study is to maximize the fulfillment of vaccine demand for each priority group at each demand point. In practice, the MCLP model requires data on the amount of demand at each demand point, which in reality can be influenced by many factors so that the value is uncertain. This problem makes the optimization model to be uncertain linear problem (ULP). The robust optimization approach converts ULP into a single deterministic problem called Robust Counterpart (RC) by assuming the demand quantity parameter in the constraint function is in the set of uncertainty boxes, so that a robust counterpart to the model is obtained. Numerical simulations are carried out using available data. It is found that the optimal value in the robust counterpart model is not better than the deterministic model but is more resistant to changes in parameter values. This causes the robust counterpart model to be more reliable in overcoming uncertain vaccine distribution problems in real life. This research is limited to solving the problem of vaccine distribution at a certain time and only assumes that the uncertainty of the number of requests is within a specified range so that it can be developed by assuming that the number of demand is dynamic.","PeriodicalId":489521,"journal":{"name":"JTAM (Jurnal Teori dan Aplikasi Matematika)","volume":"61 ","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"JTAM (Jurnal Teori dan Aplikasi Matematika)","FirstCategoryId":"0","ListUrlMain":"https://doi.org/10.31764/jtam.v8i2.20035","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

This study proposes a multi objective optimization model for vaccine distribution problems using the Maximum Covering Location Problem (MCLP) model. The objective function of the MCLP model in this study is to maximize the fulfillment of vaccine demand for each priority group at each demand point. In practice, the MCLP model requires data on the amount of demand at each demand point, which in reality can be influenced by many factors so that the value is uncertain. This problem makes the optimization model to be uncertain linear problem (ULP). The robust optimization approach converts ULP into a single deterministic problem called Robust Counterpart (RC) by assuming the demand quantity parameter in the constraint function is in the set of uncertainty boxes, so that a robust counterpart to the model is obtained. Numerical simulations are carried out using available data. It is found that the optimal value in the robust counterpart model is not better than the deterministic model but is more resistant to changes in parameter values. This causes the robust counterpart model to be more reliable in overcoming uncertain vaccine distribution problems in real life. This research is limited to solving the problem of vaccine distribution at a certain time and only assumes that the uncertainty of the number of requests is within a specified range so that it can be developed by assuming that the number of demand is dynamic.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
具有需求不确定性的疫苗配送问题的稳健优化
本研究利用最大覆盖位置问题(MCLP)模型,为疫苗分配问题提出了一个多目标优化模型。本研究中 MCLP 模型的目标函数是最大限度地满足每个需求点上每个优先群体的疫苗需求。在实践中,MCLP 模型需要每个需求点的需求量数据,而现实中的需求量会受到很多因素的影响,因此其值是不确定的。这个问题使得优化模型成为不确定线性问题(ULP)。稳健优化方法通过假定约束函数中的需求量参数位于不确定性箱集中,将 ULP 转化为一个单一的确定性问题,称为稳健对应问题(RC),从而得到模型的稳健对应问题。利用现有数据进行了数值模拟。结果发现,稳健对应模型的最优值并不比确定性模型好,但更能抵御参数值的变化。这使得鲁棒对应模型在克服现实生活中不确定的疫苗分布问题时更加可靠。本研究仅限于解决某一时间的疫苗分配问题,并且仅假设需求数量的不确定性在指定范围内,因此可以通过假设需求数量是动态的来进行开发。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Rainfall Forecasting Using an Adaptive Neuro-Fuzzy Inference System with a Grid Partitioning Approach to Mitigating Flood Disasters Projection of PT Aneka Tambang Tbk Share Risk Value Based on Backpropagation Artificial Neural Network Forecasting Result Exploring Multivariate Copula Models and Fuzzy Interest Rates in Assessing Family Annuity Products Development of a Desmos-Assisted Planar Analytic Geometry Textbook to Support High Order Thinking Skills Identifying Factors Affecting Waste Generation in West Java in 2021 Using Spatial Regression
×
引用
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