Transportation Research Part E
2016
Urban networks Routing HAZMAT Hazard
We 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.
Andrés Bronfman a,b; Vladimir Marianov a,⇑; Germán Paredes-Belmar a,b; Armin Lüer-Villagra a,b
a Department of Electrical Engineering, Pontificia Universidad Católica de Chile, Santiago, Chile
b Engineering Sciences Department, Universidad Andres Bello, Santiago, Chile
