Defense resource allocation in road dangerous goods transportation network: A Self-Contained Girvan-Newman Algorithm and Mean Variance Model combined approach

A Self-Contained Girvan-Newman Algorithm and Mean Variance Model combined approach is proposed to allocate the defense resource in road dangerous goods transportation network. Firstly, the weighted physical network without direction and its weighted service network with direction are established. The Self-Contained Girvan-Newman Algorithm is applied to separate the whole weighted physical network into several communities. Next, based on the service network, the covariance matrix of each separated community is established, the Mean Variance Model is used to allocate the defense resource for each community, which focuses on selecting the option with the lowest probability of loss caused by the dangerous goods transportation accident/risk. The case study is conducted by using the road network and the dangerous goods transportation volume of Dalian, China as the background. When the whole network is separated into 6 communities, the defense resource capability in the whole network is the best. The Power Function Allocation Model (PFAM) is applied as the comparison approach, the overall rescue capability of the network is defined and applied to evaluate the defense resource allocation schemes. The results show that, the approach proposed in this paper has better effectiveness than PFAM, especially when the whole network is separated into 6 communities.

Automated summary

This study introduces a method that combines a self-contained Girvan-Newman algorithm with a mean variance model for allocating defense resources in a dangerous goods transportation network. By dividing the entire network into different communities and allocating resources based on the covariance matrix of each community using the mean variance model, a more effective defense resource allocation is achieved.