4.7 Article

The maxisum and maximin-maxisum HAZMAT routing problems

出版社

PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.tre.2016.06.007

关键词

Urban networks; Routing; HAZMAT; Hazard

资金

  1. FONDECYT [1130265]
  2. Complex Engineering Systems Institute through ICM-MIDEPLAN [P-05-004-F]
  3. Complex Engineering Systems Institute through CONICYT [FBO16]
  4. [CONICYT/FONDAP/15110017]

向作者/读者索取更多资源

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. (C) 2016 Elsevier Ltd. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据