The maxisum and maximin-maxisum HAZMAT routing problems

Thumbnail Image
Files
TEXTO EN INGLES
Date
2016-09
Authors
Profesor/a Guía
Facultad/escuela
Idioma
en
Journal Title
Journal ISSN
Volume Title
Publisher
Elsevier Ltd
Nombre de Curso
item.page.dc.rights
Atribución 4.0 Internacional (CC BY 4.0)
item.page.dc.rights
https://creativecommons.org/licenses/by/4.0/deed.es
Abstract
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.
item.page.dc.description
Indexación: Scopus
Keywords
Hazard, HAZMAT, Routing, Urban networks
Citation
Transportation Research Part E: Logistics and Transportation Review Volume 93, Pages 316 - 3331 September 2016
DOI
10.1016/j.tre.2016.06.007
URI
https://repositorio.unab.cl/xmlui/handle/ria/53280
Link a Vimeo
Collections
FIng - Artículos de Revista