CN117274004A - Primary school site selection method based on shortest path planning and space syntax - Google Patents

Abstract

The invention discloses a primary school address selection method based on shortest path planning and space syntax, which comprises the following steps: s1) constructing a basic model of a target area, and drawing a global axis map; s2) endowing the entrance and exit of each residential district with a pedestrian initial value; s3) calculating the integration degree of each point on the axis of the global axis map; s4) generating a global integration map; s5) calculating the comprehensive integration degree of the axial line segment; s6) selecting primary school candidate points; s7) solving the shortest path of the corresponding relation group between the school coverage area and the residential district entrance; s8) comparing the shortest paths, and obtaining the primary school address selection scheme according to actual requirements. The invention carries out scientific weighting on the paths in the Dijkstra algorithm, adopts the integration degree to replace the space distance as the path value, and has more scientific and accurate calculation result; meanwhile, the primary school service range is considered, the corresponding relations between schools and entrances and exits of residential communities are matched one by one, and a plurality of primary schools comprehensive optimal sites and travel paths are comprehensively calculated.

Description

Primary school site selection method based on shortest path planning and space syntax

Technical field

The invention relates to the technical field of computer-aided planning and site selection, and specifically relates to a primary school site selection method based on shortest path planning and space syntax.

Background technique

According to the "Design Code for Primary and Secondary Schools" (GB50099-2011), the service radius of a complete primary school in an urban area should be 500m. Therefore, most current primary school site selections use 500m as a radius to evaluate the current primary school service area, so as to select plans in areas not covered by services. Primary school selection. However, this method does not take into account the actual conditions of pedestrian activities in different areas, and the scientific nature and adaptability of its site selection plan need to be enhanced. Therefore, it is necessary to introduce more refined and quantitative research methods to improve the scientificity and rationality of primary school site selection.

In order to improve the scientificity and efficiency of primary school location selection, some scholars have tried to use quantitative methods such as Dijkstra algorithm, space syntax, and P-center of gravity method to select primary school locations. Dijkstra's algorithm is a classic algorithm for shortest path planning. Its original algorithm is only suitable for finding the shortest path between two vertices. However, it has certain limitations when applied to the primary school site selection process: first, its optimal solution can only be generated in preset site selection points; second, only the shortest path of spatial distance is used as the primary school site selection The standard does not take into account the "human" factor and is difficult to adapt to the practical requirements of primary school site selection, which requires consideration of multiple factors.

Space syntax is a traditional network analysis method, and the integration index mentioned in it can be used to measure the accessibility of urban roads and areas along them. Space syntax is based on the principle of "visible and accessible", but it cannot take into account the two most important factors in primary school location selection - the service population and people's travel characteristics, so it has limitations in its application in primary school location selection. In addition, traditional space syntax can only find the point with the highest degree of integration in the region as the primary school site selection point, which has limitations when comprehensive site selection of multiple primary schools is required.

Contents of the invention

In order to solve the above-mentioned shortcomings of the prior art, the present invention proposes a primary school site selection method based on shortest path planning and space syntax, which matches the path correspondence between the school and the residential area one by one, and comprehensively calculates the location within the area. Multiple primary school staging plans and evaluation of multiple primary school site plans.

The invention proposes a primary school site selection method based on shortest path planning and space syntax. Its special feature is that the method includes the following steps:

S1) Build a basic model of the target area, import the linear road network diagram of the target area, draw the pedestrian trails in the target area, and draw each pedestrian trail as an axis to form a global axis diagram;

S2) Take each entrance and exit of the residential area in the target area as the starting point O , allocate the total number of school-age children in the residential area equally to the exit of each residential area as the starting point initial value R, and assign each entrance and exit point an initial pedestrian value RO _j , j = 1,2,…, N , represents the number of entrances and exits of residential areas in the study area;

S3) For each point i on each axis of the global axis diagram, calculate the integration degree RQ _ij = RO _j × D × Z × J based on the entrance and exit of the residential area O _j , where D is the distance coefficient, Z is the resistance coefficient, and J is angle coefficient;

S4) Taking each axis on the global axis diagram as a path, iteratively calculate the initial pedestrian integration degree RQ _iN of the initial value distribution of all entrances and exits at point i on the axis, RQ _iN =Σ( Q _i1 + Q _i2 + Q _i3 +… …+ Q _iN ), generate a global integration graph based on the integration value of each point on each axis on the global axis graph;

S5) Calculate the comprehensive integration degree of the axis segment, divide each axis of the global axis diagram into several axis segments AB with the starting point A and the end point B according to the intersection points, and calculate the comprehensive integration degree of the axis segment AB;

S6) Selection of primary school alternative sites. Combined with the current planned residential land and approval information in the area, and the layout of NIMBY facilities, extract blank plots that meet the area size requirements as M primary school alternative sites, m =1,2,… M ;

_{S7 )} Use the Dijkstra _algorithm to find _the shortest path P (

Let the set G={V,E};

Among them, the vertex set V is the set of the entrance and exit of the residential area O _j , the school X _m , and the intersection points A and B of the axis segment, and the edge weight data E is the reciprocal of the comprehensive integration degree of the axis segment AB;

Define set S as the set of shortest path vertices that have been found, and set T as the set of shortest path vertices that have not yet been found;

The process of solving the shortest path P ( O ₁ , X _{1 )} of the residential area entrance and exit O ₁ corresponding to the school X 1 is:

a. Initially, let the set S={ O ₁ }, T=VS={the remaining vertices};

If O ₁ can reach the vertex V, then P( O ₁ ,V) is the shortest path value;

If O ₁ cannot reach the vertex V, then P( O ₁ ,V) is infinite;

b. Select a vertex W from the set T that has an edge associated with the vertex in the set S and has the smallest edge weight data E, and adds it to the set S. At this time, the distance from point O ₁ to point W is calculated as the shortest path P ( O ₁ ,W);

c. Calculate the distance value from point O ₁ to the remaining vertices in set T and modify it;

Repeat steps 2 and 3 above until set S contains all points in set V;

d . The shortest path P ( O ₁ , X ₁ ) is the shortest path value from the starting point O ₁ to the school X _1. In the same way, P ( O _{2,3 …j} ,

_S8 ) _{Compare the} shortest paths P ( _{_}

Preferably, in step S4), before generating the global integration map, the initial pedestrian integration degree RQ _iN is corrected to obtain the corrected axis integration degree Q _zi = RQ _iN × T _i , where T _i is the place vector, and Q _zi is taken as The final integration degree of point i on the axis generates a global integration degree map.

Preferably, the calculation method of _the place vector Ti is: by collecting street view photos, classifying the road properties according to the building-lined road/boulevard road and ground slope, and obtaining the place vector of each axis by weighted calculation or direct assignment. Ti _.

Preferably, in step S3), the distance coefficient D represents the distance parameter from any point i to the entrance and exit point j , and is set to a parameter value within 0 to 1 based on the actual distance or obtained by calculation.

Preferably, in step S3), the resistance coefficient Z represents the resistance parameter from any point i to the entrance and exit point j , and is set to a parameter value within 0~1 according to the actual distance, including the resistance coefficient Z ₀ of ordinary pedestrian paths and the resistance coefficient of zebra crossings Z ₁ , resistance coefficient of three-dimensional transportation facilities Z ₂ , and 0< Z ₂ < Z ₁ < Z ₀ <1.

Preferably, in step S3), the angle coefficient J is set according to the angle between adjacent axis segments, and is obtained by actual setting of a parameter value within 0 to 1 or calculation.

Preferably, the distance coefficient D is obtained by calculation, and the calculation method is:

In the formula, x is the distance from any point i to the entrance and exit point j , σ ² is the variance, and μ is the distance value at which the highest number of people is expected to attenuate. When x ≥ 500m, D = 0.

Preferably, in step S5), the comprehensive integration degree of the axis segment AB is calculated as follows: segment the axis segment AB with the starting point A and the end point B into metric segments, that is, a segmentation point is taken every 1m until the Point covers point B; calculate the integration degree of each segment point including AB on axis segment AB in turn, and take the median integration degree of all segment points as the comprehensive integration degree of axis segment AB.

Preferably, the step of outputting the primary school site selection plan in step S8) is:

Calculate the comprehensive score of the shortest path value for each primary school alternative point:

;

Calculate P ( O _1,2,…j , X ₂ ), P ( O _1,2,…j , X ₃ ),…, P ( O _{1,2,…j ,} As the first primary school site selection point, the knapsack algorithm is used to generate several primary school site selection plans; according to the comprehensive score from low to high, the site selection plans are divided into three groups, which are recommended points for the recent construction of primary schools, primary schools Recommended points for medium-term construction and recommended points for long-term construction of primary schools.

Preferably, the step of outputting the evaluation results of multiple groups of primary school site selection plans in step S8) is:

Calculate the comprehensive score of the shortest path value for each primary school alternative point:

,

Calculate P ( O _1,2,…j , X ₂ ), P ( O _1,2,…j , X ₃ ),…, P ( O _1,2,…j , X _m ) in sequence;

Three groups of primary school location layout plans are proposed for the target area, and the average of the comprehensive scores of the shortest path values of all primary school alternative points in each group of plans is calculated as the comprehensive score of the plan;

The plan with the smallest comprehensive score is used as the recommended plan, and the primary school alternative point corresponding to this plan is the output primary school recommended point.

Compared with the prior art, the present invention has the following advantages and beneficial effects:

(1) This invention quantifies factors such as human behavior and the impact of the environment on pedestrian paths based on traditional space syntax and incorporates them into the calculation of the original integration degree;

(2) By simulating people’s travel characteristics and preferences, this invention calculates the factors that affect travel such as building shade, tree shade coverage, and ground slope during travel, making it closer to the actual situation of pedestrians;

(3) The method of the present invention scientifically weights the paths in the Dijkstra algorithm, and uses the integration degree of the improved space syntax to replace the spatial distance as the edge weight, making the Dijkstra algorithm calculation results more scientific and accurate;

(4) This invention considers the service radius of primary schools, constructs school service areas, matches the corresponding relationships between schools and residential areas one by one, and comprehensively calculates the comprehensive optimal addresses and travel routes for multiple primary schools within the area.

Description of the drawings

Figure 1 is a schematic structural diagram of the overall network model of the method of the present invention;

Figure 2 is a global axis diagram in Embodiment 1;

Figure 3 is a global integration degree diagram (partial) in Embodiment 1;

Figure 4 is a comprehensive integration degree diagram (partial) in Embodiment 1;

Figure 5 is a distribution map of candidate points for primary and secondary schools in Embodiment 1;

Figure 6 is a diagram of the near, medium and long-term site selection plan for primary and secondary schools in Embodiment 1;

Figure 7 is a diagram of the primary and secondary school site selection plan in Embodiment 2;

Figure 8 is a diagram of the second primary and secondary school site selection plan in Embodiment 2;

Figure 9 is a diagram of the third primary and secondary school site selection plan in Embodiment 2;

Figure 10 is a schematic diagram of the correspondence relationship group in Embodiment 2 (Option 1);

Figure 11 is a schematic diagram of the correspondence relationship group in Embodiment 2 (Option 2);

Figure 12 is a schematic diagram of the correspondence relationship group in Embodiment 2 (Option 3);

Figure 13 is a schematic diagram of the shortest path in Embodiment 2.

Detailed ways

In order to make the purpose, technical solutions and advantages of the present invention more clear, the present invention will be further described in detail below with reference to the specific embodiments and the accompanying drawings. It should be understood that these descriptions are exemplary only and are not intended to limit the scope of the invention.

Embodiment 1

The present invention proposes a primary school site selection method based on shortest path planning and space syntax, which includes the following steps:

S0) Preparation of primary school alternative points. Import the linear road network map of the target area, enter the approved administrative permit land, current residential land, and current primary school point coverage, use 500m near the primary school as a buffer zone, and extract blank land with an area greater than 2 hectares as an alternative primary school site.

S1) Construct a basic model of the target area, mark the properties of each block in the road grid area, and draw pedestrian trails in the target area. The pedestrian trails include ordinary trails, overpasses, and underground passages; draw each pedestrian trail as an axis to form Global axis chart.

In this embodiment, a certain district - a certain street is selected as the target area. The total size of the target area is 18.8 square kilometers, of which 6.1 square kilometers are residential land. The global axis diagram is shown in Figure 2.

S2) Take each entrance and exit of the residential area in the target area as the starting point O , allocate the total number of school-age children in the residential area equally to the exit of each residential area as the starting point initial value R, and assign each entrance and exit point an initial pedestrian value RO _j , j = 1,2,…, N , represents the number of entrances and exits of residential areas in the study area.

S3) For each point i on each axis of the global axis diagram, calculate the integration degree RQ _ij = RO _j × D × Z × J based on this point, where D is the distance coefficient, Z is the resistance coefficient, and J is the angle coefficient.

The distance coefficient D, the resistance coefficient Z and the angle coefficient J are parameter values within 0~1, which respectively represent the distance parameter, resistance parameter and angle coefficient from any point i to the entrance and exit point j . These coefficients can be designed through different levels of parameter values, also It can be calculated based on actual needs.

Specifically, the distance coefficient D is calculated as:

In the formula, x is the distance from any point i to the entrance and exit point j , σ ² is the variance, and μ is the distance value at which the highest number of people is expected to attenuate. When x ≥ 500m, D = 0.

The resistance coefficient Z is set to a parameter value within 0~1 according to the actual distance, including the resistance coefficient Z ₀ of ordinary pedestrian paths, the resistance coefficient Z ₁ of zebra crossings, and the resistance coefficient Z ₂ of three-dimensional transportation facilities, and 0 < Z ₂ < Z ₁ < Z ₀ <1.

The angle coefficient J is set according to the angle between adjacent axis segments, and is obtained based on the actual parameter value within 0~1 or calculation.

S4) Taking each axis on the global axis diagram as a path, iteratively calculate the initial pedestrian integration degree RQ _iN of the initial value distribution of all entrances and exits at point i on the axis, RQ _iN =Σ( Q _i1 + Q _i2 + Q _i3 +… …+ Q _iN ), a global integration graph is generated based on the integration value of each point on each axis on the global axis graph.

Before generating the global integration map, the place vector Ti is calculated by collecting street view photos as _a correction for the integration.

The calculation method of place vector Ti is as follows: by _collecting street view photos, classifying road properties, and obtaining _the place vector Ti of each axis by weighted calculation or direct assignment.

T _i mainly considers whether the road is a building-shaded road/boulevard road, the ground slope, etc. Louyin Road/Lin-lined Road is interpreted through street view images, and the ground slope is determined through road repair data. The assignment scheme in this embodiment is as shown in the table below.

The corrected axis integration degree Q _zi = RQ _iN × T _i is obtained, where T _i is the site vector. Taking Q _zi as the final integration degree of point i on the axis, a global integration degree map (partial) is generated, as shown in Figure 3 .

S5) Calculate the comprehensive integration degree of the axis segment, divide each axis of the global axis diagram into several axis segments AB with the starting point A and the end point B according to the intersection point, and calculate the comprehensive integration degree Q _AB of the axis segment AB.

In this embodiment, the calculation method for the comprehensive integration degree of axis segment AB is: segment the axis segment AB with the starting point A and the end point B into metric segments, that is, a segmentation point is taken every 1m until the i- th point is obtained. when covering point B; if axis AB is not an integer multiple of 1m, the distance from the last segment point to point B does not have to be 1m; calculate the integration degree of each segment point including AB on axis segment AB in turn, and take The median integration degree of all segmentation points is the comprehensive integration degree of axis segment AB. The comprehensive integration degree diagram (partial) in this embodiment is shown in Figure 4.

S6) Selection of primary school alternative sites. Combined with the current planned residential land and approval information in the area, and the layout of NIMBY facilities, extract blank plots that meet the area size requirements as M primary school alternative sites, m =1,2,… M ;The distribution map of primary school candidate points is shown in Figure 5.

S7) Use the Dijkstra algorithm, replace the integration degree with the weight value of the corresponding path distance in the Dijkstra algorithm to perform the Dijkstra operation, and find the shortest path of the correspondence group between the school X _m coverage and the residential area entrance and exit O _j .

The specific steps are:

Let the set G={V,E};

Among them, the vertex set V is the set of the entrance and exit of the residential area O _j , the school X _m , and the axis segment intersection points A and B. The edge weight data E= ;

Define set S as the set of shortest path vertices that have been found, and set T as the set of shortest path vertices that have not yet been found;

The process of solving the shortest path P ( O ₁ , X _{1 )} of the residential area entrance and exit O ₁ corresponding to the school X 1 is:

a. Initially, let the set S={ O ₁ }, T=VS={the remaining vertices};

If O ₁ can reach the vertex V, then P( O ₁ ,V) is the shortest path value;

If O ₁ cannot reach the vertex V, then P( O ₁ ,V) is infinite;

b. Select a vertex W from the set T that has an associated edge with the vertex in the set S and has the smallest weight, and adds it to the set S. At this time, the distance from point O ₁ to point W is calculated as the shortest path P ( O ₁ ,W );

c. Calculate the distance value from point O ₁ to the remaining vertices in set T and modify it;

Repeat steps 2 and 3 above until set S contains all points in set V;

d . The shortest path P ( O ₁ , X ₁ ) is the shortest path value from the starting point O ₁ to the school X _1. In the same way, P ( O _{2,3 …j} ,

_S8 ) _{Compare the} shortest paths P ( _{_}

This embodiment uses the comprehensive score ranking method to calculate the ranking of primary school site selection points closest to the entrance and exit of each residential area, and outputs the primary school site selection plan based on the ranking. The specific methods are:

Calculate the comprehensive score of the shortest path value for each primary school alternative point

, calculate P ( O _1,2,…j , X ₂ ), P ( O _1,2,…j , X ₃ ),…, P ( O _{1,2,…j ,} The highest point is used as the first primary school site selection point. The knapsack algorithm is used to generate 12 primary school site selection plans. According to the comprehensive score from low to high, the site selection points ranked 1 to 4 are used as recommendations for the recent construction of primary schools. Points; those ranked 5 to 8 are recommended sites for mid-term construction of primary schools; those ranked 9 to 12 are recommended sites for long-term construction of primary schools. The short-term, mid-term and long-term site selection plan for primary schools is shown in Figure 6.

Embodiment 2

The main difference between this embodiment and Embodiment 1 is that multiple groups of primary school site selection plans can be evaluated.

In this embodiment, when performing step S6) to select the primary school alternative point, a coverage plan is first generated, the planning range is imported, and M groups of primary school service area coverage plans are generated using the actual travel distance of 500m for pedestrians as the radius, in which the location of the primary school is counted as X _m , That is, using a minimum number of primary schools to cover all residential land.

In this embodiment, three sets of plans are proposed for the target area, as shown in Figures 7, 8, and 9 respectively. The primary school locations in the three sets of plans can cover more than 90% of the residential land.

In the _same primary school service area, match the pre - _selected school .

Use Dijkstra's _algorithm to find the shortest path value P ( X _m , O _j ) from all entrances and exits O _j of residential areas within the service range _of all schools

For the three groups of primary school site selection and layout plans, the average of the comprehensive scores of the shortest path values of all primary school alternative points in each group of plans is calculated as the comprehensive score value of the plan, and the group with the smallest score is used as the recommended plan, that is, Plan 2 ; The primary school alternative point corresponding to this plan is the output primary school recommendation point. The shortest path diagram (partial) is shown in Figure 13.

Contents not described in detail in this specification belong to the prior art known to those skilled in the art.

Finally, it should be noted that the above specific embodiments are only used to illustrate the technical solution of this patent and not to limit it. Although this patent is described in detail with reference to the preferred embodiments, those of ordinary skill in the art should understand that the technical solution of this patent can be modified Modifications or equivalent substitutions without departing from the spirit and scope of the technical solution of this patent shall be covered by the claims of this patent.

Claims (10)

1. A primary school location method based on shortest path planning and space syntax is characterized in that: the method comprises the following steps:

s1) constructing a basic model of a target area, importing a linear road network diagram of the target area, drawing sidewalks in the target area, drawing each sidewalk as an axis, and forming a global axis diagram;

s2) taking the entrance and exit of each residential district in the target area as a starting pointOAverage allocation of the total amount of children suitable for the age of the residential district to the exit of each residential district as the initial value of the starting pointRA pedestrian initial value is given to each entrance pointRO _j ，j=1,2,…,NRepresenting the number of residential district entrances and exits in the study area;

s3) for each point on each axis of the global axis mapiCalculation is based on residential district access & exitO _j Is integrated with (a)RQ _ij = RO _j ×D×Z×JWherein, the method comprises the steps of, wherein,Dis a distance coefficient,ZIs a resistance coefficient,JIs an angle coefficient;

s4) taking each axis on the global axis diagram as a path, traversing and calculating the point on the axis where the initial values of the people flow at all the entrances and exits are distributediInitial human integration degree of (2)RQ _iN ，RQ _iN =Σ(Q _i1 + Q _i2 + Q _i3 +……+ Q _iN ) Generating a global integration map according to the integration value of each point on each axis on the global axis map;

s5) calculating the comprehensive integration degree of the axis segments, dividing each axis of the global axis map into a plurality of axis segments AB with a starting point A and a finishing point B according to the intersection points, and calculating the comprehensive integration degree of the axis segments AB;

s6) selecting primary school candidate points, combining with current living land planning and approval information in the area and combining with adjacent facilities layout, and extracting blank land blocks meeting the area and size requirements as primary school candidate pointsMThe number of the two-dimensional space-saving type,m =1,2,…M；

s7) application ofDijkstraAlgorithm for solving schoolX _m In-coverage and residential district access & exitO _j Shortest path of corresponding relation group of (a)P(X _m ,O _j ) The method comprises the following specific steps of:

let set g= { V, E };

wherein the vertex set V is the entrance and exit of residential districtO _j School and schoolX _m The collection of the intersection points A, B of the axis segments, and the edge weight data E is the reciprocal of the comprehensive integration degree of the axis segments;

defining a set S as a set with the shortest path vertexes already solved, and defining a set T as a set with the shortest path vertexes not yet solved;

solution and schoolX ₁ Corresponding residential district access & exitO ₁ Is the shortest path of (a)P(O ₁ , X ₁ ) The process of (1) is as follows:

a. initially, let set s= {O ₁ T=v-s= { remaining vertices };

if it isO ₁ Can reach the vertex V, P #O ₁ V) is the shortest path value;

if it isO ₁ If it can not reach the vertex V, P #O ₁ V) is infinity;

b. selecting a vertex W with the smallest edge weight data E from the set T, adding the vertex W to the set S, and calculating the point at the momentO ₁ The distance to the point W is taken as the shortest path P #, the distance to the point W isO ₁ ,W)；

c. Calculation pointO ₁ Modifying the distance values to the rest vertexes in the set T;

repeating the steps 2 and 3 until the set S contains all points in the set V;

d. shortest pathP(O ₁ , X ₁ ) I.e. from the startO ₁ To schoolX ₁ The shortest path value of (1) is obtained by the same methodP(O _2,3…j ,X _2,3…m )；

S8) comparison schoolX _m And service scopeResidential district access & exit in enclosingO _j Shortest paths in corresponding relation groupP(X _m ,O _j ) And obtaining a primary school address selection scheme according to actual requirements.

2. The primary school addressing method based on shortest path planning and space syntax according to claim 1, wherein: in step S4), the initial pedestrian integration degree is compared with the global integration degree mapRQ _iN Correcting to obtain the corrected axis integration degreeQ _zi =RQ _In ×T _i ，T _i Is a place vector, willQ _zi As an on-axis pointiAnd (3) generating a global integration map.

3. The primary school addressing method based on shortest path planning and space syntax according to claim 2, wherein: the location vectorT _i The calculation method of (1) is as follows: by collecting street view photos, road properties are classified according to building shadows/boulders and ground slopes, and the place vector of each axis is obtained by means of weighted calculation or direct assignmentT _i 。

4. The primary school addressing method based on shortest path planning and space syntax according to claim 1, wherein: in step S3), the distance coefficientDRepresenting arbitrary pointsiTo the entrance pointjSetting a parameter value within 0-1 according to the actual distance or calculating the parameter value.

5. The primary school addressing method based on shortest path planning and space syntax according to claim 1, wherein: in step S3), the drag coefficientZRepresenting arbitrary pointsiTo the entrance pointjSetting a parameter value within 0-1 according to the actual distance, including the resistance coefficient of a common sidewalkZ ₀ Coefficient of zebra stripes resistanceZ ₁ Drag coefficient of three-dimensional traffic facilitiesZ ₂ And 0 is<Z ₂ <Z ₁ <Z ₀ <1。

6. The primary school addressing method based on shortest path planning and space syntax according to claim 1, wherein: in step S3), the angle coefficientJAnd setting according to the included angle between the adjacent axis segments, and setting a parameter value within 0-1 according to actual setting or calculating to obtain the angle.

7. The primary school addressing method based on shortest path planning and space syntax according to claim 4, wherein: the distance coefficientDThe method is obtained through calculation, and the calculation method comprises the following steps:

wherein x is any pointiTo the entrance pointjDistance sigma of (2) ² For variance, μ is the distance value at which the highest number of people is expected to decay, d=0 when x is ≡500 m.

8. The primary school addressing method based on shortest path planning and space syntax according to claim 1, wherein: in step S5), the method for calculating the comprehensive integration degree of the axis line segment AB includes: metric segmentation is carried out on an axis segment AB with a starting point of A and an ending point of B, namely, a segmentation point is taken every 1m until the taken point covers the point B; and sequentially calculating the integration degree of each segment point including the axis segment AB, and taking the median value of the integration degree of all segment points as the integrated integration degree of the axis segment AB.

9. The primary school addressing method based on shortest path planning and space syntax according to claim 1, wherein: the step of outputting the primary school addressing scheme in the step S8) is as follows:

calculating a shortest path value composite score for each primary candidate point

；

Sequentially calculatingP(O _1,2,…j , X ₂ )、P(O _1,2,…j , X ₃ )、…、P(O _1,2,…j , X _m ) The method comprises the steps of carrying out a first treatment on the surface of the Taking the point with the lowest comprehensive score as a first primary school address point, and generating a plurality of primary school address schemes by using a knapsack algorithm; and sorting the site selection schemes into three groups according to the comprehensive scores from low to high, wherein the three groups are a near-term construction recommended point of primary school, a medium-term construction recommended point of primary school and a long-term construction recommended point of primary school in sequence.

10. The primary school addressing method based on shortest path planning and space syntax according to claim 1, wherein: the step of outputting the primary school addressing scheme in the step S8) is as follows:

calculating the shortest path value composite score of each primary candidate point:

，

sequentially calculatingP(O _1,2,…j , X ₂ )、P(O _1,2,…j , X ₃ )、…、P(O _1,2,…j , X _m )；

Three groups of primary school address layout schemes are provided for a target area, and the average value of the shortest path value comprehensive scores of all primary school candidate points in each group of schemes is calculated as the comprehensive score value of the scheme;

and taking the scheme with the smallest comprehensive score value as a recommended scheme, wherein the primary candidate points corresponding to the scheme are output primary recommended points.