CN113218411A - Square partition matrix transfer method suitable for multiple buses - Google Patents
Square partition matrix transfer method suitable for multiple buses Download PDFInfo
- Publication number
- CN113218411A CN113218411A CN202110347039.0A CN202110347039A CN113218411A CN 113218411 A CN113218411 A CN 113218411A CN 202110347039 A CN202110347039 A CN 202110347039A CN 113218411 A CN113218411 A CN 113218411A
- Authority
- CN
- China
- Prior art keywords
- station
- block
- point
- route
- user
- 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
- 238000000034 method Methods 0.000 title claims abstract description 31
- 239000011159 matrix material Substances 0.000 title claims abstract description 18
- 238000005192 partition Methods 0.000 title claims abstract description 18
- 238000000638 solvent extraction Methods 0.000 claims abstract description 4
- 230000009286 beneficial effect Effects 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 230000000694 effects Effects 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
- G01C21/34—Route searching; Route guidance
- G01C21/3407—Route searching; Route guidance specially adapted for specific applications
- G01C21/3423—Multimodal routing, i.e. combining two or more modes of transportation, where the modes can be any of, e.g. driving, walking, cycling, public transport
-
- 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
- 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)
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Economics (AREA)
- Radar, Positioning & Navigation (AREA)
- Remote Sensing (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Strategic Management (AREA)
- Theoretical Computer Science (AREA)
- Tourism & Hospitality (AREA)
- General Business, Economics & Management (AREA)
- Marketing (AREA)
- Entrepreneurship & Innovation (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Game Theory and Decision Science (AREA)
- Development Economics (AREA)
- Automation & Control Theory (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Traffic Control Systems (AREA)
- Navigation (AREA)
Abstract
The invention relates to the technical field of public transport, and provides a square partition matrix transfer method suitable for various buses, which comprises the following steps: step 1, obtaining map information of a city, and carrying out square partitioning on a city area to form a plurality of square blocks; step 2, determining a starting point block and a final block; searching all stations in a starting point block and a final block; and 3, when the distance between the starting point or the terminal point and the station is within the distance threshold, according to the priority of station selection: BRT, subway, bus, and determining a starting station and a final station; when the distance between the starting point or the terminal point and the station is beyond the distance threshold, taking the station closest to the starting point as the starting station and taking the station closest to the terminal point as the terminal station; step 4, forming a riding route; and 5, displaying the formed riding route in a map, and recommending the riding route to a user. The invention can improve the transfer efficiency and reduce the transfer time.
Description
Technical Field
The invention relates to the technical field of public transport, in particular to a square partition matrix transfer method suitable for various buses.
Background
Public transportation has the advantages of large carrying capacity, high transportation efficiency, low transportation cost and the like, and becomes the most important transportation mode in the transportation field. At present, conventional public transport, BRT and subway are used as three main bodies of public transport, how to realize high-efficiency transfer between the same kind of buses and different buses, and the three main bodies are concerned in many aspects.
Through the development of recent years, the information management method is greatly improved and developed in the field of intelligent bus dispatching, particularly, the intelligent mobile phone is widely applied, people can acquire position information of the people, the trend of bus lines and position information of bus stations at any time and any place, the space data information is used as a support, and the convenience of bus traveling can be better improved. People not only care about the arrival time information and the vehicle position information of the vehicles, but also more care about the transportation time length of the vehicles and the transfer plan of the vehicles, namely how to find the most reasonable and closest bus departure station from any position for passengers, and the passengers arrive at the own target station through limited transfer, thereby ensuring the optimal transfer scheme.
Disclosure of Invention
The invention mainly solves the technical problems that the most reasonable and nearest bus departure station cannot be found and the optimal transfer scheme cannot be formed in the prior art, provides a square partition matrix transfer method suitable for various buses, ensures the optimal space-time of public transport trip and the most convenient trip through an optimal transfer model, improves the transfer efficiency and reduces the transfer time.
The invention provides a square partition matrix transfer method suitable for various buses, which comprises the following processes:
and 3, when the distance between the starting point or the terminal point and the station is within the distance threshold, according to the priority of station selection: BRT, subway, bus, and determining a starting station and a final station; when the distance between the starting point or the terminal point and the station is beyond the distance threshold, taking the station closest to the starting point as the starting station and taking the station closest to the terminal point as the terminal station;
and 5, displaying the formed riding route in a map, and recommending the riding route to a user.
Further, in step 2, the block where the departure point of the user is located is taken as the departure point block; setting a block where the end point of the user is as a final block;
if the starting point is on the boundary line of the two blocks, determining the block where the station closest to the starting point is located as the starting point block;
and if the terminal point is on the boundary line of the two blocks, determining the block where the station closest to the terminal point is located as the terminal block.
Further, step 5 further includes:
and calculating the fare of each section of the journey according to the acquired riding route, and displaying the whole journey fare of the user.
Further, step 5 further includes:
and acquiring the vehicle information of the riding route in real time, and displaying the congestion condition of each road section.
Further, after the step 5, the method further comprises the following steps: step 6, calculating the consumed time of each section of journey according to the riding route, comprising the following steps 601 to 604:
601, acquiring time information related to a line in a riding route, and acquiring position information of each vehicle in real time; the time information comprises the shift and arrival interval of each route;
step 602, calculating the walking time of the user from the starting point to the starting station;
step 603, calculating the walking time from the terminal to the site to the terminal of the user;
and step 604, recommending the vehicle shifts taken by the users according to the position information of each vehicle and the traveling time from the departure point to the departure station, and calculating the time consumption of each distance.
Further, step 6, further includes:
step 605, for the riding route needing to be transferred, if the bus mode needs to be changed or the stations in the same bus mode are different in position in the transferring process, calculating the distance between the station of going out of one distance and the station of going in the next distance, and displaying the route needing to be transferred on the map.
Further, step 6, further includes:
step 606, calculating the travel time required by transit for the riding route required to be transferred; acquiring the vehicle and position information of the bus in the next distance, and calculating the arrival time of the vehicle; and calculating the time required by the user for transferring and the maximum waiting time according to the walking time required by transferring and the arrival time of the vehicle.
Further, step 6, further includes:
step 607, acquiring navigation information corresponding to the riding route; and acquiring the position information of the user in real time, matching the position information with the navigation information, and prompting the user to walk the route.
The square subarea matrix transfer method suitable for various public transport means provided by the invention averagely divides the urban area into a plurality of square blocks, searches for a transfer route on the basis of the blocks, finds the minimum transfer scheme, can provide reasonable transfer suggestions aiming at various public transport means forms such as BRT, subway, public transport and the like, improves the transfer efficiency, enables users to fully know the conditions of walking, transfer, waiting time and the like in the bus route, greatly shortens the transfer convenience and waiting time of the users, is beneficial to improving the attraction of public transport and reducing the pressure of traffic jam.
Drawings
FIG. 1 is a flow chart of the implementation of the square partition matrix transfer method suitable for various buses provided by the invention;
FIG. 2 is a schematic diagram of step 4;
FIG. 3 is a diagram of step 4.
Detailed Description
In order to make the technical problems solved, technical solutions adopted and technical effects achieved by the present invention clearer, the present invention is further described in detail below with reference to the accompanying drawings and embodiments. It is to be understood that the specific embodiments described herein are merely illustrative of the invention and are not limiting of the invention. It should be further noted that, for the convenience of description, only some but not all of the relevant aspects of the present invention are shown in the drawings.
As shown in fig. 1, the square partition matrix transfer method suitable for multiple buses provided by the embodiment of the present invention includes the following steps:
Specifically, a block where a starting point of a user is located is taken as a starting point block; setting a block where the end point of the user is as a final block; if the starting point is on the boundary line of the two blocks, determining the block where the station closest to the starting point is located as the starting point block; and if the terminal point is on the boundary line of the two blocks, determining the block where the station closest to the terminal point is located as the terminal block. For a particular threshold, the departure point is at the boundary between block S1 and block S2, the distance from the nearest station within block S1 to the departure point is 600 meters, the distance from the nearest station within block S2 to the departure point is 700 meters, and block S1 is used as the departure point block for the departure point.
And 3, when the distance between the starting point or the terminal point and the station is within the distance threshold, according to the priority of station selection: BRT, subway, bus, and determining a starting station and a final station; and when the distance between the starting point or the terminal point and the station is beyond the distance threshold value, taking the station closest to the starting point as the starting station and taking the station closest to the terminal point as the terminal station.
In the step, different schemes are provided for two situations, a starting station and a final station are determined, and the first scheme is as follows: in the case that the distance is within the threshold value, that is, the time for the user to walk to the station is reasonable, for example, within the range of 500 meters, the station is selected according to the principle of BRT (bus speed) subway bus; according to the principle of BRT (bus rapid transit) subway bus, due to the fact that the BRT bus line and the special line are operated in a closed mode, the operation efficiency is high, the bus cost is low, the bus station is convenient to get in and out, and the first priority is used; the subway has higher fare, longer station entering and leaving time, no congestion condition and higher operation efficiency and is taken as a second priority; the bus is convenient to check out stations, has low fare, is greatly influenced by traffic conditions and serves as a third priority. And the second method comprises the following steps: in case of a distance outside the threshold, for example in a range exceeding 500 meters, the following applies: and (4) selecting the closest site according to the site closest principle. In the embodiment, the distance between the starting point or the terminal point and the station suggests a comfortable walking range of 0-1 km.
In general, n is the search depth, n levels of search are finished, and n is recommended not to exceed 3 levels, namely the transfer times. For example, as shown in fig. 2, a triangle is a starting point and an ending point, a square is a starting point and an ending point which are found, a circle is a route point, and a hexagon is a transit point. And the block S1 is taken as a starting point block to form a common bus route, a final block Sn is found on the BRT route in the block S4 on the common bus route, the BRT route is taken as a transfer route and can reach the final block Sn, the finding is finished, and the BRT route is transferred at the nearest stop of the common bus route in the block S4 in the transfer scheme. The bus route belongs to transfer of different buses at different stops and requires the user to transfer by walking. The embodiment has high searching speed, and can search S1, Sn and a transfer scheme at the highest speed; a minimum transfer scheme can be found; the person can transfer the person from one station to another, and the walking time is most reasonable. For example, as shown in fig. 3, a triangle is a starting point and an ending point, a square is a starting point and an ending point found, a circle is a route passing point, and a hexagon is a transit point. Determining a block where the starting point is located as a starting point block, finding a route 1, taking a passing station on the route 1 as a connection block, finding a route 2 as a transfer route to reach a final block Sn at the block S4, finishing the finding, obtaining a riding route needing transfer, and obtaining the transfer route 2 at the block S4, wherein the transfer route belongs to the transfer at the same station.
And 5, displaying the formed riding route in a map, and recommending the riding route to a user. And calculating the fare of each section of the journey according to the acquired riding route, and displaying the whole journey fare of the user. The method and the device can be combined with a map to obtain the vehicle information of the riding route in real time and display the congestion condition of each road section in real time, so that a user can know the road condition information of the route in the riding process.
On the basis of the above scheme, step 6 further includes: step 605, for the riding route needing to be transferred, if the bus mode needs to be changed or the stations in the same bus mode are different in position in the transferring process, calculating the distance between the station of going out of one distance and the station of going in the next distance, and displaying the route needing to be transferred on the map. The embodiment can calculate the transfer distances of different stations, guide the walking route of the user and prevent the time waste caused by walking by mistake.
Step 606, calculating the travel time required by transit for the riding route required to be transferred; acquiring the vehicle and position information of the bus in the next distance, and calculating the arrival time of the vehicle; and calculating the time required by the user for transferring and the maximum waiting time according to the walking time required by transferring and the arrival time of the vehicle. In addition, if a subway line is involved in the route, an entrance/exit may be suggested. The embodiment can calculate the time required by transferring from different stations and the waiting time of the next vehicle, so that the user can fully understand the riding process.
Step 607, acquiring navigation information corresponding to the riding route; and acquiring the position information of the user in real time, matching the position information with the navigation information, and prompting the user to walk the route. The method of the embodiment can be combined with a public transportation map, and further comprises a navigation process, wherein after a bus route is formed, the route is displayed on the map, and a user is navigated to go to a starting station, so that the travel efficiency of the user is improved.
The square partition matrix transfer method is suitable for various public transport means, can averagely divide an urban area into a plurality of square blocks, searches for transfer routes on the basis of the blocks, can find the minimum transfer scheme, can provide reasonable transfer suggestions aiming at various public transport means forms such as BRT, subway, public transport and the like, can enable users to fully know the conditions such as walking, transfer, waiting time and the like in a bus route, enables the convenience of transfer of the users to be greatly shortened, is beneficial to improving the attraction of public transport, and reduces the pressure of traffic jam.
Finally, it should be noted that: the above embodiments are only used to illustrate the technical solution of the present invention, and not to limit the same; while the invention has been described in detail and with reference to the foregoing embodiments, it will be understood by those skilled in the art that: modifications of the technical solutions described in the embodiments or equivalent replacements of some or all technical features may be made without departing from the scope of the technical solutions of the embodiments of the present invention.
Claims (8)
1. A square partition matrix transfer method suitable for various buses is characterized by comprising the following steps:
step 1, obtaining map information of a city, and carrying out square partitioning on a city area to form a plurality of square blocks, wherein the side length of each square block is adjustable;
step 2, obtaining the departure point information and the destination point information of the user, and further determining a departure point block and a final block; searching all stops in a starting point block and a final point block, wherein the stops comprise bus stops, BRT stops and subway stops;
and 3, when the distance between the starting point or the terminal point and the station is within the distance threshold, according to the priority of station selection: BRT, subway, bus, and determining a starting station and a final station; when the distance between the starting point or the terminal point and the station is beyond the distance threshold, taking the station closest to the starting point as the starting station and taking the station closest to the terminal point as the terminal station;
step 4, obtaining n lines where the starting station is located, obtaining blocks where all stations of the lines are located, using the blocks as connection blocks, and if the connection blocks have final blocks, forming a riding route which does not need to be transferred; if the transfer block does not have the terminal block, sequentially using the transfer blocks as relay blocks according to the route sequence, and continuously searching the next stage of transfer block until the transfer block has the terminal block to form a riding route needing transfer;
and 5, displaying the formed riding route in a map, and recommending the riding route to a user.
2. The square partition matrix transfer method suitable for multiple buses as claimed in claim 1, wherein in step 2, the block where the departure point of the user is located is taken as the departure point block; setting a block where the end point of the user is as a final block;
if the starting point is on the boundary line of the two blocks, determining the block where the station closest to the starting point is located as the starting point block;
and if the terminal point is on the boundary line of the two blocks, determining the block where the station closest to the terminal point is located as the terminal block.
3. The square partition matrix transfer method suitable for multiple buses according to claim 1, wherein the step 5 further comprises:
and calculating the fare of each section of the journey according to the acquired riding route, and displaying the whole journey fare of the user.
4. The square partition matrix transfer method suitable for various buses as in claim 1 or 3, wherein the step 5 further comprises:
and acquiring the vehicle information of the riding route in real time, and displaying the congestion condition of each road section.
5. The square partition matrix transfer method suitable for multiple buses according to claim 1, further comprising, after step 5: step 6, calculating the consumed time of each section of journey according to the riding route, comprising the following steps 601 to 604:
601, acquiring time information related to a line in a riding route, and acquiring position information of each vehicle in real time; the time information comprises the shift and arrival interval of each route;
step 602, calculating the walking time of the user from the starting point to the starting station;
step 603, calculating the walking time from the terminal to the site to the terminal of the user;
and step 604, recommending the vehicle shifts taken by the users according to the position information of each vehicle and the traveling time from the departure point to the departure station, and calculating the time consumption of each distance.
6. The square partition matrix transfer method suitable for multiple buses according to claim 5, wherein the step 6 further comprises:
step 605, for the riding route needing to be transferred, if the bus mode needs to be changed or the stations in the same bus mode are different in position in the transferring process, calculating the distance between the station of going out of one distance and the station of going in the next distance, and displaying the route needing to be transferred on the map.
7. The square partition matrix transfer method suitable for multiple buses according to claim 6, wherein the step 6 further comprises:
step 606, calculating the travel time required by transit for the riding route required to be transferred; acquiring the vehicle and position information of the bus in the next distance, and calculating the arrival time of the vehicle; and calculating the time required by the user for transferring and the maximum waiting time according to the walking time required by transferring and the arrival time of the vehicle.
8. The square partition matrix transfer method suitable for multiple buses according to claim 7, wherein the step 6 further comprises:
step 607, acquiring navigation information corresponding to the riding route; and acquiring the position information of the user in real time, matching the position information with the navigation information, and prompting the user to walk the route.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110347039.0A CN113218411B (en) | 2021-03-31 | 2021-03-31 | Square partition matrix transfer method suitable for multiple buses |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110347039.0A CN113218411B (en) | 2021-03-31 | 2021-03-31 | Square partition matrix transfer method suitable for multiple buses |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113218411A true CN113218411A (en) | 2021-08-06 |
| CN113218411B CN113218411B (en) | 2022-12-06 |
Family
ID=77086189
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110347039.0A Active CN113218411B (en) | 2021-03-31 | 2021-03-31 | Square partition matrix transfer method suitable for multiple buses |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113218411B (en) |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101807222A (en) * | 2010-02-09 | 2010-08-18 | 武汉大学 | Station-based urban public traffic network optimized configuration method |
| CN102568193A (en) * | 2011-12-22 | 2012-07-11 | 东南大学 | Method for designing bus system by wiring in regions |
| US20140302875A1 (en) * | 2013-04-05 | 2014-10-09 | HERE Global B. V. | Method and apparatus for determining parking location based on departure time information |
| CN105118014A (en) * | 2015-09-18 | 2015-12-02 | 常州普适信息科技有限公司 | Method for evaluating grids of bus network |
| CN105303854A (en) * | 2015-09-11 | 2016-02-03 | 百度在线网络技术（北京）有限公司 | Travel route data processing method and device |
| CN105528401A (en) * | 2015-12-02 | 2016-04-27 | 北京奇虎科技有限公司 | Bus information inquiry method and apparatus |
| US20170069208A1 (en) * | 2015-09-04 | 2017-03-09 | Nokia Technologies Oy | Method and apparatus for providing an alternative route based on traffic light status |
| CN108763518A (en) * | 2018-05-30 | 2018-11-06 | 武汉轻工大学 | Recommendation method, apparatus, terminal device and the readable storage medium storing program for executing of riding scheme |
| CN109816979A (en) * | 2019-02-19 | 2019-05-28 | 辽宁师范大学 | Consider bus arrival frequency and by bus the public bus network recommended method of comfort level |
| CN110069720A (en) * | 2017-11-03 | 2019-07-30 | 北京嘀嘀无限科技发展有限公司 | Transit riding route method for pushing and device, computer equipment and storage medium |
-
2021
- 2021-03-31 CN CN202110347039.0A patent/CN113218411B/en active Active
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101807222A (en) * | 2010-02-09 | 2010-08-18 | 武汉大学 | Station-based urban public traffic network optimized configuration method |
| CN102568193A (en) * | 2011-12-22 | 2012-07-11 | 东南大学 | Method for designing bus system by wiring in regions |
| US20140302875A1 (en) * | 2013-04-05 | 2014-10-09 | HERE Global B. V. | Method and apparatus for determining parking location based on departure time information |
| US20170069208A1 (en) * | 2015-09-04 | 2017-03-09 | Nokia Technologies Oy | Method and apparatus for providing an alternative route based on traffic light status |
| CN105303854A (en) * | 2015-09-11 | 2016-02-03 | 百度在线网络技术（北京）有限公司 | Travel route data processing method and device |
| CN105118014A (en) * | 2015-09-18 | 2015-12-02 | 常州普适信息科技有限公司 | Method for evaluating grids of bus network |
| CN105528401A (en) * | 2015-12-02 | 2016-04-27 | 北京奇虎科技有限公司 | Bus information inquiry method and apparatus |
| CN110069720A (en) * | 2017-11-03 | 2019-07-30 | 北京嘀嘀无限科技发展有限公司 | Transit riding route method for pushing and device, computer equipment and storage medium |
| CN108763518A (en) * | 2018-05-30 | 2018-11-06 | 武汉轻工大学 | Recommendation method, apparatus, terminal device and the readable storage medium storing program for executing of riding scheme |
| CN109816979A (en) * | 2019-02-19 | 2019-05-28 | 辽宁师范大学 | Consider bus arrival frequency and by bus the public bus network recommended method of comfort level |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113218411B (en) | 2022-12-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105865472B (en) | A kind of navigation method based on optimum oil consumption | |
| US10976170B2 (en) | Electric vehicle routing system | |
| CN109344529B (en) | Customized bus route design method based on two-stage heuristic algorithm | |
| CN106504577B (en) | A kind of park and shift traffic path method and device for planning | |
| US10895461B2 (en) | Multi-day, multi-person, and multi-modal trip planning system | |
| CN104408082B (en) | A kind of Metro Passenger method of servicing based on real time information | |
| CN107545320B (en) | Urban rail transit passenger path planning method and system based on graph theory | |
| CN102297700B (en) | Be used for method and the guider of the route planning of time correlation | |
| JP6094543B2 (en) | Origin / Destination Extraction Device, Origin / Destination Extraction Method | |
| JP5038597B2 (en) | Route search method, navigation system including vehicle movement, route search server, navigation terminal device, and program | |
| US8799038B2 (en) | Dynamic taxi-sharing system and sharing method thereof | |
| CN100463009C (en) | Traffic information fusion processing method and system | |
| CN105424052B (en) | Random travelable mileage | |
| CN102245458B (en) | Route searching system, route searching server and route searching method | |
| EP1876418A1 (en) | Navigation system, route search server, route search method, and program | |
| CN102243811B (en) | Vehicular navigation system and recommendation paths search method | |
| CN109102114B (en) | Bus trip getting-off station estimation method based on data fusion | |
| CN110222786B (en) | Dynamic car pooling method and system based on travel information | |
| CN102052926A (en) | Methods for reducing the consumption and cost of fuel | |
| CN105702035A (en) | Method for evaluating bus taking difficulty degree by using historical bus data | |
| EP3556601A1 (en) | Vehicle routing | |
| WO2013172157A1 (en) | Path search device and computer program | |
| JP4767816B2 (en) | Navigation system, route search server, and portable terminal device | |
| JP5953630B2 (en) | Route search apparatus and computer program | |
| JP7166093B2 (en) | Apparatus and method for selecting a charging method for a vehicle powered by battery power |
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 | ||
| CP03 | Change of name, title or address |
Address after: 14 / F, Hualu building, 717 Huangpu Road, Dalian hi tech Industrial Park, Liaoning 116000 Patentee after: Hualu Zhida Technology Co.,Ltd. Address before: 116600 No.717 Huangpu Road, Dalian high tech Industrial Park, Liaoning Province Patentee before: Hualu Zhida Technology Co.,Ltd. |
|
| CP03 | Change of name, title or address |