A relax-and-fix Pareto-based algorithm for a bi-objective vaccine distribution network considering a mix-and-match strategy in pandemics

数学优化 启发式 计算机科学 帕累托原理 多目标优化 还原(数学) 算法 数学 几何学
作者
Alireza Nikoubin,Mehdi Mahnam,Ghasem Moslehi
出处
期刊:Applied Soft Computing [Elsevier]
卷期号:132: 109862-109862 被引量:6
标识
DOI:10.1016/j.asoc.2022.109862
摘要

Mass vaccination in pandemics is one of the most effective strategies to halt disease transmission. A well-organized vaccination plan is essential for guaranteeing its success in cases with limited vaccines. On the other hand, most vaccines need more than one dose for appropriate immunity, intensifying the vaccine shortage probability and complicating decision-making. This study presents a bi-objective mixed-integer linear model for a vaccine distribution chain problem, simultaneously considering economic and social objectives, with multi-dose vaccination adaptable even for booster doses. Moreover, the compatible vaccines in each vaccination process are considered a mix-and-match strategy to diversify vaccination alternatives and alleviate the vaccine shortage risk. It is shown that the problem is NP-hard, and we develop two heuristic and meta-heuristic algorithms to solve real-size instances in a reasonable time. Both algorithms use problem size reduction and problem decomposition techniques to produce an approximate Pareto front for the problem. The heuristic algorithm employs relax-and-fix and fix-and-optimize techniques, and an epsilon-constraint method to solve the multi-objective problem. The proposed meta-heuristic algorithm is based on the hybrid of two well-known evolutionary algorithms, particle swarm optimization, and genetic algorithm. It also uses a multi-objective framework called PESA-II to generate the Pareto front. Both proposed heuristic and meta-heuristic algorithms can employ parallel computing, which significantly reduces computational time. Finally, we investigate the proposed algorithms’ performance using 30 random problem instances and a case study from Iran. The results demonstrate that heuristic and meta-heuristic algorithms have obtained a reasonable solution with a maximum of 6.9% and 16.3% cost objective function gap respectively. The heuristic algorithm is superior to the meta-heuristic in terms of Pareto front quality metrics.

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
PDF的下载单位、IP信息已删除 (2025-6-4)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
量子星尘发布了新的文献求助10
刚刚
市区凤姐完成签到,获得积分10
刚刚
eric888应助开心市民采纳,获得30
1秒前
失眠的契完成签到,获得积分10
1秒前
欧耶欧椰完成签到 ,获得积分10
2秒前
shaofeng完成签到,获得积分10
2秒前
hamliton完成签到 ,获得积分20
2秒前
完美世界应助jianrobsim采纳,获得10
3秒前
传奇3应助欢呼的听南采纳,获得10
3秒前
汉堡包应助幸福无声采纳,获得10
3秒前
3秒前
Andy完成签到 ,获得积分10
3秒前
mxt完成签到,获得积分10
3秒前
4秒前
4秒前
hyacinth完成签到,获得积分10
4秒前
5秒前
zzz完成签到,获得积分10
5秒前
koreyoshi发布了新的文献求助10
5秒前
up完成签到,获得积分10
6秒前
淡淡的酸奶完成签到,获得积分10
6秒前
wanci应助yunsww采纳,获得10
6秒前
6秒前
执着的风华完成签到,获得积分10
6秒前
光之晨曦完成签到,获得积分10
7秒前
7秒前
7秒前
隐形曼青应助Chris采纳,获得100
7秒前
远扬关注了科研通微信公众号
7秒前
程文轩发布了新的文献求助10
7秒前
啦啦啦关注了科研通微信公众号
7秒前
wx2360ouc完成签到 ,获得积分10
8秒前
NIUBEN完成签到,获得积分10
8秒前
8秒前
Lynn完成签到,获得积分10
8秒前
乔钰涵发布了新的文献求助10
9秒前
伶俐骁发布了新的文献求助10
9秒前
9秒前
思辰。完成签到,获得积分10
9秒前
10秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
List of 1,091 Public Pension Profiles by Region 1561
Current Trends in Drug Discovery, Development and Delivery (CTD4-2022) 800
Foregrounding Marking Shift in Sundanese Written Narrative Segments 600
Holistic Discourse Analysis 600
Beyond the sentence: discourse and sentential form / edited by Jessica R. Wirth 600
Science of Synthesis: Houben–Weyl Methods of Molecular Transformations 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 有机化学 生物化学 物理 纳米技术 计算机科学 内科学 化学工程 复合材料 物理化学 基因 遗传学 催化作用 冶金 量子力学 光电子学
热门帖子
关注 科研通微信公众号,转发送积分 5523959
求助须知:如何正确求助?哪些是违规求助? 4614601
关于积分的说明 14543506
捐赠科研通 4552337
什么是DOI,文献DOI怎么找? 2494743
邀请新用户注册赠送积分活动 1475510
关于科研通互助平台的介绍 1447207