考虑不确定性因素的消防车辆路线优化

发布时间：2018-04-29 21:44

本文选题：消防车导航 + 出行时间可靠性　；参考：《大连理工大学》2015年硕士论文

【摘要】：发生城市火灾时,消防救援力量能够及时到达现场展开救援的具有重要意义。作为交通流的一部分,消防车辆在行驶中受到了实时交通状况、突发事件等影响,这些因素导致从消防中心到火灾地点的行程时间具有不确定性。同时,消防车辆线路优化具有不同于一般社会车辆线路优化的属性。首先,消防车辆对出行线路的可靠性要求很高,这需要规划中保证导航线路的可靠度;其次,消防车辆出行对时间要求很高,.但是对以节省耗油为目标的路程最短要求不高,因此目标以节省时间为主,研宄实时导航;最后,消防车辆不受交通信号、交通流行驶方向等的限制,因此出动线路规划中的可行路网应当将逆向行驶路段包括在内。针对消防车辆的上述属性,本文假设路段的行程时间是一个随机数,并分别懫用了随机路网以及随机时变路网作为消防车辆路线规划中路网模型的基础。在分析对比多种随机网络中路线规划指标的基础上,依据消防部门的评价原则,选取了ct-可靠度以及平均出行时间最为消防车辆线路规划的两个目标,提出了帕累托最优路线集合的概念。然后,基于传统的最短路径算法,通过扩展贝尔曼最优性原理,改进了现有的标号算法,分别给出了随机网络以及随机时变网络中消防车辆线路规划的求解算法。文章接下来引入了自适应路由策略的定义,确定在实时前进过程中,消防车辆导航的原则,给出了具体的算法。最后,本文选取了大连市中心的区域作为研究对象,展示了算法的运行结果,并分析了算法的运行速度等指标。研究结果表明,本文的目标函数能够很好的反映消防车辆出行的决策过程,且在城市消防车服务区域的路网规模下,求解算法能够保持较快的运行速度。
[Abstract]:It is of great significance that the fire rescue force can reach the scene in time to carry out the rescue in case of urban fire. As a part of traffic flow, fire fighting vehicles are affected by real-time traffic conditions and unexpected events. These factors lead to uncertainty of travel time from fire center to fire site. At the same time, fire vehicle route optimization is different from the common social vehicle line optimization attribute. First of all, the reliability requirements of fire fighting vehicles to travel line is very high, which needs to ensure the reliability of navigation line in the planning; secondly, the travel time requirement of fire fighting vehicles is very high. However, the shortest distance to save fuel is not high, so the goal is to save time and study the navigation in real time. Finally, the fire fighting vehicle is not restricted by the traffic signal, the direction of the traffic flow, etc. Therefore, the feasible road network in the route planning should include the reverse section. In view of the above properties of fire fighting vehicles, this paper assumes that the travel time of road sections is a random number, and uses the random road network and the random time-varying road network as the basis of the road network model in the route planning of fire fighting vehicles. On the basis of analyzing and comparing the route planning indexes of various random networks, according to the evaluation principle of fire department, two targets of CT-reliability and average travel time are selected as the most important targets for the route planning of fire fighting vehicles. The concept of Pareto optimal route set is proposed. Then, based on the traditional shortest path algorithm and by extending Belman's optimality principle, the existing labeling algorithms are improved, and the algorithms for the route planning of fire fighting vehicles in stochastic networks and stochastic time-varying networks are given respectively. Then the paper introduces the definition of adaptive routing strategy, determines the principles of fire vehicle navigation in the real-time forward process, and gives the specific algorithm. Finally, this paper selects the area in the center of Dalian as the research object, shows the running results of the algorithm, and analyzes the running speed of the algorithm. The results show that the objective function of this paper can well reflect the decision-making process of fire vehicle travel, and the solution algorithm can keep a faster running speed under the network scale of urban fire engine service area.
【学位授予单位】：大连理工大学
【学位级别】：硕士
【学位授予年份】：2015
【分类号】：U491

【共引文献】