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.
|Number of pages||18|
|Journal||Transportation Research Part E: Logistics and Transportation Review|
|Publication status||Published - 1 Sep 2016|
- Urban networks
ASJC Scopus subject areas
- Business and International Management
- Management Science and Operations Research