CN107895392B - Time map drawing method - Google Patents
Time map drawing method Download PDFInfo
- Publication number
- CN107895392B CN107895392B CN201711167980.4A CN201711167980A CN107895392B CN 107895392 B CN107895392 B CN 107895392B CN 201711167980 A CN201711167980 A CN 201711167980A CN 107895392 B CN107895392 B CN 107895392B
- Authority
- CN
- China
- Prior art keywords
- time
- map
- points
- geographic
- area
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T11/00—2D [Two Dimensional] image generation
- G06T11/20—Drawing from basic elements, e.g. lines or circles
- G06T11/206—Drawing of charts or graphs
Landscapes
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Instructional Devices (AREA)
Abstract
The invention discloses a method for drawing a time map. Relates to the field of map drawing. The method comprises the following steps: s1: the method comprises the steps of collecting the position information of the geographic point in a drawing area, selecting the area range to be drawn, determining the geographic point required to be displayed on a map in the area, and collecting the position information of the displayed geographic point, wherein the collection mode can call a Baidu map API to read the geographic position information in a database, or adopt related data provided by a national geographic basic information center. Compared with the prior art, the invention realizes the core function of the time map, namely the passing time of any two points in the drawing area is read, and when a user uses the time map, the relative position relation between the geographical points and the geographical points can be seen, and the passing distance between the geographical points can be read according to the scale. Meanwhile, the optimization of the model and the algorithm shortens the time consumption of the whole calculation and drawing process, and the accuracy of the time map is ensured for the accuracy analysis.
Description
Technical Field
The invention relates to the technical field of map drawing, in particular to a time map drawing method.
Background
With the development of the transportation industry, the restriction effect of the spatial distance on the travel of the residents is gradually reduced, and the residents pay more attention to the 'time spent on reaching the destination' rather than the 'distance to the destination' when traveling, which indicates that the time factor has a more important influence on the travel selection of the residents. Meanwhile, due to the non-uniformity of the spatial distribution of the traffic infrastructure, the positive correlation between the travel time of residents and the distance between two places in the traditional sense is weaker and weaker, people pay more attention to the accessibility and convenience of the traffic between the two places, the traditional geographical map can only display the distance between the departure place and the destination, and users cannot visually see the time required for completing the travel on the map.
The time map is based on a traditional map, under the condition that the original geographical position cognition of a user is not influenced, coordinate conversion is carried out on geographical points, the space relative position relation between the geographical points is ensured to be unchanged as much as possible, and the passing distance between two places is represented by time, so that the user can read the distance between any two points on the map, namely the time required by the passing of the two places. The invention is suitable for drawing a time map under one traffic mode (but not limited to one traffic mode) because the two-place traffic time is different due to different traffic modes.
The existing time map drawing technology is not complete at present, the transformation of a time map based on a traveler motion track is mainly adopted, and the transformation from a traditional road thematic map to the time map based on the motion track is realized. Firstly, preprocessing data, finishing and perfecting original road data of a drawing area, calculating travel time at different speeds, selecting traffic nodes, checking topological relation, and constructing a geometric network data set of the drawing area; then, ArcGIS Engine 9.3 design software is used for obtaining the road path track with the shortest time, and partial unselected road tracks are also transformed into a time map by using a single-point interpolation algorithm and a double-point interpolation algorithm, so that the time maps with different starting points are drawn. In this way, the time distances from other cities to the same city in the area can be read, but the distance between any two cities cannot be accurately represented.
In order to allow the drawn time map to realize the purpose that the user can directly read the two-place transit time, the theoretical basis and the technology of the existing time map drawing need to be further perfected on the basis of the prior art.
Disclosure of Invention
The invention aims to provide a time map drawing method, which solves the problems in the background technology.
In order to achieve the purpose, the invention provides the following technical scheme: a method of time map rendering comprising the steps of:
s1: collecting the position information of the geographic point in the drawing area, selecting the area range to be drawn, determining the geographic point required to be displayed on the map in the area, and collecting the position information of the displayed geographic point.
The collection mode can call a Baidu map API to read the geographic position information in the database, or adopt related data provided by a national geographic basic information center.
The representation form of the geographic position information can be represented by latitude and longitude, and can also be represented by other coordinate systems.
S2: and collecting the information of the passing time between the geographic points in the drawing area, and selecting the traffic mode for passing between the geographic points after the geographic point required to be displayed in the drawing area is selected at S1.
After the adopted traffic mode is selected, different time information acquisition methods are adopted for different traffic modes.
S3: and preprocessing the geographic position information and the traffic time information, and preprocessing the geographic position information and the traffic time information in Excel.
If n geographical points to be displayed in the drawing area are set, the position information of the geographical points is represented by longitude and latitude, the longitude is an abscissa, and the latitude is an ordinate, the abscissa forms a 1 × n matrix, and the ordinate is also a 1 × n matrix.
Assuming that there are n geographical points to be displayed in the drawing area, and the travel time information between the geographical points to be displayed in the drawing area is represented by an n × n matrix, it is assumed here that the time of round trip between the departure point and the destination coincides, and therefore the n × n matrix is represented in the form of an upper triangular matrix or a lower triangular matrix, and in particular, when the departure point and the destination are the same, the travel time is 0.
S4: in the establishment of the time map model, a traffic channel may exist between one geographic point and a plurality of geographic points and correspond to a plurality of traffic times, but on a two-dimensional plane map, the relative positions of the three points can be determined by the relation between any three points, when the undetermined point and the two points exceed the time distance relation, accurate description of all the relations cannot be realized, and only all the relations can be satisfied as much as possible, so that the time drawing is converted into an optimization problem. The time map model provided by the invention is expressed by adopting a nonlinear least square method problem, and the expression is as followsThe following:in the formula, i, j—;&# 8212; a number of the geographic entity; l is—;&# 8212; a set of all geographic entities; t is tij—;&# 8212; time of passage of two places i, j, let tij=tji;xi,yi—;&# 8212; horizontal and vertical coordinates of the geographic point on the time map S5: the time map model is solved based on a Matlab platform, and the time map model is solved by programming by means of an optimized Leverberg-Marquardt method added with a conformal rule. The algorithm gives approximate values to variables of the target function and linearizes the approximate values, the minimum variables of the approximate solutions are used as regular conditions, repeated iterative computation is carried out on the imported longitude and latitude coordinates until the coordinates meeting the precision requirement are configured, and the coordinates meeting the precision requirement are displayed on a two-dimensional plane, namely, a drawn time map. S6: as described in S4, the drawn time map cannot accurately guarantee the distance between any two points on the map, that is, the transit time between two points, but as long as sufficient accuracy is guaranteed, the user is not greatly impaired in cognition. Therefore, the drawn time map needs to be subjected to precision analysis to ensure the accuracy of the time map, the invention provides an algorithm for the correlation of the transit time between any two points before and after drawing, and the requirement is met when the correlation between the transit time between 90% of geographic points on the drawn time map and the real transit time reaches 90%. S7: the coordinate data of the administrative boundary in the additionally drawn area of the administrative boundary on the time map can be read from the geographic position information in the database by calling a Baidu map API, on the basis of the completion of the drawing of the geographic point displayed by the time map, the coordinates of the drawn (coordinate transformation completed) geographic point and the administrative boundary coordinates which are not transformed are normalized, the two graphs are placed on the same graph layer, and the time map with the administrative boundary in the area can be obtained by stretching and transforming.
Preferably, the transportation modes in the step S2 include road, railway and aviation, and only one transportation mode can be selected, but not limited to the three transportation modes listed.
Preferably, when the highway traffic is selected, the fastest passing road route is obtained by the Baidu map APP on the basis of drawing a road network in the area, and the passing time under the route is used as the passing time of two places.
Preferably, when the railway transportation is selected, on the basis of drawing a railway network in an area, the train number between two geographical points is directly inquired through the website inquiry and acquisition of a Chinese railway customer service center, and the train number travel time with the shortest required time is taken as the time of the geographical point; for geographical points without direct trains, inquiring the train transfer mode under 'transfer inquiry', and taking the time with the shortest time interval between the departure time and the arrival time as the passing time between the two geographical points, wherein the passing time in the situation comprises the train running time and the transfer waiting time.
Preferably, when the air traffic is selected, based on the chart in the drawing area, the shortest time of the two places of direct flight is obtained through the ticketing information of each airline company and is taken as the passing time between the two geographical points, and the time, which is required to pass through the intermediate switch and has the shortest time interval between the departure time and the arrival time, is taken as the passing time between the two geographical points, and the passing time in this case includes the flight time and the waiting time for switching.
Preferably, when the highway traffic is selected, the fastest passing road route is obtained by the Baidu map APP on the basis of drawing a road network in the area, and the passing time under the route is used as the passing time of two places.
Compared with the prior art, the invention has the beneficial effects that: compared with the prior art, the invention realizes the core function of the time map, namely the passing time of any two points in the drawing area is read, and when a user uses the time map, the relative position relation between the geographical points and the geographical points can be seen, and the passing distance between the geographical points can be read according to the scale. Meanwhile, the optimization of the model and the algorithm shortens the time consumption of the whole calculation and drawing process, and the accuracy of the time map is ensured for the accuracy analysis.
Drawings
FIG. 1 is a flow chart of a rendering method of the present invention;
FIG. 2 is a geographic map of a 41-seater city in the rectangular region of the present invention;
FIG. 3 is a time map of a 41-seater city in the Long triangular region of the present invention;
fig. 4 is a time map of the city of the gorge 41 in the present invention with administrative boundaries added.
Detailed Description
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 only a part of the embodiments of the present invention, and not all of the embodiments. 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.
As shown in fig. 1, the present invention relates to a method for drawing a time map, which comprises the following steps: the method comprises the steps of collecting geographical point position information in a drawing area (S1), collecting traffic time information between geographical points in the drawing area (S2), preprocessing the geographical position information and the traffic time information (S3), establishing a time map model (S4), solving the time map model (S5), analyzing the precision of a time map drawing result (S6), and adding an administrative boundary on a time map (S7).
The following further describes the embodiments of the present invention with reference to the drawings, and the examples are only for illustrating the present invention and are not meant to limit the present invention.
S1: collection of geographical point location information within a drawing area
The implementation method selects the Yangtze river delta area in China as a drawing area of a time map, and selects 41 main cities in the area as geographical points needing to be displayed on the map, and comprises the following steps: shanghai, Liyuanchong, Xuzhou, Huaian, Yancheng, Taizhou, Yangzhou, Zhenjiang, Changzhou, Nantong, Suzhou, Nanjing, Jiaxing, Hangzhou, Shaoxing, Ningbo, Jinhua, Lishui, Wenzhou, Taizhou, Quzhou, Huangshan, Xuan, Anqing, Pozhou, Tongling, Wenhuang, Yangtouyang, Unioniu, Liquan, Liuzhou, Huainan, Anhuo, dormitou, dormitozhou, Bozhou, Huabei, Kunshan, Danyang, and Dingyuan. The coordinates of 41 cities are obtained from a longitude and latitude data table of each Chinese big city provided by a national geographic basic information center.
S2: acquisition of transit time information between geographical points within a drawing area
On the basis of a long triangular railway network, directly inquiring the train number between two geographical points by website inquiry and acquisition of a China railway customer service center, and taking the train number travel time with the shortest required time as the time of the geographical points for the geographical points of a direct train; for geographical points without direct trains, inquiring the train transfer mode under 'transfer inquiry', and taking the time with the shortest time interval between the departure time and the arrival time as the passing time between the two geographical points, wherein the passing time in the situation comprises the train running time and the transfer waiting time.
S3: preprocessing of geographical location information and transit time information
The position information of the geographic point is represented by longitude and latitude, the longitude is an abscissa, and the latitude is an ordinate, so that the abscissa forms a 1 × 41 matrix, and the ordinate is also a 1 × 41 matrix.
The travel time information between the geographical points to be displayed in the drawing area is represented by a 41 × 41 matrix, and it is assumed here that the round-trip time of the departure point and the destination coincides, and therefore the 41 × 41 matrix is represented in the form of an upper triangular matrix or a lower triangular matrix, and particularly, when the departure point and the destination are the same, the travel time is 0.
S4: establishment of time map model
The time map model provided by the invention is expressed by adopting a nonlinear least square method problem, and the expression is as follows:
in the formula (I), the compound is shown in the specification,
i, j-number of geographic entity;
l-a set of all geographic entities;
tij-transit time of two places i, j, let tij=tji;
xi,yi-horizontal and vertical coordinates of the geographical point on the time map.
S5: solving of time map model
Based on a Matlab platform, programming is carried out by means of an optimized Leverberg-Marquardt method added with a conformal rule, and the solution of a time-map model is realized, wherein the method comprises the following steps:
s51: importing and storing geographic position information and traffic time information
Calling an example, importing geographical location information and transit time information, and storing data in a matrix form by using a storage instruction save.
S52: operation of the Leverberg-Marquardt algorithm
Calling a Leverberg-Marquardt algorithm of [ xf, yf, Sx, Sy, cnt ] ═ LMFsolve ('rosen', [ ]) to perform program operation, and converting the coordinates of the city points into coordinates on a time map from actual longitude and latitude, wherein specific codes are as follows:
s53: the coordinates of each city point on the time map obtained by the calculation in S52 are displayed in the form of a two-dimensional map, and a time map of 41 cities in the long delta area of china is obtained, as shown in fig. 3.
S6: precision analysis of time mapping results
Determining the correlation of the passing time between any two points before and after drawing, wherein the codes are as follows:
[r,p]=corrcoef(T,Tnew);
sprintf ('t correlation coefficient r ═ 4d', r (1,2))
[r,p]=corrcoef(yff./xff,y0./x0);
sprintf ('angle correlation coefficient r ═ 4d', r (1,2))
The calculated result is: the time correlation coefficient is 95.54%, the angle correlation coefficient is 99.31%, the accuracy requirement is met, and the drawn time map can be used.
S7: addition of administrative boundaries on a time map
The coordinate data of the administrative boundary in the drawing area can be read from the geographic position information in the database by calling a Baidu map API, and the coordinates of the drawn (coordinate transformation completed) geographic point and the administrative boundary coordinates which are not transformed are normalized on the basis of the completion of the drawing of the geographic point displayed by the time map. And (3) placing the two graphs in the same graph layer in AutoCAD, performing stretching transformation to obtain a time map with an administrative boundary in the area, and drawing the result as shown in FIG. 4.
In summary, the following steps: compared with the prior art, the invention realizes the core function of the time map, namely the passing time of any two points in the drawing area is read, and when a user uses the time map, the relative position relation between the geographical points and the geographical points can be seen, and the passing distance between the geographical points can be read according to the scale. Meanwhile, the optimization of the model and the algorithm shortens the time consumption of the whole calculation and drawing process, and the accuracy of the time map is ensured for the accuracy analysis.
It should be noted that, in this document, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus.
Although embodiments of the present invention have been shown and described, it will be appreciated by those skilled in the art that changes, modifications, substitutions and alterations can be made in these embodiments without departing from the principles and spirit of the invention, the scope of which is defined in the appended claims and their equivalents.
Claims (5)
1. A method of time map rendering, characterized by: the method comprises the following steps:
s1: collecting the position information of the geographic point in the drawing area, selecting the area range to be drawn, determining the geographic point required to be displayed on the map in the area, and collecting the position information of the displayed geographic point;
the acquisition mode comprises calling a Baidu map API to read the geographic position information in the database, or adopting related data provided by a national geographic basic information center;
the representation form of the geographic position information comprises the representation by latitude and longitude;
s2: collecting the passing time information between the geographical points in the drawing area, and selecting a traffic mode for passing among the geographical points after S1 selects the geographical points to be displayed in the drawing area;
after the adopted traffic mode is selected, different time information acquisition methods are adopted for different traffic modes;
s3: preprocessing the geographic position information and the traffic time information, wherein the preprocessing of the geographic position information and the traffic time information is carried out in Excel;
setting n geographic points to be displayed in the drawing area, wherein the position information of the geographic points is represented by longitude and latitude, the longitude is an abscissa, and the latitude is an ordinate, so that the abscissa forms a 1 × n matrix, and the ordinate is also a 1 × n matrix;
assuming that there are n geographic points to be displayed in the drawing area, the transit time information between the geographic points to be displayed in the drawing area is represented by an n × n matrix, and it is assumed here that the time of round trip between the departure place and the destination is the same, and therefore the n × n matrix is represented in the form of an upper triangular matrix or a lower triangular matrix, and particularly, when the departure place is the same as the destination, the transit time is 0;
s4: establishing a time map model, wherein one geographic point may have a passage with a plurality of geographic points and correspond to a plurality of passage times, but on a two-dimensional plane map, the relative positions of the three points can be determined by the relation between any three points, when a point to be determined has a time distance relation with more than two points, accurate description on all the relations cannot be realized, and only all the relations can be met as far as possible, so that the time drawing is converted into an optimization problem; the time map model is expressed by a nonlinear least square method problem, and the expression is as follows:in the formula, i and j are the numbers of the geographic entities; l is a set formed by all geographic entities; tij is the transit time of the place with the number i and the number j, and the tij is tji; xi, yi are horizontal and vertical coordinates of the geographic point on the time map;
s5: the time map model is solved based on a Matlab platform, programming is carried out by means of an optimized Leverberg-Marquardt method added with a conformal rule, and the time map model is solved; the algorithm gives an approximate value to the variable of the target function and linearizes the approximate value, the minimum variable of the approximate solution is taken as a regular condition, repeated iterative computation is carried out on the imported longitude and latitude coordinates until the coordinates meeting the precision requirement are configured, and the coordinates meeting the precision requirement are displayed on a two-dimensional plane, namely a drawn time map;
s6: as described in S4, the accuracy analysis of the time map drawing result indicates that the distance between any two points on the time map drawn cannot be accurately guaranteed, that is, the transit time between two points, but as long as sufficient accuracy is guaranteed, a large cognitive impairment is not generated for the user; therefore, the drawn time map needs to be subjected to precision analysis to ensure the accuracy of the time map, the time map model comprises an algorithm for the correlation of the transit time between any two points before and after drawing, and the requirement is met when the correlation between the transit time between 90% of the geographic points on the drawn time map and the real transit time reaches 90%;
s7: the coordinate data of the administrative boundary in the additionally drawn area of the administrative boundary on the time map can be read from the geographic position information in the database by calling a Baidu map API, on the basis of the completion of the drawing of the geographic point displayed by the time map, the coordinates of the geographic point after the coordinate transformation is completed after the drawing and the coordinates of the administrative boundary which is not completed are normalized, the two graphs are placed on the same graph layer, and the time map with the administrative boundary in the area can be obtained by stretching and transforming.
2. A method of time mapping as claimed in claim 1, wherein: the transportation means in the step S2 includes road, railway, and aviation, and only one transportation means can be selected.
3. A method of time mapping as claimed in claim 2, characterized in that: when road traffic is selected, the fastest passing road route is obtained by the Baidu map APP on the basis of drawing a road network in an area, and the passing time under the route is used as the passing time of two places.
4. A method of time mapping as claimed in claim 2, characterized in that: when selecting railway traffic, on the basis of drawing a railway network in an area, inquiring and acquiring through a website of a China railway customer service center, directly inquiring train number between two geographical points for the geographical points with a through train, and taking train number travel time with the shortest required time as the time of the geographical points; for geographical points without direct trains, inquiring the train transfer mode under 'transfer inquiry', and taking the time with the shortest time interval between the departure time and the arrival time as the passing time between the two geographical points, wherein the passing time in the situation comprises the train running time and the transfer waiting time.
5. A method of time mapping as claimed in claim 2, characterized in that: when the air traffic is selected, the shortest time of two places of direct flight is obtained through ticket selling information of each airline company as the passing time of the two geographical points on the basis of a navigation chart in a drawing area, the time with the shortest time interval between departure time and arrival time of the time needing to pass through an intermediate switch is used as the passing time between the two geographical points, and the passing time in the case comprises the flight time and the waiting time of the switch.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201711167980.4A CN107895392B (en) | 2017-11-21 | 2017-11-21 | Time map drawing method |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201711167980.4A CN107895392B (en) | 2017-11-21 | 2017-11-21 | Time map drawing method |
Publications (2)
Publication Number | Publication Date |
---|---|
CN107895392A CN107895392A (en) | 2018-04-10 |
CN107895392B true CN107895392B (en) | 2021-09-07 |
Family
ID=61805675
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201711167980.4A Active CN107895392B (en) | 2017-11-21 | 2017-11-21 | Time map drawing method |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN107895392B (en) |
Families Citing this family (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN108520064B (en) * | 2018-04-11 | 2021-11-09 | 航天科技控股集团股份有限公司 | Playback track query method and system based on recorder platform |
CN109448539B (en) * | 2018-12-14 | 2021-03-19 | 深圳市置辰海信科技有限公司 | Multi-beam tone scale map drawing method based on QT framework |
CN109979197B (en) * | 2019-04-04 | 2021-01-29 | 重庆同枥信息技术有限公司 | Method and system for constructing highway traffic time map based on fusion data |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2007328050A (en) * | 2006-06-06 | 2007-12-20 | Matsushita Electric Ind Co Ltd | Map display device and map display method |
CN102027326A (en) * | 2008-06-25 | 2011-04-20 | 通腾科技股份有限公司 | Navigation device & method |
CN102184640A (en) * | 2011-05-05 | 2011-09-14 | 东南大学 | Method for automatically determining rescue path of expressway network |
WO2017067990A1 (en) * | 2015-10-19 | 2017-04-27 | Usadel Gmbh | Method for visually displaying the positions of selected destinations in maps in an altered manner |
-
2017
- 2017-11-21 CN CN201711167980.4A patent/CN107895392B/en active Active
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2007328050A (en) * | 2006-06-06 | 2007-12-20 | Matsushita Electric Ind Co Ltd | Map display device and map display method |
CN102027326A (en) * | 2008-06-25 | 2011-04-20 | 通腾科技股份有限公司 | Navigation device & method |
CN102184640A (en) * | 2011-05-05 | 2011-09-14 | 东南大学 | Method for automatically determining rescue path of expressway network |
WO2017067990A1 (en) * | 2015-10-19 | 2017-04-27 | Usadel Gmbh | Method for visually displaying the positions of selected destinations in maps in an altered manner |
Non-Patent Citations (1)
Title |
---|
基于GIS的广州城市时间地图研究;李文翎 等;《热带地理》;20080531;第28卷(第3期);全文 * |
Also Published As
Publication number | Publication date |
---|---|
CN107895392A (en) | 2018-04-10 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Kondor et al. | Estimating savings in parking demand using shared vehicles for home–work commuting | |
CN105893544B (en) | A method of city space big data map is generated based on POI industry situation data | |
CN107895392B (en) | Time map drawing method | |
CN104864879A (en) | Navigation path planning method and device | |
Li et al. | Explore the recreational service of large urban parks and its influential factors in city clusters–Experiments from 11 cities in the Beijing-Tianjin-Hebei region | |
CN103034737A (en) | Deviation rectifying method of electronic map | |
CN111581315A (en) | Method and device for calculating accessibility of public service facilities | |
CN106570789A (en) | Method for recognizing ecologically sensitive region in power grid planning based on GIS (Geographic Information System) | |
Yang et al. | An enhanced weight-based topological map matching algorithm for intricate urban road network | |
CN110309952A (en) | A kind of urban employment spatial configuration optimal auxiliary system based on commuting model | |
Shi | Research on accessibility and equity of urban transport based on multisource big data | |
CN110909951A (en) | Auxiliary design system for planning new city of historical famous city | |
Tsiaras et al. | parkitsmart: Minimization of cruising for parking | |
CN110059860A (en) | A kind of public charging station location layout Multipurpose Optimal Method in city | |
CN114548811A (en) | Airport accessibility detection method and device, electronic equipment and storage medium | |
CN105844031A (en) | Mobile phone positioning data based urban traffic corridor identification method | |
Hui et al. | Hotspots identification and classification of dockless bicycle sharing service under electric fence circumstances | |
Zhu et al. | Ridership prediction of urban rail transit stations based on AFC and POI data | |
CN106875321B (en) | Real-time automatic generation method for spatial data of train line | |
Keler et al. | Is there a relationship between complicated crossings and frequently visited locations? A case study with boro taxis and OSM in NYC | |
Gao et al. | Method of Predicting Passenger Flow in Scenic Areas Considering Multisource Traffic Data. | |
Hu et al. | Dynamic modeling of urban population travel behavior based on data fusion of mobile phone positioning data and FCD | |
AU2021102010A4 (en) | Method for Evaluating Accessibility of Electric Vehicle Charging Station | |
Tang et al. | Spatio-temporal reachable area calculation based on urban traffic data | |
CN106202577A (en) | A kind of multidimensional data abstracting method based on MDA |
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 |