CN111242334A - Traffic appointment travel method, system and storage medium - Google Patents
Traffic appointment travel method, system and storage medium Download PDFInfo
- Publication number
- CN111242334A CN111242334A CN202010025104.3A CN202010025104A CN111242334A CN 111242334 A CN111242334 A CN 111242334A CN 202010025104 A CN202010025104 A CN 202010025104A CN 111242334 A CN111242334 A CN 111242334A
- Authority
- CN
- China
- Prior art keywords
- travel
- historical
- scheme
- trip
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 44
- 230000009286 beneficial effect Effects 0.000 description 5
- 230000008569 process Effects 0.000 description 4
- 230000006870 function Effects 0.000 description 2
- 230000004888 barrier function Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 230000001351 cycling effect Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000013468 resource allocation Methods 0.000 description 1
- 230000029305 taxis Effects 0.000 description 1
- 239000002699 waste material Substances 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/02—Reservations, e.g. for tickets, services or events
-
- G—PHYSICS
- G08—SIGNALLING
- G08G—TRAFFIC CONTROL SYSTEMS
- G08G1/00—Traffic control systems for road vehicles
- G08G1/01—Detecting movement of traffic to be counted or controlled
- G08G1/0104—Measuring and analyzing of parameters relative to traffic conditions
- G08G1/0125—Traffic data processing
- G08G1/0129—Traffic data processing for creating historical data or processing based on historical data
Abstract
The invention discloses a method, a system and a storage medium for traffic appointment travel, wherein the method comprises the following steps: receiving a user trip reservation request uploaded by a first terminal; acquiring historical travel data of a user; generating a plurality of travel schemes according to historical travel data and reservation requests; calculating a congestion coefficient or a congestion coefficient of each travel scheme; and selecting the trip scheme with the minimum congestion coefficient or the minimum congestion coefficient as a target trip scheme, and sending the target trip mode to the first terminal. According to the method and the device, a plurality of travel schemes are generated for the user through the reservation request and the historical travel data, the congestion or congestion coefficients of the travel schemes are calculated, the travel scheme with the minimum coefficient is selected as the target travel scheme to be sent to the first terminal, so that the user can travel when the congestion or congestion coefficients are minimum, and the probability that the user encounters congestion or congestion conditions when traveling is reduced. The invention can be widely applied to the technical field of big data application.
Description
Technical Field
The invention relates to the technical field of big data application, in particular to a method, a system and a storage medium for traffic reservation travel.
Background
At present, the traveling demands of residents in big cities in China are large, and the traveling modes are more and more diversified. Generally, the resident travel modes can be divided into driving and public transportation. For the trip mode of public transportation, subways, buses, taxis and shared buses are public transportation means frequently used during trip activities of citizens, travelers usually need to transfer various transportation means to arrive at destinations, and the right of way needs to be acquired through different platforms in each transfer, so that the process is complicated. For driving and traveling, the existing navigation platform can only see the current road condition, but in most cases, when a driver looks at a traffic road, the driver is in a condition of needing traveling or traveling on the road; the travel mode can only roughly predict the public traffic conditions at the current time and the future time from historical data, so that the travel jam or the congestion condition of a user cannot be effectively relieved by simply predicting the traffic conditions at the future time through the historical traffic data or the real-time traffic conditions.
Disclosure of Invention
To solve one of the above technical problems, the present invention aims to: provided are a traffic reservation travel method, system and storage medium, which can reduce the probability of a user encountering a congestion or crowded situation while traveling.
A first aspect of an embodiment of the present invention provides:
a transportation reservation travel method comprises the following steps:
receiving a user trip reservation request uploaded by a first terminal;
acquiring historical travel data of a user;
generating a plurality of travel schemes according to historical travel data and reservation requests;
calculating a congestion coefficient or a congestion coefficient of each travel scheme;
and selecting the trip scheme with the minimum congestion coefficient or the minimum congestion coefficient as a target trip scheme, and sending the target trip mode to the first terminal.
Further, the acquiring historical travel data of the user specifically includes:
and obtaining historical travel data corresponding to the account information uploaded with the reservation request, wherein the historical travel data comprises historical travel modes, historical tracks, and starting point position information, end point position information and travel time nodes corresponding to the historical tracks.
Further, the generating a plurality of travel plans according to the historical travel data and the reservation request specifically includes:
analyzing the preference degrees of a plurality of travel modes according to historical travel data;
generating a plurality of current to-be-selected row modes according to the preference degree and the reservation request;
sending the current row modes to be selected to a first terminal;
receiving a selected current to-be-selected travel mode uploaded by a first terminal as a target travel mode;
and generating a plurality of travel schemes according to the target travel mode.
Further, the calculating the congestion coefficient of each travel plan specifically includes:
when the target travel mode is determined to be driving travel, calculating the predicted arrival time of each road section in each travel scheme;
acquiring historical driving speed and historical vehicle flow of each road section;
calculating the maximum traffic volume of each road section according to the historical driving speed and the historical vehicle flow;
acquiring feedback information uploaded by a plurality of first terminals after reservation is completed;
calculating the road saturation of each road section according to all the feedback information and the maximum traffic volume;
and calculating a congestion coefficient of a travel scheme according to the estimated arrival time and the road saturation.
Further, the calculating the congestion coefficient of each travel plan further specifically includes:
when the target travel mode is determined to be public transport travel, calculating the predicted arrival time range of the bus station within the travel scheme;
acquiring feedback information uploaded by a plurality of first terminals after reservation is completed;
calculating the predicted passenger flow of the bus station within the predicted arrival time range according to the feedback information;
acquiring a passenger flow threshold of a bus station;
and calculating the congestion coefficient of each travel scheme according to the estimated passenger flow and the passenger flow threshold.
Further, the method also comprises the following steps:
and adjusting the public traffic configuration scheme according to the congestion coefficient.
Further, the method also comprises the following steps:
and after the first terminal is determined to select the target trip scheme as the current trip scheme, generating a two-dimensional code for the trip scheme of which the target trip mode is public transport trip, wherein the two-dimensional code is used for paying the current trip transportation cost and the current passing through the gate.
A second aspect of an embodiment of the present invention provides:
a transportation reservation travel system, comprising:
the system comprises a receiving module, a first terminal and a second terminal, wherein the receiving module is used for receiving a user trip reservation request uploaded by the first terminal;
the acquisition module is used for acquiring historical travel data of a user;
the generating module is used for generating a plurality of travel schemes according to the historical travel data and the reservation request;
the calculating module is used for calculating the congestion coefficient or the congestion coefficient of each travel scheme;
and the selection module is used for selecting the trip scheme with the minimum congestion coefficient or the minimum congestion coefficient as a target trip scheme and sending the target trip mode to the first terminal.
A third aspect of embodiments of the present invention provides:
a transportation reservation travel system comprising:
at least one memory for storing a program;
at least one processor is used for loading the program to execute the transportation reservation travel method.
A fourth aspect of an embodiment of the present invention provides:
a storage medium having stored therein processor-executable instructions for implementing a method of reserved transportation as described above when executed by a processor.
The invention has the beneficial effects that: according to the method, the reservation request of the user for travel uploaded by the first terminal is received, historical travel data of the user are obtained, a plurality of travel schemes are generated for the user through the reservation request and the historical travel data, the congestion coefficient or the congestion coefficient of each travel scheme is calculated, the travel scheme with the minimum congestion coefficient or the congestion coefficient is selected as the target travel scheme, and the target travel scheme is sent to the first terminal for the user to select and check, so that the user can travel when the congestion coefficient or the congestion coefficient is minimum, and the probability that the user encounters congestion or congestion conditions during travel is reduced.
Drawings
Fig. 1 is a flowchart of a transportation reservation travel method according to an embodiment of the present invention.
Detailed Description
The invention is described in further detail below with reference to the figures and the specific embodiments. The step numbers in the following embodiments are provided only for convenience of illustration, the order between the steps is not limited at all, and the execution order of each step in the embodiments can be adapted according to the understanding of those skilled in the art.
Referring to fig. 1, an embodiment of the present invention provides a transportation reservation travel method, which is applied to a control end, where the control end communicates with a plurality of first terminals respectively; the control end comprises a database, and historical trip data and a plurality of user IDs are stored in the database; the first terminal is a terminal device such as a mobile phone of a user or a worker, a designated APP is installed on the terminal device, and the APP provides an operation interface of the user or the worker.
The present embodiment includes steps S110 to S150:
s110, receiving a user trip reservation request uploaded by a first terminal; the reservation request comprises starting position information, terminal position information and a travel time range of current reservation. The travel time range is input by the user in a selected mode on the first terminal, and data processing is convenient to perform. The size of the time range can be set according to the actual requirements of the user.
S120, obtaining historical travel data of the user; the historical travel data comprises a historical departure place, a historical destination, a historical travel time range, a historical travel mode and a historical travel date.
S130, generating a plurality of travel schemes according to historical travel data and reservation requests; the travel scheme comprises the suggested travel time, the suggested travel route, the number of persons who have reserved on the suggested travel route and the road condition.
S140, calculating a congestion coefficient or a congestion coefficient of each travel scheme; the congestion coefficient is used for describing the congestion condition of the vehicle in the running process. The congestion coefficient is used for describing the number of queuing passengers, the number of getting-on passengers or the number of passengers carried by the vehicles in the same time. The smaller the congestion coefficient is, the minimum vehicle flow rate at the same point at the same time is indicated. The smaller the congestion coefficient is, the smaller the number of waiting passengers, the number of boarding passengers, or the number of passengers carried by the vehicle at the same point in time is.
S150, selecting the travel scheme with the minimum congestion coefficient or the minimum congestion coefficient as a target travel scheme, and sending the target travel mode to the first terminal for the user to select or view.
According to the method, a reservation request of a user for trip uploaded by a first terminal is received, historical trip data of the user is obtained, a plurality of trip schemes are generated for the user through the reservation request and the historical trip data, a congestion coefficient or a congestion coefficient of each trip scheme is calculated, the trip scheme with the minimum congestion coefficient or the minimum congestion coefficient is selected as a target trip scheme, and the target trip scheme is sent to the first terminal for the user to select and check, so that the user can trip when the congestion coefficient or the congestion coefficient is minimum, and the probability of the user encountering congestion or congestion conditions during trip is reduced.
As a preferred embodiment, the acquiring historical travel data of the user specifically includes:
and obtaining historical travel data corresponding to the account information uploaded with the reservation request, wherein the historical travel data comprises historical travel modes, historical tracks, and starting point position information, end point position information and travel time nodes corresponding to the historical tracks. The account information is the ID of the user and is used for identifying personal information and historical travel data of each user.
According to the embodiment, the historical travel mode, the historical track and the starting point position information, the end point position information and the travel time node corresponding to the historical track in the historical travel data are obtained, so that the subsequent preference degree of the travel mode of the user can be conveniently analyzed.
As a preferred embodiment, the generating a plurality of travel plans according to the historical travel data and the reservation request specifically includes:
analyzing the preference degrees of a plurality of travel modes according to historical travel data; the preference degree can be measured by using the use probability of the travel mode. The analysis process is to calculate the use probability of each travel mode in a statistical mode, and after the calculation is completed, the arrangement analysis can be performed in a descending mode. In some embodiments, a travel record with the same or similar travel time range as the travel time range reserved at this time may be matched from the historical travel data, and a travel record with the same week number as the travel time range reserved at this time may also be matched. For example, the following are displayed in the historical travel data of the user: on weekends, most of the travel modes are driving travel; in the morning and evening peak time periods, most of the travel modes are public transport, subway or network appointment; in the evening, the travel mode is mostly shared bicycle, etc. And analyzing the preference degree of the user for the travel mode according to the information.
Generating a plurality of current to-be-selected row modes according to the preference degree and the reservation request; in practical application, unreasonable travel modes can be eliminated through the distance between the departure place and the destination. For example, no public transport or subway passes through too short a distance; too long a distance is not suitable for walking or cycling, etc. Meanwhile, according to the general reservation big data, the number of people reserved in the travel time range from the departure place to the destination is known, and the current to-be-selected travel modes which meet the actual requirements are generated for the user.
And sending the current travel modes to be selected to the first terminal, so that the user can select the travel mode meeting the own requirement through the first terminal.
Receiving a selected current to-be-selected travel mode uploaded by a first terminal as a target travel mode;
and generating a plurality of travel schemes according to the target travel mode. For example, a user selects to drive a car for traveling, and after the traveling start position information and the traveling end position information are both determined, a plurality of feasible traffic roads can be generated for the user, and the time spent on each traffic road and the congestion condition can be calculated.
In the embodiment, after the historical travel data of the user is obtained, the travel mode of the user tendency is analyzed from the historical travel data, and then a suitable travel mode is determined according to the information such as the starting and ending point, the travel time and the like in the reservation request. The method has the advantages that the travel habit of the user is considered, the travel mode is recommended to the user in a personalized mode, various traffic resources can be evenly distributed, and the occurrence of congestion or crowding is reduced.
As a preferred embodiment, the calculating the congestion coefficient of each travel plan specifically includes:
when the target travel mode is determined to be driving travel, calculating the predicted arrival time of each road section in each travel scheme;
acquiring historical driving speed and historical vehicle flow of each road section; the historical vehicle flow refers to vehicle flow data under normal conditions.
Calculating the maximum traffic volume of each road section according to the historical driving speed and the historical vehicle flow; since the maximum amount of traffic that can be borne by each road segment is different, the maximum amount of traffic for each road segment needs to be calculated separately.
Acquiring feedback information uploaded by a plurality of first terminals after reservation is completed; the feedback information refers to a travel path and a travel time period in a travel scheme selected by a user.
Calculating the road saturation of each road section according to all the feedback information and the maximum traffic volume; the road saturation refers to a reserved travel vehicle in a travel time period selected by a user.
And calculating a congestion coefficient of a travel scheme according to the estimated arrival time and the road saturation.
According to the implementation, the congestion coefficient of the travel scheme is calculated by combining historical travel data, so that effective travel reference data is provided for the user, and the travel time of the user is saved.
As a preferred embodiment, the calculating the congestion coefficient for each travel plan further specifically includes:
when the target travel mode is determined to be public transport travel, calculating the predicted arrival time range of the bus station within the travel scheme; the predicted arrival time range of the user arriving at the bus station is the predicted arrival time range of the user arriving at the bus station.
Acquiring feedback information uploaded by a plurality of first terminals after reservation is completed; the feedback information refers to a travel path and a travel time period in a travel scheme selected by a user.
Calculating the predicted passenger flow of the bus station within the predicted arrival time range according to the feedback information;
acquiring a passenger flow threshold of a bus station; the passenger flow threshold is determined based on equipment conditions at each station. The equipment facilities are complete or the field is large, so that the passenger flow born by the equipment facilities is large; the equipment facilities are simple and crude or the site is small, so that the passenger flow born by the equipment facilities is small.
And calculating the congestion coefficient of each travel scheme according to the estimated passenger flow and the passenger flow threshold.
According to the implementation, the congestion coefficient of each travel scheme is calculated, so that the waiting time of a user at a bus station is shortened to the shortest in the actual travel process.
As a preferred embodiment, the method further comprises the following steps:
and adjusting the public traffic configuration scheme according to the congestion coefficient. In the actual public transport resource allocation, the allocated public transport quantity of each road is fixed, even if the public transport quantity changes, the change can be temporarily adjusted only when an unexpected situation occurs, so that the situation that the public transport utilization efficiency is not high occurs, the congestion coefficient obtained by calculating the reservation situation judges the possible passenger quantity of each road in advance, so that the allocation situation of the public transport vehicles is adjusted in advance, the full utilization of public transport supplies is realized, and the situations of traffic incapability in a peak period and resource waste in a low peak period are avoided.
As a preferred embodiment, the method further comprises the following steps:
and after the first terminal is determined to select the target trip scheme as the current trip scheme, generating a two-dimensional code for the trip scheme of which the target trip mode is public transport trip, wherein the two-dimensional code is used for paying the current trip transportation cost and the current passing through the gate.
Specifically, after the user finishes the travel reservation, the unique two-dimensional code is generated according to the current travel scheme and fed back to the user terminal equipment, so that the user can obtain one-time entry right at the reserved entry place. After the user uses the one-time access right, the fee corresponding to the reserved order is deducted from the binding payment account, so that the purpose that the user can use and settle various transportation supplies through one platform is achieved. After the user receives the two-dimension code, the user is not charged immediately, but the information of the user entering the station is obtained conveniently in the form of the two-dimension code, the information in the reservation order is matched according to the real-time travel state of the user and the fee is charged, and after the fee deduction is completed, the corresponding fee is distributed to each public transport supply service provider according to the fee information generated by each reservation order completed by the user. By planning all public transportation supply service providers, the multi-platform traffic data are fused, and the data barrier is broken.
The embodiment generates the two-dimension code for paying the current trip transportation cost and the current passing through the brake, so that the trip efficiency of the user is improved, meanwhile, the user terminal equipment can be prevented from downloading and installing various software, and the storage space of the user terminal equipment is saved.
The embodiment of the invention provides a traffic reservation travel system corresponding to the method shown in fig. 1, which comprises the following steps:
the system comprises a receiving module, a first terminal and a second terminal, wherein the receiving module is used for receiving a user trip reservation request uploaded by the first terminal;
the acquisition module is used for acquiring historical travel data of a user;
the generating module is used for generating a plurality of travel schemes according to the historical travel data and the reservation request;
the calculating module is used for calculating the congestion coefficient or the congestion coefficient of each travel scheme;
and the selection module is used for selecting the trip scheme with the minimum congestion coefficient or the minimum congestion coefficient as a target trip scheme and sending the target trip mode to the first terminal.
The content of the embodiment of the method of the invention is all applicable to the embodiment of the system, the function of the embodiment of the system is the same as the embodiment of the method, and the beneficial effect achieved by the embodiment of the system is the same as the beneficial effect achieved by the method.
The embodiment of the invention provides a traffic reservation travel system, which comprises:
at least one memory for storing a program;
at least one processor is used for loading the program to execute the transportation reservation travel method.
The content of the embodiment of the method of the invention is all applicable to the embodiment of the system, the function of the embodiment of the system is the same as the embodiment of the method, and the beneficial effect achieved by the embodiment of the system is the same as the beneficial effect achieved by the method.
Furthermore, an embodiment of the present invention also provides a storage medium, in which processor-executable instructions are stored, and when the processor-executable instructions are executed by a processor, the storage medium is used for implementing the above-mentioned transportation reservation travel method.
In summary, in the embodiment of the invention, the reservation request of the user for travel uploaded by the first terminal is received, the historical travel data of the user is acquired, a plurality of travel schemes are generated for the user through the reservation request and the historical travel data, the congestion coefficient or the congestion coefficient of each travel scheme is calculated, the travel scheme with the minimum congestion coefficient or congestion coefficient is selected as the target travel scheme, and the target travel scheme is sent to the first terminal for the user to select and view, so that the user travels when the congestion coefficient or congestion coefficient is minimum, and the probability of the user encountering congestion or congestion conditions during travel is reduced.
While the preferred embodiments of the present invention have been illustrated and described, it will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the spirit and scope of the invention as defined by the appended claims.
Claims (10)
1. A traffic reservation travel method is characterized in that: the method comprises the following steps:
receiving a user trip reservation request uploaded by a first terminal;
acquiring historical travel data of a user;
generating a plurality of travel schemes according to historical travel data and reservation requests;
calculating a congestion coefficient or a congestion coefficient of each travel scheme;
and selecting the trip scheme with the minimum congestion coefficient or the minimum congestion coefficient as a target trip scheme, and sending the target trip mode to the first terminal.
2. The transportation appointment travel method according to claim 1, characterized in that: the acquiring of the historical travel data of the user specifically includes:
and obtaining historical travel data corresponding to the account information uploaded with the reservation request, wherein the historical travel data comprises historical travel modes, historical tracks, and starting point position information, end point position information and travel time nodes corresponding to the historical tracks.
3. The transportation appointment travel method according to claim 1, characterized in that: the generating of the plurality of travel plans according to the historical travel data and the reservation request specifically comprises the following steps:
analyzing the preference degrees of a plurality of travel modes according to historical travel data;
generating a plurality of current to-be-selected row modes according to the preference degree and the reservation request;
sending the current row modes to be selected to a first terminal;
receiving a selected current to-be-selected travel mode uploaded by a first terminal as a target travel mode;
and generating a plurality of travel schemes according to the target travel mode.
4. The transportation appointment travel method according to claim 3, characterized in that: the calculating of the congestion coefficient of each travel plan specifically includes:
when the target travel mode is determined to be driving travel, calculating the predicted arrival time of each road section in each travel scheme;
acquiring historical driving speed and historical vehicle flow of each road section;
calculating the maximum traffic volume of each road section according to the historical driving speed and the historical vehicle flow;
acquiring feedback information uploaded by a plurality of first terminals after reservation is completed;
calculating the road saturation of each road section according to all the feedback information and the maximum traffic volume;
and calculating a congestion coefficient of a travel scheme according to the estimated arrival time and the road saturation.
5. The transportation appointment travel method according to claim 3, characterized in that: the calculating the congestion coefficient of each travel plan further specifically includes:
when the target travel mode is determined to be public transport travel, calculating the predicted arrival time range of the bus station within the travel scheme;
acquiring feedback information uploaded by a plurality of first terminals after reservation is completed;
calculating the predicted passenger flow of the bus station within the predicted arrival time range according to the feedback information;
acquiring a passenger flow threshold of a bus station;
and calculating the congestion coefficient of each travel scheme according to the estimated passenger flow and the passenger flow threshold.
6. The transportation appointment travel method according to claim 5, characterized in that: further comprising the steps of:
and adjusting the public traffic configuration scheme according to the congestion coefficient.
7. The transportation appointment travel method according to claim 5, characterized in that: further comprising the steps of:
and after the first terminal is determined to select the target trip scheme as the current trip scheme, generating a two-dimensional code for the trip scheme of which the target trip mode is public transport trip, wherein the two-dimensional code is used for paying the current trip transportation cost and the current passing through the gate.
8. A traffic reservation travel system is characterized in that: the method comprises the following steps:
the system comprises a receiving module, a first terminal and a second terminal, wherein the receiving module is used for receiving a user trip reservation request uploaded by the first terminal;
the acquisition module is used for acquiring historical travel data of a user;
the generating module is used for generating a plurality of travel schemes according to the historical travel data and the reservation request;
the calculating module is used for calculating the congestion coefficient or the congestion coefficient of each travel scheme;
and the selection module is used for selecting the trip scheme with the minimum congestion coefficient or the minimum congestion coefficient as a target trip scheme and sending the target trip mode to the first terminal.
9. A traffic reservation travel system is characterized in that: the method comprises the following steps:
at least one memory for storing a program;
at least one processor configured to load the program to perform a method of reserving travel according to any of claims 1-7.
10. A storage medium having stored therein instructions executable by a processor, the storage medium comprising: the processor-executable instructions, when executed by a processor, are for implementing a method of transportation reservation travel according to any of claims 1-7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010025104.3A CN111242334A (en) | 2020-01-10 | 2020-01-10 | Traffic appointment travel method, system and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010025104.3A CN111242334A (en) | 2020-01-10 | 2020-01-10 | Traffic appointment travel method, system and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN111242334A true CN111242334A (en) | 2020-06-05 |
Family
ID=70875982
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010025104.3A Pending CN111242334A (en) | 2020-01-10 | 2020-01-10 | Traffic appointment travel method, system and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111242334A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112669603A (en) * | 2020-12-17 | 2021-04-16 | 广东南方通信建设有限公司 | Urban traffic cooperation method and device based on big data |
| CN113379090A (en) * | 2021-08-16 | 2021-09-10 | 北京交通大学 | Urban rail transit reservation station-entering method, system, electronic equipment and storage medium |
| CN116011600A (en) * | 2023-01-17 | 2023-04-25 | 北京交通发展研究院 | Reservation method, device and system for congestion-free travel, electronic equipment and medium |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107563710A (en) * | 2016-06-30 | 2018-01-09 | 上海博泰悦臻网络技术服务有限公司 | Trip recommendation method, system and electronic equipment |
| CN108627174A (en) * | 2017-03-24 | 2018-10-09 | 北京嘀嘀无限科技发展有限公司 | Navigation routine determines method and device, data retrieval processing method and server |
| CN108734981A (en) * | 2017-04-13 | 2018-11-02 | 宁波轩悦行电动汽车服务有限公司 | It hires a car system and method in conjunction with the reservation of traffic congestion situation |
| CN109478364A (en) * | 2017-06-13 | 2019-03-15 | 北京嘀嘀无限科技发展有限公司 | Determine the method and system of E.T.A |
| CN110223058A (en) * | 2019-05-10 | 2019-09-10 | 南京理工大学 | One yard of travel system and method based on dynamic two-dimension code |
| CN110457416A (en) * | 2019-07-31 | 2019-11-15 | 摩比科技（深圳）有限公司 | A kind of method and apparatus for recommending bus trip route |
-
2020
- 2020-01-10 CN CN202010025104.3A patent/CN111242334A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107563710A (en) * | 2016-06-30 | 2018-01-09 | 上海博泰悦臻网络技术服务有限公司 | Trip recommendation method, system and electronic equipment |
| CN108627174A (en) * | 2017-03-24 | 2018-10-09 | 北京嘀嘀无限科技发展有限公司 | Navigation routine determines method and device, data retrieval processing method and server |
| CN108734981A (en) * | 2017-04-13 | 2018-11-02 | 宁波轩悦行电动汽车服务有限公司 | It hires a car system and method in conjunction with the reservation of traffic congestion situation |
| CN109478364A (en) * | 2017-06-13 | 2019-03-15 | 北京嘀嘀无限科技发展有限公司 | Determine the method and system of E.T.A |
| CN110223058A (en) * | 2019-05-10 | 2019-09-10 | 南京理工大学 | One yard of travel system and method based on dynamic two-dimension code |
| CN110457416A (en) * | 2019-07-31 | 2019-11-15 | 摩比科技（深圳）有限公司 | A kind of method and apparatus for recommending bus trip route |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112669603A (en) * | 2020-12-17 | 2021-04-16 | 广东南方通信建设有限公司 | Urban traffic cooperation method and device based on big data |
| CN113379090A (en) * | 2021-08-16 | 2021-09-10 | 北京交通大学 | Urban rail transit reservation station-entering method, system, electronic equipment and storage medium |
| CN113379090B (en) * | 2021-08-16 | 2021-12-03 | 北京交通大学 | Urban rail transit reservation station-entering method, system, electronic equipment and storage medium |
| CN116011600A (en) * | 2023-01-17 | 2023-04-25 | 北京交通发展研究院 | Reservation method, device and system for congestion-free travel, electronic equipment and medium |
| CN116011600B (en) * | 2023-01-17 | 2023-06-23 | 北京交通发展研究院 | Reservation method, device and system for congestion-free travel, electronic equipment and medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112419706B (en) | Real-time single processing method and server | |
| CN111242334A (en) | Traffic appointment travel method, system and storage medium | |
| US20170169366A1 (en) | Systems and Methods for Adjusting Ride-Sharing Schedules and Routes | |
| US20160247247A1 (en) | Systems and Methods for Allocating Networked Vehicle Resources in Priority Environments | |
| CN110118567B (en) | Travel mode recommendation method and device | |
| CN108921762B (en) | Vehicle hybrid scheduling method, device and equipment | |
| JP2004362271A (en) | Ride sharing riding system, riding information processor and ride sharing riding method | |
| KR102288490B1 (en) | Vehicle rental method, system and program based on limit waiting time | |
| CN111461485A (en) | Task allocation method, device, equipment and computer readable storage medium | |
| CN111882107B (en) | Driver and passenger matching method based on automatic driving shared taxi system | |
| Khalid et al. | AVPark: Reservation and cost optimization-based cyber-physical system for long-range autonomous valet parking (L-AVP) | |
| US11580521B2 (en) | Curbside management system for connected and autonomous vehicles | |
| JP2019219212A (en) | Route setting system and route setting program | |
| CN107437129B (en) | Reservation sheet processing method and server | |
| KR102072174B1 (en) | Method and Server for compulsive allocation of car | |
| WO2018138884A1 (en) | Traffic guidance system, traffic guidance method, parking lot management system, parking lot management method, and recording medium | |
| CN111311950A (en) | Intelligent dispatching method and system for bus in peak period | |
| JP2002024659A (en) | Taxi dispatch reserving system | |
| CN112446757A (en) | Information processing apparatus, information processing method, and storage medium | |
| CN111461375A (en) | Service system and method for automatically driving automobile by intelligent network contract | |
| KR101910882B1 (en) | Allocation service method for prepayment of taxi | |
| JP7414019B2 (en) | Energy consumption estimation device and energy consumption estimation method | |
| JP7022826B2 (en) | Commercial vehicle operation system | |
| CN109447316B (en) | Vehicle using method | |
| CN114493236A (en) | Service vehicle assignment method, service vehicle assignment device, service vehicle assignment apparatus, service vehicle assignment medium, and program product |
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 | ||
| CB02 | Change of applicant information | ||
| CB02 | Change of applicant information |
Address after: No.122 Luoshi Road, Wuhan, Hubei Applicant after: WUHAN University OF TECHNOLOGY Address before: No.122 Luoshi Road, Wuhan, Hubei Applicant before: WUHAN University OF TECHNOLOGY |
|
| CB02 | Change of applicant information | ||
| CB02 | Change of applicant information |
Address after: No.122 Luoshi Road, Wuhan, Hubei Applicant after: WUHAN University OF TECHNOLOGY Address before: 430063 No.122 Luoshi Road, Wuhan City, Hubei Province 430063 Applicant before: WUHAN University OF TECHNOLOGY |
|
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20200605 |