CN1684074A - Optimum path selecting method between arbitrary buildings based on city road net structure - Google Patents
Optimum path selecting method between arbitrary buildings based on city road net structure Download PDFInfo
- Publication number
- CN1684074A CN1684074A CN 200410017666 CN200410017666A CN1684074A CN 1684074 A CN1684074 A CN 1684074A CN 200410017666 CN200410017666 CN 200410017666 CN 200410017666 A CN200410017666 A CN 200410017666A CN 1684074 A CN1684074 A CN 1684074A
- Authority
- CN
- China
- Prior art keywords
- node
- city
- road network
- building
- path
- 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.)
- Pending
Links
Abstract
The method of selecting optimal path between two buildings based on city road net structure includes: establishing the topologic structure of city road net; establishing node map layer of road cross points; calculating in Dijkstra algorithm to find all the shortest path between nodes and writing into V database; coding city buildings geographically for spatial locating; searching the initial node Ss and final node St of the initial road section according to the initial site S; searching the initial node Ts and final node Tt of the final road section according to the final site T; sorting and calculating with the four values to find out the shortest path W between S and T W [S, T]=min{V[Ss, Ts], V[Ss, Tt], V[St, Ts], V[St, Tt]}. The present invention converts the optimal path inquiring and calculation process into inquiring process by means of database intermediate technology, and realizes the optimal path inquiry by means of network topologic structure of geographic information system.
Description
Technical field
The present invention relates to a kind of urban transportation optimal path inquiry, city logistics etc. of can be applicable to, based on any point-to-point transmission optimal route selection method of city road network structure.
Background technology
Both at home and abroad for all having used opening, proven technique, mainly be presented as at present based on optimal path algorithm between the road network node of Geographic Information System:
1. set up the city road network topological structure;
2. select the optimal path between the direct computing node of optimal path algorithm, with the distance is that the computing that parameter is carried out is called shortest path, the computing that the combining road condition resistance model carries out then is called optimal path, no matter is which kind of title, and its core algorithm is based on the shortest path first of digraph structure.
In addition, can realize very easily, but consider as yet for algorithm any 2 between any buildings by Geographic Information System (GIS) software for the space orientation of City Building.
Hereinafter will carry out classified description to these background technologies:
2.1 Dijkstra (Di Jiesitela) algorithm
Shortest route problem can be divided into two kinds of single source shortest route problem and full source shortest route problems.Wherein single source shortest route problem has more universal significance, and can provide good reference scheme for full source shortest path.The algorithm of single source shortest route problem has a variety of, from the early stage depth-first search algorithm based on restrictive condition, based on the dynamic programming of directed acyclic graph, based on the dijkstra's algorithm of adjacency matrix, to maximal correlation limit method, maximal correlation point method, the dijkstra's algorithm based on adjacency list, A
*Algorithm, based on the oval searching algorithm of the depth-first of hypergraphic-based data structure etc.Wherein, adopting greed and inspiring the dijkstra's algorithm of strategy is the most perfect algorithm in the present well-known theory, and it obtains with extremely strong anti-poor property popularizing widely and using.
The constraint condition of shortest route problem is described as:
Given starting point (Strat) and destination node (Goal), and this path must through node sequence l=(l1, l2, l3 ..., ln) and avoid node sequence O=(O1, O2, O3 ..., Om).
Here hypothesis must be that order provides through the node sequence, represents that the i in this path must be Ii (l≤i≤n) through node; And the node of avoiding in the node sequence is not stipulated in proper order.
The sequence that the shortest path that produces is made up of several nodes, that is: P={P1, P2, P3 ..., Pk}
P1=Start wherein, Pk=Goal
Ii＝Pki(l≤i≤n)，Oi∈/P(l≤i≤m)
P is a shortest path that satisfies above-mentioned condition so.
Nineteen fifty-nine Dijkstra has proposed an algorithm of seeking shortest path in given figure, and its basic thought is: the shortest path (shortest path length from P1 to itself is zero) of each node near m the node of starting point P1 and from node P1 to these nodes in the known figure (or net); Painted to node P1 and this m node; Then, m+1 the node that is accepted in P1 most can be tried to achieve as follows:
For each uncoloured node y, consider all painted node x, (x y) is connected on shortest path back from P1 to x, so just obtains the different paths of m bar from P1 to y the limit; Choose the shortest path from this m paths, it is exactly the shortest path of P1 to y; Because the equal nonnegative value of all length of sides only uses painted summit as intermediate node so the shortest path from P1 to m+1 the node that approaches most P1 is inevitable.
From m=0, this process is repeated down, till the shortest path of trying to achieve from P1 to Pk.
Based on traditional dijkstra's algorithm of adjacency matrix, the core pseudo-code is described below:
D[v
0]=0; Final[v
0]=TRUE; //D is the accumulative total resistance value of node
1. for (i=1; I＜n; I++) { v is obtained in // major cycle at every turn
0To the shortest path of certain node v, and will add in the S set
min＝INFINITY；
② for(w＝0；w＜n；w++){
If (! Final[w]) // node w the set V-S in
If (D[w]＜min) { // node w is apart from v
0Nearer
v＝w；min＝D[w]；
}
}
Final[v]=TRUE; // nearest node v is added in the S set
3. for (w=0; W＜n; W++) { current shortest path of // renewal and distance
If (! Final[w] ﹠amp; ﹠amp; (min+c[v] [w]＜D[w])) // modification D[w], w ∈ V-S
D[w]＝min+c[v][w]；
}
}
If use the adjacency list store network data instead, then 3. the subcycle of dijkstra's algorithm can change into:
3. for (w=0; W＜v-adj-num; W++) //v-adj-num and v-adj[w] be respectively adjacent node sum and the numbering of v
if(！final[v-adj[w]]&&(min+c[v][v-adj[w]]＜D[v-adj[w]]))
D[v-adj[w]]＝min+c[v][v-adj[w]]；
}
The algorithm scale maybe can be designated as f (x)=n
2+ n
2, also be that the time complexity is O (n
2).
2.2 the foundation of city road network topological structure
In Geographic Information System, we can represent urban road with line, and can set up topology to urban road by ArcGIS software, show promptly whether the relation between line and the line is crossing or non-intersect, unidirectional or two-way, and the independent figure layer of acquisition road intersection point, so just constituted the network chart in the network graph theory theory.Again the mileage chart after the topological segmentation is indicated left and right sides house number, formed complete city road network topological structure.Its processing procedure is as follows:
Original mileage chart is carried out the topology inspection of line element, generate line and the cross one another mileage chart of line;
Mileage chart is created the topological relation file, and the definition start node, node stopped, road name, left and right sides house number, link length, attribute datas such as width of roadway, grade; Wherein start node, termination node, link length can be passed through ArcGIS
Software generates automatically, and road name, width of roadway, grade can be inherited from original mileage chart attribute list, and left and right sides house number then must be proofreaied and correct by manual type;
Generating road junction is the network node file, and its attribute data is ID number, X, Y coordinate figure, and the titles of cross street etc. all can be passed through ArcGIS
Software generates automatically;
The node file is imported database or writes table separately.
2.3 ground, city point location based on house number
Arbitrary buildings all has its house number in the city, just mean that also buildings itself can be by house number location, implementation space in the city road network structure, this process is called geocoding (GeoCoding) in Geographic Information System, its prerequisite is to set up the city road network topological structure.
This position fixing process can be realized by the geocoding function in arbitrary Geographic Information System (GIS) software.
Summary of the invention
The object of the present invention is to provide a kind of based on optimal route selection method between any buildings of city road network structure, thereby realize in the network optimal path inquiry of point-to-point transmission arbitrarily.
Provided by the present invention a kind of based on optimal route selection method between any buildings of city road network structure, comprise the following steps: one) according to existing road network spatial information database and building space information bank, set up the city road network topological structure; Two) extracting intersection from this city road network topological structure is node information, sets up node spatial information database middleware; Simultaneously, City Building is carried out geocoding by central point and house number, the location, implementation space; Three) call node spatial information database middleware, the described road network spatial information database that superposes on the one hand selects for use dijkstra's algorithm to carry out computing, obtains shortest path between any two nodes, generate city intersection, promptly optimal path is separated the high-volume database middleware between node; On the other hand, increase its two nearest intersections in described building space information bank, promptly initial, the record field that stops node in this highway section, buildings place generates City Building basic space information bank; Four) to any two buildingss, at first inquire about described City Building basic space information bank, obtain: the highway section start node Ss of initial building object point position S, termination node St; Stop highway section start node Ts, the termination node Tt of building object point position T; Five) the described optimal path of inquiry is separated high-volume database middleware V, obtains V[Ss, Ts], V[Ss, Tt], V[St, Ts] and, V[St, Tt]; Six) to V[Ss, Ts], V[Ss, Tt] and, V[St, Ts], V[St, Tt] sort, ask for minimum value, i.e. the shortest path of S to T.
Adopt above-mentioned technical scheme, utilize database middleware, being about to the data link table form of traditional shortest path operation result by the structural belt blank character is saved in the database, form in the city road network (excellent) short path database between any two nodes, location technology in conjunction with City Building combines with the city road network topological structure again, searches initial buildings to stopping between buildings (excellent) short path.The present invention is query script with traditional optimal path inquiry computation process by the database middleware technical transform, and utilizes the network topology structure of Geographic Information System, realizes the optimal path inquiry of any point-to-point transmission in the network.
Description of drawings
Fig. 1 is city road network and building information pretreatment process synoptic diagram among the present invention;
Fig. 2 is for inquiry among the present invention and calculate optimal path flow process between any two buildingss.
Embodiment
Basic thought of the present invention is:
1. set up the city road network topological structure;
2. set up node map layer of road cross points;
3. select for use dijkstra's algorithm to carry out computing, obtain all nodes, write database V the shortest (excellent) path;
4. City Building is carried out geocoding by house number, the location, implementation space;
5. according to highway section, S place, initial building object point position 1s title, search highway section start node Ss, the termination node St of this buildings;
6. according to arriving building highway section, T place, object point position 1t title, search highway section start node Ts, the termination node Tt of this buildings;
7. calculate by the ordering of 4 values after the inquiry, obtain the shortest path W of S to T
W[S，T]＝min{V[Ss，Ts]，V[Ss，Tt]，V[St，Ts]，V[St，Tt]}
Its specific implementation process is divided following two steps, as shown in Figure 1 and Figure 2.
As shown in Figure 1, city road network and building information pretreatment process:
According to existing road network spatial information database and building space information bank, pass through ArcGIS
Software is set up the city road network topological structure;
Extracting intersection from this city road network topological structure is node information, sets up node spatial information database middleware; Simultaneously, City Building is carried out geocoding by central point and house number, the location, implementation space;
Call node spatial information database middleware, described road network spatial information database on the one hand superposes, select for use dijkstra's algorithm to carry out computing, obtain shortest path between any two nodes, generate city intersection, be that optimal path is separated the high-volume database middleware between node, traditional shortest path operation result is saved in the database by the data link table form of structural belt blank character; On the other hand, by the add algorithm in space buffer district, increase its two nearest intersections in described building space information bank, promptly initial, the record field that stops node in this highway section, buildings place generates City Building basic space information bank.
As shown in Figure 2, optimal path flow process between inquiry and any two buildingss of calculating:
To any two buildingss, at first inquire about described City Building basic space information bank, obtain: the highway section start node Ss of initial building object point position S, termination node St; Stop highway section start node Ts, the termination node Tt of building object point position T;
Inquire about described optimal path and separate high-volume database middleware V, obtain V[Ss, Ts], V[Ss, Tt], V[St, Ts] and, V[St, Tt];
To V[Ss, Ts], V[Ss, Tt] and, V[St, Ts], V[St, Tt] sort, ask for minimum value, i.e. the shortest path of S to T.
In above-mentioned, core is the list structure that the structure optimal path is separated the high-volume database middleware, in case consider and write database, record wherein adds up to nodal point number n * (n-1), for saving the storage space of every record in the database as far as possible, to reduce query time, we have set up road ID in the attribute list of city road network topological structure, and the storage of linked list structure in the database is { l
1, l
2..., l
nBe an independent field, and in calculation procedure, add coding function, in polling routine, add decoding functions and realize.
With the oracle database is example, and we define node to (excellent) short path list structure is as follows:
ID NUMBER 10
F_NODE NUMBER 4 // road starting point
T_NODE NUMBER 4 // road terminating point
LENGTH NUMBER 10 2 // shortest path length overall
ID number of 1000 // every section road of ROUTE_ID VARCHAR
To be example by ADO mode write data storehouse table, the VB pseudo-code is as follows: for i=l To MaxNodeNum{
for?j＝l?To?MaxNodeNum{
rst.AddNew；
If if were FindPath{ // there is a shortest path
Set?BestRoute＝Nothing；
Call ExecutePathSearch (NodeReturnID); // call dijkstra's algorithm
RoutesId=BestRoute.Fields (" Id ") .Value; // obtain shortest path information
While(！BestRoute.EOF)
If?InStr(routesName，Trim(BestRoute.Fields(″Id″).Value))＝0
routesId＝routesId+″，″+Trim(BestRoute.Fields(″Id″).Value)；
BestRoute.MoveNext；
Wend；
BestRoute.MoveFirst；
Route_id=routesId; // write database
}
Else{
" road of point-to-point transmission is not communicated with route_id=! "
" road of point-to-point transmission is not communicated with route_name=! "
}
rst.Update
}
}
We obtain the database middleware of following list structure:
Current, influence important that the optimal path algorithm uses in traffic and logistics, just time of on machine, moving of algorithm because of being the complexity of algorithm mutually.There are a lot of people that energy is placed in the improvement to dijkstra's algorithm itself, proposed the method for a series of raising arithmetic speeds such as four fork numbers heap Priority Queues, inverse adjacency list and efficient.But the algorithm that proposes among the present invention does not really go to realize the raising of dijkstra's algorithm efficient, but pass through database middleware, the computation process of complexity is placed on the backstage execution, the optimum computer problem in traditional path is converted into the generation and the inquiry of database middleware.
We know that city road network also is dynamic change, although period of change is not a real-time update, also exist the update cycle, and algorithm in the past means that each road network upgrades, and the user will face the latent period of a period of time.And the great advantage of this algorithm is separated renewal process exactly with use, each step in the basic thought all can be finished by different computing machines, for large database, still can provide concurrent inquiry service in the time of Data Update, this makes this algorithm that extremely strong vitality and application surface be arranged.
Claims (1)
1. one kind based on optimal route selection method between any buildings of city road network structure, comprises the following steps:
One) according to existing road network spatial information database and building space information bank, sets up the city road network topological structure;
Two) extracting intersection from this city road network topological structure is node information, sets up node spatial information database middleware; Simultaneously, City Building is carried out geocoding by central point and house number, the location, implementation space;
Three) call node spatial information database middleware, the described road network spatial information database that superposes on the one hand selects for use dijkstra's algorithm to carry out computing, obtains shortest path between any two nodes, generate city intersection, promptly optimal path is separated the high-volume database middleware between node; On the other hand, increase its two nearest intersections in described building space information bank, promptly initial, the record field that stops node in this highway section, buildings place generates City Building basic space information bank;
Four) to any two buildingss, at first inquire about described City Building basic space information bank, obtain: the highway section start node Ss of initial building object point position S, termination node St; Stop highway section start node Ts, the termination node Tt of building object point position T;
Five) the described optimal path of inquiry is separated high-volume database middleware V, obtains V[Ss, Ts], V[Ss, Tt], V[St, Ts] and, V[St, Tt];
Six) to V[Ss, Ts], V[Ss, Tt] and, V[St, Ts], V[St, Tt] sort, ask for minimum value, i.e. the shortest path of S to T.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 200410017666 CN1684074A (en) | 2004-04-14 | 2004-04-14 | Optimum path selecting method between arbitrary buildings based on city road net structure |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 200410017666 CN1684074A (en) | 2004-04-14 | 2004-04-14 | Optimum path selecting method between arbitrary buildings based on city road net structure |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN1684074A true CN1684074A (en) | 2005-10-19 |
Family
ID=35263408
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 200410017666 Pending CN1684074A (en) | 2004-04-14 | 2004-04-14 | Optimum path selecting method between arbitrary buildings based on city road net structure |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN1684074A (en) |
Cited By (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100407200C (en) * | 2005-10-26 | 2008-07-30 | 华为技术有限公司 | Correlation inquiry system and its method |
| CN102073669A (en) * | 2010-10-15 | 2011-05-25 | 江苏鸿信系统集成有限公司 | Method for selecting optimal path between any two cities based on nationwide road network structure |
| WO2011116673A1 (en) * | 2010-03-24 | 2011-09-29 | Lin Dingwei | Logical topology network model, artificial intelligence control method and artificial intelligence system |
| CN101548157B (en) * | 2006-12-05 | 2012-09-05 | 罗伯特.博世有限公司 | Navigation device |
| CN102810118A (en) * | 2012-07-05 | 2012-12-05 | 上海电力学院 | K nearest neighbor search method for variable weight network |
| CN104331519A (en) * | 2014-11-27 | 2015-02-04 | 无锡儒安科技有限公司 | City map indexing method |
| CN104468831A (en) * | 2014-12-26 | 2015-03-25 | 山东中创软件商用中间件股份有限公司 | Message service network cluster based on network topology |
| CN104486105A (en) * | 2014-12-05 | 2015-04-01 | 广东省电信规划设计院有限公司 | Transmission network service configuration method and system |
| CN105160089A (en) * | 2015-08-26 | 2015-12-16 | 华南理工大学 | Assisted planning and site selection method for network optimization based on space syntax |
| CN105654186A (en) * | 2015-12-17 | 2016-06-08 | 山东师范大学 | Indoor and outdoor integrated planning method used for emergency rescue optimal path calculation |
| CN105928535A (en) * | 2016-06-15 | 2016-09-07 | 苏州清研捷运信息科技有限公司 | Vehicle routing planning method capable of avoiding road restrictions |
| CN111259100A (en) * | 2020-01-10 | 2020-06-09 | 北京嘀嘀无限科技发展有限公司 | Road network topological structure construction method and device |
| CN111652434A (en) * | 2020-06-02 | 2020-09-11 | 百度在线网络技术（北京）有限公司 | Road network data processing method and device, electronic equipment and computer storage medium |
-
2004
- 2004-04-14 CN CN 200410017666 patent/CN1684074A/en active Pending
Cited By (22)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100407200C (en) * | 2005-10-26 | 2008-07-30 | 华为技术有限公司 | Correlation inquiry system and its method |
| CN101548157B (en) * | 2006-12-05 | 2012-09-05 | 罗伯特.博世有限公司 | Navigation device |
| WO2011116673A1 (en) * | 2010-03-24 | 2011-09-29 | Lin Dingwei | Logical topology network model, artificial intelligence control method and artificial intelligence system |
| GB2493303A (en) * | 2010-03-24 | 2013-01-30 | Dingwei Lin | Logical topology network model, artificial intelligence control method and artificial intelligence system |
| CN102073669A (en) * | 2010-10-15 | 2011-05-25 | 江苏鸿信系统集成有限公司 | Method for selecting optimal path between any two cities based on nationwide road network structure |
| CN102810118A (en) * | 2012-07-05 | 2012-12-05 | 上海电力学院 | K nearest neighbor search method for variable weight network |
| CN102810118B (en) * | 2012-07-05 | 2015-08-05 | 上海电力学院 | A kind of change weighs net K nearest neighbor search method |
| CN104331519B (en) * | 2014-11-27 | 2018-03-02 | 无锡儒安科技有限公司 | City map indexing means |
| CN104331519A (en) * | 2014-11-27 | 2015-02-04 | 无锡儒安科技有限公司 | City map indexing method |
| CN104486105A (en) * | 2014-12-05 | 2015-04-01 | 广东省电信规划设计院有限公司 | Transmission network service configuration method and system |
| CN104486105B (en) * | 2014-12-05 | 2018-04-20 | 广东省电信规划设计院有限公司 | Transmission network business collocation method and system |
| CN104468831A (en) * | 2014-12-26 | 2015-03-25 | 山东中创软件商用中间件股份有限公司 | Message service network cluster based on network topology |
| CN105160089A (en) * | 2015-08-26 | 2015-12-16 | 华南理工大学 | Assisted planning and site selection method for network optimization based on space syntax |
| CN105160089B (en) * | 2015-08-26 | 2018-06-22 | 华南理工大学 | A kind of auxiliary programming site selecting method based on the Space Syntax network optimization |
| CN105654186A (en) * | 2015-12-17 | 2016-06-08 | 山东师范大学 | Indoor and outdoor integrated planning method used for emergency rescue optimal path calculation |
| CN105654186B (en) * | 2015-12-17 | 2019-11-05 | 山东师范大学 | Indoor and outdoor integration planing method for emergency management and rescue optimal path computation |
| CN105928535A (en) * | 2016-06-15 | 2016-09-07 | 苏州清研捷运信息科技有限公司 | Vehicle routing planning method capable of avoiding road restrictions |
| CN105928535B (en) * | 2016-06-15 | 2018-08-31 | 苏州清研捷运信息科技有限公司 | A kind of vehicle path planning method of road limitation |
| CN111259100A (en) * | 2020-01-10 | 2020-06-09 | 北京嘀嘀无限科技发展有限公司 | Road network topological structure construction method and device |
| CN111259100B (en) * | 2020-01-10 | 2021-01-12 | 滴图(北京)科技有限公司 | Road network topological structure construction method and device |
| CN111652434A (en) * | 2020-06-02 | 2020-09-11 | 百度在线网络技术（北京）有限公司 | Road network data processing method and device, electronic equipment and computer storage medium |
| CN111652434B (en) * | 2020-06-02 | 2023-09-29 | 百度在线网络技术（北京）有限公司 | Road network data processing method and device, electronic equipment and computer storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN1948913A (en) | Heuristic path culculating method for treating large scale floating vehicle data | |
| CN1684074A (en) | Optimum path selecting method between arbitrary buildings based on city road net structure | |
| CN1967524A (en) | Collecting and inquiry system of traffic information and method thereof | |
| CN109029472A (en) | Map-matching method based on low sampling rate GPS track point | |
| CN1590964A (en) | Iterative logical renewal of navigable map database | |
| CN104217249A (en) | Dynamic car sharing and matching method based on time and cost constraints | |
| CN1645402A (en) | Road traffic flow data quality controlling method and apparatus | |
| Wang et al. | Sustainable urban development in China: Challenges and achievements | |
| CN104392037B (en) | City scene parameterization modeling system | |
| WO2022068745A1 (en) | Data processing method and device | |
| CN1731394A (en) | Method for implementing electronic urban map system having intelligent query function | |
| CN101957757B (en) | Graphic layout method applicable to software visualization process | |
| Li | Sustainable design for low carbon architecture | |
| CN112991800B (en) | Urban road network shortest path acquisition method based on angle limitation and bidirectional search | |
| CN1492361A (en) | Processing method for embedded data bank searching | |
| CN101055190A (en) | Method for sampling and fuzzy positioning interest point in map system | |
| CN101030230A (en) | Image searching method and system | |
| CN106373384A (en) | Remote area passenger transport regular bus route real-time generation method | |
| CN110530386A (en) | A kind of dynamic shortest path planing method based on improvement dijkstra's algorithm | |
| CN114168705A (en) | Chinese address matching method based on address element index | |
| CN1796942A (en) | Method for calculating route of navigating cities | |
| CN1435790A (en) | Geographic information system on-line analysis data model and attribute data relating method | |
| CN104123357B (en) | A kind of method and apparatus of inquiry bayonet | |
| CN1588373A (en) | General method and its program for automatic search public traffic path | |
| CN112328877A (en) | Skyline inquiry method for multiple users on time-dependent road network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |