随机时变路网下的城市应急服务车辆路径分析.PDFVIP

Journal of Computer Applications ISSN 1001-9081 2014-12-15 计算机应用,2014,34(S2 :317-319 CODENJYIIDU http:/ / 文章编号：1001-9081（2014）S2-0317-03 随机时变路网下的城市应急服务车辆路径分析 * 孙 硕 ，段征宇，孙世超，刘 锐 （道路与交通工程教育部重点实验室（同济大学），上海200092） ( 通信作者电子邮箱sunshuo081549@163.com * 要：针对城市应急服务车辆（110、119、120等）的最优路径选择问题及路网的随机性与时变性，利用鲁棒优化 理论，考虑路网在最坏情况下的行程时间，建立了随机时变条件下的应急车辆路径选择模型，并对Dijkstra 算法进行 改进，将算法的路阻矩阵进行实时更新，以在时变条件下实现对路径选择模型的求解。经算例分析表明，该模型能有 效解决随机时变路网环境下的应急车辆最优路径问题，与基于概率分布的期望行程时间最短的方法相比，该模型拥 有更高的鲁棒性和易操作性。 关键词：应急车辆；随机时变路 ；鲁棒优化；最优路径 中图分类号：TP301 文献标志码：A Vehicle routing analysis of urban emergency service in stochastic time-dependent networks * SUN Shuo , DUAN Zhengyu, SUN Shichao, LIU Rui (Key Laboratory of Road and Traffic Engineering of Ministry of Education (Tongji University , Shanghai200092, hina Abstract: Concerning the optimal paths planning of urban emergency service vehicles (such as 110, 119, 120, etc. and stochastic time-dependent networks, using the robust optimization theory, the travel time of links in the worst case was considered and a route choice model in the stochastic time-dependent networks was proposed in this paper. The Dijkstra algorithm was improved with updating the impedance matrix in real time to solve this choice model under time-dependent networks. The experimental results indicate that this model can effectively solve the optimal paths planning problem of emergency vehiclesinstochastictime-dependentnetworks. Comparedwiththemethodof searchingtherouteofwhichexpected travel time is the shortest based on