The maxisum and maximin-maxisum HAZMAT routing problems

Resultado de la investigación: Article

3 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 originalEnglish
Páginas (desde-hasta)316-333
Número de páginas18
PublicaciónTransportation Research Part E: Logistics and Transportation Review
Volumen93
DOI
EstadoPublished - 1 sep 2016

Huella dactilar

Material Problems
hazardous material
Hazardous materials
Chile
heuristics
Computational complexity
urban area
Polynomials
Routing
Maximin

ASJC Scopus subject areas

  • Business and International Management
  • Transportation
  • Management Science and Operations Research

Citar esto

@article{ce137086f8c442bfb02df6a35f139f9a,
title = "The maxisum and maximin-maxisum HAZMAT routing problems",
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.",
keywords = "Hazard, HAZMAT, Routing, Urban networks",
author = "Andr{\'e}s Bronfman and Vladimir Marianov and Germ{\'a}n Paredes-Belmar and Armin L{\"u}er-Villagra",
year = "2016",
month = "9",
day = "1",
doi = "10.1016/j.tre.2016.06.007",
language = "English",
volume = "93",
pages = "316--333",
journal = "Transportation Research, Part E: Logistics and Transportation Review",
issn = "1366-5545",
publisher = "Elsevier Limited",

}

TY - JOUR

T1 - The maxisum and maximin-maxisum HAZMAT routing problems

AU - Bronfman, Andrés

AU - Marianov, Vladimir

AU - Paredes-Belmar, Germán

AU - Lüer-Villagra, Armin

PY - 2016/9/1

Y1 - 2016/9/1

N2 - 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.

AB - 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.

KW - Hazard

KW - HAZMAT

KW - Routing

KW - Urban networks

UR - http://www.scopus.com/inward/record.url?scp=84977156637&partnerID=8YFLogxK

U2 - 10.1016/j.tre.2016.06.007

DO - 10.1016/j.tre.2016.06.007

M3 - Article

VL - 93

SP - 316

EP - 333

JO - Transportation Research, Part E: Logistics and Transportation Review

JF - Transportation Research, Part E: Logistics and Transportation Review

SN - 1366-5545

ER -