CN117274004A - Primary school address selection method based on shortest path planning and space syntax - Google Patents
Primary school address selection method based on shortest path planning and space syntax Download PDFInfo
- Publication number
- CN117274004A CN117274004A CN202311542409.1A CN202311542409A CN117274004A CN 117274004 A CN117274004 A CN 117274004A CN 202311542409 A CN202311542409 A CN 202311542409A CN 117274004 A CN117274004 A CN 117274004A
- Authority
- CN
- China
- Prior art keywords
- point
- axis
- shortest path
- primary school
- school
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000010187 selection method Methods 0.000 title abstract description 7
- 230000010354 integration Effects 0.000 claims abstract description 51
- 238000004364 calculation method Methods 0.000 claims abstract description 21
- 238000000034 method Methods 0.000 claims description 45
- 238000010586 diagram Methods 0.000 claims description 21
- 238000010276 construction Methods 0.000 claims description 9
- 230000011218 segmentation Effects 0.000 claims description 7
- 239000002131 composite material Substances 0.000 claims description 5
- 230000007774 longterm Effects 0.000 claims description 4
- 241000283070 Equus zebra Species 0.000 claims description 3
- 238000013461 design Methods 0.000 description 2
- 101150070547 MAPT gene Proteins 0.000 description 1
- 230000006399 behavior Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000012937 correction Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000011156 evaluation Methods 0.000 description 1
- 238000003012 network analysis Methods 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 230000000007 visual effect Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/10—Services
- G06Q50/20—Education
- G06Q50/205—Education administration or guidance
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/10—Complex mathematical operations
- G06F17/18—Complex mathematical operations for evaluating statistical data, e.g. average values, frequency distributions, probability functions, regression analysis
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
- G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Strategic Management (AREA)
- Theoretical Computer Science (AREA)
- Human Resources & Organizations (AREA)
- Data Mining & Analysis (AREA)
- Tourism & Hospitality (AREA)
- Economics (AREA)
- Mathematical Analysis (AREA)
- Computational Mathematics (AREA)
- Marketing (AREA)
- General Business, Economics & Management (AREA)
- Mathematical Physics (AREA)
- Pure & Applied Mathematics (AREA)
- Mathematical Optimization (AREA)
- Educational Administration (AREA)
- Educational Technology (AREA)
- Operations Research (AREA)
- Bioinformatics & Computational Biology (AREA)
- Probability & Statistics with Applications (AREA)
- Bioinformatics & Cheminformatics (AREA)
- Primary Health Care (AREA)
- Quality & Reliability (AREA)
- Entrepreneurship & Innovation (AREA)
- Evolutionary Biology (AREA)
- Game Theory and Decision Science (AREA)
- Development Economics (AREA)
- Life Sciences & Earth Sciences (AREA)
- Health & Medical Sciences (AREA)
- Algebra (AREA)
- General Health & Medical Sciences (AREA)
- Databases & Information Systems (AREA)
- Software Systems (AREA)
- General Engineering & Computer Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
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
Technical Field
The invention relates to the technical field of computer aided planning and site selection, in particular to a primary school site selection method based on shortest path planning and space syntax.
Background
According to the primary and secondary school design specification (GB 50099-2011), the service radius of the town complete primary school is preferably 500m, so that the current primary school service area is mostly evaluated by taking 500m as the radius at present, and the planning primary school selection point is selected from the service uncovered area. However, this method does not take into account the actual situation of the pedestrian activity in different areas, and the scientificity and adaptability of the location scheme are 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.
To improve the scientificity and efficiency of primary school addressing, students have tried to use Dijkstra's algorithm, spatial syntax, P-barycenter equalization methods to conduct primary school addressing. The Dijkstra algorithm is a classical algorithm for shortest path planning, the original algorithm of which is only applicable to find the shortest path between two vertices. However, the method has certain limitation in the process of applying the method to primary school site selection: firstly, the optimal solution can only be generated in preset site selection points; secondly, only the shortest path of the space distance is used as a standard of primary school address selection, the 'man' factor is not considered, and the method is difficult to adapt to the multi-factor realistic requirement that primary school address selection needs to be considered.
Space syntax is a traditional network analysis method, in which the mentioned integration index can be used to measure the accessibility of urban roads and regions along the same. The space syntax is based on the principle of 'visual access', but cannot consider the travel characteristics of service population and people, which are the two most important elements in primary school address selection, and has limitation in application to primary school address selection. In addition, the traditional space syntax can only find the highest integration point in the area as a primary school address selection point, and has limitation when multiple primary schools need to be comprehensively selected.
Disclosure of Invention
In order to solve the defects of the prior art, the invention provides a primary school address selection method based on shortest path planning and space syntax, which is used for carrying out one-to-one matching on path correspondence between schools and residential communities, comprehensively calculating a plurality of primary school stage address selection schemes and evaluating a plurality of primary school address selection schemes in an area range.
The invention provides a primary school address selection method based on shortest path planning and space syntax, which is characterized by comprising 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 residential district to each residential district exit as starting point initial value R, and assigning pedestrian initial value 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 & exit O 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 sections, and the edge weight data E is the reciprocal of the comprehensive integration degree of the axis section AB;
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 1 Corresponding residential district access & exitO 1 Is the shortest path of (a)P(O 1 ,X 1 ) The process of (1) is as follows:
a. initially, let set s= {O 1 T=v-s= { remaining vertices };
if it isO 1 Can reach the vertex V, P #O 1 V) is the shortest path value;
if it isO 1 If it can not reach the vertex V, P #O 1 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 1 The distance to the point W is taken as the shortest path P #, the distance to the point W isO 1 ,W)；
c. Calculation pointO 1 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 1 ,X 1 ) I.e. from the startO 1 To schoolX 1 The shortest path value of (1) is obtained by the same methodP(O 2,3…j ,X 2,3…m )；
S8) comparison schoolX m Residential district access and exit within service rangeO j Shortest paths in corresponding relation groupP(X m ,O j ) And obtaining a primary school address selection scheme according to actual requirements.
Preferably, in step S4), the global integration map is generated with respect to the initial pedestrian integrationRQ 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.
Preferably, 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 。
Preferably, 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.
Preferably, 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 0 Coefficient of zebra stripes resistanceZ 1 Drag coefficient of three-dimensional traffic facilitiesZ 2 And 0 is<Z 2 <Z 1 <Z 0 <1。
Preferably, in step S3), the angle coefficientJAccording to the distance between adjacent axial segmentsAnd setting an included angle, and obtaining the included angle according to the parameter value or calculation within the actual setting range of 0-1.
Preferably, 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) 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.
Preferably, in step S5), the method for calculating the integrated integration degree of the axis segment AB is as follows: 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.
Preferably, the step of outputting the primary school address scheme in step S8) is:
calculating the shortest path value composite score of each primary candidate point:
；
sequentially calculatingP(O 1,2,…j ,X 2 )、P(O 1,2,…j ,X 3 )、…、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.
Preferably, the step of outputting the evaluation results of the multiple groups of primary school address selection schemes 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 2 )、P(O 1,2,…j ,X 3 )、…、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.
Compared with the prior art, the invention has the following advantages and beneficial effects:
(1) According to the invention, factors such as human behaviors, influence of environments on pedestrian paths and the like are quantified on the basis of the traditional space syntax, and the factors are incorporated into the calculation of the original integration degree;
(2) According to the invention, the travel characteristics and preference of people are simulated, and the factors influencing travel such as building shadow, forest shadow coverage condition, ground gradient and the like in the travel process are calculated, so that the factors are more close to the actual conditions of people;
(3) The method of the invention carries out scientific weighting on the paths in the Dijkstra algorithm, adopts the integration degree of the improved space syntax to replace the space distance as the edge weight value, and ensures that the calculation result of the Dijkstra algorithm is more scientific and accurate;
(4) According to the invention, primary school service radiuses are considered, a school service area is constructed, the corresponding relation between schools and residential communities is matched one by one, and a plurality of primary schools comprehensive optimal addresses and travel paths in the area range are comprehensively calculated.
Drawings
FIG. 1 is a schematic diagram of the overall network model structure of the method of the present invention;
FIG. 2 is a global axis diagram of a first embodiment;
FIG. 3 is a global integration map (local) according to the first embodiment;
FIG. 4 is a diagram of integrated integration (partial) in accordance with the first embodiment;
FIG. 5 is a plot of an alternative point profile for primary school in accordance with one embodiment;
FIG. 6 is a diagram of a middle-high-term addressing scheme in primary and middle schools according to an embodiment;
FIG. 7 is a diagram of a primary school addressing scheme in accordance with a second embodiment;
FIG. 8 is a diagram of a second primary school addressing scheme in accordance with the second embodiment;
FIG. 9 is a third illustration of a primary school addressing scheme in accordance with the second embodiment;
FIG. 10 is a schematic diagram of a correspondence set (scheme one) in the second embodiment;
FIG. 11 is a schematic diagram of a correspondence set (scheme II) in the second embodiment;
fig. 12 is a schematic diagram of a correspondence group in the second embodiment (scheme three);
fig. 13 is a schematic diagram of the shortest path in the second embodiment.
Detailed Description
The objects, technical solutions and advantages of the present invention will become more apparent by the following detailed description of the present invention with reference to the accompanying drawings. It should be understood that the description is only illustrative and is not intended to limit the scope of the invention.
Example 1
The invention provides a primary school address selection method based on shortest path planning and space syntax, which comprises the following steps:
s0) primary school candidate point preparation. The linear road network map of the target area is imported, the authorized administrative block, the current living place and the current primary school point coverage are input, 500m nearby the primary school is used as a buffer area, and blank places with the area larger than 2 hectares are extracted as primary school alternative points.
S1) constructing a basic model of a target area, marking the properties of each land block in a road grid area, and drawing a sidewalk in the target area, wherein the sidewalk comprises a common sidewalk, an overpass and an underground passage; each pavement is drawn as an axis, forming a global axis map.
In this embodiment, a certain area, namely a certain street, is selected as a target area, and the total scale of the target area is 18.8 square kilometers, wherein the residence land is 6.1 square kilometers, and the global axis diagram is shown in fig. 2.
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 residential district to each residential district exit as starting point initial value R, and assigning pedestrian initial value to each entrance pointRO j ，j=1,2,…,NThe number of residential district entrances and exits in the study area is shown.
S3) for each point on each axis of the global axis mapiCalculating the degree of integration based on this pointRQ 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.
Distance coefficientD、Coefficient of resistanceZAnd angle coefficientJA parameter value within 0 to 1, each representing an arbitrary pointiTo the entrance pointjThe distance parameter, the resistance parameter and the angle coefficient of the model (B), and the coefficients can be obtained through different level design parameter values or calculation according to actual requirements.
Specifically, the distance coefficientDThe calculation method comprises the following steps:
wherein x is any pointiTo the entrance pointjDistance sigma of (2) 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.
Coefficient of resistanceZSetting parameter values within 0-1 according to the actual distance, including the resistance coefficient of the common sidewalkZ 0 Coefficient of zebra stripes resistanceZ 1 Drag coefficient of three-dimensional traffic facilitiesZ 2 And 0 is<Z 2 <Z 1 <Z 0 <1。
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.
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 ) And generating a global integration map according to the integration value of each point on each axis on the global axis map.
Calculating a place vector by collecting street view pictures before generating a global integration mapT i As a correction of the degree of integration.
Location vectorT i The calculation method of (1) is as follows: by collecting street view photos, classifying road properties, and obtaining the place vector of each axis by means of weighted calculation or direct assignmentT i 。
T i Mainly consider whether the road is a building shade/boulevard, the ground gradient, etc. The building shade road/boulevard is interpreted through street view images, the ground gradient is judged to be obtained through repair rule data of roads, and assignment schemes in the embodiment are shown in the following table.
Obtaining the corrected axis integration degreeQ zi =RQ iN ×T i ，T i Is a place vector, willQ zi As an on-axis pointiA global integrism map (local) is generated as shown in fig. 3.
S5) calculating the comprehensive integration degree of the axis segments, dividing each axis of the global axis graph 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 Q of the axis segments AB AB 。
In this embodiment, the method for calculating the comprehensive integration degree of the axis segment AB includes: metric segmentation is carried out on the axis line segment AB with the starting point of A and the end point of B, namely, a segmentation point is taken every 1m until the first segmentation point is takeniCovering the point B when the point B is located; if the axis AB is notAn integer multiple of 1m, the distance from the last segment point to the point B is not necessarily 1m; 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. In this embodiment, the integrated map (local) is shown in fig. 4.
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,…Mthe method comprises the steps of carrying out a first treatment on the surface of the The primary candidate point profile is shown in fig. 5.
S7) application ofDijkstraAlgorithm, replacing the integration degree with the weight value of the corresponding path distance in Dijkstra algorithm to perform Dijkstra operation, and solving the schoolX m In-coverage and residential district access & exitO j Is the shortest path of the corresponding relationship group.
The method comprises the following specific steps:
let set g= { V, E };
wherein the vertex set V is the entrance and exit of residential districtO j School and schoolX m Set of axis segment intersections A, B, edge weight data e=；
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 1 Corresponding residential district access & exitO 1 Is the shortest path of (a)P(O 1 ,X 1 ) The process of (1) is as follows:
a. initially, let set s= {O 1 T=v-s= { remaining vertices };
if it isO 1 Can reach the vertex V, P #O 1 V) is the shortest path value;
if it isO 1 If it can not reach the vertex V, P #O 1 V) is infinity;
b. selecting one of the vertices in the set S from the set T, wherein the vertex has an associated edgeAdding the vertex W with the smallest weight value into the set S, and calculating the point at the momentO 1 The distance to the point W is taken as the shortest path P #, the distance to the point W isO 1 ,W)；
c. Calculation pointO 1 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 1 ,X 1 ) I.e. from the startO 1 To schoolX 1 The shortest path value of (1) is obtained by the same methodP(O 2,3…j ,X 2,3…m )。
S8) comparison schoolX m Residential district access and exit within service rangeO j Shortest paths in corresponding relation groupP(X m ,O j ) And obtaining a primary school address selection scheme according to actual requirements.
The embodiment adopts a comprehensive scoring ranking method to calculate the ranking of the primary school address points closest to the entrances and exits of the residential communities, and outputs a primary school address scheme according to the ranking condition. The specific method comprises the following steps:
calculating a shortest path value composite score for each primary candidate point
Sequentially calculateP(O 1,2,…j ,X 2 )、P(O 1,2,…j ,X 3 )、…、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 highest comprehensive score as a first primary school site selection point, and generating 12 primary school site selection schemes by using a knapsack algorithm; sorting from low to high according to the comprehensive scores, and taking the address points sorted into 1-4 as recent construction recommendation points of primary schools; 5-8 in ranking as mid-term construction recommended points of primary school; the ranking 9-12 are used as primary school long-term construction recommended points, and a primary school near-middle long-term site selection scheme diagram is shown in fig. 6.
Example two
The main difference between this embodiment and the first embodiment is that multiple groups of primary school addressing schemes can be evaluated.
In the embodiment, when the step S6) is executed to select the primary candidate points, a coverage scheme is generated first, a planning range is imported, and M groups of primary service area coverage schemes are generated by taking the actual travel distance of 500M of a pedestrian as a radius, wherein primary position meters are as followsX m I.e. covering the entire living land with a minimum number of primary schools.
In this embodiment, three sets of schemes are proposed for the target area, as shown in fig. 7, 8 and 9, respectively, where primary school addresses in the three sets of schemes can cover more than 90% of the residence land.
In the same primary school service area, matching a preselected school X and a residential district entrance O to construct a schoolX m And an entrance and an exitO j Schematic diagrams of the corresponding relation groups of the three groups of schemes are shown in fig. 10, 11 and 12 respectively.
By usingDijkstraAlgorithm finds all schoolsX m All residential district access & exit within service areaO j Reach schoolX m Shortest path value of (a)P(X m ,O j )。
Aiming at three groups of primary school address layout schemes, respectively calculating the average value of the shortest path value comprehensive scores of all primary school candidate points in each group of schemes as the comprehensive score value of the scheme, and taking the group with the smallest score as a recommended scheme, namely a scheme II; the primary candidate points corresponding to the scheme are output primary recommended points, and the shortest path schematic diagram (part) is shown in fig. 13.
What is not described in detail in this specification is prior art known to those skilled in the art.
Finally, it should be noted that the above-mentioned embodiments are only for illustrating the technical solution of the present patent and not for limiting the same, and although the present patent has been described in detail with reference to the preferred embodiments, it should be understood by those skilled in the art that the technical solution of the present patent may be modified or equivalently replaced without departing from the spirit and scope of the technical solution of the present patent, and all such embodiments are included in the scope of the claims of the present 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 1 Corresponding residential district access & exitO 1 Is the shortest path of (a)P(O 1 , X 1 ) The process of (1) is as follows:
a. initially, let set s= {O 1 T=v-s= { remaining vertices };
if it isO 1 Can reach the vertex V, P #O 1 V) is the shortest path value;
if it isO 1 If it can not reach the vertex V, P #O 1 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 1 The distance to the point W is taken as the shortest path P #, the distance to the point W isO 1 ,W)；
c. Calculation pointO 1 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 1 , X 1 ) I.e. from the startO 1 To schoolX 1 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 0 Coefficient of zebra stripes resistanceZ 1 Drag coefficient of three-dimensional traffic facilitiesZ 2 And 0 is<Z 2 <Z 1 <Z 0 <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) 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 2 )、P(O 1,2,…j , X 3 )、…、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 2 )、P(O 1,2,…j , X 3 )、…、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.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311542409.1A CN117274004B (en) | 2023-11-20 | 2023-11-20 | Primary school address selection method based on shortest path planning and space syntax |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311542409.1A CN117274004B (en) | 2023-11-20 | 2023-11-20 | Primary school address selection method based on shortest path planning and space syntax |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN117274004A true CN117274004A (en) | 2023-12-22 |
| CN117274004B CN117274004B (en) | 2024-02-27 |
Family
ID=89214626
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311542409.1A Active CN117274004B (en) | 2023-11-20 | 2023-11-20 | Primary school address selection method based on shortest path planning and space syntax |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117274004B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117540939A (en) * | 2024-01-10 | 2024-02-09 | 武汉市规划编审中心(武汉规划展示馆) | Square dance floor site selection method based on space syntax and vision field segmentation method |
Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105160089A (en) * | 2015-08-26 | 2015-12-16 | 华南理工大学 | Assisted planning and site selection method for network optimization based on space syntax |
| CN110378527A (en) * | 2019-07-16 | 2019-10-25 | 常州市卫生监督所 | A kind of water station site selecting method |
| CN110598921A (en) * | 2019-08-30 | 2019-12-20 | 泰华智慧产业集团股份有限公司 | Shortest path algorithm-based building project auxiliary site selection method and system |
| CN110648019A (en) * | 2019-09-04 | 2020-01-03 | 武汉市规划编制研究和展示中心 | Improved space syntax-based small-sized civil facility site selection method |
| CN112308313A (en) * | 2020-10-29 | 2021-02-02 | 中国城市规划设计研究院 | Method, device, medium and computer equipment for continuous point addressing of school |
| CN113407872A (en) * | 2021-06-28 | 2021-09-17 | 西华大学 | POI-based urban air traffic flight carrier take-off and landing point addressing method |
| KR102373276B1 (en) * | 2021-06-29 | 2022-03-18 | (주)아인스에스엔씨 | Apparatus and Method for selecting location of Public facilities based on bigdata |
| KR20220053982A (en) * | 2020-10-23 | 2022-05-02 | 이민수 | Method for recommanding educational institute based on artificial intelligence |
| CN114897228A (en) * | 2022-04-26 | 2022-08-12 | 南通大学 | Public facility layout inspection method based on population distribution and road network |
| CN116362439A (en) * | 2023-03-23 | 2023-06-30 | 贵州省山地资源研究所 | Global travel potential evaluation method based on highway space structure |
| CN116451931A (en) * | 2023-03-15 | 2023-07-18 | 山东科技大学 | Data processing method for public service facility site selection administrative management decision |
-
2023
- 2023-11-20 CN CN202311542409.1A patent/CN117274004B/en active Active
Patent Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105160089A (en) * | 2015-08-26 | 2015-12-16 | 华南理工大学 | Assisted planning and site selection method for network optimization based on space syntax |
| CN110378527A (en) * | 2019-07-16 | 2019-10-25 | 常州市卫生监督所 | A kind of water station site selecting method |
| CN110598921A (en) * | 2019-08-30 | 2019-12-20 | 泰华智慧产业集团股份有限公司 | Shortest path algorithm-based building project auxiliary site selection method and system |
| CN110648019A (en) * | 2019-09-04 | 2020-01-03 | 武汉市规划编制研究和展示中心 | Improved space syntax-based small-sized civil facility site selection method |
| KR20220053982A (en) * | 2020-10-23 | 2022-05-02 | 이민수 | Method for recommanding educational institute based on artificial intelligence |
| CN112308313A (en) * | 2020-10-29 | 2021-02-02 | 中国城市规划设计研究院 | Method, device, medium and computer equipment for continuous point addressing of school |
| CN113407872A (en) * | 2021-06-28 | 2021-09-17 | 西华大学 | POI-based urban air traffic flight carrier take-off and landing point addressing method |
| KR102373276B1 (en) * | 2021-06-29 | 2022-03-18 | (주)아인스에스엔씨 | Apparatus and Method for selecting location of Public facilities based on bigdata |
| CN114897228A (en) * | 2022-04-26 | 2022-08-12 | 南通大学 | Public facility layout inspection method based on population distribution and road network |
| CN116451931A (en) * | 2023-03-15 | 2023-07-18 | 山东科技大学 | Data processing method for public service facility site selection administrative management decision |
| CN116362439A (en) * | 2023-03-23 | 2023-06-30 | 贵州省山地资源研究所 | Global travel potential evaluation method based on highway space structure |
Non-Patent Citations (2)
| Title |
|---|
| 佟耕;李鹏飞;刘治国;胡毅军;: "GIS技术支持下的沈阳市中小学布局规划研究", 规划师, no. 1 * |
| 谢敏慧;石惠春;赵鹏霞;宋媛;: "基于路网交通的旅游景点可达性研究――以西北五省为例", 现代城市研究, no. 03 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117540939A (en) * | 2024-01-10 | 2024-02-09 | 武汉市规划编审中心(武汉规划展示馆) | Square dance floor site selection method based on space syntax and vision field segmentation method |
| CN117540939B (en) * | 2024-01-10 | 2024-04-09 | 武汉市规划编审中心(武汉规划展示馆) | Square dance floor site selection method based on space syntax and vision field segmentation method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN117274004B (en) | 2024-02-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108446470B (en) | Medical facility accessibility analysis method based on vehicle trajectory data and population distribution | |
| Hamdy et al. | Analyses the driving forces for urban growth by using IDRISI® Selva models Abouelreesh-Aswan as a case study | |
| CN117274004B (en) | Primary school address selection method based on shortest path planning and space syntax | |
| Burdziej | Using hexagonal grids and network analysis for spatial accessibility assessment in urban environments–a case study of public amenities in Toruń | |
| CN113011925A (en) | Business space quality evaluation method, system, device and medium based on big data | |
| Guyot et al. | The urban form of Brussels from the street perspective: The role of vegetation in the definition of the urban fabric | |
| Díaz-Pacheco et al. | The importance of scale in land use models: Experiments in data conversion, data resampling, resolution and neighborhood extent | |
| Zhao et al. | Deep CNN-based methods to evaluate neighborhood-scale urban valuation through street scenes perception | |
| Sabri et al. | A multi-dimensional analytics platform to support planning and design for liveable and sustainable urban environment | |
| CN110648019B (en) | Improved space syntax-based small-sized civil facility site selection method | |
| Boongaling et al. | Developing a street level walkability index in the Philippines using 3D photogrammetry modeling from drone surveys | |
| Godoy et al. | Modelling intra-urban dynamics in the Savassi neighbourhood, Belo Horizonte city, Brazil | |
| WO2024069268A1 (en) | Intelligent platform for designing and drawing construction plans based on data mining and artificial intelligence | |
| Gyenizse et al. | A multi-factor model developed on residents’ opinions for the classification of urban residential areas | |
| CN116307857A (en) | Built-up area environment evaluation method based on remote sensing image scene understanding | |
| Paciorek et al. | Microscopic simulation of pedestrian traffic in urban environment under epidemic conditions | |
| Yang et al. | An adaptive workflow to generate street network and amenity allocation for walkable neighborhood design | |
| Pérez et al. | Sustainable acoustics: A smart cities approach | |
| CN114202249A (en) | Community life circle public service facility space supply and demand balance model | |
| Khodnenko et al. | Walking distance estimation using multi-agent simulation of pedestrian flows | |
| CN114331232A (en) | Street space quality monitoring, evaluating and early warning method | |
| Koshkalda et al. | Estimation of Transport and Functional Convenience of Assessment Areas During the Regulatory Monetary Valuation of Land Plots In Cities | |
| Borhani et al. | Soft computing modelling of urban evolution: Tehran metropolis | |
| Abedini et al. | Land use compatibility assessment using a mdified TOPSIS model: A case study of elementary schools in Tehran | |
| Lin et al. | TRANSMISSION SUITABILITY ROUTE MAP USING THE LEAST COST PATH ANALYSIS (LCPA) |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |