Title
On Efficient Vaccine Distribution Strategy To Suppress Pandemic Using Social Relation
Abstract
In this paper, we investigate the problem of how to distribute vaccines, which will be supplied over time, so that the number of the infected can be minimized during a given mission period. The concept of temporal graph is adopted to abstract the constantly changing social relations over time. Then, we formally introduce the social-relation-based vaccine distribution planning problem (SVDP2) on the temporal graph. To solve the problem, we first introduce a new graph induction technique to combine the subgraphs in the temporal graph into a single directed acyclic graph. Then, we design a new technique based on a maximum flow algorithm to evaluate the quality of any feasible solution of the problem. Finally, we propose an enumeration algorithm which will search the solution space using the evaluation technique and find the best possible solution within polynomial time. Our simulation result shows the proposed algorithm is more efficient than a simple strategy which randomly distributes vaccines.
Year
DOI
Venue
2016
10.1142/S1793830916500105
DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS
Keywords
Field
DocType
Graph theory, optimization, temporal graph, vaccine distribution, fire-fighter problem, graph cut
Graph theory,Cut,Discrete mathematics,Mathematical optimization,Combinatorics,Closure problem,Directed acyclic graph,Graph bandwidth,Time complexity,Mathematics,Moral graph,Graph (abstract data type)
Journal
Volume
Issue
ISSN
8
1
1793-8309
Citations 
PageRank 
References 
1
0.36
2
Authors
6
Name
Order
Citations
PageRank
Kim Donghyun145841.00
Hao Guo210.36
Wei Wang38112.64
Joonglyul Lee4111.94
Sung-Sik Kwon5142.04
Alade O. Tokuta615913.96