The maxisum and maximin-maxisum HAZMAT routing problems

Resultado de la investigación: Contribución a una revistaArtículo

10 Citas (Scopus)

Resumen

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.

Idioma originalInglés
Páginas (desde-hasta)316-333
Número de páginas18
PublicaciónTransportation Research Part E: Logistics and Transportation Review
Volumen93
DOI
EstadoPublicada - 1 sep 2016

Áreas temáticas de ASJC Scopus

  • Gestión internacional y de empresa
  • Transporte
  • Ciencia de la gestión e investigación de operaciones

Huella Profundice en los temas de investigación de 'The maxisum and maximin-maxisum HAZMAT routing problems'. En conjunto forman una huella única.

  • Citar esto