Bronfman, AndrésMarianov, VladimirParedes-Belmar, GermánLüer-Villagra, Armin2023-09-212023-09-212016-09Transportation Research Part E: Logistics and Transportation Review Volume 93, Pages 316 - 3331 September 20161366-5545https://repositorio.unab.cl/xmlui/handle/ria/53280Indexación: ScopusWe design routes for transportation of hazardous materials (HAZMAT) in urban areas, with multiple origin-destination pairs. First, we introduce the maxisum HAZMAT routing problem, which maximizes the sum of the population-weighted distances from vulnerable centers to their closest point on the routes. Secondly, the maximin-maxisum HAZMAT routing problem trades-off maxisum versus the population-weighted distance from the route to its closest center. We propose efficient IP formulations for both NP-Hard problems, as well as a polynomial heuristic that reaches gaps below 0.54% in a few seconds on the real case in the city of Santiago, Chile. © 2016 Elsevier Ltd.enHazardHAZMATRoutingUrban networksArtículoAtribución 4.0 Internacional (CC BY 4.0)10.1016/j.tre.2016.06.007