WO2022257357A1 - 网约车信息处理方法、装置、设备和计算机存储介质 - Google Patents
网约车信息处理方法、装置、设备和计算机存储介质 Download PDFInfo
- Publication number
- WO2022257357A1 WO2022257357A1 PCT/CN2021/131178 CN2021131178W WO2022257357A1 WO 2022257357 A1 WO2022257357 A1 WO 2022257357A1 CN 2021131178 W CN2021131178 W CN 2021131178W WO 2022257357 A1 WO2022257357 A1 WO 2022257357A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- time
- query
- recommended
- destination
- departure
- Prior art date
Links
- 230000010365 information processing Effects 0.000 title claims abstract description 20
- 238000003672 processing method Methods 0.000 title abstract description 9
- 238000000034 method Methods 0.000 claims abstract description 57
- 238000012545 processing Methods 0.000 claims description 19
- 238000004590 computer program Methods 0.000 claims description 10
- 230000001960 triggered effect Effects 0.000 claims description 9
- 238000004364 calculation method Methods 0.000 claims description 7
- 230000003993 interaction Effects 0.000 claims description 6
- 230000004044 response Effects 0.000 claims description 6
- 238000005516 engineering process Methods 0.000 abstract description 4
- 238000013473 artificial intelligence Methods 0.000 abstract description 3
- 238000013135 deep learning Methods 0.000 abstract description 2
- 238000010586 diagram Methods 0.000 description 13
- 230000006870 function Effects 0.000 description 12
- 238000004891 communication Methods 0.000 description 10
- 230000008569 process Effects 0.000 description 10
- 238000012549 training Methods 0.000 description 9
- 238000013527 convolutional neural network Methods 0.000 description 4
- 238000012986 modification Methods 0.000 description 3
- 230000004048 modification Effects 0.000 description 3
- 230000003287 optical effect Effects 0.000 description 3
- 238000011161 development Methods 0.000 description 2
- 238000007499 fusion processing Methods 0.000 description 2
- 238000011478 gradient descent method Methods 0.000 description 2
- 238000013507 mapping Methods 0.000 description 2
- 230000029305 taxis Effects 0.000 description 2
- 238000003491 array Methods 0.000 description 1
- 238000013528 artificial neural network Methods 0.000 description 1
- 230000001413 cellular effect Effects 0.000 description 1
- 238000004883 computer application Methods 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 239000000835 fiber Substances 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 238000010801 machine learning Methods 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 230000001953 sensory effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 238000011282 treatment Methods 0.000 description 1
- 230000000007 visual effect 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
- 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
- G06Q50/43—Business processes related to the sharing of vehicles, e.g. car sharing
- G06Q50/47—Passenger ride requests, e.g. ride-hailing
-
- 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/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06311—Scheduling, planning or task assignment for a person or group
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/953—Querying, e.g. by the use of web search engines
- G06F16/9537—Spatial or temporal dependent retrieval, e.g. spatiotemporal queries
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computing arrangements based on biological models
- G06N3/02—Neural networks
- G06N3/08—Learning methods
-
- 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
- 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
- G06Q10/025—Coordination of plural reservations, e.g. plural trip segments, transportation combined with accommodation
-
- 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"
-
- 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
- G06Q30/00—Commerce
- G06Q30/02—Marketing; Price estimation or determination; Fundraising
- G06Q30/0283—Price estimation or determination
-
- 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
- G06Q30/00—Commerce
- G06Q30/02—Marketing; Price estimation or determination; Fundraising
- G06Q30/0283—Price estimation or determination
- G06Q30/0284—Time or distance, e.g. usage of parking meters or taximeters
-
- 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
- G06Q30/00—Commerce
- G06Q30/06—Buying, selling or leasing transactions
- G06Q30/0601—Electronic shopping [e-shopping]
- G06Q30/0633—Lists, e.g. purchase orders, compilation or processing
- G06Q30/0635—Processing of requisition or of purchase orders
-
- 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
Definitions
- the present disclosure relates to the field of computer application technology, in particular to big data calculation and deep learning technology in artificial intelligence technology.
- the online car-hailing platform puts drivers who need to receive orders and passengers who need to take taxis on one network platform.
- a passenger places an order (subsequently referred to as "bill issuance")
- the online car-hailing platform can effectively match drivers who are within a certain distance from the passenger, and the driver who is successfully matched will accept the order and drive the passenger to the destination specified in the order. land.
- the advantages of online car-hailing are departure at any time, high efficiency and no need to consider parking issues.
- the current online car-hailing client will give the user an estimate of the cost of a taxi at the current moment after the passenger enters the origin and destination for the passenger's reference. But passengers can only consider whether to take a taxi based on this. If the current taxi fare is high due to road conditions or other problems, the passenger will give up taking a taxi or try to obtain the estimated taxi fare after a period of time. This will inevitably bring inconvenience to passengers, low efficiency, and users have tried to estimate the taxi fare many times, which also wastes network resources and puts pressure on system performance.
- the present disclosure provides a method, device, device, and computer storage medium for online car-hailing information processing, which facilitates users to choose a less costly billing time, improves user efficiency and experience, saves network resources, and reduces the impact on system performance. bring pressure.
- a method for processing online car-hailing information including:
- a query result is returned to the client, the query result includes the recommended billing time, or the query result includes the recommended billing time and cost information corresponding to the recommended billing time.
- a method for processing online car-hailing information including:
- the query result includes the recommended billing time, or the query result includes the recommended billing time and the cost information corresponding to the recommended billing time ;
- an online car-hailing information processing device including:
- the condition receiving unit is used to obtain the online car-hailing query condition sent by the client, and the query condition includes origin and destination information;
- an interval determining unit configured to determine the query time interval according to the query condition
- a cost calculation unit configured to calculate the cost information starting from each time and arriving at the destination for each time in the query time interval
- the first recommendation unit is configured to determine the time that satisfies the query condition as the recommended departure time according to the cost information from each time to the destination;
- the second recommending unit is configured to use the recommended departure time to determine the recommended billing time
- a result returning unit configured to return a query result to the client, the query result includes the recommended billing time, or the query result includes the recommended billing time and the price corresponding to the recommended billing time information.
- an online car-hailing information processing device including:
- a condition obtaining unit is used to obtain the network car-hailing query condition input by the user, and the query condition includes origin and destination information;
- the server interaction unit is configured to send the query condition to the server, and obtain the query result returned by the server, the query result includes the recommended billing time, or the query result includes the recommended billing time and the recommended The price information corresponding to the time when the order is issued;
- the result display unit is used to display the query result.
- an electronic device comprising:
- the memory stores instructions executable by the at least one processor, the instructions are executed by the at least one processor to enable the at least one processor to perform the method as described above.
- a non-transitory computer-readable storage medium storing computer instructions, wherein the computer instructions are used to cause the computer to execute the above method.
- a computer program product comprises a computer program which, when executed by a processor, implements the method as described above.
- FIG. 1 shows an exemplary system architecture to which embodiments of the present disclosure can be applied
- FIG. 2 is a flow chart of a method for processing online car-hailing information provided by an embodiment of the present disclosure
- FIG. 3 is a flowchart of a method for estimating the pick-up time provided by an embodiment of the present disclosure
- FIG. 4 is a flow chart of a method for estimating order receiving time provided by an embodiment of the present disclosure
- FIG. 5 is a schematic diagram of a pick-up time estimation model provided by an embodiment of the present disclosure.
- FIG. 6 is a schematic diagram of an order receiving time estimation model provided by an embodiment of the present disclosure.
- FIG. 7 is a schematic diagram of multi-task training provided by an embodiment of the present disclosure.
- FIG. 8 is a flowchart of another online car-hailing information processing method provided by an embodiment of the present disclosure.
- FIG. 9 is an example diagram of an interface displaying query results provided by an embodiment of the present disclosure.
- FIG. 10 is a structural diagram of an online car-hailing information processing device provided by an embodiment of the present disclosure.
- FIG. 11 is a schematic structural diagram of another online car-hailing information processing device provided by an embodiment of the present disclosure.
- FIG. 12 is a block diagram of an electronic device used to implement an embodiment of the present disclosure.
- FIG. 1 shows an exemplary system architecture to which embodiments of the present disclosure can be applied.
- the system architecture may include terminal devices 101 and 102 , a network 103 and a server 104 .
- the network 103 is used as a medium for providing communication links between the terminal devices 101 , 102 and the server 104 .
- Network 103 may include various connection types, such as wires, wireless communication links, or fiber optic cables, among others.
- Terminal devices 101 and 102 Users can use terminal devices 101 and 102 to interact with server 104 via network 103 .
- Terminal devices 101 and 102 can be installed with a client for online car-hailing applications or a client that can display information about online car-hailing, especially in this application, a client used by passengers is installed. Clients used by drivers may also be installed on other terminal devices.
- Terminal devices 101 and 102 may be various mobile electronic devices. Including but not limited to smartphones, tablets, laptops, wearable devices, vehicle terminals, etc.
- An online car-hailing information processing device provided in the present application may be set and run in the above-mentioned server 104 .
- Another online car-hailing information processing device provided in this application can be set and run in the above-mentioned terminal devices 101 and 102 . It can be implemented as multiple software or software modules (for example, to provide distributed services), or can be implemented as a single software or software module, which is not specifically limited here.
- the server 104 can be a single server, or a server group composed of multiple servers.
- terminal devices, networks and servers in Fig. 1 are only illustrative. According to the implementation needs, there can be any number of terminal devices, networks and servers.
- the user can only choose whether to take a taxi now after inquiring about the cost information from the starting point to the destination, such as the price or the duration of the route. If the price is high due to factors such as road conditions, users may give up taking a taxi. However, the road conditions may improve in a short period of time, and users will lose the opportunity to improve the taxi-hailing experience later, which also inhibits the development of the online car-hailing industry. In some cases, many users choose to start now not because of the demand for the itinerary, but because they are concerned that they will not be able to get a taxi due to the shortage of transportation, so they are anxious to queue up. This will increase the cost of taking a taxi during peak hours and make it more difficult to get a taxi.
- the present disclosure provides a new idea, which can recommend the billing time for users, so that users who want to reduce the price or are not in a hurry to start now can choose to issue bills later according to the recommended billing time.
- the present disclosure will be described in detail below with reference to the embodiments.
- Fig. 2 is a flow chart of a method for processing online car-hailing information provided by an embodiment of the present disclosure, and the method can be executed on the server side. As shown in Figure 2, the method includes the following steps:
- the online car-hailing query condition sent by the client is acquired, and the query condition includes origin and destination information.
- the query time interval is determined according to the query condition.
- the cost information of departure from each time to the destination is calculated respectively.
- the time that satisfies the query condition is determined as the recommended departure time.
- the recommended departure time is used to determine the recommended billing time.
- the query result is returned to the client, the query result includes the recommended billing time, or the query result includes the recommended billing time and the cost information corresponding to the recommended billing time.
- this disclosure can determine the recommended billing time based on the cost information triggered at each time within the query time interval, and return the recommended billing time in the query result or further return the price corresponding to the recommended billing time information. It enables the user to select a less costly billing time based on the recommended billing time or further combining cost information.
- the first aspect avoids losing the taxi-hailing experience because the user finds that the departure cost at the current moment is too high.
- the second aspect also prevents users from frequently trying to inquire about the cost information of a taxi in a short period of time, which improves user efficiency and experience.
- the third aspect also reduces the cost of taxis for users, saving costs for users.
- the fourth aspect can also alleviate the problem of unreasonable capacity allocation caused by users concentrating on taxi-hailing peak hours.
- the user can obtain the billing time with a small cost at one time without multiple attempts, which saves network resources and reduces the impact on the system pressure. It can be said to serve multiple purposes.
- step 201 that is, "obtaining the online car-hailing query condition sent by the client, where the query condition includes origin and destination information" is described in detail in conjunction with an embodiment.
- the above online car-hailing query conditions are from the client, including at least origin and destination information.
- the origin information may be information input by the user, or may be obtained according to the current location of the client.
- Destination information is generally information input by a user.
- the "user" involved in this embodiment refers to the passenger who pre-uses the online car-hailing service.
- the above query conditions may further include query time interval information, or further include a cost range.
- the query time interval is usually a period of time in the future set by the user, such as within the next hour, within the next half hour, within the next two hours, etc., and is set according to the user's billing requirements. It reflects how long the user can accept to take a taxi. If the user is not in a hurry for the trip, a longer time interval can be set. If the user is in a hurry for the trip, a shorter time interval can be set.
- the price range may be an acceptable taxi price set by the user. It can be reflected in the price range, for example, within 60 yuan. It can also be reflected in the length of the line, that is, the time-consuming range, for example, within 40 minutes. and many more.
- step 202 that is, "determining the query time interval according to the query condition" will be described in detail below in conjunction with an embodiment.
- the query time interval set by the user is directly used in this step, that is, the query time interval is determined from the query condition.
- the default query time interval can be used in this step, for example, one hour in the future is set as the query time interval by default.
- step 203 that is, "for each time in the query time interval, calculate the cost information from each time to the destination" will be described in detail below in conjunction with an embodiment.
- the query time interval may be divided into various moments according to a preset granularity.
- the granularity may be a set fixed value, or a granularity corresponding to the length of the query time interval. For example, if the query time interval set by the user is half an hour, then the granularity is 1 minute. If the query time interval set by the user is 24 hours, the granularity is 10 minutes.
- the following processing can be performed for each time in the query time interval, so as to obtain the cost information of departure and arrival at each time:
- route planning is carried out for the origin and destination, and the estimated duration information of departure and arrival at the time t i is obtained as the departure from time t i Information about the cost of reaching the destination.
- the route planning is carried out from the starting point to the destination.
- the road condition prediction method will be combined to predict the road condition at this time t i , and the route planning will be carried out based on the road condition prediction result to obtain the time t i Estimated time from departure to destination.
- the method for route planning and traffic condition prediction may adopt any implementable manner, which is not limited in the present disclosure.
- the following processing can be performed for each time in the query time interval, so as to obtain the cost information of departure and arrival at each time:
- route planning is carried out for the origin and destination, and the length and estimated duration of the route from and to the destination at this time t i are obtained.
- the pricing rule calculates the price, and takes the calculated price as the cost information from the moment to the destination.
- the pricing rules for online car-hailing are usually relatively fixed, taking into account the interests of drivers, passengers and enterprises. Different regions or online car-hailing platforms will have some differences.
- the specific pricing rules can be pre-obtained and recorded from the online car-hailing platform.
- the starting price includes a specific mileage and duration, such as 3 kilometers and 10 minutes. And when the driving mileage exceeds 3 kilometers, it will be accumulated at a certain rate per kilometer. When the driving time exceeds 10 minutes, it will be accumulated at a certain rate per minute. The result of the final sum is the calculated price. Since the driving time is related to the road conditions, the road conditions at different times are different, so the price of the same starting point and destination at different times may be different. This application does not limit the specific content of the online car-hailing pricing rules, and it is only illustrated here for the convenience of understanding.
- step 204 that is, "determine the time that satisfies the query condition as the recommended departure time according to the cost information from each time to the destination" will be described in detail below in conjunction with an embodiment.
- the N moments corresponding to the minimum cost in the query time interval can be used as the recommended departure time.
- the above N may be a preset positive integer.
- the time when the corresponding price in the query time interval meets the price range set by the user can be used as the recommended departure time. For example, if the user sets a price range within 40 yuan, the time below 40 yuan can be selected from the prices corresponding to each moment.
- the recommended departure time determined in this step may be one or more than one.
- step 205 that is, "determine the recommended billing time by using the recommended departure time" will be described in detail with reference to the embodiment.
- the recommended departure time refers to the actual departure time of the recommended user, that is, the departure time from the starting point of the route. But for the user, it is more intuitive and necessary when to issue the order, therefore, it is necessary to determine the recommended time to issue the order.
- the specific implementation process of this step may include the following steps:
- Step S1 Use the recommended departure time to estimate the pick-up time of the online car-hailing car, and obtain the estimated order pick-up time.
- Step S2 Estimate the order receiving time by using the estimated order receiving time, and obtain the recommended order issuing time.
- the so-called online car-hailing driver receiving order refers to the process that after the user sends the order, the online car-hailing platform sends the user's order to the matching online car-hailing driver, and then the online car-hailing driver accepts the order.
- the so-called pick-up refers to the process from the driver's location to the passenger's location after the online car-hailing driver accepts the order.
- step S1 the recommended departure time is used to invert the required pick-up time, so as to obtain the estimated order receiving time.
- the specific process is shown in Figure 3, including the following steps:
- Step 301 Obtain a preset initial first duration.
- the initial first duration may be a preset time unit, such as 1 minute.
- Step 302 Determine the time of the first duration before the recommended departure time as the candidate order receiving time.
- T d the time of the first duration before the recommended departure time
- T dn the time of the first duration before the recommended departure time
- Step 303 Estimate the pick-up time required for the candidate order pick-up time.
- a pick-up time estimation model When estimating the pick-up time (denoted as T pickup ) required for the candidate pick-up time T dn in this step, a pick-up time estimation model can be used. The specific implementation will be described in detail later.
- Step 304 Determine whether the estimated pick-up time is less than or equal to the first time, if yes, go to step 305; otherwise, go to step 306.
- T pickup is less than or equal to the current first duration, that is, whether T dn +T pickup ⁇ T d is judged.
- Step 305 Determine the candidate order receiving time as the estimated order receiving time, and end the current estimation process.
- the current T dn is the estimated order receiving time T t .
- Step 306 Extend the first duration, and go to step 302 again.
- the first duration can be extended, for example, by 1 minute, and the first duration becomes 2 minutes, and then go to step 302, and T dn at this time is the time 2 minutes before T d .
- the above steps are carried out until the estimated order receiving time is determined.
- step S2 the estimated order receiving time is used to reverse the order receiving time, so as to obtain the recommended order issuing time.
- the specific process is shown in Figure 4, including the following steps:
- Step 401 Obtain a preset initial second duration.
- the initial second duration may be a preset time unit, such as 1 minute.
- Step 402 Determine the time of the second time period before the estimated order receiving time as the candidate order issuing time.
- the estimated order receiving time is T t
- the second time before the estimated order receiving time is expressed as T tm
- the candidate order issuing time at this time is T tm .
- Step 403 Estimate the order receiving time required for the candidate order issuing time.
- an order receiving time estimation model may be used. The specific implementation will be described in detail later.
- Step 404 Determine whether the estimated order receiving time is less than or equal to the second time, if yes, go to step 405; otherwise, go to step 406.
- T order is less than or equal to the current second duration, that is, whether T tm +T order ⁇ T t is judged.
- Step 405 Determine the candidate billing time as the recommended billing time, and end the current estimation process.
- the current T tm is the recommended billing time T c .
- Step 406 extend the second duration, and go to step 402 again.
- the second duration can be extended, for example, by 1 minute, and the second duration becomes 2 minutes, and then go to step 402, where T tm is 2 minutes before T t .
- the above steps are carried out until the recommended billing time is determined.
- the above-mentioned pick-up time estimation model may adopt a regression model, which can output the corresponding pick-up time T pickup when the candidate pick-up time T dn is input.
- the structure of the pick-up time prediction model can be shown in FIG. 5 , which mainly includes an embedding layer and a fully connected layer.
- the embedding layer is mainly used to embed each feature of the input pick-up time estimation model, and obtain the vector representation of each feature respectively.
- the vector representation of each feature is input into the fully connected layer after fusion processing such as splicing, and the pick-up time is obtained by mapping the fully connected layer.
- the features of the input pick-up duration estimation model include at least one of the user's location, destination, cost information at the recommended departure time, route length, weather information, and road condition information in addition to the candidate order receiving time T dn , in Figure 5 to include all these information as an example.
- the cost information includes price and estimated duration as an example.
- the above-mentioned order receiving time estimation model may also use a regression model, which can output the corresponding order receiving time T order when the candidate order issuing time T tm is input.
- the structure of the order receiving duration prediction model may be shown in FIG. 6 , which mainly includes an embedding layer and a fully connected layer.
- the embedding layer is mainly used to embed each feature of the input order time estimation model, and obtain the vector representation of each feature respectively.
- the vector representation of each feature is input into the fully connected layer after fusion processing such as splicing, and the order receiving time is obtained by mapping the fully connected layer.
- the features of the input order receiving time estimation model may also include at least one of the user's location, destination, cost information at the recommended departure time, route length, and weather information. In Figure 6, all these information are included as an example.
- the cost information includes price and estimated duration as an example.
- the feature used may be POI information.
- POI information may include POI names, attributes, coordinate information, and the like. Embedding processing is actually a semantic representation of POI information. Since the POI name may have the characteristics of POI popularity and function, the POI name can be segmented and then vectorized.
- the attribute information of POI mainly adopts categories, such as public transport hubs, residential areas, etc., which can be represented by discrete values.
- the coordinate information describes the spatial heat information, so the entire area can be divided into cells and then serialized and numbered, and the number of the cell where the coordinates are located can be used as a feature representation.
- Time features such as recommended departure time and candidate billing time can be represented by continuous values. For example, for a specific moment, it can include the hour value x, the minute value 12, and the second value z, and two characteristics can be defined and To represent, this representation can limit the value range to [-1,1].
- discrete information such as whether it is a working day or a day of the week can also be used.
- Price, estimated duration, and route length are all discrete values, which can be normalized and directly input into the model.
- Weather features can be expressed discretely using onehot (one-hot) to express and distinguish weather such as sunny, cloudy, foggy, rainy (light rain, moderate rain, heavy rain, heavy rain), snow (light rain, moderate rain, heavy rain, heavy rain).
- the road condition feature is introduced in the pick-up time estimation model because it has a high impact on the pick-up time, and the nearby road condition features are insufficiently expressed in other features.
- the characteristics of road conditions near the user mainly hope to describe the traffic flow density within a certain physical range. Therefore, neural networks such as CNN (Convolutional Neural Networks, convolutional neural network) and GCN (Graph Convolutional Network, graph convolutional neural network) can be used for encoding.
- CNN Convolutional Neural Networks, convolutional neural network
- GCN Graph Convolutional Network, graph convolutional neural network
- the user's location can be used as the center area to expand the preset range, such as 2km, to obtain a square area of 4km*4km, and then divide this area into 16 small areas of 1km*1km.
- the traffic flow characteristics in the area can be represented by the average value of road congestion coefficient weighted road length, for example:
- I x represents the traffic flow characteristics in the area
- l i represents the road length in the i-th small area
- j i represents the congestion coefficient of the i-th small area.
- the training data used can be obtained from the logs of the online car-hailing platform.
- the online car-hailing platform records the time from when the driver receives the order to when the passenger boards the car, that is, the time of pick-up and driving. From this part of the data, the passenger's location, destination, price, route length, weather information, road condition information and the driver's order-taking time are extracted as Input, take the actual pick-up time as the target output, train the regression model to obtain the pick-up time estimation model. That is to say, when designing the loss function loss, the absolute value of the difference between the output of the pick-up time prediction model and the actual pick-up time is minimized.
- the training data used can also be obtained from the logs of the online car-hailing platform.
- the online car-hailing platform records the time from when the passenger issued the order to when the driver received the order, that is, the time for receiving the order. From this part of the data, the location, destination, price, route length, weather information, and passenger issuing time are extracted as input, the actual order receiving time is taken as the target output, and the regression model is trained to obtain the order receiving time estimation model. That is to say, when designing the loss, minimize the absolute value of the difference between the output of the order receiving time prediction model and the actual order receiving time.
- the above-mentioned pick-up time prediction model and order reception time prediction model can be trained separately, or can be trained by multi-task learning.
- the user's location, destination, estimated price, route length, and weather information are used as shared features, and the corresponding embedding processing part is a shared layer.
- the road condition feature is a unique feature of the pick-up time prediction model.
- the order receiving time is the input of the order receiving time estimation model. After the order receiving model outputs the order receiving time, the combination of the order receiving time and the order issuing time is the order receiving time, which is used as the input of the driving time estimation model.
- a task can be randomly selected in each iteration, and after calculating the loss function of the task, the gradient descent method is used to update the model parameters corresponding to the task.
- a joint training method can also be used, that is, only the loss function of the driving task is used, and all model parameters are updated using the gradient descent method. Continue to iterate until the preset training end conditions are met, such as the loss function converges, or the number of iterations reaches the preset threshold of iterations, and so on.
- FIG. 8 is a flow chart of another method for processing online car-hailing information provided by an embodiment of the present disclosure, and the method can be executed on a client. As shown in Figure 8, the method includes the following steps:
- the online car-hailing query condition input by the user is acquired, and the query condition may include origin and destination information.
- the client may be the client of the online car-hailing application, or the client of other applications integrated with the online car-hailing function, for example, the client of the map application integrated with the online car-hailing function.
- the client terminal may provide the user with a first interface for the user to input the origin and destination information of the taxi.
- a component for setting the query time interval or cost range can also be provided to the user.
- an input box may be provided on the first interface for the user to input a query time interval or cost range.
- options such as a drop-down box may be provided on the first interface for the user to select and input a query time interval or cost range.
- the cost range may be a price range, or a time range of a route (that is, a taxi trip).
- the query condition is sent to the server, and the query result returned by the server is obtained.
- the query result includes the recommended billing time, or the query result includes the recommended billing time and the cost information corresponding to the recommended billing time.
- the server executes the process in the embodiment shown in FIG. 2 to generate query results and return them to the client.
- the processing performed by the server side will not be repeated here.
- the cost information corresponding to the recommended billing time may include estimated duration information of departure and arrival at the time, or price information of departure and arrival at the time.
- the client terminal may provide the user with a second interface on which query results are displayed. At least one recommended billing time is displayed on the second interface, and there may be one or more recommended billing times. When displaying the recommended billing time, only the recommended billing time can be displayed, or each time in the query time interval can be displayed, but the recommended billing time among them can be highlighted.
- the price information corresponding to the recommended billing time can be displayed. Only one type of cost information may be provided, or multiple types of cost information may be provided for the user to choose.
- Fig. 9 is an example diagram showing a query result interface provided by an embodiment of the present disclosure.
- two kinds of cost information can be provided for users to choose: according to the least cost (ie price) and according to time (ie line Estimated duration) minimum.
- the recommended billing time with the least cost will be displayed to the user. It is also possible to provide multiple online car-hailing platforms for users to choose to view.
- taking the query time interval within one hour as an example the recommended billing time is highlighted, that is, the time of 16:00, and the corresponding cost is 27 yuan.
- a component for setting the departure time may be displayed on the second interface, for example, the "set departure time” component shown in FIG. 9 .
- the component After getting the event triggered by the component, record the departure time set by the user.
- a reminder message is displayed to the user.
- a component for ordering and issuing bills may be displayed on the second interface, for example, the component of “reserving a taxi” shown in FIG. 9 .
- the component of “reserving a taxi” shown in FIG. 9 After obtaining the triggered event of the component, record the billing time set by the user; when the billing time set by the user is reached, send the online car-hailing order from the origin to the destination.
- Fig. 10 is a structural diagram of an online car-hailing information processing device provided by an embodiment of the present disclosure, which is set on the server side.
- the device may be an application located on the server side, or may also be a functional unit such as a plug-in or a software development kit (Software Development Kit, SDK) in the application located on the server side.
- the apparatus 1000 may include: a condition receiving unit 1010 , an interval determining unit 1020 , a cost calculating unit 1030 , a first recommending unit 1040 , a second recommending unit 1050 and a result returning unit 1060 .
- the main functions of each component unit are as follows:
- the condition receiving unit 1010 is used to obtain the online car-hailing query condition sent by the client, and the query condition includes origin and destination information.
- the interval determining unit 1020 is configured to determine the query time interval according to the query condition.
- the cost calculation unit 1030 is configured to calculate, for each time in the query time interval, the cost information from each time to the destination.
- the first recommendation unit 1040 is configured to determine the time that satisfies the query condition as the recommended departure time according to the cost information from each time to the destination.
- the second recommendation unit 1050 is configured to use the recommended departure time to determine the recommended billing time.
- the result returning unit 1060 is configured to return a query result to the client.
- the query result includes the recommended billing time, or the query result includes the recommended billing time and the cost information corresponding to the recommended billing time.
- the query condition also includes a query time interval
- the first recommendation unit 1040 is specifically configured to use the N times with the lowest corresponding costs within the query time interval as recommended departure times, where N is a preset positive integer.
- the query condition also includes a cost range
- the first recommendation unit 1040 is specifically configured to use the time within the query time interval when the corresponding cost meets the cost range set by the user as the recommended departure time.
- the interval determining unit 1020 is specifically configured to: if the query condition includes the query time interval set by the user, adopt the query time interval set by the user; otherwise, adopt the default query time interval.
- the cost calculation unit 1030 is specifically configured to execute respectively for each moment:
- route planning is carried out for the starting point and destination, and the length and estimated time of the route departing from and arriving at the destination at this moment are obtained, and the price is calculated using the online car-hailing pricing rules, and the calculated The price is used as the cost information from the moment to the destination.
- the second recommendation unit 1050 may include: a first prediction subunit 1051 and a second prediction subunit 1052 .
- the first estimating subunit 1051 is used to estimate the pick-up time of the online car-hailing car by using the recommended departure time to obtain the estimated order receiving time;
- the second estimating subunit 1052 is configured to use the estimated order receiving time to estimate the order receiving time to obtain the recommended order issuing time.
- the first estimation subunit 1051 is specifically used for:
- the preset initial first time length determine the time of the first time length before the recommended departure time as the candidate order receiving time
- the candidate pick-up time as the estimated pick-up time; otherwise, extend the first time, and switch to the time of the first time before the recommended departure time as the candidate pick-up time. single-moment operation.
- the first estimating subunit 1051 estimates the pick-up time required for the candidate order-taking time, it specifically executes: combining the user's location, destination, cost information, route length, weather information and At least one of the road condition information and the candidate pick-up time are input into the pick-up time estimation model to obtain the pick-up time required for the candidate pick-up time.
- the second estimation subunit 1052 is specifically used for:
- the preset initial second time period determine the second time period before the estimated order receiving time as the candidate order issuing time
- the candidate order-issuing time as the recommended order-issuing time, otherwise, extend the second time-length, and switch to the second time-long time before the estimated order-receiving time as the candidate The operation at the moment of billing.
- the second estimating subunit 1052 estimates the order-receiving time required for the candidate order-issuing moment, it specifically performs: the user's location, destination, cost information, route length and weather information Input at least one of the candidate order-issuing times into the order-receiving time-duration estimation model to obtain the order-receiving time required for the candidate order-issuing time.
- FIG. 11 is a schematic structural diagram of another online car-hailing information processing device provided by an embodiment of the present disclosure, which is set in a terminal device.
- the apparatus may be an application located in the terminal device, or may also be a functional unit such as a plug-in or a software development kit (Software Development Kit, SDK) located in the application of the terminal device.
- the device may include: a condition acquisition unit 1101 , a server interaction unit 1102 and a result presentation unit 1103 , and may further include a first component response unit 1104 and a second component response unit 1105 .
- the main functions of each component unit are as follows:
- the server interaction unit 1102 is configured to send the query condition to the server, and obtain the query result returned by the server, the query result includes the recommended billing time, or the query result includes the recommended billing time and the cost information corresponding to the recommended billing time ;
- a result display unit 1103, configured to display query results.
- the cost information corresponding to the recommended billing time may include: information on the estimated duration of departure and arrival at the destination at this time, or price information on departure and arrival at the destination at this time.
- result display unit 1103 can also be used to display a component for setting the departure time on the interface.
- the first component response unit 1104 is configured to record the departure time set by the user after obtaining the event triggered by the component; trigger the result display unit when the departure time set by the user arrives or is preset before the departure time set by the user 1103 Display a reminder message to the user.
- result display unit 1103 is also used to display the component of ordering and billing on the interface.
- the second component response unit 1105 is used to record the billing time set by the user after obtaining the event triggered by the component; Destination online car-hailing orders.
- each embodiment in this specification is described in a progressive manner, the same and similar parts of each embodiment can be referred to each other, and each embodiment focuses on the differences from other embodiments.
- the description is relatively simple, and for relevant parts, please refer to part of the description of the method embodiment.
- the present disclosure also provides an electronic device, a readable storage medium, and a computer program product.
- FIG. 12 it is a block diagram of an electronic device according to an online car-hailing information processing method according to an embodiment of the present disclosure.
- Electronic device is intended to represent various forms of digital computers, such as laptops, desktops, workstations, personal digital assistants, servers, blade servers, mainframes, and other suitable computers.
- Electronic devices may also represent various forms of mobile devices, such as personal digital processing, cellular telephones, smart phones, wearable devices, and other similar computing devices.
- the components shown herein, their connections and relationships, and their functions, are by way of example only, and are not intended to limit implementations of the disclosure described and/or claimed herein.
- the device 1200 includes a computing unit 1201 that can execute according to a computer program stored in a read-only memory (ROM) 1202 or loaded from a storage unit 1208 into a random-access memory (RAM) 1203. Various appropriate actions and treatments. In the RAM 1203, various programs and data necessary for the operation of the device 1200 can also be stored.
- the computing unit 1201, ROM 1202, and RAM 1203 are connected to each other through a bus 1204.
- An input/output (I/O) interface 1205 is also connected to the bus 1204 .
- the I/O interface 1205 includes: an input unit 1206, such as a keyboard, a mouse, etc.; an output unit 1207, such as various types of displays, speakers, etc.; a storage unit 1208, such as a magnetic disk, an optical disk, etc. ; and a communication unit 1209, such as a network card, a modem, a wireless communication transceiver, and the like.
- the communication unit 1209 allows the device 1200 to exchange information/data with other devices through a computer network such as the Internet and/or various telecommunication networks.
- the computing unit 1201 may be various general-purpose and/or special-purpose processing components with processing and computing capabilities. Some examples of computing units 1201 include, but are not limited to, central processing units (CPUs), graphics processing units (GPUs), various dedicated artificial intelligence (AI) computing chips, various computing units that run machine learning model algorithms, digital signal processing processor (DSP), and any suitable processor, controller, microcontroller, etc.
- the calculation unit 1201 executes the various methods and processes described above, such as the online car-hailing information processing method.
- the online car-hailing information processing method can be implemented as a computer software program, which is tangibly contained in a machine-readable medium, such as the storage unit 1208 .
- part or all of the computer program may be loaded and/or installed on the device 1200 via the ROM 802 and/or the communication unit 1209.
- the computer program When the computer program is loaded into the RAM 1203 and executed by the computing unit 1201, one or more steps of the online car-hailing information processing method described above can be executed.
- the computing unit 1201 may be configured in any other appropriate manner (for example, by means of firmware) to execute the online car-hailing information processing method.
- Various implementations of the systems and techniques described herein can be implemented in digital electronic circuitry, systems integrated circuits, field programmable gate arrays (FPGAs), application specific integrated circuits (ASICs), application specific standard products (ASSPs), systems on chips system (SOC), complex programmable logic device (CPLD), computer hardware, firmware, software, and/or a combination thereof.
- FPGAs field programmable gate arrays
- ASICs application specific integrated circuits
- ASSPs application specific standard products
- SOC systems on chips system
- CPLD complex programmable logic device
- computer hardware firmware, software, and/or a combination thereof.
- programmable processor can be special-purpose or general-purpose programmable processor, can receive data and instruction from storage system, at least one input device, and at least one output device, and transmit data and instruction to this storage system, this at least one input device, and this at least one output device an output device.
- Program codes for implementing the methods of the present disclosure may be written in any combination of one or more programming languages. These program codes may be provided to a processor or controller of a general-purpose computer, a special-purpose computer, or other programmable data processing apparatus, so that the program codes, when executed by the processor or controller, make the flow diagrams and/or block diagrams specified The function/operation is implemented.
- the program code may execute entirely on the machine, partly on the machine, as a stand-alone software package partly on the machine and partly on a remote machine or entirely on the remote machine or server.
- a machine-readable medium may be a tangible medium that may contain or store a program for use by or in conjunction with an instruction execution system, apparatus, or device.
- a machine-readable medium can be a machine-readable signal medium or a machine-readable storage medium.
- a machine-readable medium may include, but is not limited to, electronic, magnetic, optical, electromagnetic, infrared, or semiconductor systems, apparatus, or devices, or any suitable combination of the foregoing.
- machine-readable storage media would include one or more wire-based electrical connections, portable computer discs, hard drives, random access memory (RAM), read only memory (ROM), erasable programmable read only memory (EPROM or flash memory), optical fiber, compact disk read only memory (CD-ROM), optical storage, magnetic storage, or any suitable combination of the foregoing.
- RAM random access memory
- ROM read only memory
- EPROM or flash memory erasable programmable read only memory
- CD-ROM compact disk read only memory
- magnetic storage or any suitable combination of the foregoing.
- the systems and techniques described herein can be implemented on a computer having a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to the user. ); and a keyboard and pointing device (eg, a mouse or a trackball) through which a user can provide input to the computer.
- a display device e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor
- a keyboard and pointing device eg, a mouse or a trackball
- Other kinds of devices can also be used to provide interaction with the user; for example, the feedback provided to the user can be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and can be in any form (including Acoustic input, speech input or, tactile input) to receive input from the user.
- the systems and techniques described herein can be implemented in a computing system that includes back-end components (e.g., as a data server), or a computing system that includes middleware components (e.g., an application server), or a computing system that includes front-end components (e.g., as a a user computer having a graphical user interface or web browser through which a user can interact with embodiments of the systems and techniques described herein), or including such backend components, middleware components, Or any combination of front-end components in a computing system.
- the components of the system can be interconnected by any form or medium of digital data communication, eg, a communication network. Examples of communication networks include: Local Area Network (LAN), Wide Area Network (WAN) and the Internet.
- a computer system may include clients and servers.
- Clients and servers are generally remote from each other and typically interact through a communication network.
- the relationship of client and server arises by computer programs running on the respective computers and having a client-server relationship to each other.
- the server can be a cloud server, also known as cloud computing server or cloud host, which is a host product in the cloud computing service system to solve the management problems existing in traditional physical host and virtual private server (VPs, VI irtual Private Server) services. Difficulty and weak business expansion.
- the server can also be a server of a distributed system, or a server combined with a blockchain.
- steps may be reordered, added or deleted using the various forms of flow shown above.
- each step described in the present application may be executed in parallel, sequentially, or in a different order, as long as the desired result of the technical solution disclosed in the present disclosure can be achieved, no limitation is imposed herein.
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Human Resources & Organizations (AREA)
- Strategic Management (AREA)
- Theoretical Computer Science (AREA)
- Economics (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Development Economics (AREA)
- Marketing (AREA)
- General Business, Economics & Management (AREA)
- Tourism & Hospitality (AREA)
- Finance (AREA)
- Accounting & Taxation (AREA)
- Entrepreneurship & Innovation (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Game Theory and Decision Science (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Databases & Information Systems (AREA)
- Educational Administration (AREA)
- Primary Health Care (AREA)
- Data Mining & Analysis (AREA)
- General Engineering & Computer Science (AREA)
- Biomedical Technology (AREA)
- Biophysics (AREA)
- Computational Linguistics (AREA)
- Evolutionary Computation (AREA)
- Artificial Intelligence (AREA)
- Molecular Biology (AREA)
- Computing Systems (AREA)
- Mathematical Physics (AREA)
- Software Systems (AREA)
- Life Sciences & Earth Sciences (AREA)
- Navigation (AREA)
- Traffic Control Systems (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
Description
Claims (30)
- 一种网约车信息处理方法,包括:获取客户端发送的网约车查询条件,所述查询条件包括起始地和目的地信息;依据所述查询条件确定查询时间区间;针对所述查询时间区间内的各时刻,分别计算从各时刻出发到达目的地的代价信息;依据从各时刻出发到达目的地的代价信息,确定满足所述查询条件的时刻作为推荐出发时刻;利用所述推荐出发时刻,确定推荐发单时刻;向所述客户端返回查询结果,所述查询结果包括所述推荐发单时刻,或者,所述查询结果包括所述推荐发单时刻和所述推荐发单时刻对应的代价信息。
- 根据权利要求1所述的方法,其中,所述查询条件还包括查询时间区间;所述依据从各时刻出发到达目的地的代价信息,确定满足所述查询条件的时刻作为推荐出发时刻包括:将所述查询时间区间内对应代价最小的N个时刻作为推荐出发时刻,所述N为预设的正整数。
- 根据权利要求1所述的方法,其中,所述查询条件还包括代价范围;所述依据从各时刻出发到达目的地的代价信息,确定满足所述查询条件的时刻作为推荐出发时刻包括:将所述查询时间区间内对应代价符合所述用户设置的代价范围的时刻作为推荐出发时刻。
- 根据权利要求1所述的方法,其中,依据所述查询条件确定查询时间区间包括:若所述查询条件包含用户设置的查询时间区间,则采用用户设置的查询时间区间;否则,采用默认设置的查询时间区间。
- 根据权利要求1所述的方法,其中,所述分别计算从各时刻出发到达目的地的代价信息包括:针对所述各时刻分别执行:基于对该时刻的路况预估结果,对所述 起始地和目的地进行路线规划,得到该时刻出发到达目的地的预估时长信息作为从该时刻出发到达目的地的代价信息;或者,基于对该时刻的路况预估结果,对所述起始地和目的地进行路线规划,得到该时刻出发到达目的地的路线长度和预估时长,利用网约车计价规则进行价格计算,将计算得到的价格作为从该时刻出发到达目的地的代价信息。
- 根据权利要求1所述的方法,其中,利用所述推荐出发时刻,确定推荐发单时刻包括:利用所述推荐出发时刻对网约车接驾时间进行预估,得到预估接单时刻;利用所述预估接单时刻对接单时间进行预估,得到所述推荐发单时刻。
- 根据权利要求6所述的方法,其中,利用所述推荐出发时刻对网约车接驾时间进行预估,得到预估接单时刻包括:按照预设的初始第一时长,确定所述推荐出发时刻之前第一时长的时刻作为候选接单时刻;预估所述候选接单时刻所需的接驾时长;若预估的接驾时长小于或等于所述第一时长,则确定所述候选接单时刻为所述预估接单时刻,否则,延长所述第一时长,重新转至所述确定所述推荐出发时刻之前第一时长的时刻作为候选接单时刻的步骤。
- 根据权利要求7所述的方法,其中,预估所述候选接单时刻所需的接驾时长包括:将所述用户的位置、目的地、所述代价信息、路线长度、天气信息和路况信息中的至少一种以及所述候选接单时刻输入接驾时长预估模型,得到所述候选接单时刻所需的接驾时长。
- 根据权利要求6所述的方法,其中,利用所述预估接单时刻对接单时间进行预估,得到所述推荐发单时刻包括:按照预设的初始第二时长,确定所述预估接单时刻之前第二时长的时刻作为候选发单时刻;预估所述候选发单时刻所需的接单时长;若预估的接单时长小于或等于所述第二时长,则确定所述候选发单时刻为所述推荐发单时刻,否则,延长所述第二时长,重新转至所述确 定所述预估接单时刻之前第二时长的时刻作为候选发单时刻的步骤。
- 根据权利要求9所述的方法,其中,预估所述候选发单时刻所需的接单时长包括:将所述用户的位置、目的地、所述代价信息、路线长度和天气信息中的至少一种以及所述候选发单时刻输入接单时长预估模型,得到所述候选发单时刻所需的接单时长。
- 一种网约车信息处理方法,包括:获取用户输入的网约车查询条件,所述查询条件包括起始地和目的地信息;将所述查询条件发送给服务器端,并获取所述服务器端返回的查询结果,所述查询结果包括推荐发单时刻,或者所述查询结果包括推荐发单时刻和推荐发单时刻对应的代价信息;展示所述查询结果。
- 根据权利要求11所述的方法,其中,所述推荐发单时刻对应的代价信息包括:该时刻出发到达目的地的预估时长信息,或者,该时刻出发到达目的地的价格信息。
- 根据权利要求11所述的方法,还包括:在所述界面上展现设置出发时间的组件;获取到所述组件被触发的事件后,记录用户设置的出发时间;在所述用户设置的出发时间到达或者在所述用户设置的出发时间之前预设时长,向用户展示提醒消息。
- 根据权利要求11所述的方法,还包括:在所述界面上展现预约发单的组件;获取到所述组件被触发的事件后,记录所述用户设置的发单时间;在到达所述用户设置的发单时间时,发送从所述起始地到目的地的网约车订单。
- 一种网约车信息处理装置,包括:条件接收单元,用于获取客户端发送的网约车查询条件,所述查询条件包括起始地和目的地信息;区间确定单元,用于依据所述查询条件确定查询时间区间;代价计算单元,用于针对所述查询时间区间内的各时刻,分别计算从各时刻出发到达目的地的代价信息;第一推荐单元,用于依据从各时刻出发到达目的地的代价信息,确定满足所述查询条件的时刻作为推荐出发时刻;第二推荐单元,用于利用所述推荐出发时刻,确定推荐发单时刻;结果返回单元,用于向所述客户端返回查询结果,所述查询结果包括所述推荐发单时刻,或者,所述查询结果包括所述推荐发单时刻和所述推荐发单时刻对应的代价信息。
- 根据权利要求15所述的装置,其中,所述查询条件还包括查询时间区间,所述第一推荐单元具体用于将所述查询时间区间内对应代价最小的N个时刻作为推荐出发时刻,所述N为预设的正整数;或者,所述查询条件还包括代价范围,所述第一推荐单元具体用于将所述查询时间区间内对应代价符合所述用户设置的代价范围的时刻作为推荐出发时刻。
- 根据权利要求15所述的装置,其中,所述区间确定单元具体用于:若所述查询条件包含用户设置的查询时间区间,则采用用户设置的查询时间区间;否则,采用默认设置的查询时间区间。
- 根据权利要求15所述的装置,其中,所述代价计算单元具体用于针对所述各时刻分别执行:基于对该时刻的路况预估结果,对所述起始地和目的地进行路线规划,得到该时刻出发到达目的地的预估时长信息作为从该时刻出发到达目的地的代价信息;或者,基于对该时刻的路况预估结果,对所述起始地和目的地进行路线规划,得到该时刻出发到达目的地的路线长度和预估时长,利用网约车计价规则进行价格计算,将计算得到的价格作为从该时刻出发到达目的地的代价信息。
- 根据权利要求15所述的装置,其中,所述第二推荐单元包括:第一预估子单元,用于利用所述推荐出发时刻对网约车接驾时间进行预估,得到预估接单时刻;第二预估子单元,用于利用所述预估接单时刻对接单时间进行预估,得到所述推荐发单时刻。
- 根据权利要求19所述的装置,其中,所述第一预估子单元具体用于:按照预设的初始第一时长,确定所述推荐出发时刻之前第一时长的时刻作为候选接单时刻;预估所述候选接单时刻所需的接驾时长;若预估的接驾时长小于或等于所述第一时长,则确定所述候选接单时刻为所述预估接单时刻,否则,延长所述第一时长,重新转至所述确定所述推荐出发时刻之前第一时长的时刻作为候选接单时刻的操作。
- 根据权利要求20所述的装置,其中,所述第一预估子单元在预估所述候选接单时刻所需的接驾时长时,具体执行:将所述用户的位置、目的地、所述代价信息、路线长度、天气信息和路况信息中的至少一种以及所述候选接单时刻输入接驾时长预估模型,得到所述候选接单时刻所需的接驾时长。
- 根据权利要求19所述的装置,其中,所述第二预估子单元具体用于:按照预设的初始第二时长,确定所述预估接单时刻之前第二时长的时刻作为候选发单时刻;预估所述候选发单时刻所需的接单时长;若预估的接单时长小于或等于所述第二时长,则确定所述候选发单时刻为所述推荐发单时刻,否则,延长所述第二时长,重新转至所述确定所述预估接单时刻之前第二时长的时刻作为候选发单时刻的操作。
- 根据权利要求22所述的装置,其中,所述第二预估子单元在预估所述候选发单时刻所需的接单时长时,具体执行:将所述用户的位置、目的地、所述代价信息、路线长度和天气信息中的至少一种以及所述候选发单时刻输入接单时长预估模型,得到所述候选发单时刻所需的接单时长。
- 一种网约车信息处理装置,包括:条件获取单元,用于获取用户输入的网约车查询条件,所述查询条件包括起始地和目的地信息;服务端交互单元,用于将所述查询条件发送给服务器端,并获取所述服务器端返回的查询结果,所述查询结果包括推荐发单时刻,或者所 述查询结果包括推荐发单时刻和推荐发单时刻对应的代价信息;结果展示单元,用于展示所述查询结果。
- 根据权利要求24所述的装置,其中,所述推荐发单时刻对应的代价信息包括:该时刻出发到达目的地的预估时长信息,或者,该时刻出发到达目的地的价格信息。
- 根据权利要求24所述的装置,其中,所述结果展示单元,还用于在所述界面上展现设置出发时间的组件;该装置还包括:第一组件响应单元,用于获取到所述组件被触发的事件后,记录用户设置的出发时间;在所述用户设置的出发时间到达或者在所述用户设置的出发时间之前预设时长,通过所述结果展示单元向用户展示提醒消息。
- 根据权利要求24所述的装置,其中,所述结果展示单元,还用于在所述界面上展现预约发单的组件;第二组件响应单元,用于获取到所述组件被触发的事件后,记录所述用户设置的发单时间;在到达所述用户设置的发单时间时,通过所述服务端交互单元发送从所述起始地到目的地的网约车订单。
- 一种电子设备,包括:至少一个处理器;以及与所述至少一个处理器通信连接的存储器;其中,所述存储器存储有可被所述至少一个处理器执行的指令,所述指令被所述至少一个处理器执行,以使所述至少一个处理器能够执行权利要求1-14中任一项所述的方法。
- 一种存储有计算机指令的非瞬时计算机可读存储介质,其中,所述计算机指令用于使所述计算机执行权利要求1-14中任一项所述的方法。
- 一种计算机程序产品,包括计算机程序,所述计算机程序在被处理器执行时实现根据权利要求1-14中任一项所述的方法。
Priority Applications (4)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP2023514809A JP7460062B2 (ja) | 2021-06-07 | 2021-11-17 | オンライン予約車両情報処理方法、装置、機器、及びコンピュータ記憶媒体 |
EP21916645.1A EP4123527A4 (en) | 2021-06-07 | 2021-11-17 | ONLINE CAR CALL INFORMATION PROCESSING METHOD AND APPARATUS AND COMPUTER STORAGE DEVICE AND MEDIUM |
US17/758,687 US20240169462A1 (en) | 2021-06-07 | 2021-11-17 | Online ride-hailing information processing method, device and computer storage medium |
KR1020237007589A KR20230047444A (ko) | 2021-06-07 | 2021-11-17 | 온라인 카헤일링 정보 처리 방법, 장치, 기기 및 컴퓨터 기록 매체 |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202110633451.9A CN113408877A (zh) | 2021-06-07 | 2021-06-07 | 网约车信息处理方法、装置、设备和计算机存储介质 |
CN202110633451.9 | 2021-06-07 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2022257357A1 true WO2022257357A1 (zh) | 2022-12-15 |
Family
ID=77676784
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/CN2021/131178 WO2022257357A1 (zh) | 2021-06-07 | 2021-11-17 | 网约车信息处理方法、装置、设备和计算机存储介质 |
Country Status (6)
Country | Link |
---|---|
US (1) | US20240169462A1 (zh) |
EP (1) | EP4123527A4 (zh) |
JP (1) | JP7460062B2 (zh) |
KR (1) | KR20230047444A (zh) |
CN (1) | CN113408877A (zh) |
WO (1) | WO2022257357A1 (zh) |
Families Citing this family (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN113408877A (zh) * | 2021-06-07 | 2021-09-17 | 北京百度网讯科技有限公司 | 网约车信息处理方法、装置、设备和计算机存储介质 |
CN116383368B (zh) * | 2023-04-25 | 2023-10-03 | 武汉维序科技有限公司 | 一种基于大数据的智能信息推送方法及*** |
Citations (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20170039667A1 (en) * | 2015-08-03 | 2017-02-09 | Nhn Entertainment Corporation | System for providing a transportation call service in response to passenger's vehicle selection and method using the same |
CN107844853A (zh) * | 2017-10-23 | 2018-03-27 | 重庆大学 | 一种利用动态价格预测减少网约车费用的乘车推荐*** |
CN109146280A (zh) * | 2018-08-14 | 2019-01-04 | 北京三快在线科技有限公司 | 一种推送信息的方法、装置及*** |
CN110737849A (zh) * | 2019-10-10 | 2020-01-31 | 北京百度网讯科技有限公司 | 出行方案的推荐方法、装置、设备及存储介质 |
CN111178558A (zh) * | 2018-11-09 | 2020-05-19 | 北京嘀嘀无限科技发展有限公司 | 网约车订单处理方法及装置、计算机设备和可读存储介质 |
CN111369025A (zh) * | 2020-03-03 | 2020-07-03 | 北京嘀嘀无限科技发展有限公司 | 一种信息显示方法、装置、存储介质以及电子设备 |
CN113408877A (zh) * | 2021-06-07 | 2021-09-17 | 北京百度网讯科技有限公司 | 网约车信息处理方法、装置、设备和计算机存储介质 |
Family Cites Families (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP5777373B2 (ja) | 2011-03-31 | 2015-09-09 | 株式会社日本総合研究所 | カーステーション負荷分散システム |
JP6478082B2 (ja) | 2013-11-13 | 2019-03-06 | 三菱重工機械システム株式会社 | 経路案内装置、経路案内方法、およびプログラム |
US20210199450A1 (en) * | 2019-12-31 | 2021-07-01 | Beijing Didi Infinity Technology And Development Co., Ltd. | System and method for determining service level metrics in bidding-based ridesharing |
CN111667083B (zh) * | 2020-06-11 | 2023-07-14 | 北京白龙马云行科技有限公司 | 网约车预估价确定方法和装置 |
-
2021
- 2021-06-07 CN CN202110633451.9A patent/CN113408877A/zh active Pending
- 2021-11-17 WO PCT/CN2021/131178 patent/WO2022257357A1/zh active Application Filing
- 2021-11-17 US US17/758,687 patent/US20240169462A1/en active Pending
- 2021-11-17 EP EP21916645.1A patent/EP4123527A4/en not_active Withdrawn
- 2021-11-17 JP JP2023514809A patent/JP7460062B2/ja active Active
- 2021-11-17 KR KR1020237007589A patent/KR20230047444A/ko unknown
Patent Citations (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20170039667A1 (en) * | 2015-08-03 | 2017-02-09 | Nhn Entertainment Corporation | System for providing a transportation call service in response to passenger's vehicle selection and method using the same |
CN107844853A (zh) * | 2017-10-23 | 2018-03-27 | 重庆大学 | 一种利用动态价格预测减少网约车费用的乘车推荐*** |
CN109146280A (zh) * | 2018-08-14 | 2019-01-04 | 北京三快在线科技有限公司 | 一种推送信息的方法、装置及*** |
CN111178558A (zh) * | 2018-11-09 | 2020-05-19 | 北京嘀嘀无限科技发展有限公司 | 网约车订单处理方法及装置、计算机设备和可读存储介质 |
CN110737849A (zh) * | 2019-10-10 | 2020-01-31 | 北京百度网讯科技有限公司 | 出行方案的推荐方法、装置、设备及存储介质 |
CN111369025A (zh) * | 2020-03-03 | 2020-07-03 | 北京嘀嘀无限科技发展有限公司 | 一种信息显示方法、装置、存储介质以及电子设备 |
CN113408877A (zh) * | 2021-06-07 | 2021-09-17 | 北京百度网讯科技有限公司 | 网约车信息处理方法、装置、设备和计算机存储介质 |
Non-Patent Citations (1)
Title |
---|
See also references of EP4123527A4 |
Also Published As
Publication number | Publication date |
---|---|
KR20230047444A (ko) | 2023-04-07 |
EP4123527A1 (en) | 2023-01-25 |
CN113408877A (zh) | 2021-09-17 |
JP7460062B2 (ja) | 2024-04-02 |
JP2023540731A (ja) | 2023-09-26 |
US20240169462A1 (en) | 2024-05-23 |
EP4123527A4 (en) | 2023-08-30 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US10859387B2 (en) | System and method for determining routes of transportation service | |
JP6878629B2 (ja) | 過去の注文に基づき現在の注文に関係がある情報を決定するためのシステムおよび方法 | |
WO2022257357A1 (zh) | 网约车信息处理方法、装置、设备和计算机存储介质 | |
JP2019215896A (ja) | 運輸サービスの料金を求める方法及びシステム | |
WO2016127918A1 (zh) | 一种运力调度方法及*** | |
WO2016119749A1 (zh) | 一种订单分配***及方法 | |
US20200005420A1 (en) | Systems and methods for transportation capacity dispatch | |
CN107563572A (zh) | 一种订单分配方法、装置、计算机设备和存储介质 | |
CN112819576A (zh) | 充电站推荐模型的训练方法、装置、及充电站的推荐方法 | |
CN104599002B (zh) | 预测订单价值的方法及设备 | |
AU2018217973A1 (en) | Dynamic selection of geo-based service options in a network system | |
CN111476389A (zh) | 一种预估接单等待时长的方法及装置 | |
CN111861178A (zh) | 服务匹配模型的训练方法、服务匹配方法、设备及介质 | |
CN111859172A (zh) | 信息推送方法、装置、电子设备和计算机可读存储介质 | |
WO2023236522A1 (zh) | 夜间步行导航方法、装置、设备、存储介质及程序产品 | |
CN115330556B (zh) | 充电站的信息调整模型的训练方法、装置及产品 | |
CN113761398B (zh) | 信息推荐方法、装置、电子设备以及存储介质 | |
CN111369025A (zh) | 一种信息显示方法、装置、存储介质以及电子设备 | |
CN115936379A (zh) | 一种共享车辆的调度方法、装置、设备及存储介质 | |
CN111798283A (zh) | 订单派发方法、装置、电子设备及计算机可读存储介质 | |
CN115062240A (zh) | 一种停车场排序方法、装置、电子设备和存储介质 | |
CN114692968A (zh) | 取号处理方法、装置以及电子设备 | |
CN113407839B (zh) | 出行方式的确定方法、装置、设备和存储介质 | |
CN115688949B (zh) | 一种自动驾驶车辆预约乘坐方法及*** | |
CN110874870A (zh) | 一种计算打车费用的方法和装置 |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
WWE | Wipo information: entry into national phase |
Ref document number: 17758687 Country of ref document: US |
|
ENP | Entry into the national phase |
Ref document number: 2021916645 Country of ref document: EP Effective date: 20220808 |
|
ENP | Entry into the national phase |
Ref document number: 2023514809 Country of ref document: JP Kind code of ref document: A |
|
ENP | Entry into the national phase |
Ref document number: 20237007589 Country of ref document: KR Kind code of ref document: A |
|
NENP | Non-entry into the national phase |
Ref country code: DE |