The maxisum and maximin-maxisum HAZMAT routing problems
Cargando...
Archivos
Fecha
2016-09
Profesor/a Guía
Facultad/escuela
Idioma
en
Título de la revista
ISSN de la revista
Título del volumen
Editor
Elsevier Ltd
Nombre de Curso
Licencia CC
Atribución 4.0 Internacional (CC BY 4.0)
Licencia CC
https://creativecommons.org/licenses/by/4.0/deed.es
Resumen
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. © 2016 Elsevier Ltd.
Notas
Indexación: Scopus
Palabras clave
Hazard, HAZMAT, Routing, Urban networks
Citación
Transportation Research Part E: Logistics and Transportation Review Volume 93, Pages 316 - 3331 September 2016
DOI
10.1016/j.tre.2016.06.007