WO2021031634A1 - Continuous order dispatching method and apparatus for advance order based on real-time one-way vehicle - Google Patents

Abstract

Disclosed are a continuous order dispatching method and apparatus for an advance order based on a real-time one-way vehicle. The method and apparatus are applied to a server of a traveling taxi-hailing system. The method specifically comprises: acquiring an advance traveling order (S1); acquiring a plurality of real-time one-way vehicles (S2); determining that the advance traveling order is a long-time advance order or a short-time advance order, and for the long-time advance order, pushing same to the plurality of real-time one-way vehicles by means of broadcasting (S3); carrying out optimization calculation on the short-time advance order and vehicle information of the real-time one-way vehicles by means of a greedy algorithm, so as to obtain a target vehicle from among the plurality of real-time one-way vehicles (S4); and sending a plurality of short-time advance orders that do not conflict with each other to the target vehicle (S5). It can be seen from the above-mentioned solution that the current real-time one-way vehicle can receive other orders even if the vehicle has received an advance traveling order, such that the order receiving rate is improved, thereby improving the usage experience of a user.

Description

Method and device for dispatching an appointment single-loop order based on a real-time single-trip vehicle Technical field

The invention relates to the technical field of online car-hailing, and in particular to a method and device for dispatching a single-chain order based on a real-time single-trip vehicle.

Background technique

Generally speaking, taxis can be divided into two types: cruise taxis and online booking taxis. Cruising taxis means that they are usually on the road and stop when they are called to provide transportation services for passengers; while booking taxis online is to pick up orders through the Internet. Provide transportation services for passengers in a single way. Online car-hailing is short for online car rental.

When in peak hours such as commuting, almost all vehicles are in service, and for booking travel orders that do not require immediate service, if the corresponding real-time single-trip vehicle can accept multiple such orders, it is bound to increase The order acceptance rate of booking travel orders can improve the service experience of users.

Summary of the invention

In view of this, the present invention provides a method and device for dispatching a single-chain order based on a real-time single-journey vehicle to improve the user's service experience.

In order to solve the above problems, the present invention discloses a reservation single-chain dispatch method based on real-time single-trip vehicles, which is applied to a server of a travel taxi system, and the reservation single-chain dispatch method includes the steps:

Obtain travel reservation orders;

Acquire multiple real-time single-trip vehicles;

Determine whether the travel reservation order is a long-term reservation form or a short-term reservation form;

If the travel reservation order is the long-term reservation form, then the long-term reservation form will be pushed to the multiple real-time single-trip vehicles in the form of broadcast, and the long-term reservations that are not received within the preset time period will be pushed The order is returned to the order pool of the server;

If the travel reservation order is the short-term reservation order, the short-term reservation order and the vehicle information of the real-time single-trip vehicle are optimized through a greedy algorithm, and the vehicle information is obtained from the multiple real-time single-trip vehicles Target vehicle

A plurality of short-term appointment orders that do not conflict with each other are sent to the target vehicle.

Optionally, said obtaining real-time travel orders includes:

Pull all travel orders within the preset time period from the order pool of the server every preset time period;

The scheduled travel order is selected from all the travel orders according to the time parameter of the travel order.

Optionally, the acquiring multiple real-time single-trip vehicles includes:

Acquiring all vehicles within the preset range according to the location information of the travel reservation order;

The real-time single-stroke vehicle is selected from the passenger-carrying state of each vehicle.

Optionally, the acquiring multiple real-time single-trip vehicles further includes the steps:

From the plurality of real-time single-trip vehicles, the real-time single-trip vehicles whose type does not match the specified vehicle type of the short-term reservation form are excluded.

Optionally, the acquiring multiple real-time single-trip vehicles further includes the steps:

From the plurality of real-time single-trip vehicles, the real-time single-trip vehicles whose drivers have made a predetermined rejection behavior are excluded.

Optionally, the sending multiple short-term appointment orders that do not conflict with each other to the target vehicle includes:

If there is only a current real-time order in the target vehicle, sending a short-term reservation order whose start time is after the order end time of the current real-time order to the target vehicle;

If the target vehicle has the current real-time order and has accepted one or more of the short-term appointment orders, the required time will not conflict with the time of the current real-time order and the accepted short-term appointment order. The time reservation form is sent to the target vehicle.

Optionally, the optimization calculation of the vehicle information of the short-term reservation form and the real-time single-trip vehicle through a greedy algorithm includes the steps:

Construct a vehicle-order matrix. The vehicle-order matrix includes a vehicle set and an appointment order set, and also includes the distance between each real-time single-trip vehicle in the vehicle set and each short-term appointment order in the appointment order set A parameter, the distance parameter is the reciprocal of the distance between the current position of the real-time single-journey vehicle and the departure position of the short-term reservation order after normalization processing;

For each of the short-term appointment orders, the target vehicle is selected from the vehicle set by using a greedy algorithm.

A device for dispatching a single-loop order based on a real-time single-trip vehicle is applied to a server of a ride-hailing system. The device for dispatching a single-loop single-loop order in a reservation includes:

The order obtaining module is configured to obtain travel reservation orders;

The vehicle acquisition module is configured to acquire multiple real-time single-trip vehicles;

The first push module is configured to determine whether the scheduled travel order is a long-term reservation order or a short-term reservation order; if the scheduled travel order is the long-term reservation order, broadcast the long-term reservation order Push to the multiple real-time single-trip vehicles, and return long-term appointment orders that are not received within a preset time period to the order pool of the server;

The optimization calculation module is configured to perform optimization calculations on the short-term reservation order and the vehicle information of the real-time single-trip vehicle through a greedy algorithm if the travel reservation order is the short-term reservation order, from the multiple Obtain the target vehicle from one real-time single-trip vehicle;

The second pushing module is configured to send multiple short-term appointment orders that do not conflict with each other to the target vehicle.

Optionally, the order acquisition module includes:

The first obtaining unit is configured to pull all travel orders within the preset time period from the order pool of the server every preset time period;

The first filtering unit is configured to select the scheduled travel order from all travel orders according to the time parameter of the travel order.

Optionally, the vehicle acquisition module includes:

The second acquiring unit is configured to acquire all vehicles within the preset range according to the location information of the scheduled travel order;

The second filtering unit is configured to select the real-time single-stroke vehicle according to the passenger loading status of each vehicle.

Optionally, the vehicle acquisition module further includes:

The first filtering module is configured to exclude, from the plurality of real-time single-trip vehicles, the real-time single-trip vehicles whose types do not match the designated vehicle type of the short-term reservation form.

Optionally, the vehicle acquisition module further includes:

The second filtering module is configured to exclude, from the plurality of real-time single-trip vehicles, real-time single-trip vehicles whose drivers have made a predetermined rejection behavior.

Optionally, the second pushing module includes:

The first pushing unit is configured to, if only the current real-time order exists in the target vehicle, send the short-term reservation order whose start time is after the order end time of the current real-time order to the target vehicle;

The second pushing unit is configured to, if the target vehicle has the current real-time order and has accepted one or more of the short-term reservations, compare the required time with the current real-time order and the accepted short-time order The short-term appointment form in which the time of the appointment form does not conflict is sent to the target vehicle.

It can be seen from the above technical solutions that the present invention provides a method and device for dispatching a single reservation order based on a real-time single-trip vehicle. The method and device are applied to the server of the travel taxi system, specifically to obtain reservation travel orders; A real-time single-trip vehicle; judge whether the reservation travel order is a long-term reservation or a short-term reservation. For long-term reservations, broadcast to multiple real-time single-trip vehicles; use a greedy algorithm for short-term reservations and real-time single-trips The vehicle information of the vehicle is optimized and calculated, and the target vehicle is obtained from multiple real-time single-trip vehicles; multiple short-term appointment orders that do not conflict with each other are sent to the target vehicle. It can be seen from the above solution that even when the current real-time single-journey vehicle has accepted the reservation travel order, the order can be accepted again, which increases the order acceptance rate, thereby improving the user experience.

In addition, this application uses a greedy algorithm to select the corresponding vehicle from the vehicle set as the target vehicle to dispatch the order for the corresponding short-term appointment order, instead of simply dispatching the order based on the distance to the vehicle, thereby avoiding the problem of no car to dispatch. , Improve overall efficiency, and correspondingly improve user service experience. Moreover, before using the greedy algorithm for calculation, the vehicles whose models do not match and the vehicles whose drivers have made the prescribed rejection behavior are also eliminated, which effectively improves the efficiency of the optimization calculation.

Description of the drawings

In order to explain the embodiments of the present invention or the technical solutions in the prior art more clearly, the following will briefly introduce the drawings that need to be used in the description of the embodiments or the prior art. Obviously, the drawings in the following description are only These are some embodiments of the present invention. For those of ordinary skill in the art, other drawings can be obtained based on these drawings without creative work.

Fig. 1 is a flowchart of a method for dispatching a single-chain order based on a real-time single-trip vehicle according to an embodiment of the application;

Fig. 2 is a block diagram of a device for dispatching a single-chain order based on a real-time single-trip vehicle according to an embodiment of the application.

detailed description

The technical solutions in the embodiments of the present invention will be clearly and completely described below in conjunction with the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are only a part of the embodiments of the present invention, rather than all the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those of ordinary skill in the art without creative work shall fall within the protection scope of the present invention.

Example one

Fig. 1 is a flow chart of a method for dispatching a single-chain order based on a real-time single-trip vehicle according to an embodiment of the application.

As shown in FIG. 1, the method for dispatching orders in a chain of reservations provided by this embodiment is applied to a server of a travel taxi system, and is used to place orders for passengers and provide an order dispatching solution to taxis. The real-time single-trip vehicle here refers to a vehicle that belongs to the contracted vehicle of the ride-hailing system and is in service at the current moment. The vehicle here is limited to electric vehicles, and may also include hybrid vehicles. The method for dispatching an appointment order chain specifically includes the following steps:

S1. Obtain an appointment travel order.

The travel reservation order here refers to a travel order that passengers who need to provide car rental services currently issue and need to get car rental services in the future. When passengers place corresponding orders, they usually use the mobile terminal to send electronic information to the server of the ride-hailing system. The reservation travel order will include corresponding location information, and the location information will indicate the specific location of the passenger who issued the travel order.

Since the travel orders received by the server include real-time travel orders and scheduled travel orders, obtaining the scheduled travel orders here is implemented through the following operations:

First, pull all travel orders generated during this period from the order pool of the above server at a preset time interval, such as every 2 seconds, which will include real-time travel orders and scheduled travel orders. For specific travel orders, Whether it is a real-time travel order or an appointment travel order can be determined by the additional information of the order itself or the type of the order itself; when all travel orders within this period of time are pulled, the judgment is made based on the additional information in the travel order or the type of the order itself. Select all scheduled travel orders from it.

S2. Acquire multiple real-time single-trip vehicles.

That is, in the case of determining the location information for issuing the travel reservation order, obtain real-time traveling vehicles within a preset range based on the location information according to the location information, that is, vehicles that are serving passengers. The preset range may be determined according to actual conditions, such as a block with the location information as a basic point, a range within a certain spatial scale, or a city.

In the process of obtaining multiple real-time single-trip vehicles, first obtain all the vehicles within the preset range according to the location information, that is, obtain all the vehicles within the preset range that have contracted with the ride-hailing system; and then according to the service of each vehicle The status is judged, and the real-time single-stroke vehicle is selected from it.

S3. Judge the long- and short-term appointment orders, and broadcast the long-term appointment orders.

In addition, the acquisition of real-time single-trip vehicles in this application also includes the following steps, and the order of the following steps does not represent the order of the steps.

S01. Eliminate real-time single-trip vehicles whose type does not match the specified vehicle type of the reservation travel order.

Generally speaking, sometimes the passenger’s travel order will provide the vehicle type he needs, that is, the vehicle type requirement is included. If the passenger’s demand cannot be met, the passenger’s experience will be reduced. Therefore, when confirming all real-time orders After the itinerary vehicle, filter all real-time single-trip vehicles according to the specified vehicle type in the travel order. If one or some vehicles do not match the specified vehicle type, it will be removed and then optimized calculations will be performed to avoid the passengers from clarifying The rejected models participate in the calculation.

S02. Exclude real-time single-trip vehicles whose drivers have made pre-determined rejections.

That is, after determining all real-time single-trip vehicles, if the driver of the vehicle has made a predetermined refusal, such as the previous refusal without reason or made a limited number of refusals within a certain period of time, you can The vehicle is eliminated, and then optimized calculations are performed, so as to avoid the problematic vehicle being pushed to the reservation travel order and affecting the passenger's car.

That is, after determining the real-time single-trip vehicle, determine whether the corresponding reservation travel order is a long-term reservation or a short-term reservation by judging the reservation time information. The two are divided according to the reservation time information pointed to by the reservation time information. The length of the time, that is, the length of the appointment order is determined by the preset time threshold. The time threshold can be one day or one week. The time threshold determined according to this principle is within the protection scope of this application.

For the long-term appointment order, because there will be no conflict with the current order status of the real-time single-trip vehicle, it can be pushed to all real-time single-trip vehicles through broadcast, and the driver of the real-time single-trip vehicle can accept or reject the order at any time single.

In addition, for the broadcasted long-term reservation order, if the order is not received within the preset time period, such as 1 second, 10 seconds, 60 seconds, 100 seconds, or the duration between the above values or other durations, it will not be received. The long-term appointment order received is returned to the order pool of the server.

S4. Match the target vehicle according to the greedy algorithm.

That is, according to the greedy algorithm, the reservation travel order and the selected real-time single-trip vehicle vehicle information are optimized, and the real-time single-trip vehicle that best matches the short-term reservation order is found from multiple real-time single-trip vehicles as the target vehicle .

Specifically, it means that the vehicle-order matrix is first constructed. When constructing the vehicle-order matrix, multiple short-term appointment orders are first obtained to form an appointment order set O. For each short-term appointment order o, according to its departure The current positions of multiple real-time single-stroke vehicles d based on the position distance are selected to obtain the candidate vehicle set D. The reservation form set and the vehicle set are taken as two dimensions to form the vehicle-order matrix. The matrix also includes the reciprocal of the distance between the departure position of each short-term reservation form and the current position of each real-time single-trip vehicle. After multiple countdowns, normalize them as the distance parameter v between the corresponding short-term reservation and the corresponding real-time single-trip vehicle, as shown in Table 1.

To	d1	d2	d3	d4	d5	d6
o1	v=0.2	0.5	0.6	0.8	0.7	0.8
o2	0.1	0.6	0.7	0.7	0.2	0.2
o3	0.6	0.4	0.5	0.3	0.1	0.7

Table 1

After obtaining the above vehicle-order matrix, for each short-term reservation, use the greedy algorithm to select from the vehicle collection, that is, use the greedy algorithm to compare the corresponding short-term reservation and the corresponding real-time single-trip vehicle and the distance between the two The parameters are calculated to obtain the target vehicle.

Specifically, first start filtering from the order of o1, select d4(0.8), d6(0.8); then continue to select o2, select d3(0.7), d4(0.7), but d4 has been selected by o1, and then Choose d2(0.6); finally choose o3, choose d1(0.6), d6(0.7), there is no conflict.

Greedy algorithm means that the overall optimal solution of the problem can be achieved through a series of local optimal choices, namely greedy choices. This is the first basic element for the greedy algorithm to be feasible, and it is also the main difference between the greedy algorithm and the dynamic programming algorithm.

Greedy algorithm uses a top-down, iterative method to make successive choices. Every time a greedy choice is made, the problem is reduced to a smaller sub-problem. For a specific problem, to determine whether it has the nature of greedy choice, we must prove that the greedy choice made at each step can finally get the optimal solution of the problem.

Usually it can be proved that an overall optimal solution of the problem starts from the greedy choice, and after making the greedy choice, the original problem is reduced to a similar sub-problem on a smaller scale. Then, use mathematical induction to prove that through each step of greedy selection, you can finally get an overall optimal solution to the problem.

S5. Send a non-conflicting short-term appointment form to the target vehicle.

After the target vehicle is determined, multiple non-conflicting short-term appointment orders are sent to the target vehicle, so that the target vehicle serves the passenger who sent the order. Non-conflict here means that the time of the short-term appointment order does not conflict. Here, sending to the target vehicle actually refers to sending the real-time travel order to the mobile device on the target vehicle, such as the mobile phone held by the driver or the car machine of the vehicle.

Specifically, first, if a target vehicle only has a real-time order, that is, it is serving the corresponding passengers and has not accepted other reservations, then the short-term reservations whose starting time is after the real-time order are pushed to the corresponding Target vehicle

Secondly, if there are not only real-time orders, but also one or more short-term appointment orders, the time gap between the real-time order and the first appointment order, and the time gap between the appointment orders Calculate, if there is a short-term appointment order that can meet the above time gap at this time, the short-term appointment order will be pushed to the target vehicle, or the short-term appointment order whose starting time is after the last short-term appointment order will be pushed to The target vehicle.

It can be seen from the above technical solutions that this embodiment provides a method for dispatching a single reservation order based on real-time single-trip vehicles. The method is applied to the server of the travel taxi system, specifically to obtain reservation travel orders; to obtain multiple real-time orders. Itinerary vehicles; judge whether the reservation travel order is a long-term reservation order or a short-term reservation order. For long-term reservation orders, broadcast to multiple real-time single-trip vehicles through broadcast; use greedy algorithm for short-time reservation orders and real-time single-trip vehicles vehicles The information is optimized and calculated, and the target vehicle is obtained from multiple real-time single-trip vehicles; multiple short-term appointment orders that do not conflict with each other are sent to the target vehicle. It can be seen from the above solution that even when the current real-time single-journey vehicle has accepted the reservation travel order, the order can be accepted again, which increases the order acceptance rate, thereby improving the user experience.

In addition, this application uses a greedy algorithm to select the corresponding vehicle from the vehicle set as the target vehicle to dispatch the order for the corresponding short-term appointment order, instead of simply dispatching the order based on the distance to the vehicle, thereby avoiding the problem of no car to dispatch. , Improve the overall efficiency, and correspondingly improve the user's service experience. Moreover, before using the greedy algorithm for calculation, the vehicles whose models do not match and the vehicles whose drivers have made the prescribed rejection behavior are also eliminated, which effectively improves the efficiency of the optimization calculation.

Example two

FIG. 2 is a block diagram of a device for dispatching a single-chain order based on a real-time single-trip vehicle according to an embodiment of the application.

As shown in Figure 2, the reservation order chain dispatching device provided by this embodiment is applied to the server of the ride-hailing system, which can be understood as the actual electronic device or the functional module of the server, which is used to place orders for passengers and dispatch orders to taxis Provide dispatch plan. The real-time single-trip vehicle here refers to the contracted vehicle that belongs to the ride-hailing system for the trip and is currently in service. The device for dispatching an appointment order chain specifically includes an order acquisition module 10, a vehicle acquisition module 20, a first pushing module 30, an optimization calculation module 40, and a second pushing module 50.

The order obtaining module 10 is used to obtain a travel reservation order.

The travel reservation order here refers to a travel order that is currently issued by passengers who need to provide car rental services and needs to get car rental services in the future. When passengers place corresponding orders, they generally use the mobile terminal to send electronic information to the server of the ride-hailing system. The reservation travel order will include corresponding location information, and the location information will indicate the specific location of the passenger who issued the travel order.

Since the travel orders received by the server include real-time travel orders and scheduled travel orders, the order acquisition module here specifically includes a first acquisition unit and a first filter unit.

The first acquisition unit is used to pull all travel orders generated during this period of time from the order pool of the server at a preset time interval, such as every 2 seconds, including real-time travel orders and scheduled travel orders. Whether the specific travel order is a real-time travel order or a reservation travel order can be determined by the additional information of the reservation order itself or the type of the order itself; the first filter unit is used when the first acquisition unit pulls all travel orders within this period of time, Judge based on the additional information in the travel order or the type of the order itself, and select all scheduled travel orders from the judgment.

The vehicle acquisition module 20 is configured to acquire multiple real-time single-stroke vehicles within a preset range according to location information.

That is, in the case where the location information for issuing the travel reservation order is determined, a real-time single-trip vehicle within a preset range based on the location information is obtained according to the location information, that is, a vehicle that is serving passengers. The preset range may be determined according to actual conditions, such as a block with the location information as a basic point, a range within a certain spatial scale, or a city.

The module includes a second acquiring unit and a second filtering unit. In the process of acquiring multiple real-time single-trip vehicles, the second acquiring unit is used to acquire all vehicles within the preset range according to the location information, that is, to acquire the preset range All the vehicles contracted with the ride-hailing system; the second filter unit is used to judge according to the service status of each vehicle, and select real-time single-trip vehicles from it.

In addition, the vehicle acquisition module in this application further includes a third filter unit and/or a fourth filter unit.

The third filtering unit is used to eliminate real-time single-trip vehicles whose type does not match the specified vehicle type of the reserved travel order before the optimization calculation module performs calculation according to the greedy algorithm.

Generally speaking, sometimes the passenger’s travel order will provide the vehicle type he needs, that is, the vehicle type requirement is included. If the passenger’s demand cannot be met, the passenger’s experience will be reduced. Therefore, when confirming all real-time orders After the itinerary vehicle, filter all real-time single-trip vehicles according to the specified vehicle type in the travel order. If one or some vehicles do not match the specified vehicle type, it will be removed and then optimized calculations will be performed to avoid the passengers from clarifying The rejected models participate in the calculation.

The fourth filtering unit is used to eliminate real-time single-trip vehicles whose drivers have issued rejection information before the optimization calculation module performs calculations according to the greedy algorithm.

That is, after determining all real-time single-trip vehicles, if the driver of the vehicle has a history of rejection, such as the last rejection or a limited number of rejections within a certain period of time, the vehicle can be removed at this time, and then Optimized calculations are carried out to prevent problematic vehicles from being pushed to the scheduled travel order and affecting the use of passengers.

The first push module 30 is used for judging the long- and short-term appointment orders, and broadcast and push the long-term appointment orders.

That is, after determining the real-time single-trip vehicle, determine whether the corresponding reservation travel order is a long-term reservation or a short-term reservation by judging the reservation time information. The two are divided according to the reservation time information pointed to by the reservation time information. The length of the time, that is, the length of the appointment order is determined by the preset time threshold. The time threshold can be one day or one week. The time threshold determined according to this principle is within the protection scope of this application.

For the long-term appointment order, because there will be no conflict with the current order status of the real-time single-trip vehicle, it can be pushed to all real-time single-trip vehicles through broadcast, and the driver of the real-time single-trip vehicle can accept or reject the order at any time single.

In addition, for the broadcasted long-term reservation order, if the order is not received within the preset time period, such as 1 second, 10 seconds, 60 seconds, 100 seconds, or the duration between the above values or other durations, it will not be received. The long-term appointment order received is returned to the order pool of the server.

The optimization calculation module 40 is used for calculating according to the greedy algorithm to obtain the target vehicle.

That is, according to the greedy algorithm, the reservation travel order and the selected real-time single-trip vehicle information are optimized, and the real-time single-trip vehicle that best matches the real-time single-trip vehicle is found as the target vehicle from multiple real-time single-trip vehicles.

The second pushing module 50 is used to sequentially send non-conflicting short-term appointment orders to the target vehicle.

After the target vehicle is determined, a plurality of non-conflicting short-term appointment orders are sent to the target vehicle in turn, so that the target vehicle serves the passenger who sent the order. Non-conflict here means that the time of the short-term appointment order does not conflict. Here, sending to the target vehicle actually refers to sending the real-time travel order to the mobile device on the target vehicle, such as a mobile phone held by the driver.

Specifically, the module includes a first push unit and a second push unit. The first push unit is used when a target vehicle has only real-time orders, that is, when a target vehicle is serving the corresponding passengers and no other reservation orders are accepted. Push the short-term appointment order with the start time after the real-time order to the corresponding target vehicle;

The second push unit is used at this time when the target vehicle not only has a real-time order, but also has one or more short-term appointment orders, the time gap between the real-time order and the first appointment order, and the appointment order Calculate the time gap between them. If there is a short-term reservation that can meet the above-mentioned time gap, push the short-term reservation to the target vehicle, or set the starting time after the last short-term reservation. The short-term appointment form is pushed to the target vehicle.

It can be seen from the above technical solutions that this embodiment provides a reservation order chain dispatching device based on real-time single-trip vehicles, which is applied to the server of the travel taxi system, specifically to obtain reservation travel orders; to obtain multiple real-time orders Itinerary vehicles; judge whether the reservation travel order is a long-term reservation order or a short-term reservation order. For long-term reservation orders, broadcast to multiple real-time single-trip vehicles through broadcast; use greedy algorithm for short-time reservation orders and real-time single-trip vehicles vehicles The information is optimized and calculated, and the target vehicle is obtained from multiple real-time single-trip vehicles; multiple short-term appointment orders that do not conflict with each other are sent to the target vehicle. It can be seen from the above solution that even when the current real-time single-journey vehicle has accepted the reservation travel order, the order can be accepted again, which increases the order acceptance rate, thereby improving the user experience.

In addition, this application uses a greedy algorithm to select the corresponding vehicle from the vehicle set as the target vehicle to dispatch the order for the corresponding short-term appointment order, instead of simply dispatching the order based on the distance to the vehicle, thereby avoiding the problem of no car to dispatch. , Improve the overall efficiency, and correspondingly improve the user's service experience. Moreover, before using the greedy algorithm for calculation, the vehicles whose models do not match and the vehicles whose drivers have made the prescribed rejection behavior are also eliminated, which effectively improves the efficiency of the optimization calculation.

The various embodiments in this specification are described in a progressive manner. Each embodiment focuses on the differences from other embodiments, and the same or similar parts between the various embodiments can be referred to each other.

Those skilled in the art should understand that the embodiments of the embodiments of the present invention may be provided as methods, devices, or computer program products. Therefore, the embodiments of the present invention may adopt the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware. Moreover, the embodiments of the present invention may take the form of computer program products implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program codes.

The embodiments of the present invention are described with reference to the flowcharts and/or block diagrams of the methods, terminal devices (systems), and computer program products according to the embodiments of the present invention. It should be understood that each process and/or block in the flowchart and/or block diagram, and the combination of processes and/or blocks in the flowchart and/or block diagram can be implemented by computer program instructions. These computer program instructions can be provided to the processors of general-purpose computers, special-purpose computers, embedded processors, or other programmable data processing terminal equipment to generate a machine, so that instructions executed by the processor of the computer or other programmable data processing terminal equipment A device for realizing the functions specified in one flow or multiple flows in the flowchart and/or one block or multiple blocks in the block diagram is generated.

These computer program instructions can also be stored in a computer-readable memory that can guide a computer or other programmable data processing terminal equipment to work in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture including the instruction device. The instruction device implements the functions specified in one process or multiple processes in the flowchart and/or one block or multiple blocks in the block diagram.

These computer program instructions can also be loaded on a computer or other programmable data processing terminal equipment, so that a series of operation steps are executed on the computer or other programmable terminal equipment to produce computer-implemented processing, so that the computer or other programmable terminal equipment The instructions executed above provide steps for implementing functions specified in one or more processes in the flowchart and/or one or more blocks in the block diagram.

Although the preferred embodiments of the embodiments of the present invention have been described, those skilled in the art can make additional changes and modifications to these embodiments once they learn the basic creative concept. Therefore, the appended claims are intended to be interpreted as including the preferred embodiments and all changes and modifications falling within the scope of the embodiments of the present invention.

Finally, it should be noted that in this article, relational terms such as first and second are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply these entities Or there is any such actual relationship or sequence between operations. Moreover, the terms "include", "include" or any other variants thereof are intended to cover non-exclusive inclusion, so that a process, method, article, or terminal device that includes a series of elements includes not only those elements, but also those that are not explicitly listed. Other elements listed, or also include elements inherent to this process, method, article, or terminal device. If there are no more restrictions, the element defined by the sentence "including a..." does not exclude the existence of other same elements in the process, method, article or terminal device that includes the element.

The technical solutions provided by the present invention are described in detail above, and specific examples are used in this article to illustrate the principles and implementations of the present invention. The descriptions of the above embodiments are only used to help understand the methods and core ideas of the present invention; At the same time, for those of ordinary skill in the art, according to the idea of the present invention, there will be changes in the specific implementation and the scope of application. In summary, the content of this specification should not be construed as limiting the present invention.

Claims (13)

1. A reservation single-chain dispatch method based on real-time single-journey vehicles, applied to a server of a travel taxi system, is characterized in that the reservation single-chain dispatch method includes the steps:

   Obtain travel reservation orders;

   Acquire multiple real-time single-trip vehicles;

   Determine whether the travel reservation order is a long-term reservation form or a short-term reservation form;

   If the travel reservation order is the long-term reservation form, then the long-term reservation form will be pushed to the multiple real-time single-trip vehicles in the form of broadcast, and the long-term reservations that are not received within the preset time period will be pushed The order is returned to the order pool of the server;

   If the travel reservation order is the short-term reservation order, the short-term reservation order and the vehicle information of the real-time single-trip vehicle are optimized through a greedy algorithm, and the vehicle information is obtained from the multiple real-time single-trip vehicles Target vehicle

   A plurality of short-term appointment orders that do not conflict with each other are sent to the target vehicle.
2. The method for dispatching an appointment order chain according to claim 1, wherein said obtaining a real-time travel order comprises:

   Pull all travel orders within the preset time period from the order pool of the server every preset time period;

   The scheduled travel order is selected from all the travel orders according to the time parameter of the travel order.
3. The method for dispatching an appointment and a chain of orders according to claim 1, wherein said acquiring multiple real-time single-trip vehicles comprises:

   Acquiring all vehicles within the preset range according to the location information of the travel reservation order;

   The real-time single-stroke vehicle is selected from the passenger-carrying state of each vehicle.
4. The method for dispatching an appointment and a chain of orders according to claim 3, wherein said acquiring multiple real-time single-trip vehicles further comprises the steps of:

   A real-time single-trip vehicle whose type does not match the specified model of the short-term reservation form is excluded from the plurality of real-time single-trip vehicles.
5. The method for dispatching an appointment and a chain of orders according to claim 3, wherein said acquiring multiple real-time single-trip vehicles further comprises the steps of:

   From the plurality of real-time single-trip vehicles, the real-time single-trip vehicles whose drivers have made a predetermined rejection behavior are excluded.
6. The method for dispatching reservations in a chain of claim 1, wherein the sending a plurality of short-term reservations that do not conflict with each other to the target vehicle comprises:

   If there is only a current real-time order in the target vehicle, sending the short-term reservation order whose start time is after the order end time of the current real-time order to the target vehicle;

   If the target vehicle has the current real-time order and has accepted one or more of the short-term appointment orders, the required time will not conflict with the time of the current real-time order and the accepted short-term appointment order. The time reservation form is sent to the target vehicle.
7. The method for dispatching an appointment order chain according to claim 1, wherein the optimization calculation of the short-term appointment order and the vehicle information of the real-time single-trip vehicle through a greedy algorithm comprises the steps of:

   Construct a vehicle-order matrix. The vehicle-order matrix includes a vehicle set and an appointment order set, and also includes the distance between each real-time single-trip vehicle in the vehicle set and each short-term appointment order in the appointment order set A parameter, the distance parameter is the reciprocal of the distance between the current position of the real-time single-journey vehicle and the departure position of the short-term reservation order after normalization processing;

   For each of the short-term appointment orders, the target vehicle is selected from the vehicle set by using a greedy algorithm.
8. A reservation single-chain dispatching device based on a real-time single-trip vehicle, applied to a server of a travel taxi system, characterized in that the reservation dispatching device includes:

   The order obtaining module is configured to obtain travel reservation orders;

   The vehicle acquisition module is configured to acquire multiple real-time single-trip vehicles;

   The first push module is configured to determine whether the scheduled travel order is a long-term reservation order or a short-term reservation order; if the scheduled travel order is the long-term reservation order, broadcast the long-term reservation order Push to the multiple real-time single-trip vehicles, and return long-term appointment orders that are not received within a preset time period to the order pool of the server;

   The optimization calculation module is configured to perform optimization calculations on the short-term reservation order and the vehicle information of the real-time single-trip vehicle through a greedy algorithm if the travel reservation order is the short-term reservation order, from the multiple Obtain the target vehicle from one real-time single-trip vehicle;

   The second pushing module is configured to send multiple short-term appointment orders that do not conflict with each other to the target vehicle.
9. The device for dispatching an appointment order chain according to claim 8, wherein the order obtaining module comprises:

   The first obtaining unit is configured to pull all travel orders within the preset time period from the order pool of the server every preset time period;

   The first filtering unit is configured to select the scheduled travel order from all travel orders according to the time parameter of the travel order.
10. The device for dispatching an appointment order chain according to claim 8, wherein the vehicle acquisition module comprises:

    The second acquiring unit is configured to acquire all vehicles within the preset range according to the location information of the scheduled travel order;

    The second filtering unit is configured to select the real-time single-stroke vehicle according to the passenger loading status of each vehicle.
11. The device for dispatching an appointment order chain according to claim 10, wherein the vehicle acquisition module further comprises:

    The third filtering unit is configured to exclude, from the plurality of real-time single-trip vehicles, the real-time single-trip vehicles whose types do not match the specified vehicle type of the short-term reservation form.
12. The device for dispatching an appointment order chain according to claim 10, wherein the vehicle acquisition module further comprises:

    The fourth filtering unit is configured to exclude, from the plurality of real-time single-trip vehicles, the real-time single-trip vehicles whose drivers make a predetermined rejection behavior.
13. The device for dispatching an appointment order chain according to claim 7, wherein the second pushing module comprises:

    The first pushing unit is configured to, if only the current real-time order exists in the target vehicle, send the short-term reservation order whose start time is after the order end time of the current real-time order to the target vehicle;

    The second pushing unit is configured to, if the target vehicle has the current real-time order and has accepted one or more of the short-term reservations, compare the required time with the current real-time order and the accepted short-time order The short-term appointment form in which the time of the appointment form does not conflict is sent to the target vehicle.

Images