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.
Artículos científicos
The maxisum and maximin-maxisum HAZMAT routing problems
Abstract
- Revista
- Transportation Research Part E
- Área de investigación
- Análisis del riesgo y mitigación
- Autores
- Andrés Bronfman
- Año
- 2016
Relacionados
Ver todas →Artículos científicos
Vertical evacuation buildings: Sequential earthquake and tsunami assestment
Temáticas: Terremotos • Tsunamis
Artículos científicos
Variable Route Expiration Time based on a Fixed Probability of Failure for Ad-Hoc Networks Routing Applications
Temáticas: Procesos de evacuación