The maxisum and maximin-maxisum HAZMAT routing problems

Andrés Bronfman; Vladimir Marianov; Germán Paredes-Belmar; Armin Lüer-Villagra

doi:10.1016/j.tre.2016.06.007

The maxisum and maximin-maxisum HAZMAT routing problems

Andrés Bronfman, Vladimir Marianov, Germán Paredes-Belmar, Armin Lüer-Villagra

Engineering School

Research output: Contribution to journal › Article › peer-review

20 Citations (Scopus)

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.

Original language	English
Pages (from-to)	316-333
Number of pages	18
Journal	Transportation Research Part E: Logistics and Transportation Review
Volume	93
DOIs	https://doi.org/10.1016/j.tre.2016.06.007
Publication status	Published - 1 Sept 2016

Keywords

HAZMAT
Hazard
Routing
Urban networks

ASJC Scopus subject areas

Business and International Management
Civil and Structural Engineering
Transportation

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

Access to Document

10.1016/j.tre.2016.06.007

Cite this

@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 = "HAZMAT, Hazard, Routing, Urban networks",

author = "Andr{\'e}s Bronfman and Vladimir Marianov and Germ{\'a}n Paredes-Belmar and Armin L{\"u}er-Villagra",

note = "Funding Information: We gratefully acknowledge the support by FONDECYT Grant No. 1130265 , by the Complex Engineering Systems Institute (through Grants ICM-MIDEPLAN P-05-004-F and CONICYT FBO16 ), and to the National Research Center for Integrated Natural Disaster Management CONICYT/FONDAP/15110017 .",

year = "2016",

month = sep,

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 Ltd",

}

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

N1 - Funding Information: We gratefully acknowledge the support by FONDECYT Grant No. 1130265 , by the Complex Engineering Systems Institute (through Grants ICM-MIDEPLAN P-05-004-F and CONICYT FBO16 ), and to the National Research Center for Integrated Natural Disaster Management CONICYT/FONDAP/15110017 .

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 - HAZMAT

KW - Hazard

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

AN - SCOPUS:84977156637

SN - 1366-5545

VL - 93

SP - 316

EP - 333

JO - Transportation Research Part E: Logistics and Transportation Review

JF - Transportation Research Part E: Logistics and Transportation Review

ER -

The maxisum and maximin-maxisum HAZMAT routing problems

Abstract

Keywords

ASJC Scopus subject areas

UN SDGs

Access to Document

Other files and links

Fingerprint

Cite this