Bi-objective optimization for a multi-period COVID-19 vaccination planning problem()

This work investigates a new multi-period vaccination planning problem that simultaneously optimizes the total travel distance of vaccination recipients (service level) and the operational cost. An optimal plan determines, for each period, which vaccination sites to open, how many vaccination stations to launch at each site, how to assign recipients from different locations to opened sites, and the replenishment quantity of each site. We formulate this new problem as a bi-objective mixed-integer linear program (MILP). We first propose a weighted-sum and an [Formula: see text]-constraint methods, which rely on solving many single-objective MILPs and thus lose efficiency for practical-sized instances. To this end, we further develop a tailored genetic algorithm where an improved assignment strategy and a new dynamic programming method are designed to obtain good feasible solutions. Results from a case study indicate that our methods reduce the operational cost and the total travel distance by up to 9.3% and 36.6%, respectively. Managerial implications suggest enlarging the service capacity of vaccination sites can help improve the performance of the vaccination program. The enhanced performance of our heuristic is due to the newly proposed assignment strategy and dynamic programming method. Our findings demonstrate that vaccination programs during pandemics can significantly benefit from formal methods, drastically improving service levels and decreasing operational costs.