Highlights We formulate and solve models for two new HAZMAT transportation route design problems for multiple origin destination pairs. The models minimize the danger to which vulnerable centers (schools, hospitals) are exposed by the routes. We propose a polynomial efficient heuristic for the problems. We apply the methods to actual data.
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.
The maxisum and maximin-maxisum HAZMAT routing problems
2016-06-20
18 pages
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
Urban networks , Routing , HAZMAT , Hazard
The maxisum and maximin-maxisum HAZMAT routing problems
Online Contents | 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
|