The maxisum and maximin-maxisum HAZMAT routing problems

The authors design routes for transportation of hazardous materials (HAZMAT) in urban areas, with multiple origin-destination pairs. First, they 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. They 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.

Language

  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 01611376
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Aug 1 2016 2:35PM