CN105512169B - Method for searching shortest route based on path and power - Google Patents
Method for searching shortest route based on path and power Download PDFInfo
- Publication number
- CN105512169B CN105512169B CN201510790636.5A CN201510790636A CN105512169B CN 105512169 B CN105512169 B CN 105512169B CN 201510790636 A CN201510790636 A CN 201510790636A CN 105512169 B CN105512169 B CN 105512169B
- Authority
- CN
- China
- Prior art keywords
- path
- footpath
- polygon
- starting
- new
- 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
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/29—Geographical information databases
-
- 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
Abstract
The present invention is intended to provide a kind of method for searching shortest route based on path and power, comprises the following steps：1）The path length on every section of road is actual distance divided by weights；2）It is analysed to each bar road connection in region；3）Connection starting point and terminal obtain connecting line, obtain multiple initial path polygons；4）By multiple initial path polygonal meshes, outsourcing polygon is obtained；5）Using connecting line as boundary, the starting left footpath and starting right wing footpath of outsourcing polygon are obtained；6）The connecting line of 2 points of starting path correspondence is replaced with shorter line, search successively obtains new left footpath and new right wing footpath；7）If newly left footpath and new right wing footpath have overlapping, lap must be shortest path part, if new left footpath and new right wing footpath are underlapped, obtain final left footpath and final right wing footpath；8）Merge the middle polygon in final left footpath and final right wing footpath, obtain merging polygon；9) new left and right path common portion is merged with the result tried to achieve, obtains final shortest path.Search efficiency of the present invention and precision are high, can be in current major spatial data handling software desk Implementation.
Description
Technical field
The present invention relates to mathematics and computer science graphics field, and in particular to a kind of shortest path based on path and power is searched
Suo Fangfa.
Background technology
Shortest Path Searching is common Dijkstra algorithms (signal source shortest path), Floyd algorithms (interpolation point method), A
Star algorithms (heuristic shortest path first) etc., wherein foremost algorithm is Djikstra algorithms.This algorithm realizes base
In the adjacency matrix method of figure, it can not only find the shortest path of any two points, can also find some specified point and arrive
The shortest path on other all vertex.Although dijkstra's algorithm is simple, all paths in search range are needed, such as net interior nodes
Number is very big, then computational efficiency will drastically decline.The advantages of Floyd algorithms is to propose primary condition, avoids Dijkstra
Algorithm search improves a lot without purpose, search efficiency, but its assume initial path still with whole search range
Number of nodes is related, and still not high and final result is not necessarily shortest path to search efficiency.A Star algorithms are really that one kind opens
Hairdo is searched for, and the path exactly searched for every time using an evaluation function assessment, determines to select suitable valuation functions.So may be used
Greatly to optimize the route searching of common breadth First, but search for accuracy is influenced be subject to evaluation function, its result
It is not necessarily shortest path.
Although above method can realize Shortest Path Searching problem, have the disadvantage that and insufficient：1）Search efficiency
Low, search result is difficult to be equalized with efficiency；2）Complex disposal process, although algorithm is ripe, fails to combine spatial relationship
Lift search efficiency and accuracy rate；3）Road conditions are different, and current Shortest Path Searching Algorithm considers geometry shortest path more, very
Few dynamic according to road conditions real-time update shortest path and needs to search again for again in time.
The content of the invention
It is an object of the invention to provide a kind of method for searching shortest route based on path and power.The present invention will combine each
The advantages of kind algorithm, propose a kind of brand-new Shortest Path Searching Algorithm, Shortest Path Searching is expanded into surface layer, utilizes dotted line
The topological relation in face, realize it is being influenced from search range, weights, simple efficient shortest path can be adjusted according to road conditions
Search.
Technical scheme is as follows：The method for searching shortest route based on path and power of the present invention, including it is following
Step：
1）Different types of road is assigned to different weights first, the path length on every section of road is actual distance divided by power
Value；
2）Each bar road connection, space topology analyzing, by the Road structure face in region in region are analysed to again；
3）Straight line connects starting point and terminal obtains connecting line, and connecting line is looked into by the space of GIS platform
Ask function and carry out space querying analysis, obtain multiple initial path polygons with connecting line space intersection；
4）Obtained multiple initial path polygons are merged by GIS platform, obtain outsourcing polygon；
5）Using connecting line as boundary, direction is starting point to terminal, and starting left footpath and the starting for obtaining outsourcing polygon are right
Path, takes starting left footpath and starting right wing footpath as starting path；
6）It is subject to the starting path, since starting point, is examined in multiple initial path polygons, if starting path
The connecting line path length at middle starting point to terminal both ends is more than the path length of the line of another side in respective path polygon,
The connecting line of 2 points of starting path correspondence is replaced with shorter line, search successively obtains new left footpath and new right wing footpath；
7）Using new left footpath and new right wing footpath to start at,
71）If newly left footpath and new right wing footpath have overlapping, the common portion in new left and right path is lap, then overlapping portion
It must be shortest path part to divide；
72）, will using the crosspoint in new left footpath and new right wing footpath as cut-point if new left footpath and new right wing footpath are underlapped
In adjacent new left and right path polygon new left footpath and new right wing footpath pass through and with common edge polygonal meshes, weight
Multiple above step 6,7, obtains final left footpath and final right wing footpath；Merge the path that final left footpath and final right wing footpath include
Middle polygon, obtains merging polygon；It is subject to and merges polygon, tries to achieve most short left footpath between two adjacent cut-points and most
Short right wing footpath, the shortest path for taking short person to be obtained for search；
8）Judge whether it is dead end highway,
81）If not dead end highway, again by step 71）In new left and right path common portion and step 72）In search for
The shortest path arrived merges, and obtains final shortest path；
82）If dead end highway, by step 72）Middle obtained shortest path connection dead end highway of searching for is final shortest path
Footpath.
Above-mentioned steps 1) comprise the following steps：
11) different weights are assigned respectively according to different grades first by road；
12) physical length of every section of road is obtained；
13) length is divided by with weights, obtains the path length on every section of road.
Above-mentioned steps 2) comprise the following steps：
21) check that road connects Topology Error by GIS platform, it is ensured that every road correctly connects pass
System；
22) space topology analyzing is carried out by GIS platform, by the road topology structure face in region；
23) topological structure face mistake is checked by GIS platform, dead end highway such as occurs, be not involved in structure face；
24) polygon after the success of structure face should be sequentially connected, concurrent or common side；
If 25) there is the polygon that is not sequentially connected, mistake is checked, if there are mistake, repeat step 22), 23), 24)；
If 26) mistake is not present, path isolates the part that side must be shortest path, record between not connected polygon
The path isolates side.
Above-mentioned steps 3) comprise the following steps：
31) starting point and terminal are connected, obtains the connecting line of point-to-point transmission, is the theoretical beeline of point-to-point transmission；
32) it is subject to connecting line, there are the multiple of space intersection by GIS platform space querying and connecting line
Initial path polygon.
Above-mentioned steps 4) comprise the following steps：
41) inquire about to obtain multiple initial polygons by GIS platform inspection, will be polygon if being sequentially connected
Shape GIS platform merges, and obtains outsourcing polygon, enters step 5）；
If 42) in the presence of situation is not attached to, connected polygonal segment is merged by GIS platform, is transferred to
Step 43）；
43) the outsourcing polygon after record merges, if there are isolated line, which must be one of shortest path
Point.
Above-mentioned steps 5) comprise the following steps：
51) using connecting line as boundary, direction is terminal to starting point；
If 52) path polygon is not connected to, using isolated line as common portion, then left and right sideline is respectively connected with i.e. with isolated line
For left side bearing and right side bearing；
If 53) path polygon connects, the starting left footpath and starting right wing footpath of the outsourcing polygon are obtained, as starting
Path.
Above-mentioned steps 6) comprise the following steps：
61) it is subject to the starting path, since starting point, is examined in multiple initial path polygons, if starting road
The connecting line path length at footpath Zhong Gaiduan both ends is more than the path length of the line of another side in the polygon of path, the shorter company of use
Line replaces the connecting line that starting path corresponds at 2 points；
62) each path polygon is searched for successively, obtains new left footpath and new right wing footpath.
The method for searching shortest route of the present invention preferably uses the Shortest Path Searching environment of city complexity road conditions.This hair
It is bright by the way that the traditional algorithm of method for searching shortest route is expanded to space field, using spatial relationship and shortest path will
Ask, both realized the rapid of initial path and determined, searching algorithm it is scientific, and realize the efficient of search procedure efficiency
Change.This method can realize in major spatial data handling platform, have the principle simple, it is easy to accomplish, the characteristics of efficient stable,
Search efficiency and accuracy can be greatly promoted.
Brief description of the drawings
Fig. 1 is the flow diagram of method for searching shortest route of the present invention based on path and power；
Fig. 2 to Fig. 9 is the search procedure signal of method for searching shortest route embodiment of the present invention based on path and power
Figure..
Embodiment
The present invention is elaborated with reference to embodiment.
Embodiment 1
Method for searching shortest route of the present embodiment based on path and power, comprises the following steps：
The present embodiment city main city zone point-to-point transmission Shortest Path Searching, operation platform are the operations of Windows 7 system on PC
System, GIS Development platform is Beijing hypergraph geographical information platform software 5.3.3 versions.
For accurate definition concept, it is ensured that the correctness of language expression and realized easy to program, it is special that herein below is carried out
Illustrate and define：
Node：The characteristic point of road；
Degree：The bar number of node connecting line, it is for ordinary node to spend for 2, and degree is node more than 2；
Node：The intersection point of different roads；
Road：Natural road；
Path polygon：The region that all segmental arcs surround.
Four relations：Node be road characteristic point, both ends（Degree is more than 2）When, it is node.Closing on node line is
Segmental arc, the degree of node are more than 2.Segmental arc is the border of these polygons, and each segmental arc is for the common edge of two adjacent polygons
Spatial relationship is intersecting.
Comprise the following steps that：
1) different types of road is assigned to different weights first, the path length on every section of road is actual distance divided by power
Value；
2) each bar road connection in region is analysed to again, passes through the space topological of Beijing hypergraph geographical information platform software
Function is analyzed, the spatial data handling function structure by the Road in region by Beijing hypergraph geographical information platform software
Face；
3) starting point 1 shown in straight line connection figure 2 and terminal 2, pass through Beijing hypergraph geographical information platform software to connecting line 3
Space querying function carry out space querying analysis, obtain the initial path shown in multiple Fig. 2 of 3 space intersection of the connecting line
Polygon 4；
4), initial path polygon 4 is merged by Beijing hypergraph geographical information platform software, obtains the figure of the connecting line
Outsourcing polygon shown in 25；
5）It is boundary with connecting line 3 shown in Fig. 2, Fig. 2 starting points 2 are arrived in direction for Fig. 2 terminals 1, obtain Fig. 3 outsourcings polygon 1
Initial left footpath 6 and initial right wing footpath 7, take the initial left footpaths 6 of Fig. 3 and initial right wing footpath 7 as starting path；
6）It is subject to the starting path, since Fig. 2 starting points 1, is examined in the multiple path polygons 4 of Fig. 2, if starting road
The connecting line path length at footpath Zhong Gaiduan both ends is more than the path length of the line of another side in respective path polygon, and use is shorter
Line replace starting path to correspond to 2 points of connecting line, search successively obtains new left footpath 9 and new right wing footpath 10 shown in Fig. 4；
7）Started at new left footpath 9 and new right wing footpath 10 shown in Fig. 4, if new left footpath 9 and new right wing footpath 10 are overlapping, weighed
New left and right path common portion 11 shown in folded part Fig. 4 must be shortest path part, if new left footpath 9 and new right wing footpath 10 are not
It is overlapping, it is cut-point with the left and right path intersection point 15 shown in adjacent Fig. 5, passes through the new left footpath 9 of Beijing hypergraph and new right wing footpath
10 left and right path polygonal meshes passing through and with common edge, repeat above step 6,7, obtain final 13 He of left footpath
Final right wing footpath 14；
8）It is more to merge the polygon in final left footpath 13 and final right wing footpath 14, the merging obtained shown in Fig. 6 shown in Fig. 5
Side shape 16, tries to achieve the path of final left and right path 15 the right and lefts of intersection point shown in two adjacent Fig. 5, it is result to take short person；
9) by the spatial data handling function of Beijing hypergraph geographical information platform software, again by the new left side shown in Fig. 4
Right wing footpath common portion 11 merges with the result tried to achieve, and obtains final shortest path 19 shown in Fig. 8.
Above-mentioned steps 1 comprise the following steps：
11）First road is assigned to different weights P respectively according to different grades, it is secondary dry if major trunk roads weights are 1
Road is 0.8, branch 0.6；
12）Obtain the physical length L of every section of road；
13）Length and weights are divided by, obtain the path length L/P on every section of road；
Above-mentioned steps 2 comprise the following steps：
21）Check that road connects Topology Error by Beijing hypergraph geographical information platform software, to Topology Error
Path is checked, it is ensured that the correct connection relation of every road；
22) space line topology is carried out by Beijing hypergraph geographical information platform software, by the road topology structure face in region；
23）Topological structure face mistake is checked again by Beijing hypergraph geographical information platform software, dead end highway is such as occurred and is examined
The road of Topology Error is still remained after looking into, is not involved in structure face；
24）By Beijing hypergraph geographical information platform software structure face success after polygon should be sequentially connected, concurrent or
Side, spatial relationship are tangent between the face of face altogether；
25）If there is the polygon not being sequentially connected, mistake is checked, if there are mistake, repeat 22）、23）、24）；
26）If mistake is not present, isolated path 1 shown in path profile 9 must be shortest path between being not connected with polygon
A part, records the isolated line segment；
Above-mentioned steps 3）Comprise the following steps：
31）If terminal 2 is on dead end highway shown in starting point 1 shown in Fig. 2 or Fig. 2, by starting point 1 or terminal 2 along broken end
Road searches corresponding path polygon, and starting point 1 or terminal 2 are used as using the intersection point of dead end highway and path polygon；
32）Terminal 1 shown in starting point 1 shown in connection figure 2 and Fig. 2, obtains connecting line segment 3 shown in Fig. 2 of point-to-point transmission, is
The theoretical beeline of point-to-point transmission；
33）It is subject to connecting line segment, has space with connecting line by the inquiry of Beijing hypergraph geographical information platform software space
Multiple path polygons 4 shown in intersecting Fig. 2；
Above-mentioned steps 4 comprise the following steps：
41）The multiple path polygons 4 inquired about by Beijing hypergraph geographical information platform software space, if phase successively
Even, then polygonal meshes are obtained shown in Fig. 3 by the spatial data handling function of Beijing hypergraph geographical information platform software
Outsourcing polygon 5, enters step 5）；
If 42) in the presence of being not attached to situation, polygonal segment that will be connected by Beijing hypergraph geographical information platform software
Merging obtains the outsourcing polygon 5 shown in Fig. 3, is transferred to 43）；
43) isolated line 20 shown in line graph 9 between the outsourcing polygon after record merges, which must be shortest path
The part in footpath；
Above-mentioned steps 5 comprise the following steps：
51) it is boundary with connecting line 3 shown in Fig. 2, direction is terminal 2 shown in Fig. 2 to starting point 1 shown in Fig. 2, obtains Fig. 3 institutes
Show the initial left side bearing 6 and initial right side bearing 7 of outsourcing polygon 5；
52）If path polygon is not connected to, left side bearing 21 shown in Fig. 9 and right side bearing 22 are respectively connected with i.e. with isolated line 20
For initial left side bearing 6 and initial right side bearing 7；
53）It is starting path with initial left side bearing 6 and initial right side bearing 7, enters step 6；
Above-mentioned steps 6）Comprise the following steps：
61）It is subject to the starting path, from the off, is examined in multiple initial path polygons 4 shown in Fig. 2,
If the connecting line path length for originating path Zhong Gaiduan both ends is more than the path length of the line of another side in the polygon of path, use
Shorter line replaces the connecting line that starting path corresponds at 2 points；
62）Each path polygon is searched for successively, obtains new left footpath 9 and new right wing footpath 10 shown in new Fig. 4；
Above-mentioned steps 7）Comprise the following steps：
With new left footpath 9 shown in Fig. 4 and new right wing footpath 10 to start at, if there is overlay chart 4 in new left footpath 9 and new right wing footpath 10
Shown new left and right path common portion 11, then lap must be shortest path part；
71）If new left footpath 9 and new right wing footpath 10 are underlapped, to close on left and right path intersection point 15 shown in Fig. 5 for starting
Point, by the spatial data handling function of Beijing hypergraph geographical information platform software by adjacent, new left footpath 9 and new right wing footpath 10
Polygonal meshes passing through and with common edge；
72）Above step 6,7 is repeated, finally obtains the final left footpath 13 shown in Fig. 5 and final right wing footpath 14, it is final left
The intersection point in path 13 and final right wing footpath 14 is final left and right path intersection point 15；
Above-mentioned steps 8）Comprise the following steps：
81）Final left shown in Fig. 5 is merged by the spatial data handling ability of Beijing hypergraph geographical information platform software
Polygon in footpath 13 and final right wing footpath 14, obtains multiple merging polygons 16 shown in Fig. 6；
82）The most short left footpath 17 of the right and left and most short right wing footpath 18 between two adjacent cut-points are tried to achieve, shown in Fig. 7, is taken
Short person is result；
Above-mentioned steps 9 comprise the following steps：
91）If not being dead end highway, the new left and right path common portion 11 shown in Fig. 4 and the result tried to achieve are closed again
And obtain final shortest path 19 shown in Fig. 8；
92）If dead end highway, the shortest path connection dead end highway searched for is final shortest path.
Claims (7)
1. a kind of method for searching shortest route based on path and power, it is characterised in that comprise the following steps：
1）Different types of road is assigned to different weights first, the path length on every section of road is actual distance divided by weights；
2）Each bar road connection, space topology analyzing, by the Road structure face in region in region are analysed to again；
3）Straight line connects starting point and terminal obtains connecting line, the space querying work(for passing through GIS platform to connecting line
Space querying analysis can be carried out, obtains multiple initial path polygons with connecting line space intersection；
4）Obtained multiple initial path polygons are merged by GIS platform, obtain outsourcing polygon；
5）Using connecting line as boundary, direction is starting point to terminal, obtains the starting left footpath and starting right wing footpath of outsourcing polygon,
Starting left footpath and starting right wing footpath are taken as starting path；
6）It is subject to the starting path, since starting point, is examined in multiple initial path polygons, if is risen in starting path
Initial point to terminal both ends connecting line path length be more than respective path polygon in another side line path length, with compared with
Short line replaces the connecting line that starting path corresponds at 2 points, and search successively obtains new left footpath and new right wing footpath；
7）Using new left footpath and new right wing footpath to start at,
71）If newly left footpath and new right wing footpath have overlapping, the common portion in new left and right path is lap, then lap must
For shortest path part；
72）If new left footpath and new right wing footpath are underlapped, will be adjacent using the crosspoint in new left footpath and new right wing footpath as cut-point
New left and right path polygon in new left footpath and new right wing footpath pass through and the polygonal meshes with common edge, repeat with
Upper step 6,7, obtain final left footpath and final right wing footpath；Merge among the path that final left footpath and final right wing footpath include
Polygon, obtains merging polygon；It is subject to and merges polygon, tries to achieve the most short left footpath between two adjacent cut-points and the most short right side
Path, the shortest path for taking short person to be obtained for search；
8）Judge whether it is dead end highway,
81）If not dead end highway, again by step 71）In new left and right path common portion and step 72）It is middle to search for what is obtained
Shortest path merges, and obtains final shortest path；
82）If dead end highway, by step 72）Middle obtained shortest path connection dead end highway of searching for is final shortest path.
2. the method for searching shortest route according to claim 1 based on path and power, it is characterised in that above-mentioned steps 1)
Comprise the following steps：
11) different weights are assigned respectively according to different grades first by road；
12) physical length of every section of road is obtained；
13) length is divided by with weights, obtains the path length on every section of road.
3. the method for searching shortest route according to claim 1 based on path and power, it is characterised in that above-mentioned steps 2)
Comprise the following steps：
21) check that road connects Topology Error by GIS platform, it is ensured that the correct connection relation of every road；
22) space topology analyzing is carried out by GIS platform, by the road topology structure face in region；
23) topological structure face mistake is checked by GIS platform, dead end highway such as occurs, be not involved in structure face；
24) polygon after the success of structure face should be sequentially connected, concurrent or common side；
If 25) there is the polygon that is not sequentially connected, mistake is checked, if there are mistake, repeat step 22), 23), 24)；
If 26) mistake is not present, path isolates the part that side must be shortest path between not connected polygon, records the road
Footpath isolates side.
4. the method for searching shortest route according to claim 1 based on path and power, it is characterised in that above-mentioned steps 3)
Comprise the following steps：
31) starting point and terminal are connected, obtains the connecting line of point-to-point transmission, is the theoretical beeline of point-to-point transmission；
32) it is subject to connecting line, has the multiple initial of space intersection by GIS platform space querying and connecting line
Path polygon.
5. the method for searching shortest route according to claim 1 based on path and power, it is characterised in that above-mentioned steps 4)
Comprise the following steps：
41) inquire about to obtain multiple initial polygons by GIS platform inspection, if being sequentially connected, by polygon
Manage information system platform to merge, obtain outsourcing polygon, enter step 5）；
If 42) in the presence of situation is not attached to, connected polygonal segment is merged by GIS platform, is transferred to step
43）；
43) the outsourcing polygon after record merges, if there are isolated line, which must be a part for shortest path.
6. the method for searching shortest route according to claim 1 based on path and power, it is characterised in that above-mentioned steps 5)
Comprise the following steps：
51) using connecting line as boundary, direction is terminal to starting point；
If 52) path polygon is not connected to, using isolated line as common portion, then left and right sideline is respectively connected with as a left side with isolated line
Sideline and right side bearing；
If 53) path polygon connects, the starting left footpath and starting right wing footpath of the outsourcing polygon are obtained, as starting road
Footpath.
7. the method for searching shortest route according to claim 1 based on path and power, it is characterised in that above-mentioned steps 6)
Comprise the following steps：
61) it is subject to the starting path, since starting point, is examined in multiple initial path polygons, if in starting path
The connecting line path length at this section of both ends is more than the path length of the line of another side in the polygon of path, use shorter line generation
2 points of connecting line is corresponded to for starting path；
62) each path polygon is searched for successively, obtains new left footpath and new right wing footpath.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510790636.5A CN105512169B (en) | 2016-03-10 | 2016-03-10 | Method for searching shortest route based on path and power |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510790636.5A CN105512169B (en) | 2016-03-10 | 2016-03-10 | Method for searching shortest route based on path and power |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105512169A CN105512169A (en) | 2016-04-20 |
| CN105512169B true CN105512169B (en) | 2018-05-15 |
Family
ID=55720151
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510790636.5A Active CN105512169B (en) | 2016-03-10 | 2016-03-10 | Method for searching shortest route based on path and power |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105512169B (en) |
Families Citing this family (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108120444B (en) * | 2016-11-29 | 2020-05-08 | 高德信息技术有限公司 | Electronic map data processing method and device |
| CN107480804B (en) * | 2017-06-19 | 2020-04-14 | 广西回归线信息科技有限公司 | Maze solving method based on line-surface spatial relation |
| CN107423360B (en) * | 2017-06-19 | 2020-01-24 | 广东中冶地理信息股份有限公司 | Maze solving method based on path central line |
| CN107341633A (en) * | 2017-06-26 | 2017-11-10 | 海航创新科技研究有限公司 | Regulate and control the method and apparatus of logistics route |
| CN108170807B (en) * | 2017-12-28 | 2020-12-22 | 百度在线网络技术（北京）有限公司 | Map data processing method, map drawing method, map data processing device, map drawing device, map data processing equipment and storage medium |
| CN108628952B (en) * | 2018-04-03 | 2020-01-21 | 佛山市测绘地理信息研究院 | Road center line-based method and system for analyzing accessibility inside complex road |
| CN109783591B (en) * | 2018-12-29 | 2021-09-03 | 北京辰安科技股份有限公司 | Spatial data acquisition method and device based on Internet map |
| CN109858703B (en) * | 2019-02-15 | 2021-04-27 | 中国环境监测总站 | Method and system for acquiring shortest path of sampling |
| CN110263840B (en) * | 2019-06-13 | 2021-08-24 | 东软集团股份有限公司 | Line analysis method, device, program product and storage medium |
| CN110887502B (en) * | 2019-11-18 | 2020-09-04 | 广西华蓝岩土工程有限公司 | Must-pass node shortest path searching method |
| CN111461408B (en) * | 2020-03-10 | 2022-06-07 | 广东中达规谷地信科技有限公司 | Shortest path searching method, device and storage medium |
| CN111612257B (en) * | 2020-05-26 | 2023-05-02 | 广西北投公路建设投资集团有限公司 | Shortest path solving method based on space normalization |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20090040931A1 (en) * | 2007-08-10 | 2009-02-12 | Max-Planck-Gesellschaft Zur Forderung Der Wissenschaften E.V. | Method and device for determining the length of a shortest path in a network |
| CN103837154A (en) * | 2014-03-14 | 2014-06-04 | 北京工商大学 | Path planning method and system |
| CN104457775A (en) * | 2014-12-12 | 2015-03-25 | 北京航天宏图信息技术有限责任公司 | Path determination method and device, and navigation instrument |
-
2016
- 2016-03-10 CN CN201510790636.5A patent/CN105512169B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20090040931A1 (en) * | 2007-08-10 | 2009-02-12 | Max-Planck-Gesellschaft Zur Forderung Der Wissenschaften E.V. | Method and device for determining the length of a shortest path in a network |
| CN103837154A (en) * | 2014-03-14 | 2014-06-04 | 北京工商大学 | Path planning method and system |
| CN104457775A (en) * | 2014-12-12 | 2015-03-25 | 北京航天宏图信息技术有限责任公司 | Path determination method and device, and navigation instrument |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105512169A (en) | 2016-04-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105512169B (en) | Method for searching shortest route based on path and power | |
| US9322660B2 (en) | Incremental map generation, refinement and extension with GPS traces | |
| CN104266656B (en) | For the method for searching shortest route and device of road network | |
| CN110220521B (en) | High-precision map generation method and device | |
| Kolovou et al. | Road centre line simplification principles for angular segment analysis | |
| CN106961343A (en) | A kind of virtual map method and device | |
| CN110319845A (en) | For determining the methods, devices and systems of the reachable path between two o'clock | |
| CN107121146B (en) | Optimum path planning method based on road chain depth | |
| CN112765753A (en) | Novel public transport super network construction method | |
| Zhu et al. | Transportation routing map abstraction approach: Algorithm and numerical analysis | |
| CN112800161B (en) | Road network matching method and device, storage medium and electronic equipment | |
| CN109992593A (en) | A kind of large-scale data parallel query method based on subgraph match | |
| Kieler et al. | Matching river datasets of different scales | |
| CN112785082B (en) | Learning-based road network shortest path distance approximate calculation model training method and device | |
| CN112269845B (en) | Method for quickly matching electronic road map and bus route facing to different source data | |
| JP7173310B2 (en) | Route search device, route search method, and route search program | |
| Baum et al. | Scalable exact visualization of isocontours in road networks via minimum-link paths | |
| Kobitzsch | Alternative Route Techniques and their Applications to the Stochastics on-time Arrival Problem | |
| Stankutė et al. | An integrative approach to geospatial data fusion | |
| Chasserieau et al. | Design and use of Quetzal, an open-source Python library for transport modelling | |
| Shao et al. | Easiest-to-reach neighbor search | |
| Montesinos et al. | Modeling simplicity in drivers’ route choice behavior | |
| Baum et al. | Scalable Isocontour Visualization in Road Networks via Minimum-Link Paths | |
| Song et al. | Partitioning graphs to speed up point-to-point shortest path computations | |
| Zia et al. | A New Spatial Approach for Efficient Transformation of Equality-Generalized TSP to TSP |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |