The maximin HAZMAT routing problem

Andrés Bronfman, Vladimir Marianov, GERMAN ENRIQUE PAREDES BELMAR, Armin Lüer-Villagra

Research output: Contribution to journalArticlepeer-review

30 Scopus citations

Abstract

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.

Original languageEnglish
Pages (from-to)15-27
Number of pages13
JournalEuropean Journal of Operational Research
Volume241
Issue number1
DOIs
StatePublished - 16 Feb 2015
Externally publishedYes

Keywords

  • HAZMAT
  • Networks
  • Routing

Fingerprint Dive into the research topics of 'The maximin HAZMAT routing problem'. Together they form a unique fingerprint.

Cite this