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.
The maxisum and maximin-maxisum HAZMAT routing problems
2016
Article (Journal)
English
The maxisum and maximin-maxisum HAZMAT routing problems
Elsevier | 2016
|Dynamic Routing Algorithm for Hazmat Transportation Problems
Transportation Research Record | 2022
|Hazmat Routing: Alternate Routing Risk Analysis
British Library Conference Proceedings | 2016
|Hazmat Routing: Safety and Security Challenges
British Library Conference Proceedings | 2015
|