Strategic Evaluation and Optimization of Clan Sides Based on Floyd Algorithm

: According to the Topsis method and the related data, this paper fully considers the parameters such as marching speed, equipment range, and air defense deployment of each node, thus obtaining a comprehensive evaluation of the strength value of each equipment and then effectively analyzes the results. Then, considering the preparation of the red and blue edges given, this paper combines the score of the node radius proportionally. Finally, the traffic network diagram is drawn through the specific geographic information. Based on the location and distance displayed on the map, this paper combines the coverage location and Floyd algorithm to find the best position and alternative position for both sides.


Introduction
In the current social context, both sides of the war must have effective war strategies to increase the threat of war and reduce the loss of war.At this time, knowledge of dynamic planning is particularly important.Through dynamic planning, a relatively stable and balanced war dynamic can be formed so that consensus can be reached and losses can be reduced [1].In the context of war, we consider the war relationship between the red camp and the blue camp.It is a common problem to model the attack and defense based on the military material of the two camps.On this basis, site selection is a hot topic in the military.

The Evaluation model based on entropy weight Topsis
In this paper, according to the principles of scientificity, importance, integrity, systematicity and practicality, the final selected indicators are marching speed, equipment range and grenade content to evaluate the attack difficulty indicators.

The theory of Topsis ideal solution
TOPSIS [2] is a commonly used comprehensive evaluation method within the group, which can make full use of the information of original data, and its results can accurately reflect the differences between evaluation schemes.The basic process is based on the normalized original data matrix.The cosine method is used to find out the best scheme and the worst scheme among the limited schemes,

The establishment of Evaluation model
Step 1: Forward processing of indicators Since the three factors considered in this question are all the bigger the better, there is no need to consider the forward process in the context of this question.
Step 2: Standardize the data Step 3: Determine the ideal solution Step 4: Calculation of index weight by entropy weight method [3] Step 5: Calculate European distance Step 6: Calculate the relative proximity to the optimal value [4]

The application of Floyd algorithm
The mathematical model of the Location Set Covering problem (LSCP) was first proposed by Toregas et al.Its goal is to determine the number of emergency service facilities or the minimum construction cost under the condition that all emergency points are covered, and configure these service facilities so that all emergency points can be covered.It is mainly used to solve the site selection problem of emergency service facilities such as fire stations and ambulances.
According to the node data given by the topic, we use Floyd algorithm to calculate the shortest distance between any node.Then, in order to facilitate us to select better command positions and alternative positions, we establish a location set coverage model and solve it.
It is known that the speed of the fastest UAV is 320km/h.We assume that the arrival speed of the incident is min.According to the calculation, the distance traveled by the UAV in 3min is 5.3 * 3=15.9km,so the coverage radius of the site should be 15.9km.We impose time constraints on its jurisdiction radius, which has the following expression: * 15.9 We get 18 optimal jurisdictional nodes, and then use the following model to optimize the jurisdictional area [5]...
This equation constraint indicates that 286 nodes of the red side must be under the jurisdiction of a certain service platform.For ij y , if 1 ij y  , it means that the jth node is under the jurisdiction of the ith service platform; otherwise, if 0 ij y  , it means that the jth node is not under the jurisdiction of the ith service platform.ij d represents the shortest distance between nodes.

The Solution ideas
First, we combine the related data according to the Topsis method and fully consider the marching speed, equipment range and air defence deployment of each node to obtain a comprehensive evaluation, that is, the force value evaluation of each equipment.Then consider the equipment preparation materials of the red and blue sides given in the question stem, and adjust them in proportion to the score obtained in combination with the radius of the node.That is, the larger the radius shown on the map, the more difficult it is to attack that node.The more sophisticated the equipments used, the higher the force value at the node.Finally, the network map is drawn according to the geographical information given.According to the location and distance shown on the map, we combine the coverage location and the Floyd algorithm to find the best location and alternative location for both sides.

Process and Result analysis
On this basis, this paper constructs the red and blue camps and the corresponding transportation network diagram, as shown in Figure 2: By consulting the information given in the data and topics, we will summarize the data as shown in Table 1 and Table 2 1782km/h=495m/s 13.25km 160mm Among them, we found that the walking speed of an ordinary infantry was 5.43km/h, and the flying speed of the UAV was 120km/h.For the convenience of calculation, we also inquired about the approximate travel range and ammunition of infantry and UAV.The calculation results are shown below.In addition, we believe that the faster the travel speed is, the wider the maximum range is, and the more equipments are equipped, the higher the comprehensive force value will be.
Red square: The normalized decision matrix is calculated as follows: 0 Based on the attack radius data given in the question, we analyze the force distribution and get the formula as follows: Formulas for Calculating the Distribution of Different Types of Equipments: Where, num represents the upper limit of armaments of the Red Party, K represents the armament coefficient corresponding to num obtained from the previous question.
The red and blue sides attack 436 camps, including 268 for the red side and 168 for the blue side.This is shown in Table 3: Based on the attack radius data given in the question, we analyze the force distribution and get the formula as follows: Formulas for Calculating the Distribution of Different Types of Equipments:

The operation of the Floyd algorithm
Floyd algorithm, also known as interpolation method, is an algorithm that uses the idea of dynamic programming to find the shortest path between multiple source points in a given weighted graph, similar to Dijkstra algorithm [6].The execution of the algorithm will find the length (weighted) of the shortest path between all nodes.Assume that the adjacency matrix 0

A
of graph G weight is as follows: is the shortest path value between vertices, and its pseudo code is shown in Table 5: The best command position and alternative position determined by the Red Party are: 3,8,30,36,39,63,118,147,151,154,162,171,183,193,214,215,232,263.The best command position and alternative position determined by the Blue Party are: 276,287,290,296,297,298,299,302,303,304,305,309,316,318,319,325,331,333,339,356,357,366, 367,369,387,393,397,398,406,408,425,427,428,433,435.The command positions of the Red Party and the corresponding jurisdictional nodes are listed in Table 6:

Conclusions
Focusing on the strategies of the two corps in the military exercises or combat, this paper establishes the Topsis assessment model by screening and pre-processing the specific data of the armaments of the red and blue corps and combining with the search of relevant information to obtain the score of the strength value of each equipment.On this basis, this paper determines the optimal command position and a number of alternative positions for both legions using the Freudian shortest distance algorithm according to the attack difficulty and marching distance of different nodes.The results show that the red legion has 18 better options at nodes 3~263, while the blue legion has more deployable positions at 276~435.However, the actual situation may be more complex, and based on this consideration, a dynamic planning model can be further established.The model should establish state transfer equations based on the changes in the battle situation and the material situation, and give full consideration to the possible offensive strategies adopted by the other side, so as to provide a specific program for the distribution and supply of medical materials and living supplies for the red and blue armies.In addition, the model can be applied to other areas such as business and sports competitions in the future by improving it in order to develop sound competitive strategies.

Figure 1 :
Figure 1: Flow Chart of Topsis Method in General

Figure 2 :
Figure 2: Red and blue camp

Table 5 :
Floyd pseudocode Algorithm 1 Floyd algorithm a) initialization: D[u,v]=A[u,v] b)For k:=1 to n For i:=1 to n For j:=1 to n If D[i,j]>D[i,k]+D[k,j] Then D[i,j]:=D[i,k]+D[k,j]; c) The end of the algorithm: D is the shortest path matrix of all point pairs

Table 2 :
Blue Party's war readiness

Table 3 :
Red Force Deployment

Table 4
describes the concrete blue force deployment strategy:

Table 6 :
Red Party Command Location and Corresponding Jurisdiction Nodes