Exact methods for the Selective Assessment Routing Problem

The Selective Assessment Routing Problem (SARP) is a problem in humanitarian logistics addressing the site selection and routing decisions of rapid needs assessment teams which aim to evaluate the post-disaster conditions of different community groups, each carrying a distinct characteristic. The aim is to construct an assessment plan that maximizes the covering of different characteristics in a balanced way. We explore exact approaches based on mixed integer linear programming. Different mathematical formulations are presented, and theoretical results regarding their strengths are derived. The models are experimentally evaluated on a set of test instances including a real-world scenario.