基于緊急救援的加油站母站選址研究
發(fā)布時間：2019-01-13 10:15
【摘要】：加油站母站是為子站提供油品配送的服務設施,它所存儲的成品油量較大,一旦發(fā)生事故,會嚴重危害周圍居民的生命和財產(chǎn)安全,因此,加油站母站選址成為重要的研究問題。現(xiàn)有的加油站母站選址以總成本最小為目標進行建模與求解,僅考慮到加油站發(fā)生事故的風險成本沒有考慮到加油站事故發(fā)生后的緊急救援及其產(chǎn)生的成本。針對以往不足,本文在考慮加油站母站建站成本和母站對子站運輸成本的基礎上,結(jié)合事故發(fā)生后的緊急救援以及由此產(chǎn)生的救援成本,研究基于緊急救援的加油站母站選址問題,考慮車輛行駛過程中是否遭遇堵塞的情形,建立模型并求解出選址方案,給加油站母站的選址提供依據(jù)。論文主要工作和成果如下。針對基于路徑最短緊急救援的加油站母站選址問題,在路徑不發(fā)生堵塞的情形下,車輛能夠按照最短路徑行駛,考慮事故發(fā)生后的緊急救援,以總成本即建站成本、運輸成本及救援成本之和最小為目標,建立模型,設計近似算法A求解選址方案,其中,算法A的時間復雜性為o(m2n),m為母站備選點的個數(shù),n為子站的個數(shù),之后分析算法A的近似比。當各子站到母站的距離相差不大以及各救援點到母站的距離相差不大時,算法得到的近似比趨近于1。最后運用所建的模型和設計的算法對中石油湖北公司-武漢局部路網(wǎng)進行了實例分析。針對基于路徑堵塞緊急救援的加油站母站選址問題,在路徑發(fā)生突發(fā)性堵塞的情形下,車輛如果按照最短路徑行駛,一旦最短路徑上的關鍵邊遭遇突發(fā)性堵塞,將會繞行非常大的距離。若不選擇最短路徑,而是選擇抗堵塞路徑行駛,雖然它比最短路徑稍長一些,但即便遭遇堵塞,救援車輛繞行的距離也不是很長,還是能夠在較短的時間內(nèi)趕到事故地。因此在發(fā)生突發(fā)性堵塞的情形下,選擇抗堵塞路徑作為行駛路徑,以總成本最小為目標建立模型并求解,在實際中可能發(fā)生2種情形：一類是救援過程中車輛沿著抗堵塞路徑行走在最佳救援時間內(nèi)能夠抵達母站備選點實施救援,另一類是車輛沿著抗堵塞路徑行走在最佳救援時間內(nèi)也不能抵達母站備選點實施救援,這樣就會產(chǎn)生一個比較大的成本,稱之為額外成本。根據(jù)這2種情形設計近似算法CA求解選址方案,其中,算法的時間復雜性為o(m2n),m為母站備選點的個數(shù),n為子站的個數(shù),然后分析算法CA的近似比。當各子站到母站的抗堵塞路徑的堵塞風險相差不大,單位距離救援成本與單位距離額外成本相差不大,各救援點到母站的抗堵塞路徑的堵塞風險相差不大時,近似比趨近于1。最后運用所建的模型和設計的算法對中石油湖北公司-武漢局部路網(wǎng)進行了實例分析。
[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.
【學位授予單位】：西安工業(yè)大學
【學位級別】：碩士
【學位授予年份】：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.
【學位授予單位】：西安工業(yè)大學
【學位級別】：碩士
【學位授予年份】：2015
【分類號】：TE88
【參考文獻】
相關期刊論文 前6條
1 張敏;楊超;楊s，
本文編號：2408345
本文鏈接：http://www.sikaile.net/kejilunwen/shiyounenyuanlunwen/2408345.html
教材專著
