Routing Vehicles for Dengue Control

This work proposes an exact methodology for routing spraying vehicles during the visit of dengue regions. The methodology is grounded on an Integer Programming (IP) formulation for the Rural Postman Problem. Computational experiments were conducted over a set of real-life instances from the city of Campinas, São Paulo, obtained from the Open Street Maps. The results show that the methodology is effective to obtain optimal routes for instances with more than 2500 vertices and 5500 arcs in less than one hour of computational time.