[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

CN110968796B - Information pushing method and device and electronic equipment - Google Patents

Information pushing method and device and electronic equipment Download PDF

Info

Publication number
CN110968796B
CN110968796B CN201811145260.2A CN201811145260A CN110968796B CN 110968796 B CN110968796 B CN 110968796B CN 201811145260 A CN201811145260 A CN 201811145260A CN 110968796 B CN110968796 B CN 110968796B
Authority
CN
China
Prior art keywords
driver
area
target driver
target
time period
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201811145260.2A
Other languages
Chinese (zh)
Other versions
CN110968796A (en
Inventor
魏文
樊志国
徐哲
陆文韬
程珊珊
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Didi Infinity Technology and Development Co Ltd
Original Assignee
Beijing Didi Infinity Technology and Development Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Beijing Didi Infinity Technology and Development Co Ltd filed Critical Beijing Didi Infinity Technology and Development Co Ltd
Priority to CN201811145260.2A priority Critical patent/CN110968796B/en
Publication of CN110968796A publication Critical patent/CN110968796A/en
Application granted granted Critical
Publication of CN110968796B publication Critical patent/CN110968796B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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/00Administration; Management
    • G06Q10/02Reservations, e.g. for tickets, services or events

Landscapes

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Tourism & Hospitality (AREA)
  • Operations Research (AREA)
  • Economics (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Human Resources & Organizations (AREA)
  • Marketing (AREA)
  • Development Economics (AREA)
  • Quality & Reliability (AREA)
  • Strategic Management (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Traffic Control Systems (AREA)

Abstract

The application provides an information pushing method, wherein the method comprises the following steps: acquiring a target driver who does not receive a bill in a first area; judging whether the target driver meets a preset pushing condition or not; and if the preset pushing condition is met, sending a first pushing message to the target driver, wherein the first pushing message comprises second area information of a second area, and the second area is the second area, wherein the first area heat of the first area is lower than the second area heat of the second area.

Description

Information pushing method and device and electronic equipment
Technical Field
The application relates to the technical field of computers, in particular to an information pushing method and device and electronic equipment.
Background
At present, a background server of an application of an existing network appointment order receiving has data processing capacity, but information pushing of the application of the existing network appointment order receiving is not enough, and an existing driver needs to know some conditions, wherein the conditions around the driver can be observed to realize the understanding, or the mode of consulting background client personnel is adopted. Either of these methods is relatively inefficient and does not meet driver's needs well.
Disclosure of Invention
In view of this, an object of the embodiments of the present application is to provide an information pushing method, an information pushing device, and an electronic device, which send some push messages to a driver, so as to achieve an effect of recommending some areas easy to pick up an order.
In a first aspect, an embodiment of the present application provides an information pushing method, including:
acquiring a target driver who has not received a bill in a first area, wherein the first area has a first area heat, and the area heat represents a ratio of a passenger request amount to a driver supply amount in an area;
judging whether the target driver meets a preset pushing condition or not;
and if the preset pushing condition is met, sending a first pushing message to the target driver, wherein the first pushing message comprises second area information of a second area, and the first area heat of the first area is lower than the second area heat of the second area.
As an optional implementation, the determining whether the target driver meets a preset pushing condition includes:
and judging whether the target driver receives the order within a first specified time period before the current time, if not, indicating that the target driver meets the preset pushing condition.
As an optional implementation, the determining whether the target driver meets a preset pushing condition includes:
judging whether the target driver receives the order within a first specified time period before the current time;
judging whether the target driver receives a push message of an area with higher recommendation popularity in a second specified time period before the current time;
and if the target driver does not receive the order within the first specified time period and does not receive the first push message within the second specified time period, the target driver is indicated to meet the preset push condition.
As an optional implementation, the determining whether the target driver meets a preset pushing condition includes:
and judging whether the current listening single-row position of the target driver is greater than the set position number, if so, indicating that the target driver meets the preset pushing condition.
As an optional implementation, the determining whether the target driver meets a preset pushing condition includes:
calculating the waiting time required by the listening list of the target driver;
and judging whether the waiting time for listening to the order is longer than a first set time, if so, indicating that the target driver meets a preset pushing condition.
As an optional embodiment, the calculating of the waiting time required for the target driver to listen to the order includes:
acquiring position information of a target driver;
obtaining the number and the positions of passengers and the number and the positions of drivers which can be served in the area where the position information is located;
and calculating the waiting time required by the order of the target user according to the number and the positions of the passengers and the number and the positions of the drivers capable of being served.
As an optional embodiment, before sending the first push message to the target driver, the method further comprises:
and judging whether the target driver is a limit driver or not, and if not, sending the first push message to the target driver.
As an alternative embodiment, the determining whether the target driver is a restricted driver includes:
and judging whether the target driver is in the driving route towards the position direction of the reserved order to be processed, if so, the target driver is a limit driver.
As an alternative embodiment, the determining whether the target driver is a restricted driver includes:
and judging whether the target driver sets to receive the order in the designated area or not, if so, the target driver is a limit driver.
As an alternative embodiment, the determining whether the target driver is a restricted driver includes:
and judging whether the target driver sets an order for receiving the specified route, wherein the target driver is a limit driver.
As an alternative embodiment, the determining whether the target driver is a restricted driver includes:
and judging whether the position information of the target driver can be acquired or not, and if the position information cannot be acquired, determining that the target driver is a restricted driver.
As an alternative embodiment, the determining whether the target driver is a restricted driver includes:
and judging whether the target driver has an appointment order in a third appointed time period, if so, the target driver is a limit driver, and the third appointed time period represents a future time period.
As an alternative embodiment, the determining whether the target driver is a restricted driver includes:
and judging whether the driving range of the target driver exceeds a preset value in a fourth specified time period, if so, determining that the target driver is a limit driver, and the fourth specified time period represents a time period which has passed.
As an alternative embodiment, the determining whether the target driver is a restricted driver includes:
and judging whether the driving authority corresponding to the target driver is driving in a limited area, if so, the target driver is a limited driver, and the fourth specified time period represents a time period which has passed.
As an alternative embodiment, the determining whether the target driver is a restricted driver includes:
and judging whether the target driver is a registered driver within a fifth specified time period, if so, judging that the target driver is a limited driver, and indicating that a time period has passed by the fifth specified time period.
As an alternative embodiment, the determining whether the target driver is a restricted driver includes:
obtaining a rest time node of the target driver according to the historical behavior data of the target driver;
and judging whether the current time is less than a second set time length from the rest time node, if so, the target driver is a limited driver.
As an alternative embodiment, the determining whether the target driver is a restricted driver includes:
obtaining a first service level of the target driver and other service levels of other drivers in the first area except the target driver;
sequencing the first service level and the other service levels to obtain a target sequence;
and judging whether the first service level is arranged in a front designated range at the high end of the service level of the target sequence, if not, the target driver is a restricted driver.
As an optional implementation manner, the second area is selected by:
selecting a plurality of second areas to be selected according to the positions of the first areas;
acquiring the candidate heat of each candidate second area in the plurality of candidate second areas;
predicting the heat degree of each to-be-selected second area at each future time node according to the to-be-selected heat degree of each to-be-selected second area;
calculating the expected time node when the target driver reaches each second area to be selected;
and selecting the second area as a pushing destination according to the estimated time node when the target driver reaches each second area to be selected and the heat of the second area to be selected at the estimated time node.
As an optional embodiment, the second zone information includes a distance that the target driver reaches a specified position of the second zone.
As an alternative embodiment, the distance from the target driver to the designated position of the second area is calculated by:
acquiring a plurality of routes from the current position of the target driver to the specified position;
selecting a target route from the plurality of routes according to a set rule;
and calculating the distance of the target route to obtain the distance from the target driver to the designated position of the second area.
As an alternative embodiment, the second zone information includes a travel time of the target driver to reach a specified position of the second zone.
As an alternative embodiment, the second area information includes a travel time of the target driver to reach a specified position of the second area, which is calculated by:
acquiring a plurality of routes from the current position of the target driver to the designated position;
selecting a target route from the plurality of routes according to a set rule;
and calculating the running time of the target driver to reach the designated position of the second area according to the road condition and the distance of the target route.
As an optional implementation manner, the first push message further includes first area information of the first area.
As an alternative embodiment, the first zone information includes a driver-to-passenger comparison parameter, which includes a driver-to-passenger ratio.
As an optional implementation manner, the first zone information further includes a waiting time period required for the target driver to listen to the order in the first zone.
As an optional implementation, the method further comprises:
sending a second push message to the driver in the second area, the second push message including the pickup speed in the second area.
In a second aspect, an embodiment of the present application further provides an information pushing apparatus, including:
the system comprises an acquisition module, a display module and a control module, wherein the acquisition module is used for acquiring a target driver who does not receive an order in a first area, and the first area has a first area heat, and the area heat represents the proportion of passenger request quantity to driver supply quantity in one area;
the judgment module is used for judging whether the target driver meets a preset pushing condition;
and the sending module is used for sending a first push message to the target driver if the preset push condition is met, wherein the first push message comprises second area information of a second area, and the first area heat of the first area is lower than the second area heat of the second area.
In a third aspect, an embodiment of the present application further provides an electronic device, including: a processor, a memory and a bus, wherein the memory stores machine-readable instructions executable by the processor, the processor and the memory communicate with each other through the bus when the electronic device runs, and the machine-readable instructions are executed by the processor to perform the steps of the information pushing method in the embodiment of the first aspect.
In a fourth aspect, this application further provides a computer-readable storage medium, where a computer program is stored on the computer-readable storage medium, and when the computer program is executed by a processor, the steps of the information push method in the implementation manner of the first aspect are executed.
According to the information pushing method, the information pushing device and the electronic equipment, the state of the driver in the first area is judged, the first pushing message is sent to the driver meeting the preset pushing condition, the driver can know the area with low selectable heat, and accordingly the order receiving success rate of the driver can be improved.
In order to make the aforementioned objects, features and advantages of the present application more comprehensible, preferred embodiments accompanied with figures are described in detail below.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings that are required to be used in the embodiments will be briefly described below, it should be understood that the following drawings only illustrate some embodiments of the present application and therefore should not be considered as limiting the scope, and for those skilled in the art, other related drawings can be obtained from the drawings without inventive effort.
Fig. 1 shows a block schematic diagram of an electronic device provided by an embodiment of the application;
FIG. 2 is a flow chart of an information pushing method provided by an embodiment of the present application;
fig. 3 shows a detailed flowchart of step S203 of the information pushing method provided in the embodiment of the present application;
fig. 4a is a schematic diagram illustrating a push message presentation manner provided by an example of the embodiment of the present application;
fig. 4b is a schematic diagram illustrating a push message presentation manner provided by an example of the embodiment of the present application;
fig. 5 shows a detailed flowchart of step S203 of the information pushing method provided in the embodiment of the present application;
fig. 6 shows a schematic structural diagram of an information pushing apparatus provided in an embodiment of the present application.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present application clearer, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all the embodiments. The components of the embodiments of the present application, generally described and illustrated in the figures herein, can be arranged and designed in a wide variety of different configurations. Thus, the following detailed description of the embodiments of the present application, presented in the accompanying drawings, is not intended to limit the scope of the claimed application, but is merely representative of selected embodiments of the application. All other embodiments, which can be derived by a person skilled in the art from the embodiments of the present application without making any creative effort, shall fall within the protection scope of the present application.
The intelligent development of mobile terminal makes people's life more and more convenient, for example, mobile terminal can make things convenient for the passenger to get a car fast through net car booking platform, also makes things convenient for the driver to receive an order.
The driver of the network car booking can be provided with a driver client (or driver end APP) of the network car booking platform through a driver terminal, if the driver logs in the driver client, the driver is displayed to be in an online state on a server of the network car booking platform, and the server can know information such as the position and the contact way of the driver. The driver corresponds to the driver account, and the driver can log in the driver client through the driver account to receive a taxi taking request of the passenger and know information such as the position of the passenger.
At present, a background server of an application of an existing network appointment order receiving has a data processing capacity, but information pushing of the existing network appointment order receiving is still imperfect, and particularly, the reason and the supply and demand conditions that the driver who is waiting for the order receiving cannot hear the order and the destination exit of the order receiving that the driver can go to cannot be pushed. If the driver wants to know that what is currently what is not listening to the list, the driver may need to consult the background service platform. For example, the online booking platform provides a background system of the customer service branch table, and when the driver cannot hear the single query, the background customer service staff can transmit the supply and demand conditions to the driver, which is inefficient. Based on this, the inventors studied how to improve the efficiency of information learning of the driver to further satisfy the demands of the passenger and the driver.
Based on the information pushing method, the information pushing device and the electronic equipment, which are provided by the application, the drivers in different positions can be effectively pushed with some contents which may need to be known by the drivers.
Example one
Fig. 1 is a block diagram of an electronic device 100 according to an embodiment of the present disclosure. The electronic apparatus 100 includes a memory 111, a memory controller 112, a processor 113, a peripheral interface 114, and an input-output unit 115. It will be understood by those of ordinary skill in the art that the structure shown in fig. 1 is merely exemplary and is not intended to limit the structure of the electronic device 100. For example, electronic device 100 may also include more or fewer components than shown in FIG. 1, or have a different configuration than shown in FIG. 1. The electronic device 100 according to this embodiment may be a server, for example, a network server, a database server, or the like. The processor 113 communicates with the memory 111 via a bus when the electronic device is in operation. Further, the electronic device 100 can obtain information such as the position and the contact information of the driver, and can also obtain regional information of the position of the driver, so as to push some messages that the driver needs to know to the driver, so that the driver can make a decision according to the pushed messages.
The memory 111, the memory controller 112, the processor 113, the peripheral interface 114, and the input/output unit 115 are electrically connected to each other directly or indirectly to realize data transmission or interaction. For example, the components may be electrically connected to each other via one or more communication buses or signal lines. The memory 111 stores at least one software functional module in the form of software or Firmware (Firmware), or an Operating System (OS) of the electronic device 100 is solidified with a software functional module. The processor 113 is configured to execute executable modules stored in the memory.
The storage 111 may be, but is not limited to, including a memory and an external storage. Examples of such memories include Random Access Memory (RAM), read Only Memory (ROM), programmable Read Only Memory (PROM), erasable Read Only Memory (EPROM), and electrically Erasable Read Only Memory (EEPROM). The memory 111 is configured to store a program, and the processor 113 executes the program after receiving an execution instruction, and the method executed by the electronic device 100 defined by the process disclosed in any embodiment of the present invention may be applied to the processor 113, or implemented by the processor 113.
The processor 113 may be an integrated circuit chip having signal processing capabilities. The Processor 113 may be a general-purpose Processor, and includes a Central Processing Unit (CPU), a Network Processor (NP), and the like; but may also be a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA) or other programmable logic device, discrete gate or transistor logic device, discrete hardware components. The various methods, steps and logic blocks disclosed in the embodiments of the present invention may be implemented or performed. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like.
The peripheral interface 114 couples various input/output devices to the processor 113 as well as to the memory 111. In some embodiments, the peripheral interface 114, the processor 113, and the memory controller 112 may be implemented in a single chip. In other examples, they may be implemented separately from the individual chips.
The input-output unit 115 is used to provide input data. The input/output unit 115 may be, but is not limited to, a mouse, a keyboard, and the like.
The electronic device 100 described above may perform the various steps in the information push method described below. The information pushing method is described in detail below with reference to the flowchart.
Example two
Referring to a flow chart of an information pushing method shown in fig. 2, the method can be applied to a server of a networked car booking platform, the server can acquire the order listening condition of a driver on line in real time, and can also perform statistical analysis on the conditions of passengers and drivers in each area to judge whether the driver and the passengers in each area can meet the requirements of each other. In order to facilitate the analysis of the supply and demand of each area, several definitions of the supply and demand of each area under different supply and demand conditions are given in the present application, including:
the area heat: the passenger request quantity and the driver supply quantity ratio in a region are represented, the driver is easier to receive the order when the regional heat is higher, and the driver is less easy to receive the order when the regional heat is lower;
an absolute cold area: indicating that the supply is much greater than the demand, i.e., the number of drivers in the area is much greater than the demand of the passengers, making it very difficult for the drivers in the area to receive the order;
a relatively cold area: indicating that the supply is greater than the demand, i.e., that the number of drivers in the area is greater than the number of passengers, resulting in the drivers in the area not receiving orders easily, but relatively receiving orders more easily than the drivers in the absolutely cold area;
hot zone: indicating that the demand is greater than the supply, i.e., that the number of drivers in the area is less than the demand of the passengers, results in the passengers in the area not easily getting on net appointment.
Wherein, the critical values of the absolute cold area and the relative cold area can be set by the user according to the actual situation.
The supply amount described above indicates a driver supply amount, and the demand amount indicates a passenger request amount.
The information pushing method shown in fig. 2 is described in detail below, and may include the following steps.
Step S201, a target driver who has not received a bill in the first area is acquired.
The first region has a first region heat.
The first region in this embodiment may be the relatively cold region or the absolutely cold region described above. Drivers are less likely to receive orders in relatively cold and absolutely cold areas.
Further, a target driver who has not received a bill in the first zone may be obtained using a non-user triggered approach.
And step S202, judging whether the target driver meets a preset pushing condition.
If the preset pushing condition is satisfied, executing step S203; and if the preset pushing condition is not met, ending the process.
Specifically, there may be many conditions as the preset push, and specifically, the step S202 may include the following embodiments.
The first implementation mode comprises the following steps: and judging whether the target driver receives the order within a first specified time period before the current time, if not, indicating that the target driver meets the preset pushing condition.
The target driver may be after the previous single order, the driver client adjusting to a wait for order taking status. By determining the length of time the target driver waits for an order, it can be determined whether the driver needs to help him to take an order more quickly. Wherein the first specified time period may be a time period corresponding to ten minutes, twenty minutes, fifteen minutes before the current time. Of course, the first specified time period may be set to a different time period according to the degree of heat of a specific city. Specifically, the first-line city is easier to pick up the order, and the first specified time period corresponding to the first-line city may be set to be relatively shorter. Assuming that the average time length of the order taking of the first-line city may be three minutes, the first specified time period corresponding to the first-line city may be set to a time period from the first seven minutes of the current time to the current time node. The two-three-four-wire city may be less likely to be singled, and the first specified time period corresponding to the two-three-four-wire city may be set to be relatively longer. Assuming that the average duration of the order taking of the three-line city may be eight minutes, the first specified time period corresponding to the three-line city may be set to a time period from the first fifteen minutes from the current time to the current time node. Specifically, the city with the high popularity of the network car booking platform is easier to receive orders, and the first designated time period corresponding to the city with the high popularity of the network car booking platform can be set to be relatively shorter. Assuming that the average time length of the city order taking with high popularity of the network appointment platform can be three minutes, the first specified time period corresponding to the city with high popularity of the network appointment platform can be set to be the time period from the previous seven minutes of the current time to the time period corresponding to the current time node. The city with low popularity of the network car booking platform is probably more difficult to receive orders, and the first designated time period corresponding to the city with low popularity of the network car booking platform can be set to be relatively longer. Assuming that the average time length of the city order taking with low popularity of the network appointment platform can be eight minutes, the first specified time period corresponding to the city with low popularity of the network appointment platform can be set to be the time period from the previous fifteen minutes of the current time to the time corresponding to the current time node. For example, it may be determined whether the target driver has received an order within ten minutes.
Further, order receiving parameters of the target driver can be obtained, the order receiving quantity of the target driver in the first appointed time period is judged through the order receiving parameters, and if the order receiving quantity is zero, the target driver meets the preset pushing condition.
The second embodiment: and judging whether the target driver receives the push message of the area with higher recommendation popularity in a second appointed time period before the current time, wherein if the target driver does not receive the first push message in the second appointed time period, the target driver meets the preset push condition.
Wherein, the second designated time period can also be set to different time lengths according to the heat degree of a specific city. Specifically, the second specified time period corresponding to the first-line city may be set to be relatively shorter; the second designated time period corresponding to the two-three-four wire city may be set to be relatively longer. Specifically, the second designated time period corresponding to the city with high popularity of the network appointment platform can be set to be relatively shorter, and the first designated time period corresponding to the city with low popularity of the network appointment platform can be set to be relatively longer. For example, it is determined whether the target driver has received the first push message within thirty minutes.
The third embodiment is as follows: judging whether a target driver receives an order in a first appointed time period before the current time, and judging whether the target driver receives a push message of an area with higher recommendation degree in a second appointed time period, wherein the target driver does not receive the order in the first appointed time period and does not receive the first push message in the second appointed time period, and the target driver meets a preset push condition.
The third embodiment is a judgment condition combining the conditions of the first embodiment and the second embodiment. Details regarding the same conditions as those in the first embodiment and the second embodiment are not repeated.
The fourth embodiment: and judging whether the current listening list position of the target driver is more than the set position number, and if so, indicating that the target driver meets the preset push condition.
The target driver may be after the previous single bundle, the driver client adjusting to a wait for order pickup state. The background server carries out the ranking of the current area of the target driver and allocates the order for the target driver after the waiting driver receives the order. It will be appreciated that the slower the ranking is, the later the ranking is. For example, the number of set digits may be one hundred twenty digits, one hundred digits, eighty digits, and so on. When the waiting time of the driver is relatively long later, the driver may need to know the state more, so that the driver needing to know the situation can know the current situation conveniently by the method in the embodiment.
The fifth embodiment: and judging whether the waiting time for listening to the order is longer than a first set time, if so, indicating that the target driver meets a preset pushing condition.
Firstly, the waiting time for the target driver to listen to the order needs to be calculated. Specifically, the calculating of the waiting time required for the target driver to listen to the order includes: acquiring position information of a target driver; obtaining the number and the positions of passengers and the number and the positions of drivers which can be served in the area where the position information is located; and calculating the waiting time required by the order of the target user according to the number and the positions of the passengers and the number and the positions of the drivers capable of being served.
If the waiting time is too long, the driver resources cannot be well utilized, and the resources are wasted, so that the waiting time of the driver is judged, subsequent services are provided for the driver, and the utilization rate of the driver resources is improved.
Step S203, sending a first push message to the target driver, where the first push message includes second zone information of a second zone, and a first zone heat of the first zone is lower than a second zone heat of the second zone.
According to the information pushing method provided by the embodiment of the application, the state of the driver in the first area is judged, the first pushing message is sent to the driver meeting the preset pushing condition, the driver can know the area with low selectable heat, and therefore the order receiving success rate of the driver can be improved. Further, by setting a preset push condition, a message is sent to some drivers who need to know the message more. It is possible to avoid push messages interfering with unwanted drivers.
In this embodiment, the second zone may be a relatively recommended zone for the target driver, the target driver may spend less time reaching the second zone, and the second zone may remain in the hot zone after reaching the second zone. Based on the above consideration, the present application may screen the second region. As shown in fig. 3, the second area is selected by:
step S2031, selecting a plurality of second areas to be selected according to the position of the first area.
The plurality of candidate second regions may be a plurality of regions surrounding the periphery of the first region. Of course, the plurality of regions surrounding the periphery of the first region may also be relatively cold regions or absolutely cold regions, and the plurality of candidate second regions may also be regions adjacent to the plurality of regions surrounding the periphery of the first region. In this embodiment, the second region may be selected to be close to the first region and belong to a hot zone.
Further, a plurality of second areas to be selected may be obtained in a non-user-triggered manner.
Step S2032, obtaining a candidate heat degree of each candidate second area in the plurality of candidate second areas.
A plurality of candidate second regions may be selected, and for example, may include a candidate second region a, a candidate second region B, a candidate second region C, and a candidate second region D.
Step S2033, predicting the heat degree of each candidate second area at each future time node according to the candidate heat degree of each candidate second area.
The time nodes may be set as required, for example, the heat of each candidate second area every ten minutes in the future may be predicted, or the heat of each candidate second area every twenty minutes in the future may be predicted, and the like.
In one example, the heat of the candidate second area a, the candidate second area B, the candidate second area C, and the candidate second area D at each time node in the future is assumed as shown in the following table:
at present 10 minutes 20 minutes 30 minutes 40 minutes 50 minutes 60 minutes
Suppose that the second area A is to be selected 2 2 2.3 2.5 2.0 1.6 1
Suppose that the second region B to be selected 2 2.3 2.2 2.4 2 1.6 1
Suppose that the second region C to be selected 2 2 1.9 1.3 0.9 0.8 0.8
Suppose that the second region D is to be selected 2 2 2.3 2.5 2.0 1.5 0.7
Wherein, the numbers in the table represent the heat degree of each second area to be selected at different time nodes. In an alternative embodiment, the heat may be the ratio of the number of passengers getting off the unit to the number of drivers waiting to pick up the unit; in another alternative embodiment, the heat may also be the ratio of the average driver order pickup waiting time period to the corresponding time node order pickup waiting time period. In detail, the higher the heat, the faster the driver gets the order. The heat degree can be counted in other ways, and the counted scores can be different.
It will be appreciated that the above table may be schematic, and in actual use, the heat of each candidate second area may be statistically presented in other manners.
Step S2034, calculating the estimated time node when the target driver reaches each second area to be selected.
And obtaining the routes from the first area to the set positions in the second areas to be selected by the target driver, and calculating the time required for the target driver to reach the second areas to be selected according to the routes and the road conditions of the routes obtained in real time.
Assume that it takes twenty minutes for the target driver to reach the second area a to be selected from the first area, ten minutes to reach the second area B to be selected from the first area, forty minutes to reach the second area C to be selected from the first area, and one hour to reach the second area D to be selected from the first area.
Step S2035, selecting the second area to be pushed away according to the estimated time node when the target driver arrives at each second area to be selected and the estimated time node of the second area to be selected.
In this embodiment, the predicted time node when the target driver reaches each of the candidate second regions is compared with the heat in each of the candidate second regions to select the second region recommended to the target driver.
As shown in the above example, when the target driver arrives at the second area a to be selected, the heat of the second area a to be selected is 2.3; when the target driver arrives at the second area B to be selected, the heat degree of the second area B to be selected is 2.3; when the target driver arrives at the second area C to be selected, the heat degree of the second area C to be selected is 0.9; and when the target driver arrives at the second area D to be selected, the heat of the second area D to be selected is 1.5. The second area a and the second area B may be reached with the same heat, but the time spent on reaching the second area B is less, so the second area B may be selected as the second area recommended to the target driver.
Further, the driver is facilitated to know the arrival at the second area, and the second area information may include some information that may enable the target driver to better know the relevant contents of the second area. For example, the distance the target driver reaches a specified position of the second area, the travel time, and the like may be included.
It will be described below that the second zone information includes the distance of the target driver to the designated location of the second zone.
The distance from the target driver to the designated position of the second area is calculated by: acquiring a plurality of routes from the current position of the target driver to the designated position; selecting a target route from the plurality of routes according to a set rule; and calculating the distance of the target route to obtain the distance from the target driver to the designated position of the second area.
Since there may be a plurality of routes for the target driver to go from the first area to the second area, the distance for the target driver to reach the designated location of the second area may be a route selected from the plurality of routes according to a set rule. For example, the distance from the target driver to the designated position of the second area may be one route arbitrarily selected from a plurality of routes, or may be a route having the shortest route, or may be the most smooth route, or may be a route that is relatively smooth and has few red lights as the route for calculating the distance.
It will be described first that the second zone information includes the travel time of the target driver to the specified position of the second zone.
Wherein the travel time for the target driver to reach the designated location of the second zone is calculated by: acquiring a plurality of routes from the current position of the target driver to the designated position; selecting a target route from the plurality of routes according to a set rule; and calculating the running time of the target driver to reach the designated position of the second area according to the road condition and the distance of the target route.
The selection mode of selecting the target route from the plurality of routes according to the set rule may be the same as the mode of selecting the route when the distance is calculated in the foregoing, or different rules may be adopted, which is not described herein again.
In the embodiment, the driving time of the target driver reaching the designated position of the second area can be calculated by acquiring the information such as the number of red street lamps in the target route, vehicle data, and the expected waiting time of each traffic light.
The distance and the driving time of the target driver reaching the second area can be conveniently and effectively selected by the user whether the target driver goes to the second area, and the use of driver resources is improved.
As shown in fig. 4a, the first push message to the target driver may include: tags, titles, and main content.
The tag may be used to identify an application attribute to which the first push message belongs, for example, the information push method in this embodiment is used for dispatching of drivers in a cold and hot area. Then as shown in fig. 4a, the tag display content can try: a small helper is scheduled.
The header may be used for the purpose of indicating the first push message, for example, as shown in fig. 4a, the tag display content may try: and scheduling the reminding.
As shown in fig. 4a, the main content may include: and (4) the favorite driver has fewer orders in the region where the driver is located, and suggests that going to the Xkm second region XXX can receive orders more quickly, and clicks the card to navigate. Where XXX may be populated with POI (Point of Interest) Point names representing the second area. For example, the POI spot name may be a mall name, a park name, an office building name, a school name, etc. belonging to the second area closest to the first area.
Further, when the target driver clicks the scheduling card, navigation to the POI spot name of the second area may be initiated in the target driver's mobile terminal.
Further, the first push message further includes first area information of the first area.
Wherein the first zone information comprises a driver to passenger comparison parameter comprising a driver to passenger ratio.
Further, the first area information also comprises the waiting time required for the target driver to listen to the order in the first area.
As shown in fig. 4b, the first push message at this time may include a tag: scheduling a small assistant; title: reminding in a cold and hot area; the content is as follows: lovely drop car owners, the number of orders in the area where you are located is small, drivers are more, and the average order receiving time in the current area is expected to exceed 10min.
In this embodiment, the driver in the hot zone can also know the current zone, and may send a second push message to the target driver who transits from the first zone to the second zone, or may send a second push message to the driver in the hot zone, that is, the second zone, where the second push message includes the order taking speed in the second zone.
EXAMPLE III
Considering that there may be some exceptions, some drivers do not need the background server to push the first push message to go to other areas where orders can be picked up more easily. For example, the user may be tired when driving, or the driver may have an order to be processed. Therefore, based on the above, the present application adds a step of determining whether the target driver is a restricted driver to the step shown in fig. 2. Specifically, referring to fig. 5, the information pushing method in the present embodiment may include the following steps.
Step S301, a target driver who does not receive a bill in the first area is obtained.
Step S302, judging whether the target driver meets preset pushing conditions.
If the preset pushing condition is satisfied, in one embodiment, step S304 may be executed, and in another embodiment, step S303 may be executed to further determine; and if the preset push condition is not met, ending the process.
Step S303, determining whether the target driver is a restricted driver.
If the target driver is not the restricted driver, step S304 is performed. And if the target driver is the limited driver, ending the process.
Specifically, there may be many as a limitation to the driver, and specifically, step S303 may include the following embodiments.
The first implementation mode comprises the following steps: and judging whether the target driver is in the driving route towards the position direction of the reserved order to be processed, if so, the target driver is a limit driver.
In this embodiment, the target driver's order for a future time period may be queried. Whether the target driver is in the journey towards the position of the reserved order to be processed can be judged through the current position of the target low level, the driving path and the inquired address of the order.
Considering that there may be some drivers who, although currently have no order and can satisfy the preset push condition, may be going to the destination of the reserved order, the driver in this case may not need to be implemented by the push message of the background system.
The second embodiment: and judging whether the target driver sets to receive the order in the designated area or not, if so, the target driver is a limit driver.
The third embodiment is as follows: and judging whether the target driver sets an order for receiving a specified route, wherein the target driver is a limited driver.
In this embodiment, the driver client of the online appointment car provides a setting function for the user to set a special requirement. For example, the driver can set parameters such as the area and route of the order to be picked up according to the requirement of the driver.
If the driver sets definable parameters, the order cannot be picked up quickly even in hot areas, so that such drivers can be dispensed with, messages can be prevented from interfering with the driver, and the effectiveness of the information push can also be increased.
The fourth embodiment: and judging whether the position information of the target driver can be acquired or not, and if the position information cannot be acquired, determining that the target driver is a restricted driver.
When the position information of the driver cannot be acquired, the driver is probably in a no-signal area, push messages are not sent to the driver, useless information can be avoided being sent, and effective push of the push messages is provided.
The fifth embodiment: and judging whether the target driver has an appointment order in a third appointed time period, if so, the target driver is a limit driver, and the third appointed time period represents a future time period.
Wherein the third specified time period may be a time period between one hour and two hours. Of course, the third specified period of time may be set to a different length of time according to the popularity of a particular city.
Embodiment six: and judging whether the driving range of the target driver exceeds a preset value in a fourth specified time period, if so, determining that the target driver is a limit driver, and the fourth specified time period represents a time period which has already passed.
Historical driving data of the target driver can be obtained, and driving mileage can be obtained according to the historical driving data of the target driver.
The fourth specified time period may be a time period within five hours before the current time period, or may be a time period within twelve hours before the current time period. Specifically, a different fourth time period may be set according to the age of the driver, for example, a less-aged driver may set a shorter time period correspondingly, and a more-aged driver may set a longer time period correspondingly.
The preset value may be a running value according to a state that may actually cause fatigue driving of the target user. Specifically, different drivers may correspond to different preset values, and specifically, different preset values may be set according to the age of the driver, for example, a younger driver may correspond to a larger preset value, and a younger driver may correspond to a smaller preset value.
Whether the target driver is in a fatigue state may be determined by determining the mileage of the target driver over the fourth specified period of time.
Embodiment seven: and judging whether the driving authority corresponding to the target driver is driving in a limited area, if so, the target driver is a limited driver.
As traffic flow increases, many cities prevent major urban traffic congestion by restricting certain license plate numbers from entering the major urban areas at designated times. For example, monday restricted license plates enter major urban areas with end numbers of 1 and 6; the Tuesday limits the license plate to enter the main urban area with the tail numbers of 2 and 7; the end numbers of the Monday license plates are 3 and 8, and the license plates enter the main urban area; the tail numbers of the four-week restricted license plates are 4 and 9, and the license plates enter the main urban area; friday restricts license plate tail numbers to 5 and 0 from entering main urban areas.
For example, if the current time is wednesday, then wednesday does not push messages to drivers with license plate end numbers of 3 and 8 to the main urban area.
The limitation can avoid pushing some push messages which can not be dispatched to some drivers, thereby improving the effective pushing of the push messages.
The eighth embodiment: and judging whether the target driver is a registered driver within a fifth specified time period, if so, judging that the target driver is a limited driver, and indicating that a time period has passed by the fifth specified time period.
The fifth specified time period may be a time period from one month ago to the current time. Of course, different time lengths can be set according to actual conditions.
Considering that a new driver may be less likely to pick up an order, the new registered driver may be filtered out, and invalid push may be reduced.
The ninth embodiment: obtaining a rest time node of the target driver according to the historical behavior data of the target driver; and judging whether the current time is less than a second set time length from the rest time node, if so, the target driver is a limited driver.
In a practical way, historical driving data of the driver can be obtained, and possible rest time periods of the driver can be obtained according to the historical data. For example, it is found from the historical data that the habituation of a driver M is no longer on order after one and a half to three hours and twenty and a half hours in the middle of the day.
The second set duration may be set according to the city heat, a shorter duration may be set as the city heat is higher, and a longer duration may be set as the city heat is lower. For example, the second set time period may be thirty minutes, and the current time is twenty-two tenths, then the driver M may be filtered out. The more passengers who need to take the net appointment due to high city heat are likely to be correspondingly increased, so that the requirements of the passengers can be better met through the arrangement in the mode.
The second set time period may be set according to the city heat, and a longer time period may be set as the city heat is higher, and a shorter time period may be set as the city heat is lower. The more drivers who can provide service are probably corresponded to because city heat is high, thereby can satisfy driver's the custom of work and rest better through the setting of above-mentioned mode, also can improve driver's experience.
Through the ninth implementation mode, the situation that the message is pushed to some drivers needing rest to cause invalid pushing can be avoided, and the situation that the normal work and rest of the drivers are influenced by the message pushing can also be avoided.
Embodiment ten: obtaining a first service level of the target driver and other service levels of other drivers in the first area except the target driver; sequencing the first service level and the other service levels to obtain a target sequence; and judging whether the first service level is arranged in a front designated range at the high end of the service level of the target sequence, if not, the target driver is a restricted driver.
The service level may represent a service level formed by the driver corresponding to the evaluation of the driver by the passenger served by the order taking. For example, more favorable ratings of the driver are higher. The manner in which the particular driver's service level is obtained and scored will not be described in detail herein.
Under the condition that a driver is not easy to take an order, the push message can be preferentially sent to the driver with higher service level, so that the driver with higher service level can take the order more easily and successfully, the driver can be encouraged to better serve passengers, and the overall service of the network booking is improved.
Step S304, sending a first push message to the target driver, wherein the first push message comprises second zone information of a second zone, and the first zone heat of the first zone is lower than the second zone heat of the second zone.
Wherein the zone heat represents a ratio of the driver's supply amount to the passenger's request amount in a zone. Drivers in areas with higher regional warmth are more likely to pick up an order and drivers in areas with lower regional warmth are less likely to pick up an order.
For the detailed processes of steps S301, S302, and S304, reference may be made to the description in embodiment two, and details are not repeated here.
It is to be understood that step S304 is similar to step S203 in the second implementation, and the first push message may also include the first area information. Further, more messages that are the same as or similar to the push message in the second embodiment may also be pushed to the target driver meeting the condition, and are not described herein again.
Further, the push message may also include a push navigation, and when the driver responds to the second area pushed by the first push message, a navigation page may be displayed to guide the driver to drive from the first area to the second area. Through the push navigation, the driver can conveniently and directly drive to the second area.
Example four
Based on the same application concept, an information pushing device corresponding to the information pushing method is further provided in the embodiment of the present application, and as the principle of solving the problem of the device in the embodiment of the present application is similar to that of the information pushing method in the embodiment of the present application, reference may be made to implementation of the device in the method, and repeated parts are not described again.
Referring to fig. 6, a schematic diagram of a functional module of an information pushing apparatus according to a fifth embodiment of the present application is shown, where the information pushing apparatus includes: an acquisition module 401, a judgment module 402 and a judgment module 403; wherein,
an obtaining module 401, configured to obtain a target driver who has not received a bill in a first area;
a judging module 402, configured to judge whether the target driver meets a preset pushing condition;
the sending module 403 is configured to send a first push message to the target driver if the preset push condition is met, where the first push message includes second area information of a second area, and a first area heat of the first area is lower than a second area heat of the second area.
In a possible implementation manner, the determining module 402 is further configured to:
judging whether a target driver receives an order within a first appointed time period before the current time, if not, indicating that the target driver meets a preset pushing condition, wherein the first appointed time period indicates an elapsed time period.
In a possible implementation manner, the determining module 402 is further configured to:
judging whether the target driver receives the order within a first specified time period before the current time;
judging whether the target driver receives a push message of an area with higher recommendation popularity in a second specified time period before the current time;
and if the target driver does not receive the order within the first specified time period and does not receive the first push message within the second specified time period, the target driver meets the preset push condition.
In a possible implementation manner, the determining module 402 is further configured to:
and judging whether the current listening single-row position of the target driver is greater than the set position number, if so, indicating that the target driver meets the preset pushing condition.
In a possible implementation manner, the determining module 402 is further configured to:
calculating the waiting time required by the listening list of the target driver;
and judging whether the waiting time for listening to the order is longer than a first set time, if so, indicating that the target driver meets a preset pushing condition.
In a possible implementation manner, the determining module 402 is further configured to:
acquiring position information of a target driver;
obtaining the number and the positions of passengers and the number and the positions of drivers which can be served in the area where the position information is located;
and calculating the waiting time required by the order of the target user according to the number and the positions of the passengers and the number and the positions of the drivers capable of being served.
In a possible implementation manner, the determining module 402 of the information pushing apparatus is further configured to:
and judging whether the target driver is a limit driver or not, and if not, sending the first push message to the target driver.
In a possible implementation manner, the determining module 402 is further configured to:
and judging whether the target driver is in the travel route towards the position direction of the reserved order to be processed, if so, determining that the target driver is a limit driver.
In a possible implementation, the determining module 402 is further configured to:
and judging whether the target driver sets to receive the order in the designated area or not, if so, the target driver is a limit driver.
In a possible implementation manner, the determining module 402 is further configured to:
and judging whether the target driver sets an order for receiving a specified route, wherein the target driver is a limited driver.
In a possible implementation manner, the determining module 402 is further configured to:
and judging whether the position information of the target driver can be acquired or not, and if the position information cannot be acquired, determining that the target driver is a restricted driver.
In a possible implementation, the determining module 402 is further configured to:
and judging whether the target driver has an appointment order in a third appointed time period, if so, the target driver is a limit driver, and the third appointed time period represents a future time period.
In a possible implementation manner, the determining module 402 is further configured to:
and judging whether the driving range of the target driver exceeds a preset value in a fourth specified time period, if so, determining that the target driver is a limit driver, and the fourth specified time period represents a time period which has passed.
In a possible implementation, the determining module 402 is further configured to:
and judging whether the driving authority corresponding to the target driver is driving in a limited area, if so, the target driver is a limited driver.
In a possible implementation, the determining module 402 is further configured to:
and judging whether the target driver is a registered driver within a fifth specified time period, if so, judging that the target driver is a limited driver, and indicating that a time period has passed by the fifth specified time period.
In a possible implementation manner, the determining module 402 is further configured to:
obtaining a rest time node of the target driver according to the historical behavior data of the target driver;
and judging whether the current time is less than a second set time length from the rest time node, if so, determining that the target driver is a limited driver.
In a possible implementation manner, the determining module 402 is further configured to:
obtaining a first service level of the target driver and other service levels of other drivers in the first area except the target driver;
sequencing the first service level and the other service levels to obtain a target sequence;
and judging whether the first service level is arranged in a front designated range at the high end of the service level of the target sequence, if not, the target driver is a restricted driver.
In a possible embodiment, the second area is selected by:
selecting a plurality of second areas to be selected according to the positions of the first areas;
acquiring the candidate heat of each candidate second area in the plurality of candidate second areas;
predicting the heat degree of each to-be-selected second area at each future time node according to the to-be-selected heat degree of each to-be-selected second area;
calculating the expected time node when the target driver reaches each second area to be selected;
and selecting the second area as a pushing destination according to the estimated time node when the target driver reaches each second area to be selected and the heat of the second area to be selected at the estimated time node.
In one possible embodiment, the second zone information includes a distance that the target driver reaches a specified position of the second zone.
In one possible embodiment, the distance from the target driver to the designated position in the second area is calculated by:
acquiring a plurality of routes from the current position of the target driver to the designated position;
selecting a target route from the plurality of routes according to a set rule;
and calculating the distance of the target route to obtain the distance from the target driver to the designated position of the second area.
In one possible embodiment, the second zone information includes a travel time of the target driver to reach a specified position of the second zone.
In one possible embodiment, the second area information includes a travel time of the target driver to reach a specified position of the second area, which is calculated by:
acquiring a plurality of routes from the current position of the target driver to the designated position;
selecting a target route from the plurality of routes according to a set rule;
and calculating the running time of the target driver to reach the designated position of the second area according to the road condition and the distance of the target route.
In a possible implementation, the first push message further includes first area information of the first area.
In one possible embodiment, the first zone information includes a driver-to-passenger comparison parameter, which includes a driver-to-passenger ratio.
In one possible embodiment, the first zone information further includes a waiting time period required for the target driver to listen to the order in the first zone.
In a possible implementation manner, the sending module 403 of the information pushing apparatus is further configured to:
sending a second push message to the driver in the second area, the second push message including the pickup speed in the second area.
The description of the processing flow of each module in the apparatus and the interaction flow between the modules may refer to the relevant description in the above method embodiments, and will not be described in detail here.
The information pushing device provided by the embodiment of the application judges the state of the driver in the first area, sends the first pushing message to the driver meeting the preset pushing condition, and enables the driver to know the area with lower selectable heat, so that the order receiving success rate of the driver can be improved.
In addition, an embodiment of the present application further provides a computer-readable storage medium, where a computer program is stored on the computer-readable storage medium, and when the computer program is executed by a processor, the computer program performs the steps of the information pushing method in the foregoing method embodiment.
The computer program product of the information push method provided in the embodiment of the present application includes a computer-readable storage medium storing a program code, where instructions included in the program code may be used to execute the steps of the information push method in the above method embodiment, which may be specifically referred to in the above method embodiment, and are not described herein again.
It can be clearly understood by those skilled in the art that, for convenience and simplicity of description, the specific working process of the system and the apparatus described above may refer to the corresponding process in the foregoing method embodiment, and details are not described herein again. In the several embodiments provided in the present application, it should be understood that the disclosed system, apparatus and method may be implemented in other ways. The above-described embodiments of the apparatus are merely illustrative, and for example, the division of the units is only one logical division, and there may be other divisions when actually implemented, and for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection of devices or units through some communication interfaces, and may be in an electrical, mechanical or other form.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit.
The functions, if implemented in the form of software functional units and sold or used as a stand-alone product, may be stored in a non-volatile computer-readable storage medium executable by a processor. Based on such understanding, the technical solution of the present application or portions thereof that substantially contribute to the prior art may be embodied in the form of a software product stored in a storage medium and including instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present application. And the aforementioned storage medium includes: various media capable of storing program codes, such as a usb disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk, or an optical disk.
The above description is only for the specific embodiments of the present application, but the scope of the present application is not limited thereto, and any person skilled in the art can easily conceive of the changes or substitutions within the technical scope of the present application, and shall be covered by the scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.

Claims (28)

1. An information pushing method, comprising:
acquiring a target driver who has not received a bill in a first area, wherein the first area has a first area heat, and the area heat represents a ratio of a passenger request quantity to a driver supply quantity in one area;
judging whether the target driver meets a preset pushing condition or not;
if the preset pushing condition is met, sending a first pushing message to the target driver, wherein the first pushing message comprises second area information of a second area, and the first area heat of the first area is lower than the second area heat of the second area;
wherein the second region is selected by:
selecting a plurality of second areas to be selected according to the positions of the first areas;
acquiring the candidate heat of each candidate second area in the plurality of candidate second areas;
predicting the heat degree of each to-be-selected second area at each future time node according to the to-be-selected heat degree of each to-be-selected second area;
calculating the expected time node when the target driver reaches each second area to be selected;
and selecting the second area according to the estimated time node when the target driver reaches each second area to be selected and the heat degree of the second area to be selected at the estimated time node.
2. The method of claim 1, wherein the determining whether the target driver meets a preset push condition comprises:
and judging whether the target driver receives the order within a first specified time period before the current time, if not, indicating that the target driver meets the preset pushing condition.
3. The method of claim 1, wherein the determining whether the target driver meets a preset push condition comprises:
judging whether the target driver receives the order within a first specified time period before the current time;
judging whether the target driver receives a push message of an area with higher recommendation popularity in a second specified time period before the current time;
and if the target driver does not receive the order within the first specified time period and does not receive the first push message within the second specified time period, the target driver meets the preset push condition.
4. The method of claim 1, wherein the determining whether the target driver meets a preset push condition comprises:
and judging whether the current listening single-row position of the target driver is greater than the set position number, if so, indicating that the target driver meets the preset pushing condition.
5. The method of claim 1, wherein the determining whether the target driver meets a preset push condition comprises:
calculating the waiting time required by the listening list of the target driver;
and judging whether the waiting time for listening to the order is longer than a first set time, if so, indicating that the target driver meets a preset pushing condition.
6. The method of claim 5, wherein calculating the waiting duration for the target driver to listen for the order comprises:
acquiring position information of a target driver;
obtaining the number and the positions of passengers and the number and the positions of drivers in the area where the position information is located;
and calculating the waiting time required by the order of the target user according to the number and the positions of the passengers and the number and the positions of the drivers capable of being served.
7. The method of claim 1, wherein prior to sending the first push message to the target driver, the method further comprises:
and judging whether the target driver is the driver limit, if not, sending the first push message to the target driver.
8. The method of claim 7, wherein the determining whether the target driver is a restricted driver comprises:
and judging whether the target driver is in the driving route towards the position direction of the reserved order to be processed, if so, the target driver is a limit driver.
9. The method of claim 7, wherein the determining whether the target driver is a restricted driver comprises:
and judging whether the target driver sets to receive the order in the designated area or not, if so, the target driver is a limit driver.
10. The method of claim 7, wherein the determining whether the target driver is a restricted driver comprises:
and judging whether the target driver sets an order for receiving the specified route, wherein the target driver is a limit driver.
11. The method of claim 7, wherein the determining whether the target driver is a restricted driver comprises:
and judging whether the position information of the target driver can be acquired or not, and if the position information cannot be acquired, determining that the target driver is a restricted driver.
12. The method of claim 7, wherein the determining whether the target driver is a restricted driver comprises:
and judging whether the target driver has an appointment order in a third appointed time period, if so, the target driver is a limit driver, and the third appointed time period represents a future time period.
13. The method of claim 7, wherein the determining whether the target driver is a restricted driver comprises:
and judging whether the driving range of the target driver exceeds a preset value in a fourth specified time period, if so, determining that the target driver is a limit driver, and the fourth specified time period represents a time period which has passed.
14. The method of claim 7, wherein the determining whether the target driver is a restricted driver comprises:
and judging whether the driving authority corresponding to the target driver is driving in a limited area, if so, the target driver is a limited driver.
15. The method of claim 7, wherein the determining whether the target driver is a restricted driver comprises:
and judging whether the target driver is a registered driver in a fifth specified time period, if so, judging that the target driver is a limited driver, and indicating a time period which has passed by the fifth specified time period.
16. The method of claim 7, wherein the determining whether the target driver is a restricted driver comprises:
obtaining a rest time node of the target driver according to the historical behavior data of the target driver;
and judging whether the current time is less than a second set time length from the rest time node, if so, the target driver is a limited driver.
17. The method of claim 7, wherein the determining whether the target driver is a restricted driver comprises:
obtaining a first service level of the target driver and other service levels of other drivers in the first area except the target driver;
sequencing the first service level and the other service levels to obtain a target sequence;
and judging whether the first service level is arranged in a front designated range at the high end of the service level of the target sequence, if not, the target driver is a restricted driver.
18. The method of claim 1, wherein the second zone information includes a distance that the target driver reaches a specified location of the second zone.
19. The method of claim 18, wherein the distance the target driver reaches the designated location of the second zone is calculated by:
acquiring a plurality of routes from the current position of the target driver to the designated position;
selecting a target route from the plurality of routes according to a set rule;
and calculating the distance of the target route to obtain the distance from the target driver to the designated position of the second area.
20. The method of claim 1, wherein the second zone information includes a travel time for the target driver to reach a designated location of the second zone.
21. The method as set forth in claim 20, wherein the second zone information includes a travel time for the target driver to reach a designated location of the second zone is calculated by:
acquiring a plurality of routes from the current position of the target driver to the designated position;
selecting a target route from the plurality of routes according to a set rule;
and calculating the running time of the target driver to reach the designated position of the second area according to the road condition and the distance of the target route.
22. The method of claim 1, wherein the first push message further comprises first region information for the first region.
23. The method of claim 22, wherein the first zone information comprises a driver to passenger comparison parameter comprising a driver to passenger ratio.
24. The method of claim 22, wherein the first zone information further comprises a waiting period for the target driver to listen for a ticket in the first zone.
25. The method of any one of claims 1-24, further comprising:
sending a second push message to the driver in the second area, the second push message including the pickup speed in the second area.
26. An information pushing apparatus, comprising:
the system comprises an acquisition module, a display module and a control module, wherein the acquisition module is used for acquiring a target driver who does not receive an order in a first area, and the first area has a first area heat, and the area heat represents the proportion of passenger request quantity to driver supply quantity in one area;
the judging module is used for judging whether the target driver meets preset pushing conditions or not;
the sending module is used for sending a first push message to the target driver if the preset push condition is met, wherein the first push message comprises second area information of a second area, and the first area heat of the first area is lower than the second area heat of the second area;
wherein the second region is selected by:
selecting a plurality of second areas to be selected according to the positions of the first areas;
acquiring the candidate heat of each candidate second area in the plurality of candidate second areas;
predicting the heat degree of each to-be-selected second area at each future time node according to the to-be-selected heat degree of each to-be-selected second area;
calculating the expected time node when the target driver reaches each second area to be selected;
and selecting the second area according to the estimated time node when the target driver reaches each second area to be selected and the heat degree of the second area to be selected at the estimated time node.
27. An electronic device, comprising: processor, memory and bus, the memory stores machine readable instructions executable by the processor, the processor and the memory communicate through the bus when the electronic device runs, the machine readable instructions when executed by the processor perform the steps of the information pushing method according to any one of claims 1 to 25.
28. A computer-readable storage medium, on which a computer program is stored which, when being executed by a processor, carries out the steps of the information push method according to any one of claims 1 to 25.
CN201811145260.2A 2018-09-29 2018-09-29 Information pushing method and device and electronic equipment Active CN110968796B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201811145260.2A CN110968796B (en) 2018-09-29 2018-09-29 Information pushing method and device and electronic equipment

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201811145260.2A CN110968796B (en) 2018-09-29 2018-09-29 Information pushing method and device and electronic equipment

Publications (2)

Publication Number Publication Date
CN110968796A CN110968796A (en) 2020-04-07
CN110968796B true CN110968796B (en) 2023-03-21

Family

ID=70027212

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201811145260.2A Active CN110968796B (en) 2018-09-29 2018-09-29 Information pushing method and device and electronic equipment

Country Status (1)

Country Link
CN (1) CN110968796B (en)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH09153098A (en) * 1995-11-30 1997-06-10 Omron Corp Vehicle demand prediction system
CN105551236A (en) * 2016-01-20 2016-05-04 北京京东尚科信息技术有限公司 Vehicle dispatching method and system
CN108010306A (en) * 2017-08-16 2018-05-08 北京嘀嘀无限科技发展有限公司 Transport capacity dispatching method, Transport capacity dispatching system and server
CN108009188A (en) * 2017-08-16 2018-05-08 北京嘀嘀无限科技发展有限公司 Thermodynamic chart methods of exhibiting, system, terminal and server
KR20180051452A (en) * 2016-08-30 2018-05-16 주식회사 카카오모빌리티 Method, device and computer readable recording medium for providing expected demand for taxi passenger

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH09153098A (en) * 1995-11-30 1997-06-10 Omron Corp Vehicle demand prediction system
CN105551236A (en) * 2016-01-20 2016-05-04 北京京东尚科信息技术有限公司 Vehicle dispatching method and system
KR20180051452A (en) * 2016-08-30 2018-05-16 주식회사 카카오모빌리티 Method, device and computer readable recording medium for providing expected demand for taxi passenger
CN108010306A (en) * 2017-08-16 2018-05-08 北京嘀嘀无限科技发展有限公司 Transport capacity dispatching method, Transport capacity dispatching system and server
CN108009188A (en) * 2017-08-16 2018-05-08 北京嘀嘀无限科技发展有限公司 Thermodynamic chart methods of exhibiting, system, terminal and server

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
Taxi Dispatch With Real-Time Sensing Data in Metropolitan Areas: A Receding Horizon Control Approach;Fei Miao et al;《IEEE Transactions on Automation Science and Engineering 》;20160322;第13卷(第2期);第463-478页 *
基于数学建模的城市出租车供需分配方案设计;杨泽民 等;《山西大同大学学报(自然科学版)》;20160729;第32卷(第3期);第1-4,16页 *

Also Published As

Publication number Publication date
CN110968796A (en) 2020-04-07

Similar Documents

Publication Publication Date Title
Beojone et al. On the inefficiency of ride-sourcing services towards urban congestion
US10639995B2 (en) Methods, circuits, devices, systems and associated computer executable code for driver decision support
Kotb et al. iParker—A new smart car-parking system based on dynamic resource allocation and pricing
US11386359B2 (en) Systems and methods for managing a vehicle sharing facility
US8504295B2 (en) Preserving assigned carpools after a cancellation
Wong et al. On dynamic demand responsive transport services with degree of dynamism
US9111403B2 (en) Systems and methods for tracking device control and report
US10061991B2 (en) Method of data visualization and data sorting
US20160247094A1 (en) Systems and Methods for Managing a Vehicle Sharing Facility
CN111626534A (en) Resource scheduling method and device, electronic equipment and readable storage medium
CN111340318B (en) Vehicle dynamic scheduling method and device and terminal equipment
JP2019164469A (en) Car sharing system and control program for car sharing system
CN109841054B (en) Method, device, equipment and storage medium for recommending boarding points
JP7078357B2 (en) Distribution device, distribution method and distribution program
Okeke The impacts of shared autonomous vehicles on car parking space
CN112629524A (en) Travel path recommendation management method and device and electronic equipment
Fonzone et al. New services, new travelers, old models? Directions to pioneer public transport models in the era of big data
CN111526170A (en) Push method, display method, device, server, terminal and storage medium
CN114694399A (en) Parking stall reservation management system based on thing networking
CN114781267A (en) Multi-source big data-based dynamic bus management method and system for stop and transfer
CA3053089A1 (en) Dynamic selection of geo-based service options in a network system
CN110968796B (en) Information pushing method and device and electronic equipment
Tengilimoglu et al. Evaluating the mileage and time efficiency of ridesourcing services: Austin, Texas case
CN110826943B (en) Method and related equipment for judging whether bus allocation is needed or not and determining bus allocation number
JP2021077063A (en) Information processor, program, and information processing method

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant