CN110956351A

CN110956351A - Order allocation method and device, server and computer readable storage medium

Info

Publication number: CN110956351A
Application number: CN201811133982.6A
Authority: CN
Inventors: 李隽钦; 盛克华
Original assignee: Beijing Didi Infinity Technology and Development Co Ltd
Current assignee: Beijing Didi Infinity Technology and Development Co Ltd
Priority date: 2018-09-27
Filing date: 2018-09-27
Publication date: 2020-04-03
Anticipated expiration: 2038-09-27
Also published as: CN110956351B

Abstract

The application relates to the technical field of computers, in particular to an order distribution method, which comprises the following steps: receiving taxi taking information of passengers, and generating taxi taking orders according to the taxi taking information, wherein the taxi taking information comprises boarding position information and alighting position information of the passengers; determining whether the order of taking a car is a cross-regional order or not according to the information of the getting-on position and the information of the getting-off position of the passenger; if so, searching at least one first candidate driver of the last picked-up order from a first area where the getting-off position of the passenger is located to a second area where the getting-on position of the passenger is located; and selecting an order taking driver for the cross-regional order according to the at least one found first candidate driver. By adopting the scheme, the order receiving efficiency of drivers in different places can be improved, and the transportation cost is saved. The application also provides an order distribution device, a server and a computer readable storage medium.

Description

Order allocation method and device, server and computer readable storage medium

Technical Field

The present application relates to the field of computer technologies, and in particular, to an order allocation method and apparatus, a server, and a computer-readable storage medium.

Background

Along with the rapid development of the internet technology, the popularization of taxi taking software brings great convenience to people going out. When a passenger needs to take a taxi, the passenger can select taxi taking information such as taxi taking time, a taxi type which the passenger wants to take, a taxi getting-on place and a taxi getting-off place through the taxi taking software client and submit the taxi taking information to the background server, so that an order is formed in the background server and can be issued to the client of a driver registered in the background server, and the driver can take an order at the client.

In order to better serve passengers, taxi taking software provides multiple travel modes for the passengers, such as: taxi, special car, express car and clockwise windmill. However, either of the above travel modes presents certain challenges for the distribution of cross-city orders. The driver usually has a familiar and preferred taxi taking range, and the driver usually chooses to return directly after completing the cross-city order rather than willing to take the order in another place due to the concerns of unfamiliarity with road conditions in another place, possible obstacles in language communication and the like.

Because the probability that drivers in different places across cities receive return orders is low, the drivers in different places can be caused to return without driving, the efficiency of receiving the orders by the drivers is reduced, and the transportation cost is wasted.

Disclosure of Invention

In view of the above, an object of the present invention is to provide an order allocation method and apparatus, so as to improve the efficiency of order taking for drivers at different places and save the transportation cost.

Mainly comprises the following aspects:

in a first aspect, an embodiment of the present application provides an order allocation method, including:

receiving taxi taking information of passengers, and generating taxi taking orders according to the taxi taking information, wherein the taxi taking information comprises boarding position information and alighting position information of the passengers;

determining whether the order of taking a car is a cross-regional order or not according to the information of the getting-on position and the information of the getting-off position of the passenger;

if so, searching at least one first candidate driver of the last picked-up order from a first area where the getting-off position of the passenger is located to a second area where the getting-on position of the passenger is located;

and selecting an order taking driver for the cross-regional order according to the at least one found first candidate driver.

With reference to the first aspect, an embodiment of the present application provides a first possible implementation manner of the first aspect, where before selecting an order pickup driver for the cross-regional order according to the at least one found first candidate driver, the method further includes:

selecting at least one second candidate driver from the local service drivers according to the current position of the local service driver in the second area and the boarding position of the passenger;

selecting an order taking driver for the cross-regional order according to the at least one found first candidate driver, comprising:

selecting an order taking driver for the cross-regional order from the at least one first candidate driver and the at least one second candidate driver based on the pickup attribute information of the at least one first candidate driver and the at least one second candidate driver and the demand for boarding time by the passenger.

With reference to the first possible implementation manner of the first aspect, an embodiment of the present application provides a second possible implementation manner of the first aspect, where the pickup attribute information includes one or more of the following information:

whether the return trip is the cross-region return trip or not; waiting time for the driver to empty; the time when the driver arrives at the boarding location for the passenger; the pick-up distance of the driver.

In combination with the second possible implementation manner of the first aspect, the present application provides an example of a third possible implementation manner of the first aspect, where, according to the pickup attribute information of the at least one first candidate driver and the at least one second candidate driver and the passenger's demand for boarding time, an order pickup driver is selected for the cross-regional order from the at least one first candidate driver and the at least one second candidate driver, and the method includes:

determining the weight of each type of pickup attribute information in the pickup attribute information according to the passenger requirement on the getting-on time;

determining scores for the at least one first candidate driver and the at least one second candidate driver based on the take over attribute information for the at least one first candidate driver and the at least one second candidate driver, and the weight for each take over attribute information;

selecting the driver with the highest score as the order taking driver of the cross-regional order.

With reference to the third possible implementation manner of the first aspect, an example of the present application provides a fourth possible implementation manner of the first aspect, where determining, according to a requirement of the passenger for boarding time, a weight of each type of pickup attribute information in the pickup attribute information includes:

if the passengers do not have real-time requirements on the boarding time, setting whether the weight of the transregional return pickup attribute information is larger than the weights of other pickup attribute information; and if the passenger has real-time requirement on the boarding time, setting whether the weight of the transregional return pickup attribute information is smaller than the weights of other pickup attribute information.

With reference to the first aspect, this application provides a fifth possible implementation manner of the first aspect, where the searching for a latest taken taxi-taking order before reaching the driver in the second area from the first area further includes:

searching candidate drivers with the number of orders served in the first area higher than a set threshold value;

the finding of the last order for taking a car is a driver who arrives from a first area where the getting-off position of the passenger is located to a second area where the getting-on position of the passenger is located, and includes:

and searching the driver who takes the taxi for the latest time from the searched candidate drivers as the driver who arrives at the second area from the first area.

With reference to the first aspect, this application provides a sixth possible implementation manner of the first aspect, where the searching for the last picked placing order as at least one first candidate driver from a first area where the getting-off position of the passenger is located to a second area where the getting-on position of the passenger is located includes:

determining the passenger's demand for boarding time;

and if the passenger does not have real-time requirement on the boarding time, selecting a driver with estimated pickup time meeting the reserved boarding time from a third candidate driver arriving at the second area from the first area as the latest service getting-on order and a fourth candidate driver arriving at the second area from the first area as the current idle state and the latest service getting-on order according to the reserved boarding time of the passenger.

With reference to the third or sixth possible implementation manner of the first aspect, this application example provides a seventh possible implementation manner of the first aspect, wherein the passenger's demand for boarding time is determined according to the following steps:

sending prompt information for selecting booking mode to the client of the passenger;

and determining the requirement of the passenger on the boarding time according to the feedback information of the client aiming at the prompt information.

With reference to the seventh possible implementation manner of the first aspect, an embodiment of the present application provides an eighth possible implementation manner of the first aspect, where the prompt information carries offer information for placing an order in a reservation manner and a reservation time option.

With reference to the sixth possible implementation manner of the first aspect, an embodiment of the present application provides a ninth possible implementation manner of the first aspect, where the method further includes:

and if no driver with the estimated drive receiving time in accordance with the reserved vehicle-entering time exists in the third candidate driver and the fourth candidate driver, selecting a driver with the estimated drive receiving time in accordance with the reserved vehicle-entering time from local service drivers in the second area.

With reference to the first or ninth possible implementation manner of the first aspect, an embodiment of the present application provides a tenth possible implementation manner of the first aspect, wherein the local service driver of the second area is determined according to the following steps:

determining local service drivers in the second area according to the proportion of the number of orders which are served by each driver in the second area to the total number of service orders; alternatively, the first and second electrodes may be,

and determining local service drivers in the second area according to the license plate number of the vehicle driven by each driver.

With reference to the first aspect, an embodiment of the present application provides an eleventh possible implementation manner of the first aspect, where the cross-region order refers to an order in which an entering location and a leaving location are located in different cities, or an order in which an entering location and a leaving location are located in different cluster regions; the clustering area is a position area formed by clustering travel places of different orders.

In a second aspect, an embodiment of the present application provides an order distribution apparatus, including:

the order generation module is used for receiving taxi taking information of passengers and generating taxi taking orders according to the taxi taking information, wherein the taxi taking information comprises boarding position information and alighting position information of the passengers;

the order determining module is used for determining whether the order for taking the car is a cross-regional order or not according to the getting-on position information and the getting-off position information of the passengers;

the first driver searching module is used for searching at least one first candidate driver from a first area where the getting-off position of the passenger is located to a second area where the getting-on position of the passenger is located for the latest getting-on order if the getting-on order is a cross-area order;

and the order distribution module is used for selecting an order taking driver for the cross-regional order according to the at least one found first candidate driver.

With reference to the second aspect, the present application provides a first possible implementation manner of the second aspect, where the method further includes:

the second driver searching module is used for selecting at least one second candidate driver from the local service drivers according to the current position of the local service driver in the second area and the boarding position of the passenger;

the order distribution module is specifically configured to select an order pickup driver for the cross-regional order from the at least one first candidate driver and the at least one second candidate driver according to the pickup attribute information of the at least one first candidate driver and the at least one second candidate driver and the demand of the passenger for the boarding time.

With reference to the first possible implementation manner of the second aspect, this example provides a second possible implementation manner of the second aspect, where the pickup attribute information includes one or more of the following information:

With reference to the second possible implementation manner of the second aspect, an embodiment of the present application provides a third possible implementation manner of the second aspect, where the order allocation module includes:

the weight determining unit is used for determining the weight of each type of pickup attribute information in the pickup attribute information according to the requirement of the passenger on the getting-on time;

a score determination unit for determining scores of the at least one first candidate driver and the at least one second candidate driver according to the take-over attribute information of the at least one first candidate driver and the at least one second candidate driver, and a weight of each take-over attribute information;

and the order distribution unit is used for selecting the driver with the highest score as the order taking driver of the cross-regional order.

With reference to the third possible implementation manner of the second aspect, this application provides a fourth possible implementation manner of the second aspect, where the weight determining unit is configured to:

With reference to the second aspect, embodiments of the present application provide a fifth possible implementation manner of the second aspect, where the method further includes:

the candidate driver searching module is used for searching candidate drivers with the number of orders which are served in the first area higher than a set threshold value;

the first driver searching module is specifically configured to search, from the searched candidate drivers, a driver who has arrived from the first area to the second area for a taxi taking order that has been received last time.

With reference to the second aspect, an embodiment of the present application provides a sixth possible implementation manner of the second aspect, where the first driver search module is specifically configured to:

determining the passenger's demand for boarding time;

With reference to the third or sixth possible implementation manner of the second aspect, an embodiment of the present application provides a seventh possible implementation manner of the second aspect, wherein the first driver searching module is specifically configured to:

With reference to the seventh possible implementation manner of the second aspect, an embodiment of the present application provides an eighth possible implementation manner of the second aspect, where the prompt information carries offer information of a subscription mode and a subscription time option.

With reference to the sixth possible implementation manner of the second aspect, the present application provides a ninth possible implementation manner of the second aspect, where the method further includes:

and the third driver searching module is used for selecting a driver with the estimated driving receiving time conforming to the reserved driving time from local service drivers in the second area if the third candidate driver and the fourth candidate driver do not have drivers with the estimated driving receiving time conforming to the reserved driving time.

With reference to the first or ninth possible implementation manner of the second aspect, the present application provides a tenth possible implementation manner of the second aspect, where the method further includes:

the driver determining module is used for determining local service drivers in the second area according to the proportion of the number of orders which are served by each driver in the second area to the total number of service orders; alternatively, the first and second electrodes may be,

With reference to the second aspect, an embodiment of the present application provides an eleventh possible implementation manner of the second aspect, where the cross-area order refers to an order in which an entering location and a leaving location are located in different cities, or an order in which an entering location and a leaving location are located in different cluster areas; the clustering area is a position area formed by clustering travel places of different orders.

In a third aspect, an embodiment of the present application further provides a server, 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 via the bus when the server runs, and the machine-readable instructions are executed by the processor to perform the steps of any one of the first aspect, the first possible implementation manner to the eleventh possible implementation manner 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 the computer program is executed by a processor to perform the steps in any one of the first aspect and the first possible implementation manner to the eleventh possible implementation manner of the first aspect.

By adopting the scheme, firstly, taxi taking information of passengers is received, taxi taking orders are generated according to the taxi taking information, and then whether the taxi taking orders are cross-regional orders or not is determined according to the boarding position information and the disembarking position information of the passengers; if yes, searching the latest order of taking a taxi as at least one first candidate driver from a first area where the passenger gets off the taxi to a second area where the passenger gets on the taxi, and finally selecting the order taking driver for the cross-area order according to the searched at least one first candidate driver. Therefore, for the cross-region order of the current passenger, the driver of taking the order is selected for the cross-region order by searching the order of taking the car which is taken for the last time as the first candidate driver which arrives at the second region from the first region, so that the probability that the driver at a different place (namely the first candidate driver) receives the return order of the cross-region can be improved, and the order taking efficiency of the driver is improved on the premise of saving the transport capacity cost. Under the condition that the driver order taking efficiency is improved, the willingness of the driver to accept the cross-regional order is strengthened, so that the order taking rate of the cross-regional order can be further improved, and the passenger's vehicle using experience 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 is a flow chart illustrating an order allocation method according to an embodiment of the present application;

FIG. 2 is a schematic diagram illustrating a driver search provided in an embodiment of the present application;

FIG. 3 is a flow chart of an order allocation method provided in the second embodiment of the present application;

fig. 4 is a flowchart illustrating an order allocation method provided in the third embodiment of the present application;

fig. 5 is a flowchart illustrating an order allocation method provided in the fifth embodiment of the present application;

fig. 6 is a schematic structural diagram illustrating an order distribution apparatus according to a sixth embodiment of the present application;

fig. 7 shows a schematic structural diagram of a server according to a seventh 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.

Considering that the cross-city order distribution is carried out according to the traditional distance, the probability that the cross-city remote driver receives the return order is far less than that the local driver receives the travel order, so that the remote driver can possibly empty and return, the order taking efficiency of the driver is reduced, and the transport capacity cost is wasted. Based on this, the embodiment of the present application provides an order allocation method and apparatus, a server, and a computer-readable storage medium, which may be applied to any scenario of allocating a cross-regional order, that is, applicable to both express trains, special trains, tailgating trains, and taxis, and the embodiment of the present application does not specifically limit this. The cross-region order may be an order spanning two cities (e.g., spanning beijing city and corridor city), or may be an order spanning a clustering region (e.g., spanning an administrative area, a hail lake area, and a fengtai area), which is not limited in this embodiment. This is described in more detail below by way of several examples.

Example one

As shown in fig. 1, which is a flowchart of an order allocation method provided in an embodiment of the present application, an execution subject of the method may be a background server of taxi taking software, and the order allocation method includes the following steps:

s101, receiving taxi taking information of passengers, and generating taxi taking orders according to the taxi taking information, wherein the taxi taking information comprises boarding position information and alighting position information of the passengers.

Here, when a passenger needs to take a car, the corresponding car taking information can be input on the client of the car taking software, so that the background server can generate a corresponding car taking order according to the car taking information. The client may be a mobile device client, a web client, or other clients, which are not limited in this embodiment of the present application. The taxi taking information may include not only boarding position information and disembarking position information of the passenger, but also other taxi taking information, such as the type of the passenger, fast driving, special driving, right-hand driving, etc., and reserved boarding time of the passenger.

In order to facilitate cross-regional order judgment and driver search, the getting-on position information and the getting-off position information are the two most key pieces of taxi taking information in the embodiment of the application. The boarding position information can be determined based on a positioning technology, and for example, after the taxi taking software is opened, the client can automatically position the current position of the passenger as the boarding position. Or, the passenger may select a specific boarding location on a map displayed by the client, or manually input boarding location information, such as manually input boarding location information of "capital airport", where the above-mentioned getting-off location information is mainly determined by the selection of the passenger on the map or by a manual input method, and is not described herein again.

S102, determining whether the order of taking the car is a cross-regional order or not according to the information of the getting-on position and the information of the getting-off position of the passenger.

Here, in consideration of a specific application scenario of the order allocation method provided in the embodiment of the present application, when determining whether a taxi-taking order is a cross-regional order, the method mainly depends on boarding position information of passengers and corresponding disembarking position information. In the embodiment of the application, whether the order of taking a car is a cross-regional order or not can be judged based on whether the getting-on position and the getting-off position are located in different cities or cluster regions or not. Firstly, when the getting-on position and the getting-off position belong to two different cities respectively, if the getting-on position is located in Beijing city and the getting-off position is located in corridor city, the corresponding order for taking a car can be determined as a cross-regional order; secondly, when the getting-on position and the getting-off position belong to two different clustering areas, determining cross-area orders according to different clustering modes, wherein one mode is that the travel places of different orders fall into different administrative areas for clustering, and if the getting-on position is located in the Beijing Haihai area and the getting-off position is located in the Beijing Tokyo area, the corresponding order for getting-on can be determined as the cross-area order; in addition, clustering can be performed by combining the actual situation of one area, for example, for the Beijing city, the clustering comprises the subzones of the Beijing city area, the Beijing suburb area (such as the cis-meaning area and the Chang-Ping area) and the like, so that clustering can be performed based on the fact that the travel places of different orders fall into different subzones, for example, the getting-on position is located in the Beijing city area, the getting-off position is located in the Chang-Ping area, and the corresponding order of taking a car can also be determined as a cross-area order; in addition, the clustering region can be divided according to the order quantity, for example, a region with a large order quantity is divided into a clustering region, and a region with a small order quantity is divided into a clustering region. In addition, the embodiment of the present application may also have other manners of determining whether the order of getting on the vehicle is a cross-regional order by using the getting on position information and the getting off position information, and the embodiment of the present application does not specifically limit this.

S103, if yes, at least one first candidate driver from a first area where the getting-off position of the passenger is located to a second area where the getting-on position of the passenger is located is searched for the order of the latest getting-on.

Here, after determining that the taxi taking order corresponding to the passenger is a cross-regional order, the background server may search for a driver meeting the requirement, and if a relevant driver is found, the number of the searched drivers may be one or multiple.

In the embodiment of the application, in order to improve the order taking efficiency of the return orders across the region, when a taxi taking order which is taken by a certain driver for the last time is in service or is finished, the driver can be found to be a selection object of the order taking driver of the current cross-region order. Based on this, in the embodiment of the present application, the cross-regional order of the passenger can be assigned to the last-picked order as the first candidate driver from the first region where the getting-off position of the passenger is located to the second region where the getting-on position of the passenger is located. Therefore, by searching for a different-place driver which can take the cross-regional order as a return order as much as possible, the problem of high idle driving return rate caused by direct return due to the fact that the probability of the different-place driver receiving the return order is far less than the probability of the local driver receiving the travel order when the cross-city order is distributed according to the nearest distance in the prior art is solved, the probability of the different-place driver (namely a first candidate driver) receiving the cross-regional return order is greatly improved, the order receiving efficiency of the driver is improved, and the transport cost is saved. Compared with the prior art that a driver directly returns, although the embodiment of the application takes a certain time to search the driver, the benefit brought by the long-distance property of the cross-regional order is objective, and a driver in a different place is willing to spend a certain waiting time to receive the return order, so that the order taking enthusiasm of the driver in the different place is greatly improved.

Fig. 2 is a schematic diagram of a search driver according to an embodiment of the present disclosure. The driver D0 will be in a waiting state after passing the historical passenger U1 from any one of the first zones Z1 where the first position P1 is located (including but not limited to the first position P1) to any one of the second zones Z2 where the second position P2 is located (including but not limited to the second position P2), or the driver D0 is in a service state (as shown in fig. 2 (a)) carrying the historical passenger U1 from any one of the first zones Z1 where the first position P1 is located (including but not limited to the first position P1) to any one of the second zones Z2 where the second position P2 is located (including but not limited to the second position P2). After the backstage server receives the taxi taking information sent by the current passenger U2 from the second position P2 to the first position P1, a corresponding taxi taking order is generated based on the taxi taking information, when the driver D0 is in a waiting state, the taxi taking order of the current passenger U2 can be distributed to the driver D0 in the second area Z2, when the driver D0 is in a service state, the taxi taking order of the current passenger U2 can be distributed to the driver D0 in the second area Z2 after the order in the service state is completed, so that the driver D0 sends the current passenger U2 from the second position P2 to the first position P1 (as shown in FIG. 2 (b)), the taxi taking efficiency of the driver is improved, and the capacity cost is saved.

S104, selecting an order taking driver for the cross-regional order according to the at least one searched first candidate driver.

Here, after the corresponding driver is located for the cross-regional order, the order pickup driver may be selected for the cross-regional order. In the embodiment of the application, order distribution can be mainly performed in a distribution mode so as to meet the requirements of the current application scene.

In consideration of the practical application scenario of the order distribution method provided by the embodiment of the application, although it is desirable to distribute the cross-regional order to the remote drivers to be returned as much as possible, the number of the remote drivers is directly reduced due to the sparsity of the cross-regional order. In order to ensure the vehicle utilization requirements of the passengers, the embodiment of the present application may select the order taking driver for the cross-regional order based on the found first candidate driver (i.e. the off-site driver), and may also select the order taking driver for the cross-regional order in combination with the second candidate driver (i.e. the local service driver), as in the following second embodiment, the process of selecting the order taking driver is performed.

Example two

As shown in fig. 3, the process for selecting a driver to receive an order provided in the second embodiment of the present application specifically includes:

s301, selecting at least one second candidate driver from the local service drivers according to the current position of the local service driver in the second area and the boarding position of the passenger;

s302, selecting an order taking driver for the cross-regional order from the at least one first candidate driver and the at least one second candidate driver according to the driving receiving attribute information of the at least one first candidate driver and the at least one second candidate driver and the requirement of the passenger on the boarding time.

Here, the second candidate driver selection based on local service drivers is primarily dependent on the current position of all local service drivers in the second area and the boarding location of the passengers. That is, in the embodiment of the present application, the distance between each local service driver and each passenger may be determined according to the current position of each local service driver and the boarding position of the passenger corresponding to the current trans-regional order, and when the distance is smaller than a preset distance threshold (e.g., 500m), at least one second candidate driver may be determined from all the local service drivers.

Based on the selected pickup attribute information of the first candidate driver and the second candidate driver and the passenger's demand for boarding time, the first candidate driver and the second candidate driver can be ranked to select a suitable pickup driver for the cross-regional order. According to the method and the device, whether the relevant driving receiving attribute information is cross-regional return, the waiting time of the driver in the empty state, the time of the driver reaching the passenger's driving position, the driving receiving distance of the driver and the like can be comprehensively considered, and the passenger's requirement on the driving receiving time can be comprehensively considered, so that the cross-city driver and the local service driver can be graded and sorted.

The requirement of the passenger for the boarding time mainly refers to whether the passenger has a real-time requirement on the boarding time, and the requirement has the real-time requirement, namely the requirement can indicate that the cross-regional order sent by the passenger is of a real-time type, and the requirement has no real-time requirement, namely the requirement can indicate that the cross-regional order sent by the passenger is of an appointment type.

In addition, the type of the cross-region order sent by the passenger can be intervened through the background server in the embodiment of the application. The method mainly considers a diversion link before issuing the order so as to find out a suitable driver in different places needing to return as much as possible by prolonging the effective time of the order. That is, when the background server acquires that the passenger has the intention of going out across the area, the background server may send a prompt message for selecting the booking mode to place an order to the client of the passenger, and encourage the passenger to place the order in the booking mode through the booking mode order placing preferential information and the booking time option carried in the prompt message, for example, the background server may send a prompt message of "asking whether the user wants to wait for 30 minutes, and if the user wants to wait for 30 minutes, the user may enjoy 8-fold preferential" to the client, and may determine that the passenger does not have a real-time requirement for the boarding time after receiving feedback information of the client for the prompt message, such as "wanting to wait for 30 minutes". Therefore, a suitable driver in different places needing to return can be found in a larger time range, the probability that the driver in different places across the city receives the return order is further improved, and the transportation cost is further saved.

It is worth noting that in order to reduce the complexity of the background server dispatch calculation, the conditions for determining the local service driver may be limited. In the embodiment of the application, firstly, the local service driver belonging to the second area can be determined by using the license plate number (namely the unique identification information of the vehicle) of the vehicle driven by each driver, for example, for two different cities of beijing city and corridor city, whether the local service driver falls into beijing city or corridor city can be determined by using the license plate number, and for two administrative areas of beijing hailake area and beijing chang plain area, whether the local service driver falls into beijing hailake area or beijing chang plain area can be determined by using the license plate number; secondly, the ratio of the number of orders that each driver has served in the second area to the total number of service orders may be used to determine the local service driver in the second area, for example, when the size of the number of orders is used to perform the partition of the cluster area to determine the cross-area order, in this embodiment of the present application, when the ratio of the number of orders that the driver has served in the second area to the total number of service orders is large, for example, when the number of orders is 70% of the total number of service orders, the corresponding driver may be determined as the local service driver in the second area, thereby saving the complexity of calculation.

EXAMPLE III

It is considered that in practical application scenarios, the demands of passengers on boarding time are different, and the different demands will directly influence the determination of the order taking driver. See the process of order-accepting driver selection in this third embodiment in detail.

As shown in fig. 4, the process for selecting a driver to receive an order provided in the third embodiment of the present application specifically includes the following steps:

s401, determining the weight of each type of pickup attribute information in the pickup attribute information according to the passenger requirement on the getting-on time;

s402, determining scores of the at least one first candidate driver and the at least one second candidate driver according to the driving receiving attribute information of the at least one first candidate driver and the at least one second candidate driver and the weight of each driving receiving attribute information;

and S403, selecting the driver with the highest score as the order taking driver of the cross-regional order.

The method comprises the steps of firstly determining the weight of each type of driving receiving attribute information in the driving receiving attribute information of the driver according to the requirement of a passenger for the getting-on time, then determining the score of a first candidate driver and the score of a second candidate driver based on the driving receiving attribute information of the first candidate driver and the second candidate driver and the corresponding weights thereof, and finally selecting the driver with the highest score from the scores of all the candidate drivers as the order receiving driver of the transregional order.

The weight of the pickup attribute information is directly determined by the requirement of the passenger on the boarding time, so that when the passenger has no real-time requirement on the boarding time, namely the passenger is not in hurry to return and is willing to select an appointment mode to place an order, the embodiment of the application can take the efficiency of the driver as a starting point, take the pickup attribute information of whether the driver returns across the region as the leading information, and the weight corresponding to whether the driver returns across the region can be larger than the weights of other pickup attribute information, so that the leading effect of the information of whether the driver returns across the region is highlighted, and the pickup probability of the pickup of the driver returning across the region can be conveniently selected to pick up the order so as to further improve the pickup probability of the driver returning across the region; when the passenger has a real-time requirement on the boarding time, namely, the passenger makes a sudden return trip and tries to select a real-time mode to place an order, the embodiment of the application takes the real-time vehicle using requirement of the passenger as a starting point, takes the driving receiving attribute information of whether the passenger is a cross-region return trip as auxiliary information, and the weight corresponding to whether the passenger is the cross-region return trip can be smaller than the weight of other driving receiving attribute information, so that the function of the information of whether the passenger is the cross-region return trip is weakened, a cross-region driver and a local service driver can be conveniently classified on the same horizontal line to receive the order, the real-time requirement of the passenger is met on the premise of not reducing the probability of receiving the return trip of the cross-region driver, and the user experience is better.

Example four

In the fourth embodiment of the present application, in order to reduce the complexity of the platform order dispatching calculation, the conditions for providing the return order may be limited, and the driver who uses the first area as the historical frequent activity area is searched, that is, when the driver is familiar with the first area, the driver provides the return cross-area order for the first area. That is, before executing step 103, it may first be determined whether the number of orders serviced by each driver in the first area of the passenger is greater than a set threshold to determine a candidate driver having the number of orders serviced in the first area greater than the set threshold, and then executing step 103 to find the latest order for taking a car as the driver arriving at the second area from the first area based on the determined candidate driver.

In consideration of practical application scenarios of the order allocation method provided in the embodiment of the present application, it is desirable to allocate the cross-regional order to the driver who wants to return to the different place as much as possible, and therefore, the order pickup driver can be directly selected for the cross-regional order based on the searched first candidate driver (i.e., the different place driver), where the search process of the first candidate driver is a key step for the order pickup driver selection. The finding process of the first candidate driver is explained in the following embodiment five.

EXAMPLE five

As shown in fig. 5, a method for finding a driver provided in the fifth embodiment of the present application specifically includes the following steps:

s501, determining the requirement of the passenger on the boarding time;

s502, if the passenger does not have real-time requirement on the boarding time, according to the reserved boarding time of the passenger, selecting a driver with the estimated pickup time meeting the reserved boarding time from a third candidate driver arriving at the second area from the first area as a taxi taking order which is in service for the last time and a fourth candidate driver arriving at the second area from the first area as a taxi taking order which is in an idle state and has finished service for the last time.

Here, it is first necessary to determine the passenger's need for boarding time, and then to determine the corresponding driver search strategy based on the different passenger needs for boarding time. Here, when the passenger has no real-time demand for the boarding time, the driver search may be performed from among the third candidate drivers being serviced or the fourth candidate drivers having completed the service based on the reserved boarding time of the passenger. For a third candidate driver who is in service, the latest service order of taking a taxi is from the first area to the second area, and for a fourth candidate driver who has completed service, the third candidate driver is currently in an idle state, and the latest service order of taking a taxi is from the first area to the second area, and the third candidate driver or the fourth candidate driver can be used as a corresponding driver searching object as long as the estimated taxi taking time can accord with the reserved taxi taking time of the passenger. For example, the time for completing the service is estimated to be 9:10 in the morning by a third candidate driver being served, which is estimated to take 30 minutes from the position where the service is completed to the boarding position of the passenger, that is, the third candidate driver is estimated to be 9:40 capable of reaching the boarding position of the passenger, the time for departing the fourth candidate driver in an idle state after the service is completed from the current parking position to the boarding position of the passenger is estimated to take 20 minutes, if the time for departing the fourth candidate driver from the time when the passenger leaves the bus to the boarding position of the passenger is 9:30, at the reserved boarding time 9:30 of the passenger, if the estimated pickup time and the reserved boarding time of the passenger are allowed to have a preset time difference (e.g., 10 minutes), then the fourth candidate driver and the third candidate driver can be both used as corresponding driver searching objects. The estimated pickup time can refer to a time length from a service order or a service-completed order to a boarding position of a passenger, and the time length is greatly influenced by traffic conditions of a driver in a pickup process and can be prolonged along with poor conditions such as traffic jam and the like.

In order to avoid the situation that the order receiving rate of drivers is low and the passenger experience is poor due to the fact that the estimated receiving time of the third candidate driver and the estimated receiving time of the fourth candidate driver cannot meet the order receiving time of the drivers in different places, the embodiment of the application can select the driver of which the estimated receiving time meets the reserved getting-on time from the local service drivers in the second area when the drivers of the third candidate driver and the fourth candidate driver do not have the drivers of which the estimated receiving time meets the reserved getting-on time. That is, the embodiment of the application can preferentially search the drivers meeting the requirements and needing to return from the drivers in different places, and if the corresponding drivers cannot be searched, the drivers capable of going out can be searched from the local service drivers, so that the order receiving efficiency of the drivers in different places during the return can be ensured, and meanwhile, the vehicle using experience of passengers can be further ensured.

It should be noted that, when the passenger has a real-time requirement for the boarding time, considering that a third candidate driver in service usually needs a certain time to complete the service and cannot ensure the real-time vehicle demand of the passenger, at this time, the fourth candidate driver that arrives from the first area to the second area and is currently in an idle state and has completed the service last time may be used as a corresponding driver search object, and a local service driver may also be used as a corresponding driver search object.

The requirement of the passenger for the boarding time mainly means whether the passenger has a real-time requirement for the boarding time, namely, the requirement can indicate that the cross-regional order sent by the passenger is of a real-time type, and the requirement does not have a real-time requirement, namely, the requirement can indicate that the cross-regional order sent by the passenger is of a reservation type.

In addition, in the fifth embodiment of the present application, the type of the cross-region order issued by the passenger may also be intervened by the background server. The method mainly considers a diversion link before issuing the order so as to find out a suitable driver in different places needing to return as much as possible by prolonging the effective time of the order. That is, when the background server acquires that the passenger has the intention of going out across the area, the background server may send a prompt message for selecting the booking mode to place an order to the client of the passenger, and encourage the passenger to place the order in the booking mode through the booking mode order placing preferential information and the booking time option carried in the prompt message, for example, the background server may send a prompt message of "whether the request is willing to wait for 30 minutes, and if the request is willing to wait for 30 minutes, the request can enjoy 8-fold preferential" to the client of the passenger, and may determine that the passenger has no real-time requirement on the boarding time after receiving the feedback information of the client for the prompt message, such as "willing to wait for 30 minutes". Therefore, a suitable driver in different places needing to return can be found in a larger time range, the probability that the driver in different places across the city receives the return order is further improved, and the transportation cost is further saved.

Similarly to the embodiment, in order to reduce the complexity of the background server dispatch calculation, the fifth embodiment of the present application may also limit the condition for determining the local service driver. In the embodiment of the application, firstly, the local service driver belonging to the second area can be determined by using the license plate number (namely the unique identification information of the vehicle) of the vehicle driven by each driver, for example, for two different cities of beijing city and corridor city, whether the local service driver falls into beijing city or corridor city can be determined by using the license plate number, and for two administrative areas of beijing hailake area and beijing chang plain area, whether the local service driver falls into beijing hailake area or beijing chang plain area can be determined by using the license plate number; secondly, the ratio of the number of orders that each driver has served in the second area to the total number of service orders may be used to determine the local service driver in the second area, for example, when the size of the number of orders is used to perform the partition of the cluster area to determine the cross-area order, in this embodiment of the present application, when the ratio of the number of orders that the driver has served in the second area to the total number of service orders is large, for example, when the number of orders is 70% of the total number of service orders, the corresponding driver may be determined as the local service driver in the second area, thereby saving the complexity of calculation.

EXAMPLE six

As shown in fig. 6, an order distribution apparatus provided in the sixth embodiment of the present application includes:

the order generation module 601 is configured to receive taxi taking information of a passenger and generate a taxi taking order according to the taxi taking information, where the taxi taking information includes boarding position information and disembarking position information of the passenger;

an order determining module 602, configured to determine whether the order for placing a car is a cross-regional order according to the getting-on position information and the getting-off position information of the passenger;

a first driver searching module 603, configured to search, if the order for taking a car is a cross-region order, at least one first candidate driver of a car taking order that has been received last time from a first region where the getting-off position of the passenger is located to a second region where the getting-on position of the passenger is located;

an order allocation module 604, configured to select an order pickup driver for the cross-regional order according to the at least one found first candidate driver.

In a specific implementation, the order distribution apparatus further includes:

a second driver searching module 605, configured to select at least one second candidate driver from the local service drivers in the second area according to a current location of the local service driver in the second area and the boarding location of the passenger;

the order allocation module 604 is specifically configured to select an order taking driver for the cross-regional order from the at least one first candidate driver and the at least one second candidate driver according to the pickup attribute information of the at least one first candidate driver and the at least one second candidate driver and the demand of the passenger for the boarding time.

Wherein the pickup property information comprises one or more of the following information:

In an implementation manner of the embodiment of the present application, the order allocation module 604 includes:

In another implementation manner of the embodiment of the present application, the weight determining unit is configured to:

In another implementation manner of the embodiment of the present application, the order distribution apparatus further includes:

a candidate driver searching module 606, configured to search for a candidate driver whose number of orders served in the first area is higher than a set threshold;

the first driver searching module 603 is specifically configured to search, from the found candidate drivers, a driver who has arrived from the first area to the second area for a taxi taking order that has been received last time.

In another implementation manner of the embodiment of the present application, the first driver searching module 603 is specifically configured to:

determining the passenger's demand for boarding time;

In a specific implementation, the first driver searching module 603 is specifically configured to:

The prompt information carries reservation mode ordering discount information and reservation time options.

a third driver searching module 607, configured to select, if there is no driver whose estimated time of receiving the vehicle matches the scheduled time of getting on the vehicle from the third candidate driver and the fourth candidate driver, a driver whose estimated time of receiving the vehicle matches the scheduled time of getting on the vehicle from the local service drivers in the second area.

In specific implementation, the cross-region order refers to an order in which the getting-on position and the getting-off position are located in different cities, or an order in which the getting-on position and the getting-off position are located in different clustering regions; the clustering area is a position area formed by clustering travel places of different orders.

EXAMPLE seven

As shown in fig. 7, a schematic structural diagram of a server provided in a seventh embodiment of the present application includes: a processor 701, a memory 702 and a bus 703, the memory 702 storing machine-readable instructions executable by the processor 701, the processor 701 and the memory 702 communicating via the bus 703 when the server is running, the machine-readable instructions when executed by the processor 701 performing the following:

In a specific implementation, in the processing executed by the processor 701, before selecting an order pickup driver for the cross-regional order according to the at least one found first candidate driver, the method further includes:

in the processing executed by the processor 701, selecting an order pickup driver for the cross-regional order according to the at least one first candidate driver found, includes:

In one implementation of this embodiment, the above processing performed by the processor 701, wherein the selecting, from the at least one first candidate driver and the at least one second candidate driver, an order pickup driver for the cross-regional order according to the pickup attribute information of the at least one first candidate driver and the at least one second candidate driver and the passenger's demand for boarding time, includes:

In another implementation manner of the embodiment of the present application, in the processing executed by the processor 701, determining a weight of each type of pickup attribute information in the pickup attribute information according to the passenger's demand for boarding time includes:

In another implementation manner of this embodiment of this application, the above processing performed by the processor 701, before searching for the latest taxi-taking order as the driver from the first area to the second area, further includes:

the processor 701 performs a process of finding a last picked order as a driver from a first area where the getting-off position of the passenger is located to a second area where the getting-on position of the passenger is located, including:

In yet another implementation manner of the embodiment of the present application, in the processing executed by the processor 701, the finding the latest picked-up order as at least one first candidate driver from a first area where the getting-off position of the passenger is located to a second area where the getting-on position of the passenger is located includes:

determining the passenger's demand for boarding time;

In a specific implementation, the processor 701 performs a process in which the passenger's demand for boarding time is determined according to the following steps:

In another implementation manner of this embodiment of this application, the processing performed by the processor 701 further includes:

In yet another implementation manner of the embodiment of the present application, in the processing performed by the processor 701, the local service driver of the second area is determined according to the following steps:

Example eight

An eighth 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 the processor 701, the step of the order allocation method corresponding to any one of the first to fifth embodiments is executed.

Specifically, the storage medium can be a general storage medium, such as a mobile disk, a hard disk, and the like, and when a computer program on the storage medium is run, the order distribution method can be executed, so that the problem that the existing cross-regional order is low in order taking efficiency is solved, and the effects of improving the order taking efficiency of the cross-regional order and saving the transportation cost are achieved.

The computer program product of the order allocation 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 method in the foregoing method embodiment, and specific implementation may refer to the method embodiment, and details are not described herein again.

It is clear to those skilled in the art that, for convenience and brevity of description, the specific working processes of the system and the apparatus described above may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.

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 computer readable storage medium. 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: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.

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

1. An order allocation method, comprising:

2. The method as claimed in claim 1, wherein before selecting a driver to pick up an order for the cross-regional order based on the at least one first candidate driver found, further comprising:

3. The method of claim 2, wherein the pickup attribute information comprises one or more of the following:

4. The method of claim 3, wherein selecting an pickup driver for the cross-regional order from the at least one first candidate driver and the at least one second candidate driver based on pickup attribute information of the at least one first candidate driver and the at least one second candidate driver, and the passenger's demand for pickup time, comprises:

5. The method of claim 4, wherein determining the weight for each of the pickup attribute information based on the passenger's demand for pickup time comprises:

6. The method of claim 1, wherein locating the most recent pick-up order before reaching the driver in the second zone from the first zone further comprises:

7. The method of claim 1, wherein said locating the most recently picked pick-up order as at least one first candidate driver arriving from a first area at the passenger's disembarking location to a second area at the passenger's boarding location comprises:

determining the passenger's demand for boarding time;

8. Method according to claim 4 or 7, characterized in that the passenger's need for boarding time is determined according to the following steps:

9. The method of claim 8, wherein the prompt message carries subscription mode ordering offer information and subscription time options.

10. The method of claim 7, further comprising:

11. The method of claim 2 or 10, wherein the local service driver of the second zone is determined according to the following steps:

12. The method of claim 1, wherein the cross-region order is an order in which the getting-on position and the getting-off position are located in different cities, or an order in which the getting-on position and the getting-off position are located in different clustering regions; the clustering area is a position area formed by clustering travel places of different orders.

13. An order distribution apparatus, comprising:

14. The apparatus of claim 13, further comprising:

15. The apparatus of claim 14, wherein the pickup attribute information comprises one or more of the following:

16. The apparatus of claim 15, wherein the order allocation module comprises:

17. The apparatus of claim 16, wherein the weight determination unit is configured to:

18. The apparatus of claim 13, further comprising:

19. The apparatus of claim 13, wherein the first driver lookup module is specifically configured to:

determining the passenger's demand for boarding time;

20. The apparatus of claim 16 or 19, wherein the first driver lookup module is specifically configured to:

21. The apparatus of claim 20, wherein the prompt message carries subscription-mode ordering preference information and subscription time options.

22. The apparatus of claim 19, further comprising:

23. The apparatus of claim 14 or 22, further comprising:

24. The apparatus of claim 13, wherein the cross-region order is an order in which the getting-on position and the getting-off position are located in different cities, or an order in which the getting-on position and the getting-off position are located in different clustering regions; the clustering area is a position area formed by clustering travel places of different orders.

25. A server, comprising: a processor, a memory and a bus, the memory storing machine readable instructions executable by the processor, the processor and the memory communicating over the bus when the server is running, the machine readable instructions when executed by the processor performing the steps of the order allocation of any of claims 1 to 12.

26. A computer-readable storage medium, having stored thereon a computer program which, when executed by a processor, performs the steps of the order allocation method of any one of claims 1 to 12.