The maximin HAZMAT routing problem

Resultado de la investigación: Article

19 Citas (Scopus)

Resumen

The hazardous material routing problem from an origin to a destination in an urban area is addressed. We maximise the distance between the route and its closest vulnerable centre, weighted by the centre's population. A vulnerable centre is a school, hospital, senior citizens' residence or the like, concentrating a high population or one that is particularly vulnerable or difficult to evacuate in a short time. The potential consequences on the most exposed centre are thus minimized. Though previously studied in a continuous space, the problem is formulated here over a transport (road) network. We present an exact model for the problem, in which we manage to significantly reduce the required variables, as well as an optimal polynomial time heuristic. The integer programming formulation and the heuristic are tested in a real-world case study set in the transport network in the city of Santiago, Chile.

Idioma originalEnglish
Páginas (desde-hasta)15-27
Número de páginas13
PublicaciónEuropean Journal of Operational Research
Volumen241
N.º1
DOI
EstadoPublished - 16 feb 2015

Huella dactilar

Maximin
Hazardous materials
Routing Problem
Integer programming
Polynomials
Heuristics
Hazardous Materials
Road Network
Urban Areas
Integer Programming
Polynomial time
Maximise
Formulation
Routing
Model
Chile
Destination
Road network
Urban areas

ASJC Scopus subject areas

  • Modelling and Simulation
  • Management Science and Operations Research
  • Information Systems and Management

Citar esto

@article{018c15295bc54698ac985e10450daaaa,
title = "The maximin HAZMAT routing problem",
abstract = "The hazardous material routing problem from an origin to a destination in an urban area is addressed. We maximise the distance between the route and its closest vulnerable centre, weighted by the centre's population. A vulnerable centre is a school, hospital, senior citizens' residence or the like, concentrating a high population or one that is particularly vulnerable or difficult to evacuate in a short time. The potential consequences on the most exposed centre are thus minimized. Though previously studied in a continuous space, the problem is formulated here over a transport (road) network. We present an exact model for the problem, in which we manage to significantly reduce the required variables, as well as an optimal polynomial time heuristic. The integer programming formulation and the heuristic are tested in a real-world case study set in the transport network in the city of Santiago, Chile.",
keywords = "HAZMAT, Networks, Routing",
author = "Andr{\'e}s Bronfman and Vladimir Marianov and Germ{\'a}n Paredes-Belmar and Armin L{\"u}er-Villagra",
year = "2015",
month = "2",
day = "16",
doi = "10.1016/j.ejor.2014.08.005",
language = "English",
volume = "241",
pages = "15--27",
journal = "European Journal of Operational Research",
issn = "0377-2217",
publisher = "Elsevier",
number = "1",

}

The maximin HAZMAT routing problem. / Bronfman, Andrés; Marianov, Vladimir; Paredes-Belmar, Germán; Lüer-Villagra, Armin.

En: European Journal of Operational Research, Vol. 241, N.º 1, 16.02.2015, p. 15-27.

Resultado de la investigación: Article

TY - JOUR

T1 - The maximin HAZMAT routing problem

AU - Bronfman, Andrés

AU - Marianov, Vladimir

AU - Paredes-Belmar, Germán

AU - Lüer-Villagra, Armin

PY - 2015/2/16

Y1 - 2015/2/16

N2 - The hazardous material routing problem from an origin to a destination in an urban area is addressed. We maximise the distance between the route and its closest vulnerable centre, weighted by the centre's population. A vulnerable centre is a school, hospital, senior citizens' residence or the like, concentrating a high population or one that is particularly vulnerable or difficult to evacuate in a short time. The potential consequences on the most exposed centre are thus minimized. Though previously studied in a continuous space, the problem is formulated here over a transport (road) network. We present an exact model for the problem, in which we manage to significantly reduce the required variables, as well as an optimal polynomial time heuristic. The integer programming formulation and the heuristic are tested in a real-world case study set in the transport network in the city of Santiago, Chile.

AB - The hazardous material routing problem from an origin to a destination in an urban area is addressed. We maximise the distance between the route and its closest vulnerable centre, weighted by the centre's population. A vulnerable centre is a school, hospital, senior citizens' residence or the like, concentrating a high population or one that is particularly vulnerable or difficult to evacuate in a short time. The potential consequences on the most exposed centre are thus minimized. Though previously studied in a continuous space, the problem is formulated here over a transport (road) network. We present an exact model for the problem, in which we manage to significantly reduce the required variables, as well as an optimal polynomial time heuristic. The integer programming formulation and the heuristic are tested in a real-world case study set in the transport network in the city of Santiago, Chile.

KW - HAZMAT

KW - Networks

KW - Routing

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

U2 - 10.1016/j.ejor.2014.08.005

DO - 10.1016/j.ejor.2014.08.005

M3 - Article

AN - SCOPUS:85027917268

VL - 241

SP - 15

EP - 27

JO - European Journal of Operational Research

JF - European Journal of Operational Research

SN - 0377-2217

IS - 1

ER -