CAJ | 학술논문

针对城市应急服务车辆（110、119、120等）的最优路径选择问题及路网的随机性与时变性，利用鲁棒优化理论，考虑路网在最坏情况下的行程时间，建立了随机时变条件下的应急车辆路径选择模型，并对 Dijkstra算法进行改进，将算法的路阻矩阵进行实时更新，以在时变条件下实现对路径选择模型的求解。经算例分析表明，该模型能有效解决随机时变路网环境下的应急车辆最优路径问题，与基于概率分布的期望行程时间最短的方法相比，该模型拥有更高的鲁棒性和易操作性。
침대성시응급복무차량（110、119、120등）적최우로경선택문제급로망적수궤성여시변성，이용로봉우화이론，고필로망재최배정황하적행정시간，건립료수궤시변조건하적응급차량로경선택모형，병대 Dijkstra산법진행개진，장산법적로조구진진행실시경신，이재시변조건하실현대로경선택모형적구해。경산례분석표명，해모형능유효해결수궤시변로망배경하적응급차량최우로경문제，여기우개솔분포적기망행정시간최단적방법상비，해모형옹유경고적로봉성화역조작성。
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 vehicles in stochastic time-dependent networks. Compared with the method of searching the route of which expected travel time is the shortest based on distribution estimation, this method has higher robustness and feasibility.