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
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. We also thank two anonymous reviewers who contributed to significantly improve the paper.
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
SN - 0377-2217
VL - 241
SP - 15
EP - 27
JO - European Journal of Operational Research
JF - European Journal of Operational Research
IS - 1
ER -