科研之友
微信
新浪微博
Facebook
分享链接
摘要
Robust transportation network design problems generally rely on systems engineering methods that share common research gaps. First, problem sizes are constrained due to the use of multi-objective solution algorithms that are notoriously inefficient due to computationally expensive function evaluations. Second, link disruptions at a network level are difficult to model realistically. In this paper, a stochastic search metaheuristic based on radial basis functions is proposed for constrained multiobjective problems. It is proven to converge, and compared with conventional metaheuristics for four representative test problems. A scenario simulation method based on multivariate Bernoulli random variables that accounts for correlations between link failures is proposed to sample scenarios for a mean-variance toll pricing problem. Four tests are conducted on the classical Sioux Falls network to gain some insights into the algorithm, the simulation model, and to the robust toll pricing problem. The first test empirically measures the efficiency of the simulation algorithm and approximate Pareto set by obtaining a standard error in the epsilon-indicator measure for a given number of scenarios and iterations. The second test compares the dominance of the proposed heuristic%26apos;s solutions with a conventional multiobjective genetic algorithm by comparing the average epsilon-indicator. The third test quantifies the gap due to falsely assuming that link failures are independent of each other when they are not. The last test quantifies the value of having the flexibility to adapt a Pareto set of toll pricing solutions to changing probability regimes such as peak and off-peak hurricane or snow seasons.
- 出版日期2014-3
