CN111507753A

CN111507753A - Information pushing method and device and electronic equipment

Info

Publication number: CN111507753A
Application number: CN202010225630.4A
Authority: CN
Inventors: 付志耀; 顾昊; 邓文哲; 戚亦平; 周国乔; 余维; 周伟
Original assignee: Hanhai Information Technology Shanghai Co Ltd
Current assignee: Hanhai Information Technology Shanghai Co Ltd
Priority date: 2020-03-26
Filing date: 2020-03-26
Publication date: 2020-08-07

Abstract

The embodiment of the application discloses an information pushing method and device and electronic equipment. An embodiment of the method comprises: detecting the idle driving time of a target driver; determining whether the target driver meets an order recall condition based on the length of the empty driving time; if yes, setting a target geographic area based on the position of the target driver, and recalling the order of which the passenger position is located in the target geographic area; selecting a target order from the recalled orders; and pushing information of the target driver to the passenger terminal submitting the target order. This embodiment has reduced the transport capacity wasting of resources, and simultaneously, can effectively shorten passenger's waiting for a bus for a long time, improves the convenience that the passenger used the car.

Description

Information pushing method and device and electronic equipment

Technical Field

The embodiment of the application relates to the technical field of computers, in particular to an information pushing method and device and electronic equipment.

Background

With the convenience of transportation, the online car booking travel has become a common travel mode for people. The user may submit the order through an online appointment Application (APP). Generally, the passenger can select information of a capacity provider, a vehicle type, and the like in the bill of lading process. After the passenger bills of lading, the platform can search for the free vehicles meeting the wishes of the passengers from the area where the passengers are located.

In the prior art, after a passenger takes a bill, if no free driver takes the bill within a normal recall distance, the platform will generally expand the recall distance to search for a free vehicle meeting the passenger's will in a farther area. The passenger will often have a bias in their will, resulting in certain capacity providers being less selected by the user, leaving their drivers in a state of long idle driving. Therefore, the mode not only causes the waste of transport capacity resources, but also causes the long waiting time of passengers and the poor convenience of the passengers for using the vehicles.

Disclosure of Invention

The embodiment of the application provides an information pushing method, an information pushing device and electronic equipment, so that the waste of transport capacity resources is reduced, meanwhile, the waiting time of passengers is effectively shortened, and the convenience of the passengers in using cars is improved.

In a first aspect, an embodiment of the present application provides an information pushing method, where the method includes: detecting the idle driving time of a target driver; determining whether the target driver meets an order recall condition based on the length of the empty driving time; if yes, setting a target geographic area based on the position of the target driver, and recalling the order of which the passenger position is located in the target geographic area; selecting a target order from the recalled orders; and pushing information of the target driver to the passenger terminal submitting the target order.

In a second aspect, an embodiment of the present application provides an information pushing apparatus, where the apparatus includes: a detection unit configured to detect a length of empty driving of a target driver; a determination unit configured to determine whether the target driver satisfies an order recall condition based on the length of empty travel; a setting unit configured to set a target geographical area based on a position of a target driver and recall an order in which a passenger position is located in the target geographical area, if satisfied; a selecting unit configured to select a target order from the orders of which the passenger position is located in the target geographic area; a pushing unit configured to push information of the target driver to the passenger terminal submitting the target order.

In a third aspect, an embodiment of the present application provides an electronic device, including: one or more processors; a storage device having one or more programs stored thereon, which when executed by one or more processors, cause the one or more processors to implement the method as described in the first aspect.

In a fourth aspect, embodiments of the present application provide a computer-readable medium on which a computer program is stored, which when executed by a processor, implements the method as described in the first aspect.

According to the information pushing method, the information pushing device and the electronic equipment, the idle running time of the target driver is detected, whether the target driver meets the order recall condition is determined based on the idle running time, if yes, the target geographic area is set based on the position of the target driver, and the order with the passenger position located in the target geographic area is recalled. Then, a target order is selected from the recalled orders, so that information of a target driver is pushed to a passenger terminal submitting the target order. The implementation mode can actively recall the order for the driver in the idle driving state and meeting the conditions, and reduces the waste of transport capacity resources. Meanwhile, more driver information can be provided for the passengers for selection, the waiting time of the passengers is effectively shortened, and the convenience of using the passengers is improved.

Drawings

Other features, objects and advantages of the present application will become more apparent upon reading of the following detailed description of non-limiting embodiments thereof, made with reference to the accompanying drawings in which:

FIG. 1 is an exemplary system architecture diagram in which one embodiment of the present application may be applied;

FIG. 2 is a flow diagram of one embodiment of an information push method according to the present application;

FIG. 3 is a schematic diagram of detecting a duration of empty travel according to the present application;

FIG. 4 is a schematic illustration of a target geographic area according to the present application;

FIG. 5 is a flow diagram of yet another embodiment of an information push method according to the present application;

FIG. 6 is a schematic block diagram of one embodiment of an information pushing device according to the present application;

FIG. 7 is a block diagram of a computer system suitable for use in implementing the electronic device of an embodiment of the present application.

Detailed Description

The present application will be described in further detail with reference to the following drawings and examples. It is to be understood that the specific embodiments described herein are merely illustrative of the relevant invention and not restrictive of the invention. It should be noted that, for convenience of description, only the portions related to the related invention are shown in the drawings.

It should be noted that the embodiments and features of the embodiments in the present application may be combined with each other without conflict. The present application will be described in detail below with reference to the embodiments with reference to the attached drawings.

Fig. 1 shows an exemplary system architecture 100 to which the information push method or the information push apparatus of the present application can be applied.

As shown in fig. 1, the system architecture 100 may include

passenger terminals

101, 102, 103,

networks

104, 106, a server 105, and

driver terminals

107, 108, 109. The network 104 serves as a medium for providing communication links between the

passenger terminals

101, 102, 103 and the server 105. The network 106 serves as a medium for providing communication links between the

driver terminals

107, 108, 109 and the server 105. The

networks

104, 106 may include various connection types, such as wired, wireless communication links, or fiber optic cables, among others.

The passenger may use the

passenger terminals

101, 102, 103 to interact with the server 105 over the network 104 to receive or send messages or the like. The driver can use the

driver terminals

107, 108, 109 to interact with the server 105 over the network 106 to receive or send messages or the like. Various communication client applications, such as a contract car-like client application, a voice interaction-like application, a shopping-like application, a search-like application, an instant messaging tool, a mailbox client, social platform software, etc., may be installed on the

passenger terminals

101, 102, 103 and the

driver terminals

107, 108, 109.

The

passenger terminals

101, 102, 103 and the

driver terminals

107, 108, 109 may be hardware or software. When the

passenger terminals

101, 102, 103 and the

driver terminals

107, 108, 109 are hardware, they may be various electronic devices having display screens and supporting network communication, including but not limited to smart phones, tablets, laptop portable computers, wearable devices, and the like. When the

passenger terminals

101, 102, 103 and the

driver terminals

107, 108, 109 are software, they can be installed in the above-listed electronic devices. It may be implemented as multiple pieces of software or software modules (e.g., to provide distributed services) or as a single piece of software or software module. And is not particularly limited herein.

The server 105 may be a server that provides various services, such as a backend server that provides support for a web appointment class of client applications. The background server may receive the orders submitted by the

passenger terminals

101, 102, 103, and may also receive information such as location locations sent by the

driver terminals

107, 108, 109. Meanwhile, the driver who meets the condition in the idle time length can recall the order based on the place of the driver and the order of the passenger, and the information of the driver can be pushed to the passenger terminal and the like.

The server may be hardware or software. When the server is hardware, it may be implemented as a distributed server cluster formed by multiple servers, or may be implemented as a single server. When the server is software, it may be implemented as multiple pieces of software or software modules (e.g., to provide distributed services), or as a single piece of software or software module. And is not particularly limited herein.

It should be noted that the information pushing method provided in the embodiment of the present application is generally executed by the server 105, and accordingly, the information pushing apparatus is generally disposed in the server 105.

It should be understood that the number of terminal devices, networks, and servers in fig. 1 is merely illustrative. There may be any number of passenger terminals, driver terminals, networks, and servers, as desired for implementation.

With continued reference to FIG. 2, a flow 200 of one embodiment of an information push method according to the present application is shown. The information pushing method comprises the following steps:

in step 201, the idle driving time of the target driver is detected.

In this embodiment, the executing entity of the information pushing method (such as the server 105 shown in fig. 1) may maintain a networked appointment platform. And any driver of any transport force provider in the execution main body parking network booking platform is used as a target driver, and the idle running time of the target driver is detected. Here, the duration of the flight may be a cumulative duration from the end of the last order (i.e., the last order) to the time when the passenger is not riding.

In some optional implementations of the present embodiment, each driver may automatically send positioning information to the executing agent either actively or periodically. The positioning information herein may refer to coordinates. If the execution main body receives the positioning information sent by a certain driver terminal, the driver related to the driver terminal can be used as a target driver, and the idle running time of the target driver is detected. Therefore, the driver can trigger the flow of order recalling and information pushing, so that the driver can more conveniently select whether the order needs to be recalled. Meanwhile, the platform can obtain more transport capacity data, and data storage is improved.

In some optional implementations of the embodiment, the execution main body may detect the empty running time period of the target driver by:

in the first step, whether the target driver is in a service state is detected. The service state may refer to a state in which a passenger is carried. If the mobile terminal is in the service state, the subsequent processes may not be executed.

In the second step, if the driver is not in service, the end time of the last order (i.e. the last order) of the target driver is queried.

And thirdly, inquiring the online time period of the target driver from the end time to the current time.

And fourthly, determining the sum of the time lengths of all the online time periods as the idle driving time length of the target driver.

As an example, fig. 3 shows a schematic diagram of detecting the empty running time period. As shown in fig. 3, the time period from the order ending time point of the previous order to the coordinate reporting time point includes 4 time periods. Respectively, an online period t1, a offline period t2, an online period t3, and an online period t 4. Thus, the idling time period of the target driver is t1+ t3+ t 4.

It should be noted that, after the driver terminal reports the positioning information (such as coordinates), the execution main body can execute the operation of detecting the idle driving time of the target driver, and the detection time is usually very short. Therefore, the current time and the coordinate reporting time can be regarded as the same time.

By analyzing the online time periods from the end time of the last order to the current time of the target driver and taking the sum of the time periods of all the online time periods as the idle running time, the time from the time when the driver goes offline can be eliminated, so that the reasonability of the calculation of the idle running time is ensured, and the fairness of recalling the order for the driver is improved.

Based on the duration of the empty drive, it is determined whether the target driver meets the order recall condition, step 202.

In the present embodiment, the execution main body described above may determine whether the target driver satisfies the order recall condition based on the duration of the empty run. As an example, a threshold value of the duration of empty may be set in advance, and if the duration of empty is greater than the threshold value, the order recall condition may be considered to be satisfied. Otherwise, the order recall condition may be considered not satisfied.

In some alternative implementations of the present embodiment, the order recall condition may be associated with driver information in addition to the duration of the empty ride. At this time, the executing body may further determine whether the target driver satisfies the order recall condition by:

in the first step, driver information of a target driver is acquired. Wherein the driver information includes, but is not limited to, at least one of: the driving force quotient of the target driver and the type of the vehicle used by the target driver. The vehicle types can be divided in advance according to the requirements, such as express, comfortable, luxury and the like.

And secondly, acquiring an idle driving time threshold value based on the time period of the current time and the driver information. Here, different driver information (such as power provider and vehicle type) and time periods may correspond to different empty driving time thresholds.

As an example, the empty time threshold for different vehicle types of a certain transport quotient "XX appointment" at different time periods can be seen in the following table:

for example, if the driver's power quotient is "XX car reservation" and the type of car is express. If the current time is 19:00, the empty driving time threshold is 30 minutes according to the record of the table.

The empty running time threshold in different cases may be set as needed, and is not limited to the above list.

And thirdly, if the idle running time is greater than or equal to the acquired idle running time threshold, determining that the target driver meets the order recall condition. And if the idle running time is less than the acquired idle running time threshold, determining that the target driver does not meet the order recall condition.

Therefore, whether the target driver meets the order recalling condition or not can be determined according to driver information such as the transport capacity quotient and the vehicle type, and multidimensional information such as the current time and the dead time of the target driver. The reasonability of the recalled order is improved.

And step 203, if the position of the passenger is met, setting a target geographic area based on the position of the target driver, and recalling the order with the passenger position in the target geographic area.

In this embodiment, if the target driver meets the order recall condition, the executive body may set the target geographic area based on the position of the target driver, and recall the order with the passenger position in the target geographic area. Here, the target geographic area may be an area where the target driver is currently located. For example, a rectangular geographic area centered on the target driver, a circular geographic area, or a pre-divided irregular geographic area, etc. The order with the passenger position located in the target geographic area is the order with the passenger waiting position located in the target geographic area.

In practice, after each order is placed, a spatial index may be created for the order. The spatial index may be used to characterize the correspondence of the number of the area to which the geographic location of the passenger belongs to the order. For example, the area may be divided into a plurality of areas in advance, and different areas correspond to different numbers. If passenger a and passenger B place an order in the area numbered 1 and passenger C and passenger D place an order in the area numbered 2, the index of the order of passenger a and passenger B is number 1 and the index of the order of passenger C and passenger D is number 2. If the order in a certain area needs to be searched, the order can be viewed through the serial number of the area. After the spatial index is created for the placed order, an inverted index of the order with respect to the spatial index may also be created. Therefore, if the area to which a certain order belongs needs to be determined, the area to which the order belongs can be known through the order and the inverted index. Thus, the executing agent may determine the order belonging to the target geographic area by reverse indexing.

In some optional implementations of this embodiment, the executing entity may set the target geographic area according to the following steps:

first, current supply and demand information is acquired. The supply and demand information may include, but is not limited to, the amount of orders currently not taken and the number of drivers not currently in service.

And secondly, determining a supply and demand coefficient based on the supply and demand information.

In practice, the more orders are currently available for order taking, the greater the demand. The greater the number of drivers not currently in service, the greater the supply. Thus, the supply and demand coefficient can be determined based on the supply and demand information. As an example, the ratio of the number of drivers who are not in service to the number of orders that are not ordered may be used as the supply and demand coefficient.

And thirdly, determining a target radius based on the preset radius and the supply and demand coefficient. As an example, the target radius may be a product of a preset radius and a supply and demand coefficient. Here, the preset radius may be a fixed value, such as 2 km.

And fourthly, setting a target geographic area based on the center and the target radius by taking the position of the target driver as the center. The target geographic area is used herein to delineate the scope of the recalled order.

By way of example, fig. 4 is a schematic illustration of a target geographic area. The "recall radius" in FIG. 4 is the target radius. O1 through O10 in fig. 4 may be considered orders in the target geographic area. The execution agent may recall each order from O1 to O10.

Step 204, selecting a target order from the recalled orders.

In this embodiment, the executing entity may select a target order from the recalled orders. Here, the target order may be selected according to any preset selection rule. As one example, the target orders may be selected from the recalled orders in order of passenger location from near to far from the target driver. As yet another example, a pre-estimate of each recalled order taken by the target driver may be pre-evaluated, and the target orders may be selected in order of low to high pre-estimate.

In some optional implementations of this embodiment, the executing entity may select a target order from the recalled orders according to the following steps:

in the first step, the order placing estimated transaction amount of each recalled order is inquired. In practice, when the user places an order, the platform calculates the estimated transaction amount interval. The estimated trading volume interval calculated by the platform can be directly obtained and used as the ordering estimated trading volume.

And secondly, determining a candidate transaction amount interval of each order based on the order placing estimated transaction amount of each order. As an example, a fixed float amount may be preset. And taking the sum of the offline of the estimated transaction amount interval and the fixed floating amount as the offline of the candidate transaction amount, and taking the sum of the online of the estimated transaction amount interval and the fixed floating amount as the online of the candidate transaction amount. Thus, a section formed by the line from the end of the candidate transaction amount to the end of the candidate transaction amount is used as the candidate transaction amount section.

And thirdly, for each recalled order, estimating the order taking transaction amount under the condition that the target driver takes the order for the order, and if the order taking transaction amount is in the candidate transaction amount interval, taking the order as a candidate order.

Specifically, for each recalled order, the platform may estimate the order pickup transaction amount under the condition that the target driver picks up the order according to factors such as the type of the vehicle, the distance, the current time, the road condition, and the like. If the order taking transaction amount of the order is within the candidate transaction amount interval, the order can be used as a candidate order. If the order-taking transaction amount of the order is not within the candidate transaction amount interval, the order can be deleted. Thus, candidate orders may be filtered from recalled orders.

And fourthly, determining the score of each candidate order.

Here, the scoring of each candidate order may be performed in various ways. As an example, the pickup time, the pickup distance, and the revenue of the target driver for the pickup of each candidate order may be obtained first. Then, the score of each selected order can be determined based on the driving receiving time, the driving receiving distance and the income corresponding to each candidate order.

In practice, a scoring model may be trained in advance using machine learning algorithms. The input of the model is the order receiving time, the order receiving distance and the income of a driver when a certain order is received by a certain driver, and the output is the score of the order. And obtaining the score of each candidate order by using the trained scoring model. Here, during the training process, a supervised training mode may be adopted for training. The scoring model here may be a function or formula constructed in advance, such as:

score f (time, distance, driver's income)

Where f represents the function and score represents the score.

And fifthly, selecting the candidate orders as target orders in sequence according to the sequence of scores from high to low. Specifically, the candidate order with the highest score may be selected as the target order first, and step 205 may be performed. In some cases, such as where the passenger submitting the target order declines the vehicle to the target driver, the target order may be deleted and the next highest scoring candidate order may be taken as the target order, and execution continues as in step 205.

Step 205, pushing information of the target driver to the passenger terminal submitting the target order.

In this embodiment, after selecting the target order, the executive agent may push information of the target driver to the passenger terminal submitting the target order. In practice, the pushed information of the target driver may include, but is not limited to, at least one of: the driving force provider of the target driver, the name of the target driver, the type of vehicle used by the target driver, the license plate number of the vehicle driven by the target driver, the brand of the vehicle driven by the target driver, the model number of the vehicle driven by the target driver, the color of the vehicle driven by the target driver, and the like.

In this embodiment, the execution body may push information of the target driver in various forms, so that the passenger terminal may present the information of the target driver in various forms. As an example, the information of the target driver may be presented in a pop-up window, or in a picture, or in a message box in the form of a card. This embodiment is not limited to this.

In some optional implementations of the embodiment, a countdown (e.g., 1 minute) may also be initiated after the executive agent pushes the information of the targeted driver to the passenger terminal submitting the targeted order. If an acceptance message returned by the passenger terminal is received before the countdown is over, the target order may be dispatched to a driver terminal used by the target driver. Further, the target driver may choose whether to take the order, or may default to take the order. Therefore, the driver with long idle running time can be actively recalled with the order, and the waste of transport capacity resources is reduced. Meanwhile, more driver information can be provided for the passengers for selection, the waiting time of the passengers is effectively shortened, and the convenience of using the passengers is improved.

In addition, if the countdown is over, or if a rejection message returned from the passenger terminal is received before the countdown is over, the execution body may select a next target order from the recalled orders and push information of a target driver to the passenger terminal submitting the next target order. And continues to perform operations such as countdown.

It should be noted that, the execution main body may also send countdown information to the passenger terminal at the same time, so as to remind the passenger to decide whether to accept or reject within the countdown time. Thereby avoiding occupying the capacity of the target driver for a long time.

In some optional implementations of this embodiment, for the target driver, if the information of the target driver is already pushed to each passenger in sequence, but each passenger does not accept the information, or the number of times of pushing to the passenger reaches a preset threshold, the information of the target driver may not be pushed to other passengers.

In some optional implementations of this embodiment, for a passenger, if information of multiple drivers is already pushed to the passenger, but the passenger does not accept the information, or the number of times that the passenger rejects reaches a preset threshold, the information of the drivers may not be pushed to the passenger, so as to avoid inconvenience to the passenger due to information pushing.

In the method provided by the embodiment of the application, the idle running time of the target driver is detected, whether the target driver meets the order recall condition is determined based on the idle running time, if yes, the target geographic area is set based on the position of the target driver, and the order with the passenger position located in the target geographic area is recalled. Then, a target order is selected from the recalled orders, so that information of a target driver is pushed to a passenger terminal submitting the target order. The implementation mode can actively recall the order for the driver in the idle driving state and meeting the conditions, and reduces the waste of transport capacity resources. Meanwhile, more driver information can be provided for the passengers for selection, the waiting time of the passengers is effectively shortened, and the convenience of using the passengers is improved.

With further reference to fig. 5, a flow 500 of yet another embodiment of an information push method is shown. The process 500 of the information pushing method includes the following steps:

step 501, detecting the idle driving time of a target driver.

Step 502, determining whether the target driver meets the order recall condition based on the duration of the empty run.

And 503, if so, setting a target geographic area based on the position of the target driver, and recalling the order with the passenger position in the target geographic area.

Steps 501 to 503 of this embodiment can refer to steps 201 to 203 of the corresponding embodiment of fig. 2, and are not described herein again.

Step 504, the order placement estimate of each recalled order is queried for the transaction amount.

In this embodiment, the executing entity of the information pushing method may query the order placing estimated transaction amount of each recalled order. In practice, when the user places an order, the platform calculates the estimated transaction amount interval. The estimated trading volume interval calculated by the platform can be directly obtained and used as the ordering estimated trading volume.

And 505, determining candidate transaction amount intervals of each order respectively based on the order placing estimated transaction amount of each order.

In this embodiment, the executing entity may determine the candidate transaction amount interval of each order based on the predicted transaction amount for placing the order of each order.

As an example, a fixed float amount may be preset. And taking the sum of the offline of the estimated transaction amount interval and the fixed floating amount as the offline of the candidate transaction amount, and taking the sum of the online of the estimated transaction amount interval and the fixed floating amount as the online of the candidate transaction amount. Thus, a section formed by the line from the end of the candidate transaction amount to the end of the candidate transaction amount is used as the candidate transaction amount section.

Step 506, for each recalled order, estimating the order taking transaction amount under the condition that the target driver takes the order for the order, and if the order taking transaction amount is in the candidate transaction amount interval, taking the order as a candidate order.

In this embodiment, for each recalled order, the platform may estimate the order-taking transaction amount of the target driver in the case of taking the order according to the vehicle type, distance, current time, road conditions, and other factors. If the order taking transaction amount of the order is within the candidate transaction amount interval, the executing agent may take the order as a candidate order. If the order-taking transaction amount of the order is not within the candidate transaction amount interval, the executing agent may delete the order. Thus, candidate orders may be filtered from recalled orders.

At step 507, a score is determined for each candidate order.

In this embodiment, the execution principal may score each candidate order in various ways. As an example, the pickup time, the pickup distance, and the revenue of the target driver for the pickup of each candidate order may be obtained first. Then, the score of each selected order can be determined based on the driving receiving time, the driving receiving distance and the income corresponding to each candidate order.

score f (time, distance, driver's income)

Where f represents the function and score represents the score.

And step 508, sequentially selecting the candidate orders as target orders according to the sequence of the scores from high to low.

In this embodiment, the executing agent may first select the candidate order with the highest score as the target order, and then execute step 509. In some cases, such as the passenger submitting the target order refuses to take the target driver's vehicle, the target order may be deleted and the next highest scoring candidate order may be taken as the target order, and the following step 509 is continued.

In step 509, a countdown is started.

In this embodiment, the pointing device may start a countdown (e.g., 1 minute). In addition, when the countdown is started, the execution main body can also simultaneously send countdown information to the passenger terminal so as to remind the passenger to decide whether to accept or reject within the countdown time. Thereby avoiding occupying the capacity of the target driver for a long time.

If an acceptance message returned by the passenger terminal is received before the countdown is over, the target order is dispatched to the driver's terminal used by the target driver, step 510.

In this embodiment, if an acceptance message returned from the passenger terminal is received before the countdown is finished, the target order can be dispatched to the driver terminal used by the target driver. Further, the target driver may choose whether to take the order, or may default to take the order. Therefore, the driver with long idle running time can be actively recalled with the order, and the waste of transport capacity resources is reduced. Meanwhile, more driver information can be provided for the passengers for selection, the waiting time of the passengers is effectively shortened, and the convenience of using the passengers is improved.

And 511, if the countdown is finished or a rejection message returned by the passenger terminal is received before the countdown is finished, selecting a next target order and pushing information of a target driver to the passenger terminal submitting the next target order.

In this embodiment, if the countdown is over, or if a rejection message returned from the passenger terminal is received before the countdown is over, the executive agent may select a next target order from the recalled orders and push information of a target driver to the passenger terminal submitting the next target order. And continues to perform operations such as countdown.

If the information of the target driver is pushed to each passenger in sequence, but each passenger does not accept the information, or the number of times of pushing to the passenger reaches a certain preset threshold value, the information of the target driver can not be pushed to other passengers.

As can be seen from fig. 5, compared with the embodiment corresponding to fig. 2, the flow 500 of the information pushing method in the present embodiment highlights a step of selecting a target order from the recalled orders. Therefore, the scheme described in the embodiment can more reasonably select the target passenger who pushes the information of the target passenger, so as to avoid inconvenience for the passenger.

With further reference to fig. 6, as an implementation of the method shown in the above-mentioned figures, the present application provides an embodiment of an information pushing apparatus, which corresponds to the embodiment of the method shown in fig. 2, and which can be applied in various electronic devices.

As shown in fig. 6, the information pushing apparatus 600 according to the present embodiment includes: a detection unit 601 configured to detect a length of empty driving time of a target driver; a determination unit 602 configured to determine whether the target driver satisfies an order recall condition based on the duration of empty driving; a setting unit 603 configured to, if yes, set a target geographical area based on the position of the target driver, and recall an order with a passenger position in the target geographical area; a selecting unit 604 configured to select a target order from the orders of which the passenger positions are located in the target geographic area; a pushing unit 605 configured to push the information of the target driver to the passenger terminal submitting the target order.

In some optional implementations of this embodiment, the detecting unit 601 is further configured to: if the positioning information sent by the driver terminal is received, taking the driver associated with the driver terminal as a target driver, and detecting whether the target driver is in a service state; if the target driver is not in the service state, inquiring the end time of the last order of the target driver; inquiring the online time period of the target driver from the end time to the current time; and determining the sum of the time lengths of all online time periods as the idle driving time length of the target driver.

In some optional implementations of this embodiment, the determining unit 602 is further configured to: acquiring driver information of the target driver, wherein the driver information comprises at least one of the following items: the driving force quotient of the target driver and the vehicle type of the target driver; acquiring an idle driving time threshold value based on the time period of the current time and the driver information; if the duration of the empty driving is greater than or equal to the threshold of the duration of the empty driving, determining that the target driver meets an order recall condition; and if the idle running time is less than the idle running time threshold, determining that the target driver does not meet the order recall condition.

In some optional implementations of the present embodiment, the setting unit 603 is further configured to: acquiring current supply and demand information, wherein the supply and demand information comprises the order quantity of the current unaccessed orders and the number of drivers not in a service state; determining a supply and demand coefficient based on the supply and demand information; determining a target radius based on a preset radius and the supply and demand coefficient; and setting a target geographical area based on the center and the target radius by taking the position of the target driver as the center.

In some optional implementations of the present embodiment, the selecting unit 604 is further configured to: inquiring the order placing estimated transaction amount of each recalled order; determining candidate transaction amount intervals of each order based on the order placing estimated transaction amount of each order; for each recalled order, estimating the order-taking transaction amount under the condition that the target driver takes an order for the order, and if the order-taking transaction amount is in the candidate transaction amount interval, taking the order as a candidate order; determining a score of each candidate order; and selecting the candidate orders as target orders in sequence according to the order of the scores from high to low.

In some optional implementations of the present embodiment, the selecting unit 604 is further configured to: acquiring the driving receiving time, the driving receiving distance and the income of the target driver under the condition that the target driver receives the order of each candidate order; and determining the score of each selected order based on the corresponding driving receiving time, driving receiving distance and income of each candidate order.

In some optional implementations of this embodiment, the apparatus further includes: a timing unit configured to start a countdown; a dispatch unit configured to dispatch the target order to a driver terminal used by the target driver if an acceptance message returned by the passenger terminal is received before the countdown is finished; and the reselection unit is configured to select a next target order and push information of the target driver to the passenger terminal submitting the next target order if the countdown is finished or a rejection message returned by the passenger terminal is received before the countdown is finished.

In some optional implementations of this embodiment, the information pushed to the passenger for the target driver includes at least one of: the driving force quotient of the target driver, the name of the target driver, the type of the vehicle of the target driver, the license plate number of the vehicle driven by the target driver, the brand of the vehicle driven by the target driver, the model of the vehicle driven by the target driver, and the color of the vehicle driven by the target driver.

According to the device provided by the embodiment of the application, the idle running time of the target driver is detected, whether the target driver meets the order recall condition is determined based on the idle running time, if yes, the target geographic area is set based on the position of the target driver, and the order with the passenger position located in the target geographic area is recalled. Then, a target order is selected from the recalled orders, so that information of a target driver is pushed to a passenger terminal submitting the target order. The implementation mode can actively recall the order for the driver in the idle driving state and meeting the conditions, and reduces the waste of transport capacity resources. Meanwhile, more driver information can be provided for the passengers for selection, the waiting time of the passengers is effectively shortened, and the convenience of using the passengers is improved.

Referring now to FIG. 7, shown is a block diagram of a computer system 700 suitable for use in implementing the electronic device of an embodiment of the present application. The electronic device shown in fig. 7 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present application.

As shown in fig. 7, the computer system 700 includes a Central Processing Unit (CPU)701, which can perform various appropriate actions and processes in accordance with a program stored in a Read Only Memory (ROM)702 or a program loaded from a storage section 708 into a Random Access Memory (RAM) 703. In the RAM 703, various programs and data necessary for the operation of the system 700 are also stored. The CPU701, the ROM 702, and the RAM 703 are connected to each other via a bus 704. An input/output (I/O) interface 705 is also connected to bus 704.

To the I/O interface 705, AN input section 706 including a keyboard, a mouse, and the like, AN output section 707 including a display such as a liquid crystal display (L CD), a speaker, and the like, a storage section 708 including a hard disk, and the like, and a communication section 709 including a network interface card such as L AN card, a modem, and the like, the communication section 709 performs communication processing via a network such as the internet, the drive 710 is also connected to the I/O interface 705 as necessary, a removable medium 711 such as a magnetic disk, AN optical disk, a magneto-optical disk, a semiconductor memory, and the like is mounted on the drive 710 as necessary, so that a computer program read out therefrom is mounted into the storage section 708 as necessary.

In particular, according to an embodiment of the present disclosure, the processes described above with reference to the flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method illustrated in the flow chart. In such an embodiment, the computer program can be downloaded and installed from a network through the communication section 709, and/or installed from the removable medium 711. The computer program, when executed by a Central Processing Unit (CPU)701, performs the above-described functions defined in the method of the present application. It should be noted that the computer readable medium described herein can be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples of the computer readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present application, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In this application, however, a computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, fiber optic cable, RF, etc., or any suitable combination of the foregoing.

The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present application. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.

The units described in the embodiments of the present application may be implemented by software or hardware. The units described may also be provided in a processor, where the names of the units do not in some cases constitute a limitation of the units themselves.

As another aspect, the present application also provides a computer-readable medium, which may be contained in the apparatus described in the above embodiments; or may be present separately and not assembled into the device. The computer readable medium carries one or more programs which, when executed by the apparatus, cause the apparatus to: detecting the idle driving time of a target driver; determining whether the target driver meets an order recall condition based on the length of the empty driving time; if yes, setting a target geographic area based on the position of the target driver, and recalling the order of which the passenger position is located in the target geographic area; selecting a target order from the recalled orders; and pushing information of the target driver to the passenger terminal submitting the target order.

The above description is only a preferred embodiment of the application and is illustrative of the principles of the technology employed. It will be appreciated by those skilled in the art that the scope of the invention herein disclosed is not limited to the particular combination of features described above, but also encompasses other arrangements formed by any combination of the above features or their equivalents without departing from the spirit of the invention. For example, the above features may be replaced with (but not limited to) features having similar functions disclosed in the present application.

Claims

1. An information pushing method, characterized in that the method comprises:

detecting the idle driving time of a target driver;

determining whether the target driver meets an order recall condition based on the length of empty travel;

if yes, setting a target geographic area based on the position of the target driver, and recalling an order with a passenger position in the target geographic area;

selecting a target order from the recalled orders;

and pushing the information of the target driver to the passenger terminal submitting the target order.

2. The method of claim 1, wherein the detecting the length of empty driving of the target driver comprises:

if the positioning information sent by the driver terminal is received, taking a driver associated with the driver terminal as a target driver, and detecting whether the target driver is in a service state;

if the target driver is not in the service state, inquiring the end time of the last order of the target driver;

inquiring the online time period of the target driver from the end time to the current time;

and determining the sum of the time lengths of all online time periods as the idle driving time length of the target driver.

3. The method of claim 1, wherein said determining whether the target driver meets an order recall condition based on the length of empty travel comprises:

obtaining driver information of the target driver, wherein the driver information comprises at least one of the following items: the driving force quotient of the target driver and the vehicle type of the target driver;

acquiring an idle driving time threshold value based on the time period of the current time and the driver information;

if the idle running time is greater than or equal to the idle running time threshold, determining that the target driver meets an order recall condition;

and if the idle running time is less than the idle running time threshold value, determining that the target driver does not meet the order recall condition.

4. The method of claim 1, wherein setting a target geographic area based on the position of the target driver comprises:

acquiring current supply and demand information, wherein the supply and demand information comprises the order quantity of the current unaccessed orders and the number of drivers not in a service state;

determining a supply and demand coefficient based on the supply and demand information;

determining a target radius based on a preset radius and the supply and demand coefficient;

and setting a target geographical area based on the center and the target radius by taking the position of the target driver as the center.

5. The method of claim 1, wherein said selecting a target order from said recalled orders comprises:

inquiring the order placing estimated transaction amount of each recalled order;

determining candidate transaction amount intervals of each order based on the order placing estimated transaction amount of each order;

for each recalled order, predicting the order taking transaction amount under the condition that the target driver takes the order for the order, and if the order taking transaction amount is located in the candidate transaction amount interval, taking the order as a candidate order;

determining a score of each candidate order;

and selecting the candidate orders as target orders in sequence according to the order of the scores from high to low.

6. The method of claim 5, wherein determining a score for each candidate order comprises:

acquiring the driving receiving time, the driving receiving distance and the income of the target driver under the condition that the target driver receives the order of each candidate order;

and determining the score of each selected order based on the corresponding driving receiving time, driving receiving distance and income of each candidate order.

7. The method of claim 1, wherein after said pushing of said targeted driver's information to the passenger terminal submitting said targeted order, said method further comprises:

starting a countdown;

if an acceptance message returned by the passenger terminal is received before the countdown is finished, the target order is dispatched to a driver terminal used by the target driver;

and if the countdown is finished or a rejection message returned by the passenger terminal is received before the countdown is finished, selecting a next target order and pushing the information of the target driver to the passenger terminal submitting the next target order.

8. The method of any one of claims 1-7, wherein the information pushed to the target driver of the passenger includes at least one of: a driving force quotient of the target driver, a name of the target driver, a type of vehicle used by the target driver, a license plate number of a vehicle driven by the target driver, a brand of the vehicle driven by the target driver, a model of the vehicle driven by the target driver, a color of the vehicle driven by the target driver.

9. An information pushing apparatus, characterized in that the apparatus comprises:

a detection unit configured to detect a length of empty driving of a target driver;

a determination unit configured to determine whether the target driver satisfies an order recall condition based on the length of empty travel;

a setting unit configured to set a target geographical area based on the position of the target driver and recall an order with a passenger position located in the target geographical area if satisfied;

a selecting unit configured to select a target order from the orders of which the passenger locations are located in the target geographic area;

a pushing unit configured to push information of the target driver to a passenger terminal submitting the target order.

10. An electronic device, comprising:

one or more processors;

a storage device having one or more programs stored thereon,

when executed by the one or more processors, cause the one or more processors to implement the method of any one of claims 1-8.

11. A computer-readable medium, on which a computer program is stored which, when being executed by a processor, carries out the method according to any one of claims 1-8.