CN110807287B - Construction method for dividing service grids in emergency repair point arrangement scene based on finite element grids - Google Patents
Construction method for dividing service grids in emergency repair point arrangement scene based on finite element grids Download PDFInfo
- Publication number
- CN110807287B CN110807287B CN201911072431.8A CN201911072431A CN110807287B CN 110807287 B CN110807287 B CN 110807287B CN 201911072431 A CN201911072431 A CN 201911072431A CN 110807287 B CN110807287 B CN 110807287B
- Authority
- CN
- China
- Prior art keywords
- intersection
- emergency repair
- grids
- time
- area
- 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.)
- Active
Links
Images
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention provides a construction method for dividing service grids in an emergency repair stationing scene based on finite element grids, which reasonably divides responsibility areas according to the emergency response time requirement of urban traffic conditions and provides stationing recommendation of each area according to the company property position; providing suggestions for emergency repair manpower and material resource allocation according to historical work order quantity of each region; and dynamically modifying the grid area range and the configuration of emergency repair resources according to the urban traffic condition and the work order quantity change condition along with the time.
Description
Technical Field
The invention relates to the field of finite element grids, in particular to a construction method for dividing service grids in an emergency repair point arrangement scene based on a finite element grid.
Background
In mathematics, Finite Element Method (FEM) is a numerical technique for approximating a solution to the problem of side values of partial differential equations. When solving, the whole problem area is decomposed, and each sub-area is divided into simple units, and the simple units are called finite elements. It minimizes the error function and produces a stable solution by a variational approach. By analogy with the idea of joining multiple segments of a small linear approximation circle, the finite element method comprises all possible methods that relate many simple equations over a small area called a finite element and use them to estimate complex equations over a larger area. It considers the solution domain as consisting of a number of small interconnected subdomains called finite elements, assuming a suitable (simpler) approximate solution for each element, and then deducing the overall satisfaction conditions (e.g. structural equilibrium conditions) for solving this domain, to arrive at a solution to the problem. This solution is not an exact solution, but an approximate solution, since the actual problem is replaced by a simpler one. Most practical problems are difficult to obtain accurate solutions, and finite elements not only have high calculation precision, but also can adapt to various complex shapes, so that the finite element becomes an effective engineering analysis means.
With the rapid development and popularization of computer technology, the finite element method is rapidly expanded from structural engineering strength analysis and calculation to almost all scientific and technical fields, and becomes a colorful, widely applied, practical and efficient numerical analysis method. Early finite element analysis studies focused on developing new efficient solution methods and high precision elements. With the gradual improvement of numerical analysis methods and the rapid development of computer operation speed, the time for solving operation of the whole computing system is less and less, and the problems of data preparation and operation result expression are increasingly prominent. The division of the mesh is an important link for establishing a finite element model, the problems are required to be considered, the required workload is large, and the divided mesh form has direct influence on the calculation precision and the calculation scale.
The power grid GIS platform is popularized and applied comprehensively, and various service departments realize the management of the functional position and the graph of the distribution network facility based on the spatial information by applying the power grid GIS platform, thereby effectively supporting the related service application.
In the power grid GIS platform, information such as a substation, a distribution network line, a meter and the like is constructed on an electronic map, so that a power distribution and power grid model integrating a substation line with a substation user is formed, spatial information is only used as background reference, and the power grid model is not specifically associated with the spatial information. Therefore, the power grid model for space management in the power grid GIS platform is mainly limited in management and presentation range only to the points and lines forming the power grid.
With the continuous deepening of the power grid GIS platform in service application and the lean management demand of services, the management demand of the services on the power grid GIS platform is not limited to the point and line management of a distribution network, and further the management of geographic space areas related to the point and line management, namely the grid management related to each service is provided. Although the power grid is composed of "points and lines" in the GIS platform, the influence is "one-sided", and therefore, management and application of grid-based grid in the power grid GIS need to be strengthened. Most of the services are divided into service grids according to respective service logics in a full-manual mode, basic division standards are lacked, the relevance among different service grids is poor, when the services are adjusted, the adjustment of the service grids is complex, the automation degree is low, and flexible and convenient adjustment cannot be achieved from the technical point of view. Therefore, it is necessary to study the technique of finite element meshing.
In order to reduce the influence of power accidents on the society, ensure that the emergency work of the power accidents is carried out efficiently and orderly, improve the emergency handling capacity of the power accidents, reduce the loss and the influence caused by the power accidents to the maximum extent, maintain the national safety, the social stability and the safety of lives and properties of people, and combine the local actual establishment of an emergency repair distribution point scheme, the emergency repair distribution point scheme is also an important work of grid management in the work of a power grid. At present, the electric power rush-repair partition area mainly determines the responsibility range of each rush-repair team through administrative division and manual partition, the partition basis cannot accurately meet the requirement of emergency response time, the partition cannot be automatically adjusted by referring to the change of urban traffic conditions, and the deployment of rush-repair resources cannot be automatically adjusted by analyzing the work order quantity.
The method for carrying out grid division and point recommendation and distribution on the emergency repair service based on the finite element grid division can more reasonably utilize the current emergency repair resources, and is superior to the current mode of manually dividing the emergency repair responsibility area. Meanwhile, scientific allocation suggestions can be provided for emergency repair manpower and materials by analyzing historical work orders. Therefore, research and design for emergency repair point arrangement scenes are necessary.
Disclosure of Invention
The invention provides a construction method for dividing service grids in an emergency repair point arrangement scene based on finite element grids, which can realize reasonable division of responsibility areas according to emergency response time requirements and urban traffic conditions and provide point arrangement recommendations of each area according to company property positions.
In order to achieve the technical effects, the technical scheme of the invention is as follows:
a construction method for dividing service grids in an emergency repair stationing scene based on finite element grids comprises the following steps:
s1: simulating a starting point and an end point of a path by using road intersections, presetting different road running speeds and intersection traffic light average traffic time length factors, calculating all arrival time of any two intersections, and screening the shortest arrival time of the path of any two intersections;
s2: calculating the polygonal geographic area covered by each intersection in the time range according to the emergency response time requirement;
s3: selecting polygonal geographic areas covered by the intersections with the minimum number according to intersections near a company property field, covering the whole test point geographic area, wherein the intersection corresponding to each polygonal geographic area is a point distribution recommendation area, and aggregating finite element grids contained in the intersection coverage area to generate an emergency repair service grid;
s4: recommending manpower and material resources to be deployed by an emergency repair team based on historical work order quantity in the coverage range of the emergency repair service grid;
s5: repeating the steps S1 to S4 to perform grid adjustment and resource allocation.
Further, the emergency response time in step S2 is a difference between the time of arrival at the site and the time of occurrence of the fault.
Furthermore, according to a threshold value of preset arrival time of the area where the end point crossing is located, all the end point crossings which can be reached when the time length is less than the threshold value are sequentially extracted from the starting point crossing, and the external coverage surfaces of the crossings form the coverage range of the starting point crossing.
Further, the division of the distribution point recommendation area and the emergency repair service grid includes the following steps:
1) selecting intersection combinations which are minimum in number at the 20-bit position before ranking and can completely cover the whole test point area after aggregating the coverage range from all the intersection combinations according to the coverage range;
2) selecting the intersection combination with the largest number of intersections with the distance from the company property to the company property, which is less than the threshold value, according to the position of the company property, and taking the peripheral range of the intersections as a recommended stationing area;
3) and dividing the coverage area intersection part of the distribution point intersection equally, and aggregating the finite element grids contained in the coverage area of the distribution point intersection to form a responsibility area of emergency rescue, namely a service grid.
Further, the specific operation of the step S4 is to collect historical work orders within a certain time, correspond the address of each work order to the geographic coordinate, count the historical work order amount and the occupied ratio included in each service grid, and adjust the emergency repair human material ratio of each grid according to the occupied ratio of the work orders in the grid.
Further, the calculation of all the arrival times of any two intersections adopts a time-first shortest path algorithm based on a weight directed graph, and the calculation of the polygonal geographic area covered by each intersection in the time range adopts an algorithm of splitting the test point area by the minimum number.
Further, the algorithm for splitting the test point region with the minimum number is a process that a plurality of known small regions are spliced to cover a large region.
Further, the calculation process of the weight in the time-first shortest path algorithm based on the weight directed graph is as follows:
wherein D represents the distance of the road section, S represents the preset average driving speed of the road section, and W represents the average waiting time of the traffic lights passing through the initial intersection of the road section.
Further, after the weighted values of all road sections are obtained through calculation, the following algorithm flow is adopted to obtain the optimal path between every two intersections:
1) dividing all nodes into two groups;
2) at the beginning, the first group only comprises the starting point, and the second group comprises the rest points;
3) and adding the nodes of the second group to the first group in the ascending order of the optimal path weight by using a greedy strategy until all the nodes which can be reached by the vertex v0 are contained in the first group. In the process, the optimal path is continuously updated, and the weight sum of the optimal path from the vertex v0 to each node in the first group is always kept to be not more than the weight sum from the vertex v0 to any node in the second group;
4) each node corresponds to a weight value, the weight corresponding to the first group of nodes is the optimal path weight sum from the v0 to the node, and the weight corresponding to the second group of nodes is the optimal path weight sum from the v0 to the node from the first group of nodes.
5) And until all the vertexes are scanned.
Further, all nodes are divided into two groups:
a first group: including nodes for which optimal paths have been determined;
second group: including nodes for which an optimal path has not yet been determined.
Compared with the prior art, the technical scheme of the invention has the beneficial effects that:
the method reasonably divides the responsibility areas according to the urban traffic conditions and the emergency response time requirements, and provides distribution recommendation of each area according to the company property position; providing suggestions for emergency repair manpower and material resource allocation according to historical work order quantity of each region; and dynamically modifying the grid area range and the configuration of emergency repair resources according to the urban traffic condition and the work order quantity change condition along with the time.
Drawings
FIG. 1 is a flow chart of an emergency repair stationing scene construction according to the present invention;
FIG. 2 is a flow chart of the least number split test point region algorithm of the present invention;
FIG. 3 is a schematic diagram of a time-first algorithm based on a weight directed graph;
FIG. 4 is an exemplary diagram of an XX minute coverage area at an intersection.
Detailed Description
The drawings are for illustrative purposes only and are not to be construed as limiting the patent;
for the purpose of better illustrating the embodiments, certain features of the drawings may be omitted, enlarged or reduced, and do not represent the size of an actual product;
it will be understood by those skilled in the art that certain well-known structures in the drawings and descriptions thereof may be omitted.
The technical solution of the present invention is further described below with reference to the accompanying drawings and examples.
As shown in fig. 1, a construction method for dividing service grids in an emergency repair point placement scene based on finite element grids includes the following steps:
the method comprises the following steps: simulating a starting point and an end point of a path by using the road intersections, presetting factors such as different road running speeds, intersection traffic light average passing time length and the like, calculating all reaching time of any two intersections, and screening the shortest reaching time of the paths of any two intersections;
in the scene, road intersections are used for simulating the starting point and the end point of a path, so that all road intersection data need to be extracted, whether each intersection comprises a traffic light and the road grade of 2 connected roads is identified by combining the traffic light data, and the following table data is generated:
| intersection ID | Whether there is traffic light | Connection road grade 1 | |
|
| 1 | Is free of | Highway with a light-emitting | High speedRoad | |
| 2 | Is provided with | Way of province | Way of |
|
| 3 | Is provided with | County road | Way of |
|
| 4 | Is provided with | Village and town road | County road | |
| … | … | … | … |
The scene relates to an optimal path planning algorithm, the road running speed and the crossing traffic light waiting time are important reference factors except for the path distance under the actual condition, the average running speed is preset for different roads with different grades in a test point area, the average passing time is preset for different crossings, and the setting table is as follows:
| road ID | Road grade | Preset speed |
| 1 | Highway with a light-emitting diode | 80 |
| 2 | Urban expressway | 60 |
| 3 | Village and town road | 40 |
| 4 | Village and town road | 30 |
| … | … | … |
The optimal path planning algorithm of the scene adopts a time-first principle to select the path which arrives the fastest. Factors that affect path planning include:
1) road driving direction (e.g. two-way road, one-way road)
2) Preset average driving speed of road
3) Average traffic duration at road traffic light intersection
The shortest path adopts a time-first algorithm based on a weight directed graph, the weight is set for the distance between each section of intersection in the following graph, the weight represents the time required by the path to the intersection, and the path with the minimum weight is taken as the shortest path by calculating the average driving time of the section and the average waiting time of traffic lights at the intersection.
The weight calculation formula of each intersection road segment (such as the road segment from the intersection V0 to the intersection V1 in fig. 3) is as follows:
in the formula, D represents the distance of the road section, S represents the preset average driving speed of the road section, and W represents the average waiting time of the traffic lights passing through the initial intersection of the road section.
After the weighted values of all road sections are obtained through calculation, the following algorithm flow is adopted to obtain the optimal path between every two intersections:
1. all nodes are divided into two groups:
a first group: including nodes for which optimal paths have been determined;
second group: including nodes for which an optimal path has not yet been determined.
2. Initially, the first group contains only the starting point and the second group contains the remaining points;
3. with a greedy strategy, the nodes of the second group are added to the first group in ascending order of optimal path weight until all nodes reachable by vertex v0 are included in the first group. In this process, the optimal path is continuously updated, and the sum of the weights of the optimal path from the vertex v0 to the nodes in the first group is always kept no greater than the sum of the weights from the vertex v0 to any node in the second group.
4. Each node corresponds to a weight value, the weight corresponding to the first group of nodes is the optimal path weight sum from the v0 to the node, and the weight corresponding to the second group of nodes is the optimal path weight sum from the v0 to the node from the first group of nodes.
5. Until all vertices are scanned (all nodes reachable by v0 are included in the first group), all optimal paths from v0 to other points are found.
Finally, the optimal path planning result between every two intersections is generated, and the table is as follows:
| intersection 1ID | Intersection 2ID | Path distance (km) | Time of arrival (min) |
| V0 | V2 | 10.5 | 20 |
| V0 | V1 | 4.8 | 11.5 |
| V1 | V7 | 22.1 | 40 |
| … | … | … | … |
Step two: calculating the polygonal geographic area covered by each intersection in the time range according to the emergency response time requirement;
the time length of emergency repair required by a power grid company to reach a site is the difference between the time of emergency repair team reaching the site and the time of failure occurrence, the time length of urban areas (A + and A) is 45 minutes, the time length of rural areas (B) is 90 minutes, all end point intersections which can be reached by the time length lower than the threshold value are sequentially extracted according to the preset arrival time threshold value of the area where the end point intersections are located, and the external coverage surfaces of the intersections form the coverage range of the start point intersection.
As can be seen from fig. 4, the boundary of the range is the connection line of all intersections reachable by XX minutes at the intersection, and the internal range is the coverage of the intersection.
Step three: selecting polygonal geographic areas covered by the intersections with the minimum number according to the intersections near the company property field, covering the whole test point geographic area, wherein the intersection corresponding to each polygonal geographic area is a point distribution recommendation area;
aggregating the finite element grids contained in the crossing coverage area to generate an emergency repair service grid;
since the point placement recommendations require a prioritization of company properties, a need exists to collect a list of company properties that are available for emergency response points placement and translate them into geographic coordinates.
The process of dividing the service grid and recommending the stationing area is as follows:
1) selecting intersection combinations which are minimum in quantity and can completely cover the whole test point area after aggregating the coverage range from the top 20 positions in the ranking according to the coverage range of the intersection combinations;
2) selecting the intersection combination with the largest number of intersections with the distance from the company property to the company property less than the threshold value according to the company property position, and taking the peripheral range of the intersections as a recommended stationing area;
3) and finally, dividing the coverage area intersection part of the distribution intersections equally, and aggregating the finite element grids contained in the coverage area of the distribution intersections to form a responsibility area of emergency rescue, namely a service grid.
Selecting a calculation mode of intersection combination as weight calculation, and according to the coverage area gap (the smaller the gap, the higher the weight), whether the property is nearby (the closer the property is, the higher the weight is), the number of intersections (the smaller the number of intersections which can cover the whole test point area, the higher the weight is), the calculation formula is as follows:
1) calculating the area weight score:
in the formula, TareaDenotes the area weight threshold, AmaxAnd AminThe intersection coverage area with the largest area and the intersection coverage area with the smallest area in the intersection combination are respectively represented, and the smaller the area difference, the higher the area weight score, and the lower the score.
2) And calculating the distance weight score with the company property:
in the formula, TdisRepresents a distance weight threshold, DiThe distance from the ith intersection to the nearest property is represented, and the weight score is higher as the recommended stationing intersection is closer to the property, and the weight score is lower if the recommended stationing intersection is closer to the property.
3) Calculating the recommended stationing quantity weight score:
in the formula, TnumAnd a quantity weight threshold is represented, N represents the quantity of recommended distribution points in the combination, and the weight score is higher when the quantity of the recommended distribution points is less, and the score is lower otherwise.
4) And (3) calculating the total weight score:
＝αarea+βdi+γnum
in the formula, alphaareaRepresents the area weight score, βdisRepresents a distance weight score, gamma, from the company propertynumAnd representing the weight scores of the recommended stationing quantity, wherein the total weight score is the sum of the three weight scores, the intersection combination with the highest total weight score is used as a final recommended stationing combination, and the coverage range of each intersection in the combination is used as a final emergency repair grid.
Step four: recommending the manpower and material resources to be deployed by the emergency repair team based on the historical work order quantity in the emergency repair service grid coverage range;
and collecting historical work orders within a certain time, corresponding the address of each work order to a geographic coordinate, counting the historical work order quantity and the occupied ratio of each service grid, and distributing the emergency repair manpower and material ratio of each grid according to the work order occupied ratio in the grid.
| Grid mesh | User quantity | Amount of work order | Staffing advice | Vehicle configuration advice |
| 1 | 80 ten thousand | 100 | 20 | 6 |
| 2 | 50 ten thousand | 70 | 15 | 4 |
| … | … | … | … | … |
Step five: and periodically repeating the first step to the fourth step to perform grid adjustment and resource allocation.
The same or similar reference numerals correspond to the same or similar parts;
the positional relationships depicted in the drawings are for illustrative purposes only and are not to be construed as limiting the present patent;
it should be understood that the above-described embodiments of the present invention are merely examples for clearly illustrating the present invention, and are not intended to limit the embodiments of the present invention. Other variations and modifications will be apparent to persons skilled in the art in light of the above description. And are neither required nor exhaustive of all embodiments. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present invention should be included in the protection scope of the claims of the present invention.
Claims (7)
1. A construction method for dividing service grids in an emergency repair stationing scene based on finite element grids is characterized by comprising the following steps:
s1: simulating a starting point and an end point of a path by using road intersections, presetting different road running speeds and intersection traffic light average traffic time length factors, calculating all arrival time of any two intersections, and screening the shortest arrival time of the path of any two intersections;
s2: calculating the polygonal geographic area covered by each intersection in the time range according to the emergency response time requirement;
s3: selecting polygonal geographic areas covered by the intersections with the minimum number according to intersections near a company property field, covering the whole test point geographic area, wherein the intersection corresponding to each polygonal geographic area is a point distribution recommendation area, and aggregating finite element grids contained in the intersection coverage area to generate an emergency repair service grid;
s4: recommending manpower and material resources to be deployed by an emergency repair team based on historical work order quantity in the coverage range of the emergency repair service grid;
s5: repeating the steps S1 to S4 to perform grid adjustment and resource allocation;
the emergency response time in the step S2 is a difference between the time of arrival at the site and the time of occurrence of the fault;
according to a threshold value of preset arrival time of an area where the end point crossing is located, sequentially extracting all end point crossings which can be reached when the time length is less than the threshold value from the starting point crossing, wherein the external coverage surfaces of the crossings form the coverage range of the starting point crossing;
the division of the distribution point recommendation area and the emergency repair service grid comprises the following steps:
1) selecting intersection combinations which are minimum in number at the 20-bit position before ranking and can completely cover the whole test point area after aggregating the coverage range from all the intersection combinations according to the coverage range;
2) selecting the intersection combination with the largest number of intersections with the distance from the company property to the company property less than the threshold value according to the company property position, and taking the peripheral range of the intersections as a recommended stationing area;
3) and dividing the coverage area intersection part of the distribution point intersection equally, and aggregating the finite element grids contained in the coverage area of the distribution point intersection to form a responsibility area of emergency rescue, namely a service grid.
2. The construction method for dividing the service grids in the emergency repair stationing scene based on the finite element grids according to claim 1, wherein the step S4 is specifically operated by collecting historical work orders within a certain time, corresponding the address of each work order to the geographic coordinate, counting the historical work order quantity and the occupied rate of each service grid, and adjusting the emergency repair manpower material and material ratio of each grid according to the occupied rate of the work orders in the grid.
3. The method for constructing the service grids in the emergency repair point placement scene based on the finite element grids according to any one of claims 1-2, wherein a time-first shortest path algorithm based on a weight directed graph is adopted for calculating all the reaching time of any two intersections, and an algorithm for splitting the test point regions by the minimum number is adopted for calculating the polygonal geographic region covered by each intersection in the time range.
4. The finite element grid-based construction method for dividing service grids in emergency repair point distribution scenes according to claim 3, wherein the algorithm for dividing the test point regions by the minimum number is a process of covering a large region by splicing a plurality of known small regions.
5. The method for constructing service grids in emergency repair point placement scenes based on finite element grids according to claim 4, wherein the calculation process of the weight in the time-first shortest path algorithm based on the weight directed graph is as follows:
wherein D represents the distance of the road section, S represents the preset average driving speed of the road section, and W represents the average waiting time of the traffic lights passing through the initial intersection of the road section.
6. The method for establishing the business grid division in the emergency repair stationing scene based on the finite element grid according to claim 5, wherein the optimal path between every two intersections is obtained by adopting the following algorithm flow after the weight values of all road sections are obtained through calculation:
1) dividing all nodes into two groups;
2) at the beginning, the first group only comprises the starting point, and the second group comprises the rest points;
3) adding the nodes of the second group to the first group in the ascending order of the optimal path weight by using a greedy strategy until all the nodes which can be reached by the vertex v0 are contained in the first group; in the process, the optimal path is continuously updated, and the weight sum of the optimal path from the vertex v0 to each node in the first group is always kept to be not more than the weight sum from the vertex v0 to any node in the second group;
4) each node corresponds to a weight value, the weight corresponding to the first group of nodes is the optimal path weight sum from the v0 to the node, and the weight corresponding to the second group of nodes is the optimal path weight sum from the v0 to the node from the first group of nodes;
5) and until all the vertexes are scanned.
7. The finite element mesh-based construction method for dividing service meshes in emergency repair stationing scenes according to claim 6, wherein all nodes are divided into two groups:
a first group: including nodes for which optimal paths have been determined;
second group: including nodes for which an optimal path has not yet been determined.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911072431.8A CN110807287B (en) | 2019-11-05 | 2019-11-05 | Construction method for dividing service grids in emergency repair point arrangement scene based on finite element grids |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911072431.8A CN110807287B (en) | 2019-11-05 | 2019-11-05 | Construction method for dividing service grids in emergency repair point arrangement scene based on finite element grids |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110807287A CN110807287A (en) | 2020-02-18 |
| CN110807287B true CN110807287B (en) | 2020-12-29 |
Family
ID=69501269
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911072431.8A Active CN110807287B (en) | 2019-11-05 | 2019-11-05 | Construction method for dividing service grids in emergency repair point arrangement scene based on finite element grids |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110807287B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112348367B (en) * | 2020-11-10 | 2024-05-28 | 魏垠 | Gridding digital city management method and system |
| CN113361945A (en) * | 2021-06-22 | 2021-09-07 | 珠海一粟科技有限公司 | Maintenance work order management method and system |
| CN115713325B (en) * | 2023-01-09 | 2023-04-18 | 佰聆数据股份有限公司 | Power line repair construction operation duration analysis method and device |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104678954A (en) * | 2015-01-23 | 2015-06-03 | 中国长江三峡集团公司 | Dam safety intelligent monitoring and pre-warning system based on full life circle and method thereof |
| CN109389825A (en) * | 2018-11-26 | 2019-02-26 | 武汉理工光科股份有限公司 | Fire-fighting and rescue route optimal method based on shortest path |
Family Cites Families (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104574214A (en) * | 2015-01-19 | 2015-04-29 | 国家电网公司 | Grid power distribution network emergency repair displaying method and system |
| CN104867357B (en) * | 2015-01-21 | 2017-03-01 | 中南大学 | Multiple no-manned plane scheduling and mission planning method towards Emergency Response to Earthquake |
| CN106326997A (en) * | 2015-06-26 | 2017-01-11 | 国网河南省电力公司周口供电公司 | Method for building GIS database for power repair under natural disasters |
| CN106022610A (en) * | 2016-05-20 | 2016-10-12 | 温州电力设计有限公司 | Typhoon prevention and resistance monitoring emergency method for electric power system |
| EP3501010B1 (en) * | 2016-08-19 | 2023-11-01 | Movidius Ltd. | Rendering operations using sparse volumetric data |
| CN106685074B (en) * | 2016-10-26 | 2019-07-16 | 珠海许继芝电网自动化有限公司 | A kind of electric command system of guarantor and method |
| CN109149565A (en) * | 2018-09-04 | 2019-01-04 | 周翔 | Electric integrated management-control method, system, server and storage medium |
| CN110288176A (en) * | 2019-05-09 | 2019-09-27 | 国网河南省电力公司郑州供电公司 | Distribution monitoring analysis and repairing maneuvering platform based on power grid GIS |
-
2019
- 2019-11-05 CN CN201911072431.8A patent/CN110807287B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104678954A (en) * | 2015-01-23 | 2015-06-03 | 中国长江三峡集团公司 | Dam safety intelligent monitoring and pre-warning system based on full life circle and method thereof |
| CN109389825A (en) * | 2018-11-26 | 2019-02-26 | 武汉理工光科股份有限公司 | Fire-fighting and rescue route optimal method based on shortest path |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110807287A (en) | 2020-02-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110807287B (en) | Construction method for dividing service grids in emergency repair point arrangement scene based on finite element grids | |
| CN109033718B (en) | Dynamic emergency evacuation method for urban rail transit line failure | |
| Liu et al. | Corridor-based emergency evacuation system for Washington, DC: system development and case study | |
| CN104809112B (en) | A kind of city bus development level integrated evaluating method based on multi-source data | |
| Yan et al. | An ant colony system-based hybrid algorithm for an emergency roadway repair time-space network flow problem | |
| CN107067163A (en) | A kind of breakdown maintenance work dispatching method and device | |
| CN112418532B (en) | Method, device, equipment and storage medium for planning inspection path of power transmission line | |
| Yang et al. | Online dispatching and routing model for emergency vehicles with area coverage constraints | |
| Gkiotsalitis | A model for modifying the public transport service patterns to account for the imposed COVID-19 capacity | |
| Ramachandran et al. | Framework for modeling urban restoration resilience time in the aftermath of an extreme event | |
| Wang et al. | Mixed-integer second-order cone programming model for bus route clustering problem | |
| CN107194541A (en) | A kind of power distribution network power supply zone method based on adaptive weighting Voronoi diagram | |
| Lyu et al. | Procedural modeling of urban layout: population, land use, and road network | |
| CN111008730B (en) | Crowd concentration prediction model construction method and device based on urban space structure | |
| Avella et al. | Resource constrained shortest path problems in path planning for fleet management | |
| Mali et al. | Enhanced routing in disaster management based on GIS | |
| Mahmud et al. | Facility location models development to maximize total service area | |
| Zilske et al. | Building a minimal traffic model from mobile phone data | |
| Raskar-Phule et al. | Vulnerability mapping for disaster assessment using ArcGIS tools and techniques for Mumbai City, India | |
| CN110442660A (en) | A kind of public transport network length calculation method for intelligent public transportation system | |
| Masłowski et al. | The method to compare cities to effective management of innovative solutions | |
| Zhao et al. | Vehicle route assignment optimization for emergency evacuation in a complex network | |
| Huang | A hierarchical process for optimizing bus stop distribution | |
| ABEDALI et al. | Traffic assignment model of Al-Amarah city | |
| Cipriani et al. | A Road Network Design Model for Large-Scale Urban Network |
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 |