Min-Max problem of multiple traveling postmen for the execution of weeding and mowing of land in the city of Londrina

The problem of weeding and mowing public land, such as schools, hospitals and cemeteries, is usually carried out by public servants or outsourced companies. This activity needs to be carried out periodically, in which employees can be separated into teams. In this case, it is necessary to determine the number of teams and the route that each one will take, in order to optimize the route traveled and that the workload is distributed equally. In this work, we used the problem of the asymmetric traveling salesman to model the problem. In addition, we present a study involving the analysis and treatment of data from the city of Londrina, made available by the Municipal Company of Transit and Urbanization.