CN107909187B - Method for quickly matching bus stops and road sections in electronic map - Google Patents
Method for quickly matching bus stops and road sections in electronic map Download PDFInfo
- Publication number
- CN107909187B CN107909187B CN201710978609.XA CN201710978609A CN107909187B CN 107909187 B CN107909187 B CN 107909187B CN 201710978609 A CN201710978609 A CN 201710978609A CN 107909187 B CN107909187 B CN 107909187B
- Authority
- CN
- China
- Prior art keywords
- bus
- road
- stops
- road section
- electronic map
- 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
- 238000000034 method Methods 0.000 title claims abstract description 21
- 241000287107 Passer Species 0.000 description 1
- 238000004134 energy conservation Methods 0.000 description 1
- 230000007613 environmental effect Effects 0.000 description 1
- 230000014509 gene expression Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
- G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
-
- 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
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/10—Complex mathematical operations
- G06F17/16—Matrix or vector computation, e.g. matrix-matrix or matrix-vector multiplication, matrix factorization
-
- 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
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/40—Business processes related to the transportation industry
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Business, Economics & Management (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Human Resources & Organizations (AREA)
- Databases & Information Systems (AREA)
- Economics (AREA)
- Data Mining & Analysis (AREA)
- Strategic Management (AREA)
- Mathematical Physics (AREA)
- Marketing (AREA)
- Mathematical Optimization (AREA)
- General Business, Economics & Management (AREA)
- General Engineering & Computer Science (AREA)
- Tourism & Hospitality (AREA)
- Computational Mathematics (AREA)
- Pure & Applied Mathematics (AREA)
- Mathematical Analysis (AREA)
- Algebra (AREA)
- Quality & Reliability (AREA)
- Computing Systems (AREA)
- Operations Research (AREA)
- Game Theory and Decision Science (AREA)
- Development Economics (AREA)
- Software Systems (AREA)
- Entrepreneurship & Innovation (AREA)
- Remote Sensing (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Navigation (AREA)
- Traffic Control Systems (AREA)
Abstract
The invention discloses a method for quickly matching bus stops and road sections in an electronic map, which comprises the steps of firstly determining a bus stop search area of each road section, taking the bus stops in the area as to-be-detected stops, then judging whether the distances between the to-be-detected stops and a certain road section are within a reasonable deviation range and on the right side of the road section one by one, if so, considering that the road section of the stop is successfully matched, and finally enabling a user to manually match the bus stops and the road sections which are not matched on the map. According to the method, the road sections to which the stops belong are automatically matched according to the position relation between the bus stops and the road sections, and finally the bus stops which cannot be automatically distinguished by a computer are displayed in a map, so that a user can automatically match the road sections to which the stops belong, the time for manually matching the road sections one by one is saved, the matching accuracy is improved, and a network basis is provided for the calculation of the subsequent bus passenger flow distribution.
Description
Technical Field
The invention relates to the technical field of quick generation of computer abstract expressions of urban traffic systems, in particular to a method for quickly matching bus stations and road sections in an electronic map.
Background
With the accelerated development of urbanization in China, the development of urban traffic faces new challenges. The urban public transport has the advantages of high intensive efficiency, energy conservation, environmental protection and the like, the inevitable requirements of relieving traffic jam, changing the urban traffic development mode, improving the quality of life of people and improving the basic public service level of the government for preferentially developing the public transport are necessary requirements, and the strategic selection for constructing the resource-saving and environment-friendly society is provided.
One of the most important problems is to reasonably arrange and plan a city bus network to avoid the situation of too many passengers on some lines, so that a passer is willing to use the bus. The bus passenger flow distribution prediction is carried out in the urban traffic network, so that a good decision basis can be provided for planners, and the method is an important information source for predicting whether the bus route is reasonable in advance. The bus passenger flow distribution means that the obtained bus OD traffic volume is distributed to each bus line in the network according to the known bus network description and a certain rule, so as to calculate the passenger flow volume of the bus line.
In order to accurately predict the selection behavior of the passenger, the real bus travel time is calculated. The ground buses need to travel in a road system, and depend on the attributes and traffic conditions of the traveling road, such as whether there is a bus lane or whether there is congestion. The existing public transport distribution models directly distribute public transport passenger flow on a public transport network, endow each bus with fixed running time and neglect the influence of a road system on the running time of the public transport, so that the distribution result is not very accurate; at present, an urban traffic management department or some map websites have electronic maps and longitude and latitude coordinates of bus stops, but the bus stops and a road network independently exist, the bus stops and the road network do not have any form of association, if the relationship between the bus stops and road sections is matched, the bus stops and the road sections need to be confirmed manually, manpower is wasted, and carelessness is easy to occur.
Disclosure of Invention
In order to solve the existing problems, the invention provides a method for quickly matching bus stops and road sections in an electronic map, the invention automatically matches the road sections to which the stops belong according to the position relationship between the bus stops and the road sections, and finally displays the bus stops which cannot be automatically distinguished by a computer in the map, so that a user can automatically match the road sections to which the bus stops belong, thereby saving the time for manually matching the road sections one by one, improving the matching accuracy, and for the purpose, the invention provides a method for quickly matching the bus stops and the road sections in the electronic map, which comprises the following steps:
converting longitude and latitude coordinates of bus stops and longitude and latitude coordinates of topological points forming road sections in an electronic map into coordinates of a UTM (universal time management) plane coordinate system, wherein the converted coordinate unit is meter; all bus stops in the electronic map form a set S1, and all road sections form a set W;
if the set W is empty, the step (2) is switched to the step (6), otherwise, a road section L is randomly selected from the set W; traversing all topological points forming the road section L, and recording the minimum value of the abscissa, the maximum value of the abscissa, the minimum value of the ordinate and the maximum value of the ordinate as xmin and ymax in the points; searching a rectangular area D by using a bus stop of a road section L consisting of four vertexes, wherein the coordinates of the four vertexes are (xmin-D, ymin-D), (xmin-D, ymax + D), (xmax + D, ymin-D), (xmax + D, ymax + D);
step (3) setting a bus stop set contained in the bus stop search rectangular area D as S2, and setting an initial state S2 as an empty set; sequentially judging whether the bus stops in the set S1 are in the region D or not, if the coordinates (x, y) of the bus stops meet the conditions that xmin-D is less than x and less than xmax + D and ymin-D is less than y and less than ymax + D, placing the bus stops in the region D into the set S2, and if not, continuously judging the next bus stop until all bus stops in S2 are judged once;
step (4) if the S2 is an empty set, deleting the road section L in the set W, returning to the step (2), otherwise, arbitrarily selecting a bus stop B from the S2;
step (5) setting a road section L to be composed of n topological points, and arranging the topological points in sequence to form a set (P1, …, Pn), wherein the starting point is P1, and the end point is Pn; and sequentially judging the relationship between a line segment consisting of the topological points Pi and Pi +1 and the site B, wherein the judgment formula is as follows:
wherein, represents the vector inner product, x represents the vector outer product, x represents the product of two numbers; if the topological points Pi and Pi +1 (i is more than or equal to 1 and less than or equal to n-1, and i is an integer) in the topological point set forming the road section L satisfy the formulas (1), (2), (3) and (4), the bus station B belongs to the road section L, the bus station B is deleted from the set S1 and the set S2 at the same time, the step (4) is returned, otherwise, the bus station B is deleted from the set S2, and the step (4) is returned;
step (6), if the bus stop set S1 is an empty set, the matching is finished, and the matching of the bus stops and the road sections in the electronic map is finished; otherwise, the positions of the sites in S1 are displayed in the electronic map, the road segments to which the sites belong are determined by the user, and each time a road segment to which a site belongs is determined, the site is deleted from S1 until the matching of the bus site and the road segment is finished after S1 is empty set.
In the step (1), the longitude and latitude coordinates of the bus stop in the electronic map and the longitude and latitude coordinates of the topological points forming the road section are converted into UTM plane coordinate system coordinates by adopting a unified horizontal axis mercator projection method in cartography.
In a further improvement of the invention, in the step (2) and the step (3), the farthest vertical distance d of the bus stop deviating from the road section is set to be 15 meters.
The invention discloses a method for quickly matching bus stops and road sections in an electronic map, which comprises the steps of firstly determining a bus stop search area of each road section, taking the bus stops in the area as to-be-detected stops, then judging whether the distances between the to-be-detected stops and a certain road section are within a reasonable deviation range and on the right side of the road section one by one, if so, considering that the road section of the stop is successfully matched, and finally enabling a user to manually match the bus stops and the road sections which are not matched on the map, thereby completing the whole matching process and improving the matching speed and accuracy.
Drawings
FIG. 1 is a flow chart of a method for quickly matching bus stops and road segments in an electronic map according to the present invention;
FIG. 2 is a schematic view of a road segment and a bus stop to be inspected around the road segment in accordance with one embodiment of the present invention;
Detailed Description
The invention is described in further detail below with reference to the following detailed description and accompanying drawings:
the invention provides a method for quickly matching bus stops and road sections in an electronic map, which automatically matches the road sections to which the stops belong according to the position relationship between the bus stops and the road sections, and finally displays the bus stops which cannot be automatically distinguished by a computer in the map, so that a user can automatically match the road sections to which the stops belong, thereby saving the time for manually matching the road sections one by one and improving the matching accuracy.
The invention relates to a method for quickly matching bus stops and road sections in an electronic map, and the flow of the method is shown in figure 1.
Converting longitude and latitude coordinates of bus stops and longitude and latitude coordinates of topological points forming road sections in an electronic map into coordinates of a UTM (universal time management) plane coordinate system, wherein the converted coordinate unit is meter; all bus stops in the electronic map form a set S1, and all road sections form a set W;
if the set W is empty, the step (2) is switched to the step (6), otherwise, a road section L is randomly selected from the set W; traversing all topological points forming the road section L, and recording the minimum value of the abscissa, the maximum value of the abscissa, the minimum value of the ordinate and the maximum value of the ordinate as xmin and ymax in the points; searching a rectangular area D by using a bus stop of a road section L consisting of four vertexes, wherein the coordinates of the four vertexes are (xmin-D, ymin-D), (xmin-D, ymax + D), (xmax + D, ymin-D), (xmax + D, ymax + D);
in this embodiment, a road segment L is arbitrarily selected as shown in fig. 2. The link L is composed of 5 topological points P1, P2, P3, P4 and P5, the coordinates are (1456.79,1113.7), (1698.77,995.185), (2050.62,1044.57), (2235.8,1182.96), (2427.16,1396.42), the minimum value xmin on the abscissa among these points is 1456.79, the maximum value xmax on the abscissa is 2427.16, the minimum value ymin on the ordinate is 995.185, and the maximum value ymax on the ordinate is 1396.42, then the vertex coordinates of the rectangular area D are (1441.79,980.185), (1441.79, 1411.42), (2442.16, 980.185) and (2442.16, 1411.42);
step (3) setting a bus stop set contained in the bus stop search rectangular area D as S2, and setting an initial state S2 as an empty set; sequentially judging whether the bus stops in the set S1 are in the region D or not, if the coordinates (x, y) of the bus stops meet the conditions that xmin-D is less than x and less than xmax + D and ymin-D is less than y and less than ymax + D, placing the bus stops in the region D into the set S2, and if not, continuously judging the next bus stop until all bus stops in S2 are judged once;
in this embodiment, for the road segment L, there are 3 bus stops B1, B2 and B3 in the set S2, and the coordinates thereof are (1710.14,1009), (2016.89, 987.815) and (2415,1361.43), respectively;
step (4) if the S2 is an empty set, deleting the road section L in the set W, returning to the step (2), otherwise, arbitrarily selecting a bus stop B from the S2;
step (5) setting a road section L to be composed of n topological points, and arranging the topological points in sequence to form a set (P1, …, Pn), wherein the starting point is P1, and the end point is Pn; and sequentially judging the relationship between a line segment consisting of the topological points Pi and Pi +1 and the site B, wherein the judgment formula is as follows:
wherein, represents the vector inner product, x represents the vector outer product, x represents the product of two numbers; if the topological points Pi and Pi +1 (i is more than or equal to 1 and less than or equal to n-1, and i is an integer) in the topological point set forming the road section L satisfy the formulas (1), (2), (3) and (4), the bus station B belongs to the road section L, the bus station B is deleted from the set S1 and the set S2 at the same time, the step (4) is returned, otherwise, the bus station B is deleted from the set S2, and the step (4) is returned;
in the present embodiment, the station B1, although satisfying the conditions (1), (2), and (3) in the segment P2P3, does not satisfy the condition (4), and indicates that the station B1 is on the other side of the travel direction of the link L, and deletes the station B1 from the set S2; while the site B2 satisfies the conditions (1), (2), and (4) in the segment P2P3, but does not satisfy the condition (3), indicating that the site B2 is too far away from the link L and may belong to another link, the site B2 is deleted from the set S2; the site B3, when the line segment P4P5 satisfies the conditions (1), (2), (3) and (4), indicates that the site B3 belongs to the link L, deletes the site B3 from the sets S1 and S2, leaves the set S2 empty, and returns to the step (2) to check the sites to which other links belong;
step (6), if the bus stop set S1 is an empty set, the matching is finished, and the matching of the bus stops and the road sections in the electronic map is finished; otherwise, the positions of the sites in S1 are displayed in the electronic map, the road segments to which the sites belong are determined by the user, and each time a road segment to which a site belongs is determined, the site is deleted from S1 until the matching of the bus site and the road segment is finished after S1 is empty set.
The above description is only a preferred embodiment of the present invention, and is not intended to limit the present invention in any way, but any modifications or equivalent variations made according to the technical spirit of the present invention are within the scope of the present invention as claimed.
Claims (3)
1. A method for quickly matching bus stops and road sections in an electronic map is characterized by comprising the following steps:
converting longitude and latitude coordinates of bus stops and longitude and latitude coordinates of topological points forming road sections in an electronic map into coordinates of a UTM (universal time management) plane coordinate system, wherein the converted coordinate unit is meter; all bus stops in the electronic map form a set S1, and all road sections form a set W;
if the set W is empty, the step (2) is switched to the step (6), otherwise, a road section L is randomly selected from the set W; traversing all topological points forming the road section L, and recording the minimum value of the abscissa, the maximum value of the abscissa, the minimum value of the ordinate and the maximum value of the ordinate as xmin and ymax in the points; searching a rectangular area D by using a bus stop of a road section L consisting of four vertexes, wherein the coordinates of the four vertexes are (xmin-D, ymin-D), (xmin-D, ymax + D), (xmax + D, ymin-D), (xmax + D, ymax + D), and D is the farthest vertical distance of the bus stop deviating from the road section;
step (3) setting a bus stop set contained in the bus stop search rectangular area D as S2, and setting an initial state S2 as an empty set; sequentially judging whether the bus stops in the set S1 are in the region D or not, if the coordinates (x, y) of the bus stops meet the conditions that xmin-D is less than x and less than xmax + D and ymin-D is less than y and less than ymax + D, placing the bus stops in the region D into the set S2, and if not, continuously judging the next bus stop until all bus stops in S2 are judged once;
step (4) if the S2 is an empty set, deleting the road section L in the set W, returning to the step (2), otherwise, arbitrarily selecting a bus stop B from the S2;
step (5) setting a road section L to be composed of n topological points, and arranging the topological points in sequence to form a set (P1, …, Pn), wherein the starting point is P1, and the end point is Pn; and sequentially judging the relationship between a line segment consisting of the topological points Pi and Pi +1 and the site B, wherein the judgment formula is as follows:
wherein, represents the vector inner product, x represents the vector outer product, x represents the product of two numbers; if the topological points Pi and Pi +1 (i is more than or equal to 1 and less than or equal to n-1, and i is an integer) in the topological point set forming the road section L satisfy the formulas (1), (2), (3) and (4), the bus station B belongs to the road section L, the bus station B is deleted from the set S1 and the set S2 at the same time, the step (4) is returned, otherwise, the bus station B is deleted from the set S2, and the step (4) is returned;
step (6), if the bus stop set S1 is an empty set, the matching is finished, and the matching of the bus stops and the road sections in the electronic map is finished; otherwise, the positions of the sites in S1 are displayed in the electronic map, the road segments to which the sites belong are determined by the user, and each time a road segment to which a site belongs is determined, the site is deleted from S1 until the matching of the bus site and the road segment is finished after S1 is empty set.
2. The method of claim 1, wherein the method comprises the following steps: in the step (1), the longitude and latitude coordinates of the bus stop and the longitude and latitude coordinates of the topological points forming the road section in the electronic map are converted into UTM plane coordinate system coordinates by adopting a unified horizontal axis mercator projection method in cartography.
3. The method of claim 2, wherein the method comprises the following steps: in the step (2) and the step (3), the farthest vertical distance d of the bus stop deviating from the road section is set to be 15 meters.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710978609.XA CN107909187B (en) | 2017-10-19 | 2017-10-19 | Method for quickly matching bus stops and road sections in electronic map |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710978609.XA CN107909187B (en) | 2017-10-19 | 2017-10-19 | Method for quickly matching bus stops and road sections in electronic map |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107909187A CN107909187A (en) | 2018-04-13 |
| CN107909187B true CN107909187B (en) | 2021-06-25 |
Family
ID=61841595
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710978609.XA Active CN107909187B (en) | 2017-10-19 | 2017-10-19 | Method for quickly matching bus stops and road sections in electronic map |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107909187B (en) |
Families Citing this family (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109948477B (en) * | 2019-03-06 | 2022-05-13 | 东南大学 | Method for extracting road network topology points in picture |
| CN111125293B (en) * | 2019-12-31 | 2021-07-09 | 南京市城市与交通规划设计研究院股份有限公司 | Automatic generation method and device of public transport network model and electronic equipment |
| CN112269845B (en) * | 2020-10-22 | 2021-06-22 | 东南大学 | Method for quickly matching electronic road map and bus route facing to different source data |
| CN112200861B (en) * | 2020-10-30 | 2023-02-17 | 久瓴(江苏)数字智能科技有限公司 | Method and device for determining column type, storage medium and electronic equipment |
| CN112772098A (en) * | 2021-02-22 | 2021-05-11 | 中国农业大学 | Variable irrigation and fertilization zoning method for large-scale sprinkler |
| CN112632399B (en) * | 2021-03-09 | 2021-06-08 | 四川万网鑫成信息科技有限公司 | Topological relation obtaining method and device based on spatial position and storage medium |
| CN113723715B (en) * | 2021-11-01 | 2022-03-18 | 深圳市城市交通规划设计研究中心股份有限公司 | Method, system, equipment and storage medium for automatically matching public transport network with road network |
| CN115100897B (en) * | 2022-05-23 | 2023-11-17 | 惠州华阳通用电子有限公司 | Vehicle position determining method and device |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103471603A (en) * | 2012-06-06 | 2013-12-25 | 腾讯科技（深圳）有限公司 | Method and apparatus for matching of bus route and road network |
| US8645402B1 (en) * | 2009-12-22 | 2014-02-04 | Teradata Us, Inc. | Matching trip data to transportation network data |
| CN104978859A (en) * | 2015-06-28 | 2015-10-14 | 常州普适信息科技有限公司 | Method used for calculating bus network density of any region in city |
| CN105976604A (en) * | 2016-06-21 | 2016-09-28 | 东南大学 | Bus route matching method based on GIS and bus GPS data |
| CN107036619A (en) * | 2017-05-27 | 2017-08-11 | 广州汽车集团股份有限公司 | High accuracy geography signal reconstruct method, device, Vehicle Decision Method system and server |
-
2017
- 2017-10-19 CN CN201710978609.XA patent/CN107909187B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8645402B1 (en) * | 2009-12-22 | 2014-02-04 | Teradata Us, Inc. | Matching trip data to transportation network data |
| CN103471603A (en) * | 2012-06-06 | 2013-12-25 | 腾讯科技（深圳）有限公司 | Method and apparatus for matching of bus route and road network |
| CN104978859A (en) * | 2015-06-28 | 2015-10-14 | 常州普适信息科技有限公司 | Method used for calculating bus network density of any region in city |
| CN105976604A (en) * | 2016-06-21 | 2016-09-28 | 东南大学 | Bus route matching method based on GIS and bus GPS data |
| CN107036619A (en) * | 2017-05-27 | 2017-08-11 | 广州汽车集团股份有限公司 | High accuracy geography signal reconstruct method, device, Vehicle Decision Method system and server |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107909187A (en) | 2018-04-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107909187B (en) | Method for quickly matching bus stops and road sections in electronic map | |
| CN108564226B (en) | Bus route optimization method based on taxi GPS and mobile phone signaling data | |
| CN105844362B (en) | Urban traffic comprehensive trip decision-making device | |
| CN103295414B (en) | A kind of bus arrival time Forecasting Methodology based on magnanimity history GPS track data | |
| CN108021686B (en) | Method for quickly matching bus routes and road networks in electronic map | |
| CN104881710A (en) | Urban express delivering method based on vehicle self-organized network | |
| CN103578267A (en) | Bus arrival predication method and system based on bus GPS data | |
| CN109543882B (en) | Bus network density calculation method based on optimal bus average station spacing | |
| CN109740811A (en) | Passage speed prediction technique, device and storage medium | |
| CN102708698A (en) | Vehicle optimal-path navigation method based on vehicle internet | |
| CN105787586A (en) | Bus line station optimal arrangement method maximizing space-time reachability | |
| CN105957348B (en) | Evaluation method is discharged at a kind of urban public bus lines node based on GIS and PEMS | |
| CN103761589A (en) | Distribution method for urban rail transit | |
| CN102968900A (en) | Method for processing RFID (Radio Frequency Identification) traffic data | |
| CN102567389B (en) | Combined traffic network forming method and equipment as well as path searching method and equipment | |
| CN104575085A (en) | Public bus arrival dynamic inducing method and device based on floating buses | |
| Milojevic et al. | Short paper: Distributed vehicular traffic congestion detection algorithm for urban environments | |
| CN101807348B (en) | Dynamic network navigation system and method | |
| CN113205213B (en) | Public transport evaluation method and system based on internet map data | |
| WO2024114414A1 (en) | Method and apparatus for pushing v2x event | |
| CN103914989A (en) | Mobile application system and method enabling people to check get-in time of nearby buses in real time | |
| CN105787240A (en) | Oil consumption prediction method and device | |
| CN110674990A (en) | Instant delivery path selection method and system with sliding window updating mechanism | |
| CN116629425A (en) | Method and device for calculating vehicle energy consumption, computer readable medium and electronic equipment | |
| CN113177684B (en) | Traffic network connection value evaluation method and terminal based on passenger transport shift data |
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 |