基于紧急救援的加油站母站选址研究
发布时间：2019-01-13 10:15
【摘要】：加油站母站是为子站提供油品配送的服务设施,它所存储的成品油量较大,一旦发生事故,会严重危害周围居民的生命和财产安全,因此,加油站母站选址成为重要的研究问题。现有的加油站母站选址以总成本最小为目标进行建模与求解,仅考虑到加油站发生事故的风险成本没有考虑到加油站事故发生后的紧急救援及其产生的成本。针对以往不足,本文在考虑加油站母站建站成本和母站对子站运输成本的基础上,结合事故发生后的紧急救援以及由此产生的救援成本,研究基于紧急救援的加油站母站选址问题,考虑车辆行驶过程中是否遭遇堵塞的情形,建立模型并求解出选址方案,给加油站母站的选址提供依据。论文主要工作和成果如下。针对基于路径最短紧急救援的加油站母站选址问题,在路径不发生堵塞的情形下,车辆能够按照最短路径行驶,考虑事故发生后的紧急救援,以总成本即建站成本、运输成本及救援成本之和最小为目标,建立模型,设计近似算法A求解选址方案,其中,算法A的时间复杂性为o(m2n),m为母站备选点的个数,n为子站的个数,之后分析算法A的近似比。当各子站到母站的距离相差不大以及各救援点到母站的距离相差不大时,算法得到的近似比趋近于1。最后运用所建的模型和设计的算法对中石油湖北公司-武汉局部路网进行了实例分析。针对基于路径堵塞紧急救援的加油站母站选址问题,在路径发生突发性堵塞的情形下,车辆如果按照最短路径行驶,一旦最短路径上的关键边遭遇突发性堵塞,将会绕行非常大的距离。若不选择最短路径,而是选择抗堵塞路径行驶,虽然它比最短路径稍长一些,但即便遭遇堵塞,救援车辆绕行的距离也不是很长,还是能够在较短的时间内赶到事故地。因此在发生突发性堵塞的情形下,选择抗堵塞路径作为行驶路径,以总成本最小为目标建立模型并求解,在实际中可能发生2种情形：一类是救援过程中车辆沿着抗堵塞路径行走在最佳救援时间内能够抵达母站备选点实施救援,另一类是车辆沿着抗堵塞路径行走在最佳救援时间内也不能抵达母站备选点实施救援,这样就会产生一个比较大的成本,称之为额外成本。根据这2种情形设计近似算法CA求解选址方案,其中,算法的时间复杂性为o(m2n),m为母站备选点的个数,n为子站的个数,然后分析算法CA的近似比。当各子站到母站的抗堵塞路径的堵塞风险相差不大,单位距离救援成本与单位距离额外成本相差不大,各救援点到母站的抗堵塞路径的堵塞风险相差不大时,近似比趋近于1。最后运用所建的模型和设计的算法对中石油湖北公司-武汉局部路网进行了实例分析。
[Abstract]:The parent station of the gas station is a service facility that provides oil distribution for the sub-station. It stores a large amount of finished oil. Once an accident occurs, it will seriously endanger the lives and property safety of the surrounding residents. The location of gas station parent station has become an important research problem. The existing location of gas station mother station is modeled and solved with the goal of minimum total cost. Only considering the risk cost of gas station accident, the emergency rescue and its cost after gas station accident are not taken into account. In view of the shortcomings in the past, this paper, on the basis of considering the cost of building the parent station of the gas station and the transportation cost of the parent station to the sub-station, combined with the emergency rescue after the accident and the resulting rescue cost. In this paper, the problem of gas station mother station location based on emergency rescue is studied. Considering whether the vehicle is blocked or not, the model is established and the location scheme is solved, which provides the basis for the location selection of the gas station parent station. The main work and results are as follows. In view of the location problem of gas station parent station based on shortest path emergency rescue, the vehicle can travel according to the shortest path, consider the emergency rescue after the accident, and build the station cost at the total cost. The minimum sum of transportation cost and rescue cost is the goal. The model is built and the approximate algorithm A is designed. The time complexity of algorithm A is o (m2n), m is the number of parent stations, n is the number of substations), and the time complexity of algorithm A is o (m2n), m is the number of parent stations, n is the number of sub-stations). Then the approximate ratio of algorithm A is analyzed. When the distance from each sub-station to the parent station is small and the distance from each rescue point to the parent station is similar, the approximate ratio of the algorithm approaches to 1. Finally, the model and algorithm are used to analyze the local road network of PetroChina Hubei Company-Wuhan. In view of the location problem of gas station mother station based on path blockage and emergency rescue, if the vehicle follows the shortest path, once the critical side of the shortest path encounters the sudden jam, in the case of sudden congestion on the path, if the vehicle travels according to the shortest path, There will be a very long detour. If the shortest path is not chosen, but the anti-jam path is chosen, although it is a little longer than the shortest path, even if the traffic is blocked, the distance around the rescue vehicle is not very long, and it can reach the accident site in a relatively short time. Therefore, in the case of sudden blockage, the anti-blocking path is chosen as the driving path, and the model is established and solved with the goal of minimum total cost. In practice, there may be two situations: one is that during the rescue process, the vehicle can reach the alternative point of the parent station during the best rescue time along the anti-blocking path to carry out the rescue. The other is that the vehicle can not reach the alternative point of the parent station during the best rescue time along the anti-jam path, which will result in a relatively large cost, which is called extra cost. According to these two cases, the approximate algorithm CA is designed to solve the location selection scheme, where the time complexity of the algorithm is o (m2n), m is the number of parent station candidate points, n is the number of substations, and then the approximate ratio of the algorithm CA is analyzed. When the clogging risk of the anti-blocking path from each sub-station to the parent station is not different, the unit distance rescue cost and the unit distance extra cost are not different, and the clogging risk of the anti-blocking path from each rescue point to the parent station is not different, the approximate ratio approaches to 1. Finally, the model and algorithm are used to analyze the local road network of PetroChina Hubei Company-Wuhan.
【学位授予单位】：西安工业大学
【学位级别】：硕士
【学位授予年份】：2015
【分类号】：TE88
[Abstract]:The parent station of the gas station is a service facility that provides oil distribution for the sub-station. It stores a large amount of finished oil. Once an accident occurs, it will seriously endanger the lives and property safety of the surrounding residents. The location of gas station parent station has become an important research problem. The existing location of gas station mother station is modeled and solved with the goal of minimum total cost. Only considering the risk cost of gas station accident, the emergency rescue and its cost after gas station accident are not taken into account. In view of the shortcomings in the past, this paper, on the basis of considering the cost of building the parent station of the gas station and the transportation cost of the parent station to the sub-station, combined with the emergency rescue after the accident and the resulting rescue cost. In this paper, the problem of gas station mother station location based on emergency rescue is studied. Considering whether the vehicle is blocked or not, the model is established and the location scheme is solved, which provides the basis for the location selection of the gas station parent station. The main work and results are as follows. In view of the location problem of gas station parent station based on shortest path emergency rescue, the vehicle can travel according to the shortest path, consider the emergency rescue after the accident, and build the station cost at the total cost. The minimum sum of transportation cost and rescue cost is the goal. The model is built and the approximate algorithm A is designed. The time complexity of algorithm A is o (m2n), m is the number of parent stations, n is the number of substations), and the time complexity of algorithm A is o (m2n), m is the number of parent stations, n is the number of sub-stations). Then the approximate ratio of algorithm A is analyzed. When the distance from each sub-station to the parent station is small and the distance from each rescue point to the parent station is similar, the approximate ratio of the algorithm approaches to 1. Finally, the model and algorithm are used to analyze the local road network of PetroChina Hubei Company-Wuhan. In view of the location problem of gas station mother station based on path blockage and emergency rescue, if the vehicle follows the shortest path, once the critical side of the shortest path encounters the sudden jam, in the case of sudden congestion on the path, if the vehicle travels according to the shortest path, There will be a very long detour. If the shortest path is not chosen, but the anti-jam path is chosen, although it is a little longer than the shortest path, even if the traffic is blocked, the distance around the rescue vehicle is not very long, and it can reach the accident site in a relatively short time. Therefore, in the case of sudden blockage, the anti-blocking path is chosen as the driving path, and the model is established and solved with the goal of minimum total cost. In practice, there may be two situations: one is that during the rescue process, the vehicle can reach the alternative point of the parent station during the best rescue time along the anti-blocking path to carry out the rescue. The other is that the vehicle can not reach the alternative point of the parent station during the best rescue time along the anti-jam path, which will result in a relatively large cost, which is called extra cost. According to these two cases, the approximate algorithm CA is designed to solve the location selection scheme, where the time complexity of the algorithm is o (m2n), m is the number of parent station candidate points, n is the number of substations, and then the approximate ratio of the algorithm CA is analyzed. When the clogging risk of the anti-blocking path from each sub-station to the parent station is not different, the unit distance rescue cost and the unit distance extra cost are not different, and the clogging risk of the anti-blocking path from each rescue point to the parent station is not different, the approximate ratio approaches to 1. Finally, the model and algorithm are used to analyze the local road network of PetroChina Hubei Company-Wuhan.
【学位授予单位】：西安工业大学
【学位级别】：硕士
【学位授予年份】：2015
【分类号】：TE88
【参考文献】
相关期刊论文 前6条
1 张敏;杨超;杨s，
本文编号：2408345
本文链接：https://www.wllwen.com/kejilunwen/shiyounenyuanlunwen/2408345.html
