启发式
危险废物
计算机科学
数学优化
网络规划与设计
时间范围
流量网络
运筹学
布线(电子设计自动化)
方案(数学)
比例(比率)
工程类
数学
量子力学
物理
数学分析
计算机网络
废物管理
作者
Behzad Zahiri,Nallan C. Suresh
标识
DOI:10.1016/j.tre.2021.102424
摘要
This paper considers a hazardous materials (hazmat) transportation network design problem based on hub location topology under uncertainty. The control variables include decisions regarding location of hubs and hazmat response teams, along with the routing schemes. The model aims to minimize the total risk in the network. The measure of risk incorporates average response time to hazmat incidents as well as waiting time at hubs. To tackle the uncertainty of the problem, an efficient interactive approach using mean-absolute deviation and possibilistic programming is developed. Two heuristic algorithms based on lower bound procedure and rolling horizon scheme are presented to solve the model in large scale instances. The advantages of the presented methodologies are demonstrated through numerical experiments based on transportation networks from Sioux Falls, SD, and Western New York. We investigate different design schemes and discuss optimal decisions under different configurations.
科研通智能强力驱动
Strongly Powered by AbleSci AI