CN110046208A - The hour circles such as the traffic based on the open data of commercial map visualize application method - Google Patents
The hour circles such as the traffic based on the open data of commercial map visualize application method Download PDFInfo
- Publication number
- CN110046208A CN110046208A CN201910220759.3A CN201910220759A CN110046208A CN 110046208 A CN110046208 A CN 110046208A CN 201910220759 A CN201910220759 A CN 201910220759A CN 110046208 A CN110046208 A CN 110046208A
- Authority
- CN
- China
- Prior art keywords
- point
- coverage
- vehicles
- time
- trip
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
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"
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Theoretical Computer Science (AREA)
- Human Resources & Organizations (AREA)
- Databases & Information Systems (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- General Physics & Mathematics (AREA)
- Physics & Mathematics (AREA)
- Development Economics (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Marketing (AREA)
- General Business, Economics & Management (AREA)
- Entrepreneurship & Innovation (AREA)
- Operations Research (AREA)
- Game Theory and Decision Science (AREA)
- Remote Sensing (AREA)
- Data Mining & Analysis (AREA)
- General Engineering & Computer Science (AREA)
- Navigation (AREA)
- Traffic Control Systems (AREA)
Abstract
The invention discloses a kind of hour circles such as traffic based on the open data of commercial map to visualize application method, this method is first according to specified urban area, the position data that the key points such as Urban Transport Terminals such as bus station, subway station are obtained from commercial map forms crucial point list.Then, all key points traffic commuting time data under different modes of transportation between any two are obtained in crucial point list by same mode, forms commuting time matrix.Subsequently, according to the different location of starting point, based on different trip strategies, the coverage that the hour circles such as traffic are formed is drawn on commercial map and is rendered to come, the hour circles visualization application such as traffic based on different trip starting points, different travel time, the different vehicles is formed, so that traveler be assisted to make corresponding trip strategy for the trip requirements of multi-destination or uncertain destination.
Description
Technical field
The present invention relates to the technical field of traffic trip planning, in particular to a kind of friendship based on the open data of commercial map
The hour circles such as logical visualize application method.
Background technique
Under the vehicles abundant provided by the nowadays city, the selectable mode of transportation of citizens' activities is also more more
Sample, including walking, ride, drive, public transport bus, subway etc..The convenient and quick vehicles make the range of citizens' activities
Be significantly expanded, the previous certain border districts in city also due to bus station set up or passing through for subway and become reachable.It is based on
This, the prime cost considered in citizens' activities, which is changed into from distance costs, takes the time spent by a variety of vehicles
Cost.Simultaneously as the spatial distribution of the transport hubs such as bus station, subway station has the characteristics that noncontinuity, any arrangement, and
The speed of service difference of different public bus networks, subway line leads to the distance of trip and does not go on a journey the spent time not
Have again stringent equal than relation with increase, intuitively, above can not more clearly judge to take the different vehicles to more from distance
Which faster, expends that the time is less, this is hindered to certain information is brought in Urban Traffic when a different zones, influences to go on a journey
Decision.
The hour circles such as traffic refer generally to a certain place be initiate point, by certain mode of transportation, in the time threshold of restriction
The spatial dimension that can be reached in value.Be in irregular shape, it is however generally that limiting time is bigger, etc. hour circles range it is wider.It
Two dimensions of the time and space are integrated with, are traffic infrastructures to the intuitive of the guidance of regional development, support and supportability
Reflection.
In related fields, traditional Map Services quotient mainly provides point-to-point commuting tools, although two can be calculated
Commuting time between point, but the case where be also only limitted to single destination demand.And for multi-destination or uncertain destination
In the case where, and be limited in certain time range or under conditions of only the shorter seeking time the better, it is above-mentioned provided by service simultaneously
The decision that cannot be gone on a journey very well needs to seek more scientific, more intuitive method and technology, shows the time using hour circles such as traffic
Accessibility in spatial dimension makes these demands become possible.
Summary of the invention
In view of the problems of the existing technology, the main object of the present invention is to provide a kind of based on the open data of commercial map
The hour circles such as traffic visualize application method, it is intended to more preferable auxiliary is provided for traveler, to meet traveler for multi-destination
Or the trip requirements of uncertain destination.
To achieve the above object, the hour circles visualization application such as traffic proposed by the present invention based on the open data of commercial map
Method includes the following steps:
S100 specifies a target area, the key point of the Urban Transport Terminals of the target area is obtained from commercial map
Position data, construct target area in crucial point list；Wherein, the key point of Urban Transport Terminals is different traffic
The website of tool, corresponding one crucial point list of every kind of different vehicles；
S200 calculates commuting time T of all key points between any two under corresponding vehicles, building commuting
Time matrix；The corresponding commuting time matrix of every kind of vehicles；
S300 analyzes data based on the key point and corresponding commuting time data obtained in S100-S200,
The coverage under specified conditions is calculated, specific calculate includes the following steps:
S310 selectes trip starting point and the vehicles, and determines travel time t by way of continuously choosing, and will select
Fixed trip starting point is defined as O point, and trip mode corresponding to the selected vehicles is defined as the first traffic trip side
Formula；
Whether whether S320, detection O point are overlapped with the key point Pi in the selected vehicles；
When O point is overlapped with key point Pi,
S321a counts all TPiPjAll key point Pj of≤t, wherein TPiPjBetween key point Pi to key point Pj
Commuting time；
S322a is calculated in time t through the reach distance Li of the second travel modal, is calculated using Pi as the center of circle, with
Reach distance Li is radius, the range coverage Di that can be reached in time t by the second travel modal；
S323a is calculated in time t-TPiPjInside pass through the reach distance Lj of the second travel modal, calculating with Pj is circle
The heart, using reach distance Lj as radius, in time t-TPiPjInside pass through the range coverage Dj that the second travel modal can reach；
S324a, circulation step S323a, until the range coverage Dj calculating of the key point Pj of all statistics is finished；
Range coverage Di and all range coverage Dj are superimposed by S325a according to position distribution relationship, formed with
O point is trip starting point, the coverage that can be reached in time t by the selected vehicles；
S326a selectes one of remaining vehicles again and is used as trip tool, calculates reachable under the trip tool
Range；The step is recycled, until the coverage calculating of all vehicles is finished；
When O point is not overlapped with the key point Pi point of the selected vehicles,
S321b finds out the key point Pk that distance O point is nearest in the crucial point list of the selected vehicles；
S322b calculates the time t1 for reaching Pk point from O point by the second travel modal；
S323b counts all TPkPjAll key point Pj of≤t-t1, wherein TPkPjFor key point Pk to key point Pj it
Between commuting time；
S324b calculates the reach distance Lo for passing through the second travel modal in time t, calculates using O point as the center of circle,
Using reach distance Lo as radius, pass through the attainable range coverage Do of the second travel modal in time t；
S325b calculates the reach distance Lk for passing through the second travel modal in time t-t1, and calculating with Pk is circle
The heart passes through the attainable range coverage Dk of the second travel modal using reach distance Lk as radius in time t；
S326b is calculated in time t-t1-TPkPjInside pass through the reach distance Lj of the second travel modal, calculates with Pj
For the center of circle, using reach distance Lj as radius, in time t-t1-TPkPjIt is attainable reachable inside to pass through the second travel modal institute
Region Dj；
S327b, circulation step S326b, until the range coverage Dj calculating of the key point Pj of all statistics is finished；
Range coverage Do, range coverage Dk and all range coverage Dj are superimposed upon by S328b according to position distribution relationship
Together, being formed with O point is trip starting point, passes through the coverage of the selected vehicles in time t；
S329b selectes one of remaining vehicles again and is used as trip tool, calculates reachable under the trip tool
Range；And S329b step is recycled, until the coverage calculating of all vehicles is finished；
S400, the map secondary development components provided by commercial map are by the coverage generated under specified conditions and not
Range coverage carries out rendering processing respectively, and coverage is highlighted on commercial map.
It in a preferred embodiment of the invention, in the step s 100, further include by the crucial point list of the different vehicles
Merge into a crucial point list.
It in a preferred embodiment of the invention, in step s 200, further include by the commuting time square of the different vehicles
Battle array merges into a commuting time matrix.
In the specific embodiment of the invention, in the step S310, selected trip starting point is one or more, is selected
The fixed vehicles are one or more.
In the specific embodiment of the invention, the rendering processing mode in the step S400 is as follows:
S401 renders the coverage generated under specified conditions with the first color；
S402 renders in the region in addition to coverage with the second color, wherein the brightness of the first color is greater than the
The brightness of second colors；
S403, if the vehicles under specified conditions are two or more, and it is corresponding under the different vehicles can
It is overlapped, then renders the coverage not being overlapped between the vehicles two-by-two with the first color up to range；By two kinds of traffic
The corresponding coverage being overlapped of tool is rendered with third color, by the corresponding coverage being overlapped of three kinds of vehicles with the
Four colors are rendered, and so on, until the corresponding coverage being overlapped of all vehicles is complete with N color rendering
Finish；
S404, if the trip starting point under specified conditions is two or more, and different trip starting points are corresponding
Coverage is overlapped, then is rendered the coverage not being overlapped between starting point of going on a journey two-by-two with the first color；By two
The corresponding coverage being overlapped of starting point of going on a journey is rendered with third color, and three starting points of going on a journey are corresponded to the reachable of coincidence
Range is rendered with the 4th color, and so on, until by all corresponding coverage N face being overlapped of trip starting point
Color rendering finishes.
Wherein, the first color, the second color, third color ..., N color be different colors.
Technical solution of the present invention on two-dimentional commercial map by carrying out the hour circles such as traffic using hour circles concepts such as traffic
Drafting and virtual interactive interface, show by various modes of transportation trip when coverage and the relationship of time, for any
Starting point, any time, multiple starting points, a variety of traffic the hour circles inquiry such as traffic, do not meet traveler for multi-destination or not
Determine the trip requirements of destination.
Detailed description of the invention
Fig. 1 is the effect diagram of the visualization application of the hour circles such as the traffic based on 1 starting point of going on a journey；
Fig. 2 is the effect diagram of the visualization application of the hour circles such as the traffic based on 2 starting points of going on a journey；
Specific embodiment
Following will be combined with the drawings in the embodiments of the present invention, and technical solution in the embodiment of the present invention carries out clear, complete
Site preparation description, it is clear that described embodiments are only a part of the embodiments of the present invention, instead of all the embodiments.It is based on
Embodiment in the present invention, it is obtained by those of ordinary skill in the art without making creative efforts every other
Embodiment shall fall within the protection scope of the present invention.
The present invention proposes a kind of hour circles visualization application methods such as the traffic based on the open data of commercial map.This method
Specific mode of operation is: determining start of line point, selectes a kind of vehicles, is selected by the interactive mode continuously chosen
The row time；Started again with starting point of going on a journey, will can reach region in the case where the selected vehicles and travel time,
Range coverage can be shown respectively with unreachable region by two different colors on map, as a result, to facilitate out
Passerby can intuitively judge by specifying the vehicles within a specified time attainable spatial dimension of institute.
For ease of understanding, it is illustrated below in conjunction with specific embodiments.
Embodiment 1:
Step 1, the position data that the existing bus station in target area is obtained from commercial map open platform, then by position
Confidence breath cleaned, duplicate removal, storage as the key point in the visualization of the hour circles such as traffic form crucial point list.
Step 2, keypoint quantity is counted, commuting time data of all key points between any two under public transport are calculated.It will
Commuting time data are stored as the matrix of n*n, construct commuting time matrix.Wherein n indicates the quantity of key point, the member in matrix
Plain TPiPjIndicate commuting time of i-th key point Pi to the j-th key point Pj under public transport.In step 2, commuting time number
Commuting time matrix is constructed according to equally corresponding commuting time data can be obtained using commercial map open platform.
Step 3, based on the key point and corresponding commuting time data obtained in step 1- step 2, data are divided
Analysis calculates the coverage under specified requirements.The specified requirements refers to: being trip starting point with O point, travel time t is handed over
Logical tool is public transport.Specific calculate includes the following steps:
Step 301, whether detection O point is overlapped with the key point in the crucial point list of public transport；If the key of O point and public transport
When a certain key point in point list is overlapped, 302a-306a is thened follow the steps:
Step 302a, it is assumed that the point being overlapped with O point is P1, counts all TP1PiAll key point Pi of≤t, wherein TP1Pi
For the commuting time between key point P1 to key point Pi.
Step 303a calculates the reach distance L1 for passing through the second travel modal in time t, and calculating with P1 is circle
The heart passes through the second travel modal attainable range coverage D1, D1=using reach distance L1 as radius in time t
π*(L1)2.Wherein, reach distance L1 is passes through the mobile farthest linear distance of the second travel modal in time t.The
Two modes of transportation are the closely lower travel modal that can freely plug into, and such as walking or are ridden.In the present embodiment, it adopts
What is used is walking as the second travel modal.Wherein L1=SStep* t, SStepFor the walking speed of ordinary meaning servant, it is contemplated that
The complexity of Urban Streets road, tends not to carry out direct straight line walking manner, therefore SStepIt should be faster than the walking of ordinary meaning
Degree is slow, value 1m/s, to reduce calculating error.
Step 304a is calculated in time t-TP1PiThe interior reach distance Li by walking is calculated using Pi as the center of circle, with reachable
Distance Li is radius, in time t-TP1PiInside pass through the second travel modal institute attainable range coverage Di, Di=π *
(Li)2.Similarly, Li=SStep*(t-TP1Pi), SStepTake 1m/s.
Step 305a, circulation step S304a, until the range coverage Di calculating of the key point Pi of all statistics is finished；
Range coverage D1 and all range coverage Di are superimposed by step 306a according to position distribution relationship, shape
At being trip starting point with key point P1 (i.e. O point), pass through the attainable coverage of public transport institute in time t.
If O point is not overlapped with all key points in the crucial point list of public transport, 302b-309b is thened follow the steps:
Step 302b finds out the key point that distance O point is nearest in the crucial point list of public transport.In this example, it is assumed that
The key point nearest from O point is P2.
Step 303b calculates the time t2 for reaching P2 point from O point by the second travel modal.Similarly, in step
The second travel modal in 303b is the walking under ordinary meaning, and considers the complexity of Urban Streets road, walking
Corresponding walking speed SStepTake 1m/s.Assuming that the distance between O point and key point P2 are Lo2, then t2=Lo2/SStep。
Step 304b counts all TP2PjAll key point Pj of≤t-t2, wherein TP2PjFor key point P2 to key point Pj
Between commuting time；
Step 305b calculates the reach distance Lo that can be walked in time t by walking, calculates using O point as the center of circle, with can
It is radius up to distance Lo, passes through range coverage Do, Do=the π * (Lo) of walking in time t2。
Step 306b calculates the reach distance L2 that can be walked in time t-t2 by walking, calculates using P2 as the center of circle, with
Reach distance L2 is radius, passes through range coverage D2, D2=the π * (L2) of walking in time t2。
Step 307b is calculated in time t-t2-TP2PjThe interior reach distance Lj that can be walked by walking, using Pj as the center of circle,
It calculates using Pj as the center of circle, using reach distance Lj as radius, in time t-t2-TP2PjInterior range coverage Dj, Dj=by walking
π*(Lj)2。
Step 308b, circulation step S307b, until the range coverage Dj calculating of the key point Pj of all statistics is finished；
Step 309b folds range coverage Do, range coverage D2 and all range coverage Dj according to the distribution of key point
It is added together, being formed with O point is trip starting point, by the attainable coverage of public transport institute in time t, that is, is formed and is based on
The hour circles such as the traffic that public transport is reached out of O point departure time t.
Step 4, the map secondary development components provided by commercial map by the coverage generated under specified requirements and
Unreachable region carries out rendering processing, and coverage is highlighted on commercial map.In step 4, commercial map mentions
The secondary development components of confession refer to a kind of render component, it is as follows specifically to render mode: reachable by what is generated under specified requirements
Range is rendered with the first color, and the region in addition to coverage is rendered with the second color.As shown in Figure 1, in order to
Coverage is highlighted, coverage is indicated with white, unreachable region gray display.
It is the visualization application of the hour circles such as the traffic reached out of O point departure time t based on public transport, remaining traffic work above
Have (such as subway, electric car) similarly.It is new to determine that user can change trip starting point, travel time and the vehicles according to demand
The hour circles such as traffic.
Further, since different trip starting points are formed by the hour circles such as traffic and are independent of each other, therefore, user can be with
Choose two trip starting points as needed to determine the hour circles such as two different traffic.As shown in Fig. 2, passing through secondary development group
Part renders the coverage not being overlapped between two starting points of going on a journey with the color between white and grey；By two
A corresponding coverage white being overlapped of trip starting point is rendered, except two corresponding coverages of trip starting point
Region indicated with grey, so that different regions be distinguished, in order to which user quickly judges based on two different trips
The hour circles such as the common traffic that starting point determines.Similarly, user can also choose more than two trip starting points, so that it is determined that
More than two trip starting points determine the hour circles such as common traffic.
It should be noted that when selecting two or more trip starting points, the travel time of each trip starting point
With the vehicles.
Embodiment 2:
Step 1, the position data of target area existing bus station and subway station is obtained from commercial map open platform,
Then location information is cleaned, duplicate removal, storage, as the key point in the visualization of the hour circles such as traffic, is formed and public transport pair
The crucial point list 1 and crucial point list 2 corresponding with subway answered.And it is one that crucial point list 1 is combinable with crucial point list 2
A key point list 3, the efficiency that key point obtains when improving subsequent calculating.
Step 2, the keypoint quantity in crucial point list 3 is counted, calculates all key points between any two on public transport or ground
Commuting time data under iron or public transport and subway.Commuting time data are stored as to the matrix of n*n, construct commuting time square
Battle array.Wherein n indicates the quantity of key point, the element T in matrixPiPjIndicate i-th key point Pi to j-th key point Pj in public affairs
Commuting time under handing over.In step 2, commuting time data equally obtain corresponding commuting using commercial map open platform
Time data construct commuting time matrix.
Step 3, based on the key point and corresponding commuting time data obtained in step 1- step 2, data are divided
Analysis calculates the coverage under specified requirements.One in trip starting point and travel time and embodiment under the specified requirements
It causes, what the vehicles were chosen is public transport and subway.In addition to the specific key point of the expressions such as Pi, Pj, Di, Dj is different with numerical value,
The specifically calculating process of coverage will not repeat them here as the calculating process in embodiment 1.
Step 4, the map secondary development components provided by commercial map by the coverage generated under specified requirements and
Unreachable region carries out rendering processing, and coverage is highlighted on commercial map.
In example 2, user can plan trip plan by selection public transport and both different vehicles of subway
Slightly, coverage of the user within the identical travel time is improved.
It should be noted that user can plan trip strategy, above-mentioned implementation by selecting the two or more vehicles
Example be merely to illustrate user can be planned by two different vehicles trip strategy, and it is non-limiting can only pass through two kinds friendship
Logical tool come plan trip strategy.
The present invention has the advantages that
1, data are acquired using the free open platform of commercial map service provider, can effectively obtained lasting, stable, effective
Position data (i.e. key point information) and commuting time data so that the calculating of the hour circles such as traffic can fit not by regional impact
For any city, method portability is very strong.Also, the data obtained from commercial map also have real-time, so that in real time
It calculates the hour circles such as traffic and provides data basis.
2, bus station, subway station etc. of transport hub node can be represented as key point by choosing, (or is ridden in conjunction with walking
Row) radius circle determine range coverage, by point and face, simplify the calculating process of the hour circles such as traffic, and due to combining out
The commuting time data of row tool, accuracy have higher, solve the hour circles such as conventional traffic and are calculated by grid method for drafting
Problem complicated, data requirements amount is big
3, the present invention can choose any time, and any starting point, multiple starting points, a variety of travel modals is arranged, facilitates use
Family quickly judge based on certain starting point etc. hour circles range, including the region that can be reached within a limited period of time and cannot reach
Region.
The above description is only a preferred embodiment of the present invention, is not intended to limit the scope of the invention, all at this
Under the inventive concept of invention, using equivalent structure transformation made by description of the invention and accompanying drawing content, or directly/use indirectly
It is included in other related technical areas in scope of patent protection of the invention.
Claims (5)
1. a kind of hour circles such as traffic based on the open data of commercial map visualize application method, which is characterized in that including as follows
Step:
S100 specifies a target area, the position of the key point of the Urban Transport Terminals of the target area is obtained from commercial map
Data information is set, the crucial point list in target area is constructed；Wherein, the key point of Urban Transport Terminals is the different vehicles
Website, corresponding one crucial point list of every kind of different vehicles；
S200 calculates commuting time T of all key points between any two under corresponding vehicles, constructs commuting time
Matrix；The corresponding commuting time matrix of every kind of vehicles；
S300 analyzes data based on the key point and corresponding commuting time data obtained in S100-S200, calculates
Coverage under specified conditions, specific calculate include the following steps:
S310 selectes trip starting point and the vehicles, and determines travel time t by way of continuously choosing, by what is selected
Trip starting point is defined as O point, and trip mode corresponding to the selected vehicles is defined as the first travel modal；
Whether whether S320, detection O point are overlapped with the key point Pi in the selected vehicles；
When O point is overlapped with key point Pi,
S321a counts all TPiPjAll key point Pj of≤t, wherein TPiPjFor the commuting between key point Pi to key point Pj
Time；
S322a calculates the reach distance Li for passing through the second travel modal in time t, calculates using Pi as the center of circle, with reachable
Distance Li is radius, the range coverage Di that can be reached in time t by the second travel modal；
S323a is calculated in time t-TPiPjInside pass through the reach distance Lj of the second travel modal, calculates using Pj as the center of circle, with
Reach distance Lj is radius, in time t-TPiPjInside pass through the range coverage Dj that the second travel modal can reach；
S324a, circulation step S323a, until the range coverage Dj calculating of the key point Pj of all statistics is finished；
Range coverage Di and all range coverage Dj are superimposed by S325a according to position distribution relationship, are formed with O point
For starting point of going on a journey, the coverage that can be reached in time t by the selected vehicles；
S326a selectes one of remaining vehicles again and is used as trip tool, calculates the reachable model under the trip tool
It encloses；The step is recycled, until the coverage calculating of all vehicles is finished；
When O point is not overlapped with the key point Pi point of the selected vehicles,
S321b finds out the key point Pk that distance O point is nearest in the crucial point list of the selected vehicles；
S322b calculates the time t1 for reaching Pk point from O point by the second travel modal；
S323b counts all TPkPjAll key point Pj of≤t-t1, wherein TPkPjBetween key point Pk to key point Pj
Commuting time；
S324b is calculated in time t through the reach distance Lo of the second travel modal, is calculated using O point as the center of circle, with can
It is radius up to distance Lo, passes through the attainable range coverage Do of the second travel modal institute in time t；
S325b is calculated in time t-t1 through the reach distance Lk of the second travel modal, is calculated using Pk as the center of circle, with
Reach distance Lk is radius, passes through the attainable range coverage Dk of the second travel modal institute in time t；
S326b is calculated in time t-t1-TPkPjInside pass through the reach distance Lj of the second travel modal, calculating with Pj is circle
The heart, using reach distance Lj as radius, in time t-t1-TPkPjInside pass through the attainable range coverage of the second travel modal institute
Dj；
S327b, circulation step S326b, until the range coverage Dj calculating of the key point Pj of all statistics is finished；
Range coverage Do, range coverage Dk and all range coverage Dj are superimposed upon one according to position distribution relationship by S328b
It rises, being formed with O point is trip starting point, passes through the coverage of the selected vehicles in time t；
S329b selectes one of remaining vehicles again and is used as trip tool, calculates the reachable model under the trip tool
It encloses；And S329b step is recycled, until the coverage calculating of all vehicles is finished；
S400, the map secondary development components provided by commercial map are by the coverage generated under specified conditions and unreachable
Region carries out rendering processing respectively, and coverage is highlighted on commercial map.
2. the hour circles such as the traffic as described in claim 1 based on the open data of commercial map visualize application method, feature
It is, further includes that the crucial point list of the different vehicles is merged into a crucial point list in the step s 100.
3. the hour circles such as the traffic as described in claim 1 based on the open data of commercial map visualize application method, feature
It is, further includes that the commuting time matrix of the different vehicles is merged into a commuting time matrix in step s 200.
4. the hour circles such as the traffic as described in claim 1 based on the open data of commercial map visualize application method, feature
It is, in the step S310, selected trip starting point is one or more, and the selected vehicles are a kind of or more
Kind.
5. the hour circles such as the traffic based on the open data of commercial map as described in claim 1-4 any one visualize application side
Method, which is characterized in that the rendering processing mode in the step S400 is as follows:
S401 renders the coverage generated under specified conditions with the first color；
S402 renders in the region in addition to coverage with the second color, wherein the brightness of the first color is greater than the second face
The brightness of color；
S403, if the vehicles under specified conditions are two or more, and corresponding reachable model under the different vehicles
Coincidence is enclosed, then is rendered the coverage not being overlapped between the vehicles two-by-two with the first color；By two kinds of vehicles
The corresponding coverage being overlapped is rendered with third color, by corresponding the 4th face of coverage being overlapped of three kinds of vehicles
Color is rendered, and so on, until the corresponding coverage being overlapped of all vehicles is finished with N color rendering；
S404, if the trip starting point under specified conditions is two or more, and different trip starting points are corresponding reachable
Range is overlapped, then is rendered the coverage not being overlapped between starting point of going on a journey two-by-two with the first color；Two are gone on a journey
The corresponding coverage being overlapped of starting point is rendered with third color, by three corresponding coverages being overlapped of starting point of going on a journey
It is rendered with the 4th color, and so on, until by all corresponding coverage N color wash with watercolours being overlapped of trip starting point
Dye finishes.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910220759.3A CN110046208B (en) | 2019-03-22 | 2019-03-22 | Traffic equal time circle visualization application method based on commercial map open data |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910220759.3A CN110046208B (en) | 2019-03-22 | 2019-03-22 | Traffic equal time circle visualization application method based on commercial map open data |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110046208A true CN110046208A (en) | 2019-07-23 |
| CN110046208B CN110046208B (en) | 2022-12-27 |
Family
ID=67274974
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910220759.3A Active CN110046208B (en) | 2019-03-22 | 2019-03-22 | Traffic equal time circle visualization application method based on commercial map open data |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110046208B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111176773A (en) * | 2019-09-18 | 2020-05-19 | 海南太美航空股份有限公司 | Target airport recommendation display method, system and terminal based on aviation big data |
| CN112287049A (en) * | 2020-09-28 | 2021-01-29 | 珠海大横琴科技发展有限公司 | Map service processing method and device |
| CN113656524A (en) * | 2021-08-18 | 2021-11-16 | 广州医药信息科技有限公司 | Dual-grid-computing-based traffic equal time circle computing method and system |
| CN114396962A (en) * | 2022-02-25 | 2022-04-26 | 北京世纪高通科技有限公司 | Reachable domain generation method, device, equipment and storage medium |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106777017A (en) * | 2016-12-08 | 2017-05-31 | 国信优易数据有限公司 | Commute range query system and method in a kind of time limit based on electronic map |
| CN108151756A (en) * | 2017-12-21 | 2018-06-12 | 深圳市综合交通运行指挥中心 | The travel time computation method and device of a kind of urban public tranlport system |
-
2019
- 2019-03-22 CN CN201910220759.3A patent/CN110046208B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106777017A (en) * | 2016-12-08 | 2017-05-31 | 国信优易数据有限公司 | Commute range query system and method in a kind of time limit based on electronic map |
| CN108151756A (en) * | 2017-12-21 | 2018-06-12 | 深圳市综合交通运行指挥中心 | The travel time computation method and device of a kind of urban public tranlport system |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111176773A (en) * | 2019-09-18 | 2020-05-19 | 海南太美航空股份有限公司 | Target airport recommendation display method, system and terminal based on aviation big data |
| CN111176773B (en) * | 2019-09-18 | 2023-08-04 | 海南太美航空股份有限公司 | Target airport recommendation display method, system and terminal based on aviation big data |
| CN112287049A (en) * | 2020-09-28 | 2021-01-29 | 珠海大横琴科技发展有限公司 | Map service processing method and device |
| CN113656524A (en) * | 2021-08-18 | 2021-11-16 | 广州医药信息科技有限公司 | Dual-grid-computing-based traffic equal time circle computing method and system |
| CN114396962A (en) * | 2022-02-25 | 2022-04-26 | 北京世纪高通科技有限公司 | Reachable domain generation method, device, equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110046208B (en) | 2022-12-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110046208A (en) | The hour circles such as the traffic based on the open data of commercial map visualize application method | |
| CN107038488B (en) | Parking lot real-time parking space reservation method based on parking space prediction and parking selection | |
| Chen et al. | B-Planner: Night bus route planning using large-scale taxi GPS traces | |
| Harper et al. | Exploring the economic, environmental, and travel implications of changes in parking choices due to driverless vehicles: An agent-based simulation approach | |
| CN106504577B (en) | A kind of park and shift traffic path method and device for planning | |
| EP0870290B1 (en) | Cost zones | |
| CN109409662B (en) | Measuring method for correlation between urban traffic and commercial space based on space syntax | |
| CN107301787A (en) | Large parking lot positioning and bootstrap technique based on position Quick Response Code | |
| CN113607177B (en) | Electric automobile intelligent charging path guiding method considering multi-source time-space data | |
| CN107024219A (en) | A kind of park and shift paths planning method and device | |
| CN114495552A (en) | Navigation method and system for quickly parking and finding vehicle | |
| Ghamami et al. | Electric Vehicle Charger Placement Optimization in Michigan: Phase I-Highways | |
| CN112906981A (en) | Computer-based transfer coverage rate public transport line station setting evaluation method | |
| Lindblad | Deployment methods for electric vehicle infrastructure | |
| JP2023112934A (en) | Parking lot proposal system | |
| Zhou et al. | Investigating the intention of rural residents to use transit in Cixi, China | |
| CN111442783B (en) | Method and terminal for optimizing path planning | |
| Hadded et al. | Platoon Route Optimization for Picking up Automated Vehicles in an Urban Network | |
| Dong et al. | A framework for electric vehicle charging-point network optimization | |
| CN105973250A (en) | Two-dimensional bar code-based large hub path induction assisting method | |
| Patil et al. | Site Suitability Assessment of Public EV Charging Stations in Urban Environment | |
| Nigro et al. | Assessing the Electric Vehicle Charging Network in Washington State | |
| Khanduja et al. | Park-Space: A Parking Space Indicator | |
| ElBanhawy | To cluster the E-mobility recharging facilities (RFs) | |
| Hof | Analysis of parking facilities in Enschede |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |