The maximin HAZMAT routing problem

Andrés Bronfman, Vladimir Marianov, Germán Paredes-Belmar, Armin Lüer-Villagra

Producción científica: Contribución a una revistaArtículorevisión exhaustiva

50 Citas (Scopus)


The hazardous material routing problem from an origin to a destination in an urban area is addressed. We maximise the distance between the route and its closest vulnerable centre, weighted by the centre's population. A vulnerable centre is a school, hospital, senior citizens' residence or the like, concentrating a high population or one that is particularly vulnerable or difficult to evacuate in a short time. The potential consequences on the most exposed centre are thus minimized. Though previously studied in a continuous space, the problem is formulated here over a transport (road) network. We present an exact model for the problem, in which we manage to significantly reduce the required variables, as well as an optimal polynomial time heuristic. The integer programming formulation and the heuristic are tested in a real-world case study set in the transport network in the city of Santiago, Chile.

Idioma originalInglés
Páginas (desde-hasta)15-27
Número de páginas13
PublicaciónEuropean Journal of Operational Research
EstadoPublicada - 16 feb. 2015

Áreas temáticas de ASJC Scopus

  • Modelización y simulación
  • Ciencia de la gestión e investigación de operaciones
  • Gestión y sistemas de información


Profundice en los temas de investigación de 'The maximin HAZMAT routing problem'. En conjunto forman una huella única.

Citar esto