东南大学学报（自然科学版）2017，Vol.47Issue(6)：1263-1268,6.DOI:10.3969/j.issn.1001-0505.2017.06.028
基于可靠性的随机交通网络约束最优路径问题
Constrained shortest path problem in stochastic traffic network based on reliability
摘要
Abstract
To simulate the behavior of the path choice under the resource constraints in the traffic network,the mathematical model of the constrained shortest path problem in the stochastic traffic network is established and solved.The mean-variance is defined as the objective function of the path.The constrained shortest path problem is modeled as a nonlinear mixed integer constrained optimization problem and solved by the proposed branch-and-bound algorithm based on linear programruing.Numerical experiments in the Sioux Falls network are carried out,and the calculation results of the constrained shortest path without resource constraint and with different resource constraints are compared and analyzed.The experimental results show that the optimal values and the shortest paths obtained without resource constraints and with resource constraints are different.The optimal values and the shortest paths obtained with different resource constraints are also different,and the upper value of the resource constraints is in inverse proportion to the optimal value.The resource constraints have a great influence on the choice of the optimal path in the traffic network.关键词
智能交通/随机网络/最优路径/资源约束/可靠性/分支定界Key words
intelligent transportation/stochastic network/optimal path/resource constraint/reliability/branch-and-bound分类
交通工程引用本文复制引用
潘义勇,马健霄..基于可靠性的随机交通网络约束最优路径问题[J].东南大学学报（自然科学版）,2017,47(6):1263-1268,6.基金项目
国家自然科学基金青年科学基金资助项目(51508280)、江苏省高等学校大学生创新创业训练计划资助项目(201610298037Z)、南京林业大学高学历人才基金资助项目(GXL2014031). （51508280）
