The maxisum and maximin-maxisum HAZMAT routing problems

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

Research output: Contribution to journalArticlepeer-review

14 Scopus citations

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.

Original languageEnglish
Pages (from-to)316-333
Number of pages18
JournalTransportation Research Part E: Logistics and Transportation Review
Volume93
DOIs
StatePublished - 1 Sep 2016
Externally publishedYes

Keywords

  • Hazard
  • HAZMAT
  • Routing
  • Urban networks

Fingerprint Dive into the research topics of 'The maxisum and maximin-maxisum HAZMAT routing problems'. Together they form a unique fingerprint.

Cite this