Optimal Tour Planning for Measles and Rubella Vaccination in Kochi, South India

摘要

We consider the problem of routing multiple teams of health workers during a vaccination campaign. We formulate the routing problem as a bi-objective team orienteering problem with additional constraints. The two objectives are to minimize the total time and to maximize vaccination coverage. The set of Pareto-optimal solutions is computed by an epsilon-constraint method. Small instances of the problem can be solved exactly by branch-and-cut, and larger instances by heuristic methods. As an example for the model, we consider optimal tour planning for the Measles and Rubella Campaign in Kochi, South India.