CN112347313A - A method of location dominance path analysis based on big data - Google Patents

A method of location dominance path analysis based on big data Download PDF

Info

Publication number
CN112347313A
CN112347313A CN202011249436.6A CN202011249436A CN112347313A CN 112347313 A CN112347313 A CN 112347313A CN 202011249436 A CN202011249436 A CN 202011249436A CN 112347313 A CN112347313 A CN 112347313A
Authority
CN
China
Prior art keywords
path
data
information
node
data set
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
Application number
CN202011249436.6A
Other languages
Chinese (zh)
Inventor
于慧
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Institute of Mountain Hazards and Environment IMHE of CAS
Original Assignee
Institute of Mountain Hazards and Environment IMHE of CAS
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Institute of Mountain Hazards and Environment IMHE of CAS filed Critical Institute of Mountain Hazards and Environment IMHE of CAS
Priority to CN202011249436.6A priority Critical patent/CN112347313A/en
Publication of CN112347313A publication Critical patent/CN112347313A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING OR CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90Details of database functions independent of the retrieved data types
    • G06F16/901Indexing; Data structures therefor; Storage structures
    • G06F16/9024Graphs; Linked lists
    • GPHYSICS
    • G06COMPUTING OR CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/29Geographical information databases
    • GPHYSICS
    • G06COMPUTING OR CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90Details of database functions independent of the retrieved data types
    • G06F16/95Retrieval from the web
    • G06F16/953Querying, e.g. by the use of web search engines
    • G06F16/9537Spatial or temporal dependent retrieval, e.g. spatiotemporal queries
    • GPHYSICS
    • G06COMPUTING OR CALCULATING; COUNTING
    • G06NCOMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00Computing arrangements based on biological models
    • G06N3/004Artificial life, i.e. computing arrangements simulating life
    • G06N3/006Artificial life, i.e. computing arrangements simulating life based on simulated virtual individual or collective life forms, e.g. social simulations or particle swarm optimisation [PSO]

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Databases & Information Systems (AREA)
  • Physics & Mathematics (AREA)
  • Data Mining & Analysis (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Software Systems (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Health & Medical Sciences (AREA)
  • Remote Sensing (AREA)
  • Artificial Intelligence (AREA)
  • Biomedical Technology (AREA)
  • Biophysics (AREA)
  • Computational Linguistics (AREA)
  • Evolutionary Computation (AREA)
  • General Health & Medical Sciences (AREA)
  • Molecular Biology (AREA)
  • Computing Systems (AREA)
  • Mathematical Physics (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

本发明公开了一种基于大数据的区位优势度路径分析方法,获取待测路径信息和道路拓扑图,并对待测路径信息调整相对坐标位置,得到对应的路径数据集;在路径网络模型中根据对应路径数据集采集路径中的节点坐标;根据蚂蚁算法获取出所述节点坐标发点和目的地之间的实地静态路线;在实地静态路线根据权重最小原则计入权重系数对路径的到达时间进行加权计算;将出发点和目的地的路径结果保存到数组中,重复以上步骤计算导出最佳路径分析结果。本发明可有效节约人工成本,避免出现相关参数设置错误导致路径分析数据错误,从多维度对路径数据进行统计分析,有效保证统计精度和质量。

Figure 202011249436

The invention discloses a location dominance degree path analysis method based on big data, which acquires path information to be tested and a road topology map, adjusts relative coordinate positions for the path information to be tested, and obtains a corresponding path data set; Collect the node coordinates in the path corresponding to the path data set; obtain the on-site static route between the origin and destination of the node coordinates according to the ant algorithm; in the on-site static route, according to the principle of minimum weight, the weight coefficient is included in the arrival time of the path. Weighted calculation; save the path results of the departure point and destination into an array, and repeat the above steps to calculate and derive the best path analysis result. The invention can effectively save labor costs, avoid errors in path analysis data caused by incorrect setting of relevant parameters, perform statistical analysis on path data from multiple dimensions, and effectively ensure statistical accuracy and quality.

Figure 202011249436

Description

Big data-based location dominance path analysis method
Technical Field
The invention relates to the technical field of data analysis, in particular to a location dominance path analysis method based on big data.
Background
The method comprises the steps of manually and manually analyzing the optimal path from a single place to multiple places, such as the optimal path from a certain village and a certain town to the nearest high-speed intersection, and sorting the analysis results from different dimensions, such as sorting out the path with the shortest time consumption and the path with the shortest distance. If the best paths from a plurality of towns to the nearest high-speed intersections need to be acquired, the process needs to be manually repeated. The high process is carried out by a large number of repeated manual operations, the energy consumption is huge, related parameters are required to be set manually, analysis results are arranged from different dimensions, if the variables are too many, for example, the optimal paths from all villages and towns to the nearest hospital, the nearest high-speed intersection, the nearest airport and the nearest train station are analyzed, the workload is huge, the related parameter setting errors can be avoided, the final analysis result errors are caused, the analysis result cannot be guaranteed, and the analysis result is difficult to count from multiple dimensions. The real traffic road junction is graded, such as national roads, provincial roads, high-speed roads and rural roads, the speed of each road can be different, so that the analysis result is not easy to count, and a path measurement method based on a big data analysis technology is needed.
Disclosure of Invention
The present invention is to provide a path measurement method based on big data analysis technology, which can alleviate the above problems.
In order to alleviate the above problems, the technical scheme adopted by the invention is as follows:
the invention comprises the following steps:
a, acquiring path information to be detected and a road topological graph, and adjusting the relative coordinate position of the path information to be detected to obtain a corresponding path data set;
b, acquiring node coordinates in the path according to the corresponding path data set in the path network model;
c, obtaining a field static route between the node coordinate starting point and the destination according to an ant algorithm;
d, weighting calculation is carried out on the arrival time of the path by taking weight coefficients into the static route in the field according to the weight minimum principle;
and E, saving the path results of the starting point and the destination into an array, and repeating the steps to calculate and derive the optimal path analysis result.
Further, the path data set is divided into data, and then the travel route of the path is sequentially played in each scene.
Further, the method for constructing the path network model comprises the following steps:
a, drawing a path topological graph;
b, constructing a path adjacency matrix through a path topological graph;
and c, importing the adjacent matrix and the node information of the path into a two-dimensional array.
Further, the ant algorithm analyzes path information passing through a designated station, and the ant algorithm supports one-time analysis of optimal paths of a plurality of stations.
A location dominance path analysis device based on big data comprises:
the path data module is used for acquiring the information of the path to be measured and the road topological graph, and adjusting the relative coordinate position of the information of the path to be measured to obtain a corresponding path data set;
the node module is used for acquiring node coordinates in the path according to the corresponding path data set in the path network model;
the route acquisition module is used for acquiring a solid static route between the node coordinate starting point and the destination;
and the calculation module is used for weighting and calculating the arrival time of the path by taking the weight coefficient into the field static route according to the weight minimum principle.
And the result deriving module is used for saving the path results of the starting point and the destination into an array and repeating the steps to calculate and derive the optimal path analysis result.
A big-data based location dominance path analysis apparatus, comprising: a memory having instructions stored therein and at least one processor, the memory and the at least one processor interconnected by a line; the at least one processor invokes the instructions in the memory to cause the big data analytics-based path measurement device to perform any of the methods described herein.
A computer-readable storage medium, on which a computer program is stored which, when being executed by a processor, carries out the steps of any of the methods.
The technical effect of the technical scheme is as follows:
the invention can effectively save labor cost, avoid path analysis data errors caused by related parameter setting errors, carry out statistical analysis on the path data from multiple dimensions, and effectively ensure statistical precision and quality.
Drawings
FIG. 1 is a schematic flow chart illustrating a method for analyzing a location dominance path based on big data according to an embodiment of the present invention;
fig. 2 is a schematic diagram of an embodiment of a path measuring device based on big data analysis in the embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, but not all, embodiments of the present invention. The components of embodiments of the present invention generally described and illustrated in the figures herein may be arranged and designed in a wide variety of different configurations.
As shown in fig. 1 and 2, the present invention comprises:
a, acquiring path information to be detected and a road topological graph, and adjusting the relative coordinate position of the path information to be detected to obtain a corresponding path data set;
b, acquiring node coordinates in the path according to the corresponding path data set in the path network model;
c, obtaining a field static route between the node coordinate starting point and the destination according to an ant algorithm;
d, weighting calculation is carried out on the arrival time of the path by taking weight coefficients into the static route in the field according to the weight minimum principle;
and E, saving the path results of the starting point and the destination into an array, and repeating the steps to calculate and derive the optimal path analysis result.
Further, the path data set is divided into data, and then the travel route of the path is sequentially played in each scene.
Further, the method for constructing the path network model comprises the following steps
a, drawing a path topological graph;
b, constructing a path adjacency matrix through a path topological graph;
and c, importing the adjacent matrix and the node information of the path into a two-dimensional array.
Further, the ant algorithm analyzes path information passing through a designated station, and the ant algorithm supports one-time analysis of optimal paths of a plurality of stations.
A location dominance path analysis device based on big data comprises:
the path data module is used for acquiring the information of the path to be measured and the road topological graph, and adjusting the relative coordinate position of the information of the path to be measured to obtain a corresponding path data set;
the node module is used for acquiring node coordinates in the path according to the corresponding path data set in the path network model;
the route acquisition module is used for acquiring a solid static route between the node coordinate starting point and the destination;
and the calculation module is used for weighting and calculating the arrival time of the path by taking the weight coefficient into the field static route according to the weight minimum principle.
And the result deriving module is used for saving the path results of the starting point and the destination into an array and repeating the steps to calculate and derive the optimal path analysis result.
A big-data based location dominance path analysis apparatus, comprising: a memory having instructions stored therein and at least one processor, the memory and the at least one processor interconnected by a line; the at least one processor invokes the instructions in the memory to cause the big data analytics-based path measurement device to perform any of the methods described herein.
A computer-readable storage medium, on which a computer program is stored which, when being executed by a processor, carries out the steps of any of the methods.
In this embodiment, an ant algorithm is used to analyze the optimal path passing through the designated site, which is described in detail as follows: the calculation principle is as follows: the weight minimization principle sets the weight according to the impedance condition of the network, which is distance or time, and the parameters describe: data: the sites that the route must pass through, Node: all nodes in the path model, Matrix: road path analysis model, Open: source set, nodes already participating in the computation, Open ═ Start ], Close: difference, points not participating in computation, Close Node-Open, Start: starting point, End: the end point, shortestPath, analyzes the line information between the start point and the stop point,
the method comprises route length information ShortestPath _ i.length, node attribute information ShortestPath _ i.pathnodes and transition parameters: and (2) sequentially acquiring the close, calculating the distance D (start, vi) from each node vi to the start in the close, finding the node branch with the minimum distance value, adding the branch to the open, removing the close, simultaneously storing the node passed by the start to the vi as a short Path _ i.route, traversing the close again, calculating the distance D (start, v) from each node vi to the start in the close as Min (D (start, vi), D (start, branch) + D (branch, vi)), and if the value is the value passing through the branch, the node passed by the start to the vi is a short Path _ branch + vi, repeating the steps of step 4, 1 and 2 until the end of the branch is added, and storing the result of the shortest distance path between the start and the end in the route of the branch and the route of the start _ i + 6. After the relevant parameters are set, the analysis result can be obtained and stored in the relevant table, and can be exported to be an express table through the export function of the SuperMap iDesktop.
A computer-readable storage medium, on which a computer program is stored which, when being executed by a processor, carries out the steps of the method.
It is clear to those skilled in the art that, for convenience and brevity of description, the specific working processes of the above-described systems, apparatuses and units may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.
In the embodiments provided in the present invention, it should be understood that the disclosed system, apparatus and method may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the units is only one logical division, and other divisions may be realized in practice, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present invention may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.
The integrated unit, if implemented in the form of a software functional unit and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present invention may be embodied in the form of a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: various media capable of storing program codes, such as a usb disk, a removable hard disk, a read-only memory (ROM), a Random Access Memory (RAM), a magnetic disk, or an optical disk.
Thus, the following detailed description of the embodiments of the present invention, presented in the figures, is not intended to limit the scope of the invention, as claimed, but is merely representative of selected embodiments of the invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention, and various modifications and changes may be made by those skilled in the art. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.

Claims (7)

1. A location dominance path analysis method based on big data is characterized by comprising the following steps:
a, acquiring path information to be detected and a road topological graph, and adjusting the relative coordinate position of the path information to be detected to obtain a corresponding path data set;
b, acquiring node coordinates in the path according to the corresponding path data set in the path network model;
c, obtaining a field static route between the node coordinate starting point and the destination according to an ant algorithm;
d, weighting calculation is carried out on the arrival time of the path by taking weight coefficients into the static route in the field according to the weight minimum principle;
and E, saving the path results of the starting point and the destination into an array, and repeating the steps to calculate and derive the optimal path analysis result.
2. The method as claimed in claim 1, wherein the path data set is divided into segments, and the path is sequentially played in each scene.
3. The big-data based locational dominance path analysis method as claimed in claim 1, wherein said path network model construction method comprises
a. Drawing a path topological graph;
b. constructing a path adjacency matrix through a path topological graph;
c. and importing the adjacent matrix and the node information of each path into a two-dimensional array.
4. The method as claimed in claim 1, wherein the ant algorithm analyzes path information passing through a specific site, and the ant algorithm supports analyzing optimal paths of multiple sites at a time.
5. A location dominance path analysis apparatus based on big data, comprising:
the path data module is used for acquiring the information of the path to be measured and the road topological graph, and adjusting the relative coordinate position of the information of the path to be measured to obtain a corresponding path data set;
the node module is used for acquiring node coordinates in the path according to the corresponding path data set in the path network model;
the route acquisition module is used for acquiring a solid static route between the node coordinate starting point and the destination;
and the calculation module is used for weighting and calculating the arrival time of the path by taking the weight coefficient into the field static route according to the weight minimum principle.
And the result deriving module is used for saving the path results of the starting point and the destination into an array and repeating the steps to calculate and derive the optimal path analysis result.
6. A big-data based location dominance path analysis apparatus, comprising: a memory having instructions stored therein and at least one processor, the memory and the at least one processor interconnected by a line; the at least one processor invokes the instructions in the memory to cause the big data analytics based path measurement device to perform the method of any of claims 1-4.
7. A computer-readable storage medium having stored thereon a computer program, characterized in that: the computer program realizing the steps of the method according to any one of claims 1-4 when executed by a processor.
CN202011249436.6A 2020-11-10 2020-11-10 A method of location dominance path analysis based on big data Pending CN112347313A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202011249436.6A CN112347313A (en) 2020-11-10 2020-11-10 A method of location dominance path analysis based on big data

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202011249436.6A CN112347313A (en) 2020-11-10 2020-11-10 A method of location dominance path analysis based on big data

Publications (1)

Publication Number Publication Date
CN112347313A true CN112347313A (en) 2021-02-09

Family

ID=74363106

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202011249436.6A Pending CN112347313A (en) 2020-11-10 2020-11-10 A method of location dominance path analysis based on big data

Country Status (1)

Country Link
CN (1) CN112347313A (en)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH04177287A (en) * 1990-11-09 1992-06-24 Sumitomo Electric Ind Ltd Optimum path determining device
CN109726852A (en) * 2018-11-30 2019-05-07 平安科技(深圳)有限公司 Based on route planning method, device, terminal and the medium for improving ant group algorithm
CN109724611A (en) * 2019-01-08 2019-05-07 北京三快在线科技有限公司 Paths planning method, device, electronic equipment and storage medium
CN110823236A (en) * 2019-10-12 2020-02-21 百度在线网络技术(北京)有限公司 Path planning method and device, electronic equipment and storage medium
CN111784260A (en) * 2020-07-14 2020-10-16 国网北京市电力公司 Transportation planning method, device, storage medium and processor

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH04177287A (en) * 1990-11-09 1992-06-24 Sumitomo Electric Ind Ltd Optimum path determining device
CN109726852A (en) * 2018-11-30 2019-05-07 平安科技(深圳)有限公司 Based on route planning method, device, terminal and the medium for improving ant group algorithm
CN109724611A (en) * 2019-01-08 2019-05-07 北京三快在线科技有限公司 Paths planning method, device, electronic equipment and storage medium
CN110823236A (en) * 2019-10-12 2020-02-21 百度在线网络技术(北京)有限公司 Path planning method and device, electronic equipment and storage medium
CN111784260A (en) * 2020-07-14 2020-10-16 国网北京市电力公司 Transportation planning method, device, storage medium and processor

Similar Documents

Publication Publication Date Title
US9880012B2 (en) Hybrid road network and grid based spatial-temporal indexing under missing road links
CN102128626B (en) Track display method and system and map server
CN102521973B (en) A kind of mobile phone switches the road matching method of location
CN112560355B (en) Method and device for predicting Mach number of wind tunnel based on convolutional neural network
CN108540988B (en) Scene division method and device
Corcoran et al. Characterising the metric and topological evolution of OpenStreetMap network representations
CN106127857A (en) Synthetic data drives the on-board LiDAR data modeling method with model-driven
CN110362640B (en) A task assignment method and device based on electronic map data
CN114662253B (en) Simulation modeling method and device, electronic equipment and storage medium
CN106845559A (en) Take the ground mulching verification method and system of POI data special heterogeneity into account
JP2020042793A (en) Obstacle distribution simulation method, apparatus and terminal based on probability plot
CN116662935A (en) Atmospheric pollutant spatial distribution prediction method based on air quality monitoring network
CN118549746A (en) Distribution network ground fault positioning method and device based on unsupervised learning
CN109059949B (en) Shortest path calculation method and device
CN115658710A (en) Map update processing method, device, electronic device and storage medium
CN116310194A (en) Method, system, equipment and storage medium for reconstruction of 3D model of distribution station building
CN112347313A (en) A method of location dominance path analysis based on big data
CN115481531A (en) Road network traffic flow real-time twinning method and system based on SUMO
CN112562311B (en) Method and device for obtaining working condition weight factor based on GIS big data
CN106375953A (en) Router-based server-side indoor positioning method
CN112527673B (en) Site testing method, device, electronic equipment and readable storage medium
CN111008730A (en) Crowd concentration degree prediction model construction method and device based on urban space structure
CN112967256A (en) Tunnel ovalization detection method based on spatial distribution
CN117689276B (en) Machine vision-based production quality analysis method for folding arm of overhead working truck
CN112540928A (en) Test case layout method and device based on to-be-tested line intersection information

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
RJ01 Rejection of invention patent application after publication
RJ01 Rejection of invention patent application after publication

Application publication date: 20210209