Method and device for allocating ride orders

Abstract

The present disclosure relates to a method and device for allocating ride orders, and belongs to the technical field of order processing. The method comprises: among ride orders that are not processed with priority, determining ride orders whose order attribute parameters meet the attribute parameter conditions; if there are ride orders that are processed with priority, determining the ride orders whose order attribute parameters meet the attribute parameter conditions and the ride orders that are processed with priority as ride orders to be allocated; determining a target allocation combination method with the highest total matching degree between each ride order to be allocated and each vehicle to be allocated; and performing ride order allocation processing on the ride orders to be allocated based on the target allocation combination method. By adopting the present disclosure, ride efficiency can be improved by performing ride order allocation processing by the target allocation combination method.

Description

Technical Field

[0001] The present disclosure relates to the technical field of order processing, and more particularly to a method and device for allocating ride orders. Background Art

[0002] The vehicle rental service platform can receive multiple ride orders and divide the multiple ride orders into priority ride orders and non-priority ride orders based on the division rules. A ride score can be calculated between each ride order and the vehicle to be allocated, and the ride score can reflect the matching degree between the ride order and the vehicle to be allocated.

[0003] In the process of assigning the to-be-assigned vehicles to the ride orders, the priority ride orders may be processed first. The to-be-assigned vehicles may be assigned to the priority ride orders according to the ride scores between the priority ride orders and the to-be-assigned vehicles. After the priority ride orders are processed, for the non-priority ride orders, the currently unassigned ride orders with the highest ride scores with the non-priority ride orders may be assigned to each non-priority ride order one by one according to the time sequence of the ride orders.

[0004] In the process of implementing the present disclosure, the inventors found that there are at least the following problems:

[0005] For a certain priority ride order, if a vehicle has been assigned to the ride order, and the ride score between the vehicle and the ride order is the first score, the vehicle has been assigned and cannot be assigned to other ride orders. At the same time, if for a non-priority ride order, the ride score between the above vehicle and the ride order is the second score, and the second score is greater than the first score, then assigning the above vehicle to a certain priority ride order first will reduce the matching degree between the ride order and the vehicle to be assigned, and thus reduce the ride efficiency. Summary of the invention

[0006] In order to overcome the problems existing in the related art, the present disclosure provides the following technical solutions:

[0007] According to a first aspect of an embodiment of the present disclosure, a method for allocating ride orders is provided, the method comprising:

[0008] Among the non-priority ride orders, determine the ride orders whose order attribute parameters meet the attribute parameter conditions;

[0009] If there are ride orders that are to be processed with priority, the ride orders whose order attribute parameters meet the attribute parameter conditions and the ride orders that are to be processed with priority are determined as ride orders to be allocated;

[0010] Determine a target allocation combination method with the highest total matching degree between each ride order to be allocated and each vehicle to be allocated;

[0011] Based on the target allocation combination method, the ride orders to be allocated are allocated and processed.

[0012] Optionally, the order attribute parameter includes order generation time, and determining, among the non-priority ride orders, ride orders whose order attribute parameters satisfy the attribute parameter conditions, comprises:

[0013] Among the ride orders that are not processed in priority, the ride order with the earliest order generation time is determined as the ride order whose order attribute parameters meet the attribute parameter conditions.

[0014] Optionally, the order attribute parameters include order generation time and order score, and determining, among the non-priority ride orders, ride orders whose order attribute parameters meet the attribute parameter conditions, comprises:

[0015] In each ride order queue corresponding to the non-priority ride orders, obtain the ride order with the earliest order generation time;

[0016] Among the ride orders with the earliest order generation time, the ride order corresponding to the largest order score is determined as the ride order whose order attribute parameters meet the attribute parameter conditions.

[0017] Optionally, the determining of a target allocation combination method with the highest total matching degree between each ride order to be allocated and each vehicle to be allocated includes:

[0018] Determine all allocation combinations between each ride order to be allocated and each vehicle to be allocated and a total ride score corresponding to each allocation combination, wherein the total ride score indicates a total matching degree between each ride order to be allocated and each vehicle to be allocated in the corresponding allocation combination, and a higher total ride score indicates a higher total matching degree;

[0019] Among all the allocation combinations, determine the target allocation combination corresponding to the maximum total ride score.

[0020] Optionally, the determining of all allocation combinations between each ride order to be allocated and each vehicle to be allocated and a total ride score corresponding to each allocation combination includes:

[0021] Determine all sorting methods of the vehicles to be assigned;

[0022] For each sorting method, vehicles to be assigned are selected one by one in order. Each time a vehicle to be assigned is selected, a target ride order to be assigned that has not been combined in the ride orders to be assigned and has the largest ride score with the currently selected vehicle to be assigned is determined, the currently selected vehicle to be assigned and the target ride order to be assigned are combined to obtain an allocation combination method between each ride order to be assigned and each vehicle to be assigned, and the sum of the ride scores corresponding to the combination of each vehicle to be assigned and the ride order to be assigned in the allocation combination method is determined as the total ride score corresponding to the allocation combination method.

[0023] Optionally, the method further comprises:

[0024] If there is no ride order to be processed with priority, the ride order whose order attribute parameters meet the attribute parameter conditions is determined as the ride order to be allocated;

[0025] Determine, among the vehicles to be assigned, a target vehicle to be assigned having the largest ride score with the ride order to be assigned;

[0026] The ride order to be assigned is processed based on the target vehicle to be assigned.

[0027] Optionally, the method further comprises:

[0028] In the ride order queue, delete the ride orders that have been processed by ride order allocation.

[0029] According to a second aspect of an embodiment of the present disclosure, a device for allocating ride orders is provided, the device comprising:

[0030] A determination module is used to determine, among non-priority ride orders, ride orders whose order attribute parameters meet the attribute parameter conditions; if there are priority ride orders, the ride orders whose order attribute parameters meet the attribute parameter conditions and the priority ride orders are determined as ride orders to be allocated; and a target allocation combination method with the highest total matching degree between each ride order to be allocated and each vehicle to be allocated is determined;

[0031] The allocation processing module is used to perform ride order allocation processing on the ride orders to be allocated based on the target allocation combination method.

[0032] According to a third aspect of an embodiment of the present disclosure, a server is provided, the server comprising a processor, a communication interface, a memory, and a communication bus, wherein:

[0033] The processor, the communication interface and the memory communicate with each other via the communication bus;

[0034] The memory is used to store computer programs;

[0035] The processor is used to execute the program stored in the memory to implement the above-mentioned method of allocating ride orders.

[0036] According to a fourth aspect of an embodiment of the present disclosure, a computer-readable storage medium is provided, in which a computer program is stored. When the computer program is executed by a processor, the method for allocating ride orders is implemented.

[0037] The technical solution provided by the embodiments of the present disclosure may have the following beneficial effects:

[0038] Through the method provided by the embodiment of the present disclosure, the situations between the ride orders with priority and non-priority and the vehicles to be allocated can be comprehensively considered, and a suitable target allocation combination method can be selected for the ride orders with priority and non-priority and the vehicles to be allocated. The target allocation combination method is the allocation combination method with the highest total matching degree between each ride order to be allocated and each vehicle to be allocated. The ride order allocation processing by the target allocation combination method can also improve the ride efficiency.

[0039] It is to be understood that the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the present disclosure. BRIEF DESCRIPTION OF THE DRAWINGS

[0040] The accompanying drawings herein are incorporated in and constitute a part of the specification, illustrate embodiments consistent with the present disclosure, and together with the description, are used to explain the principles of the present disclosure. In the drawings:

[0041] Figure 1 is a flow chart of a method for allocating ride orders according to an exemplary embodiment;

[0042] Figure 2 is a schematic diagram showing a riding score according to an exemplary embodiment;

[0043] Figure 3 is a structural schematic diagram of a device for allocating ride orders according to an exemplary embodiment;

[0044] Figure 4 The figure is a schematic diagram showing the structure of a server according to an exemplary embodiment.

[0045] The above drawings show clear embodiments of the present disclosure, which will be described in more detail below. These drawings and text descriptions are not intended to limit the scope of the present disclosure in any way, but to illustrate the concepts of the present disclosure to those skilled in the art by referring to specific embodiments. DETAILED DESCRIPTION

[0046] Exemplary embodiments will be described in detail herein, examples of which are shown in the accompanying drawings. When the following description refers to the drawings, the same numbers in different drawings represent the same or similar elements unless otherwise indicated. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with the present disclosure. Instead, they are merely examples of devices and methods consistent with some aspects of the present disclosure as detailed in the appended claims.

[0047] An exemplary embodiment of the present disclosure provides a method for allocating ride orders, such as Figure 1 As shown, the processing flow of the method may include the following steps:

[0048] Step S110, among the ride orders that are not processed as a priority, determine the ride orders whose order attribute parameters satisfy the attribute parameter conditions.

[0049] In implementation, a non-priority ride order may be a ride order with a popular ride location, such as a ride order with a location near an office building during peak hours as the ride location. In actual applications, when a passenger wants to travel by online car-hailing, he or she can rent a car through an online car-hailing application. Passengers can open the online car-hailing application, select the type of online car-hailing to be rented, select when and where to take the car, and fill in information such as the destination to be traveled. Passengers can choose to take the car immediately, and the ride location can be selected as the location. After the passenger selects the ride information, he or she can click the OK button, so that the online car-hailing application can carry the ride information in the ride order and send it to the online car-hailing platform, and the ride order will be processed by the online car-hailing platform. The online car-hailing platform can determine the type of ride order based on the ride information in the ride order. The type of ride order can be a non-priority ride order.

[0050] The online ride-hailing platform can receive a large number of ride orders and process the received ride orders according to a preset order processing cycle. The received ride orders can be divided to obtain a plurality of non-priority ride orders. Then, the online ride-hailing platform can determine the order attribute parameters of each non-priority ride order, and determine the ride orders whose order attribute parameters meet the attribute parameter conditions among the non-priority ride orders.

[0051] Optionally, the order attribute parameters include order generation time, and step S110 may include: among the non-priority ride orders, determining the ride order with the earliest order generation time as the ride order whose order attribute parameters meet the attribute parameter conditions.

[0052] In practice, the online ride-hailing platform may use the time of receiving the ride order as the order generation time, or, when the passenger selects the ride information and clicks the OK button in the terminal, use the time of generating the ride order as the order generation time. The online ride-hailing platform may obtain the order generation time of non-priority ride orders, and then select the ride order with the earliest order generation time from all non-priority ride orders as the ride order whose order attribute parameters meet the attribute parameter conditions.

[0053] Optionally, the order attribute parameters include order generation time and order score, and step S110 may include: in each ride order queue corresponding to the non-priority ride orders, respectively obtaining the ride orders with the earliest order generation time; among the ride orders with the earliest order generation time, determining the ride order corresponding to the largest order score as the ride order whose order attribute parameters meet the attribute parameter conditions.

[0054] In implementation, the order attribute parameters may also include an order score, which may reflect the degree of benefit that the order can bring to the driver. Each ride order may be scored using a preset order scoring algorithm, so that each ride order may correspond to an order score. In the process of scoring the ride order, the ride order may be scored based on the distance between the ride location and the destination, whether the destination is not in a remote suburb, and whether there is congestion on the route between the ride location and the destination.

[0055] For non-priority ride orders, the non-priority ride orders can be placed in a ride order queue, and since the ride locations of the non-priority ride orders are popular locations, which can be the same location or different locations, the non-priority ride orders with different popular locations as ride locations can be placed in different ride order queues. In addition to the above method, multiple ride order queues can be pre-set, and different attribute parameter conditions can be set for each ride order queue. When the order attribute parameters of any non-priority ride order meet any of the attribute parameter conditions, the non-priority ride order can be placed in the ride order queue corresponding to the attribute parameter condition.

[0056] In an online car-hailing platform, multiple ride order queues may be set up, and each ride order queue may contain multiple non-priority ride orders. In each ride order queue, ride orders may be placed into the ride order queue in the order of order generation time. In this way, the ride order that ranks first in the ride order queue has the earliest order generation time among the ride orders in this queue. The ride order that ranks first in different ride order queues may be taken out and placed in a set S. In set S are the non-priority ride orders with the earliest order generation time in all ride order queues. Then, in set S, the ride order with the largest order score may be selected as the ride order whose order attribute parameters meet the attribute parameter conditions.

[0057] Step S120: If there are ride orders that are to be processed with priority, the ride orders whose order attribute parameters satisfy the attribute parameter conditions and the ride orders that are to be processed with priority are determined as ride orders to be allocated.

[0058] In implementation, there may be another type of ride order in the online car-hailing platform, namely, a ride order with priority processing. This type of ride order with priority processing may be a ride order where the ride location is not a popular location, or it may be a ride order that does not meet the conditions for non-priority ride orders. If all the priority ride orders have been processed in the previous order processing cycle, and no new priority ride orders have been generated, there are no priority ride orders. On the contrary, there are priority ride orders. If there are priority ride orders, the online car-hailing platform may take out all priority ride orders, and determine all priority ride orders and non-priority ride orders whose order attribute parameters meet the attribute parameter conditions as ride orders to be allocated. The determined ride orders to be allocated may be processed, and the remaining orders will be processed in the next order processing cycle.

[0059] Step S130, determining a target allocation combination method with the highest total matching degree between each ride order to be allocated and each vehicle to be allocated.

[0060] During implementation, the online ride-hailing platform can try to combine each ride order to be allocated and each vehicle to be allocated to determine the target allocation combination with the highest overall matching degree.

[0061] Optionally, step S130 may include: determining all allocation combinations between each ride order to be allocated and each vehicle to be allocated and a total ride score corresponding to each allocation combination, wherein the total ride score indicates a total matching degree between each ride order to be allocated and each vehicle to be allocated in the corresponding allocation combination, and a higher total ride score indicates a higher total matching degree; among all allocation combinations, determining a target allocation combination corresponding to the largest total ride score.

[0062] In implementation, the matching degree between a ride order and a vehicle can be measured by a ride score. The ride score between any ride order and any vehicle can be calculated by a preset ride score algorithm. The ride score can be affected by factors such as the distance between the current location of the vehicle and the ride location, whether the area frequently served by the vehicle includes the route between the ride location and the destination of the ride order, etc. When the ride score between any ride order and any vehicle is high, it means that the matching degree between the ride order and the vehicle is high, and the ride order is suitable for allocation to the vehicle without considering other ride orders and other vehicles.

[0063] The online car-hailing platform can determine all allocation combinations between each ride order to be allocated and each vehicle to be allocated, and then determine the total ride score corresponding to each allocation combination. Among all allocation combinations, determine the target allocation combination corresponding to the maximum total ride score. Since the ride order to be allocated involved in the order allocation combination process is not just one order, and the vehicle to be allocated involved is not just one vehicle, it is necessary to consider the overall situation of all ride orders to be allocated and all vehicles to be allocated, and try to choose the allocation combination that is most favorable to the overall allocation.

[0064] Optionally, the step of determining all allocation combinations between each to-be-allocated ride order and each to-be-allocated vehicle and the total ride score corresponding to each allocation combination may include: determining all sorting methods for each to-be-allocated vehicle; for each sorting method, selecting the to-be-allocated vehicles one by one in order, and each time a to-be-allocated vehicle is selected, determining a target to-be-allocated ride order that has not been combined in each to-be-allocated ride order and has the largest ride score with the currently selected to-be-allocated vehicle, combining the currently selected to-be-allocated vehicle and the target to-be-allocated ride order to obtain an allocation combination method between each to-be-allocated ride order and each to-be-allocated vehicle, and determining the sum of the ride scores corresponding to the combination of each to-be-allocated vehicle and the to-be-allocated ride order in the allocation combination method as the total ride score corresponding to the allocation combination method.

[0065] In the implementation, it is assumed that there are currently three vehicles to be assigned, including D1, D2, and D3, and there are currently five ride orders to be assigned, including O1, O2, O3, O4, and O5. Among these five ride orders to be assigned, three orders are non-priority orders, including O1, O3, and O4. There are two orders that are priority orders, including O2 and O5. The ride scores between the above-mentioned vehicles to be assigned and the ride orders to be assigned can be seen Figure 2 shown.

[0066] The vehicles to be assigned can be sorted, such as D1, D2, and D3. D1 can select the ride order O1 to be assigned with the highest ride score among them from the set (O1, O2, O5), and the ride score is 10 points. D2 can select the ride order O2 to be assigned with the highest ride score among them from the set (O2, O3, O5), and the ride score is 7 points. D3 selects the ride order O3 to be assigned with the highest ride score among them from the set (O3, O5), and the ride score is 5 points. Finally, under the above sorting method of the vehicles to be assigned, the total ride score is 22 points.

[0067] The above-mentioned order of the vehicles to be allocated can be disrupted, and the total ride score after the disrupted order can be recalculated in the above-mentioned manner until the total ride score corresponding to the allocation combination corresponding to the order of all the vehicles to be allocated is calculated. Among these allocation combinations, the allocation combination with the largest total ride score can be selected as the target allocation combination.

[0068] Step S140, based on the target allocation combination method, the ride orders to be allocated are allocated and processed.

[0069] In implementation, based on the target allocation combination mode, the terminal identification bound to each vehicle in the target allocation combination mode can be obtained, and based on the terminal identification, the corresponding ride order can be sent to the corresponding terminal. In this way, the driver of the vehicle can view the assigned ride order in the terminal, and the driver can choose to accept the order or not. At the same time, the terminal identification corresponding to each ride order in the target allocation combination mode can also be obtained, and the corresponding order processing status can be sent to the corresponding terminal based on the terminal identification. In this way, the passenger can view the processing status of the current ride order in the terminal, such as currently looking for a vehicle, or currently finding a suitable vehicle waiting for the driver to respond. When the driver confirms to accept the order, the terminal can send a confirmation message to the online car-hailing platform. After receiving the confirmation message, the online car-hailing platform can send the information of the order-accepting vehicle to the terminal held by the passenger corresponding to the ride order, so that the passenger can learn about the relevant situation of the vehicle that accepted the order.

[0070] Optionally, the method provided by the embodiment of the present disclosure may further include: deleting the ride orders that have undergone ride order allocation processing in the ride order queue.

[0071] In implementation, if any to-be-allocated ride order is successfully allocated to any to-be-allocated vehicle, the ride order queue where the to-be-allocated ride order is located can be determined, and the to-be-allocated ride order in the determined ride order queue can be deleted, so that the to-be-allocated ride order is processed. When the next order processing cycle arrives, the to-be-allocated ride order does not need to be processed anymore.

[0072] Optionally, the method provided by the embodiment of the present disclosure may further include: if there is no ride order that is to be processed with priority, determining the ride order whose order attribute parameters satisfy the attribute parameter conditions as the ride order to be assigned; among all the vehicles to be assigned, determining the target vehicle to be assigned that has the largest ride score with the ride order to be assigned; and performing ride order assignment processing on the ride order to be assigned based on the target vehicle to be assigned.

[0073] In implementation, if there is no priority ride order, then the non-priority ride order whose order attribute parameters meet the attribute parameter conditions can be determined as the ride order to be allocated. If the ride order to be allocated is an order, then the target vehicle to be allocated with the largest ride score between the vehicle to be allocated and the ride order to be allocated can be determined among the vehicles to be allocated, and the ride order allocation process is performed on the ride order to be allocated based on the target vehicle to be allocated.

[0074] Through the method provided by the embodiment of the present disclosure, the situations between the ride orders with priority and non-priority and the vehicles to be allocated can be comprehensively considered, and a suitable target allocation combination method can be selected for the ride orders with priority and non-priority and the vehicles to be allocated. The target allocation combination method is the allocation combination method with the highest total matching degree between each ride order to be allocated and each vehicle to be allocated. The ride order allocation processing by the target allocation combination method can also improve the ride efficiency.

[0075] Another exemplary embodiment of the present disclosure provides a device for allocating ride orders, such as Figure 3 As shown, the device comprises:

[0076] The determination module 310 is used to determine the ride orders whose order attribute parameters meet the attribute parameter conditions among the non-priority ride orders; if there are priority ride orders, the ride orders whose order attribute parameters meet the attribute parameter conditions and the priority ride orders are determined as the ride orders to be allocated; and the target allocation combination method with the highest total matching degree between each ride order to be allocated and each vehicle to be allocated is determined;

[0077] The allocation processing module 320 is used to perform ride order allocation processing on the ride orders to be allocated based on the target allocation combination method.

[0078] Optionally, the order attribute parameter includes order generation time, and the determination module 310 is used to:

[0079] Among the ride orders that are not processed in priority, the ride order with the earliest order generation time is determined as the ride order whose order attribute parameters meet the attribute parameter conditions.

[0080] Optionally, the order attribute parameters include order generation time and order score, and the determination module 310 is used to:

[0081] In each ride order queue corresponding to the non-priority ride orders, obtain the ride order with the earliest order generation time;

[0082] Among the ride orders with the earliest order generation time, the ride order corresponding to the largest order score is determined as the ride order whose order attribute parameters meet the attribute parameter conditions.

[0083] Optionally, the determining module 310 is used to:

[0084] Determine all allocation combinations between each ride order to be allocated and each vehicle to be allocated and a total ride score corresponding to each allocation combination, wherein the total ride score indicates a total matching degree between each ride order to be allocated and each vehicle to be allocated in the corresponding allocation combination, and a higher total ride score indicates a higher total matching degree;

[0085] Among all the allocation combinations, determine the target allocation combination corresponding to the maximum total ride score.

[0086] Optionally, the determining module 310 is used to:

[0087] Determine all sorting methods of the vehicles to be assigned;

[0088] For each sorting method, vehicles to be assigned are selected one by one in order. Each time a vehicle to be assigned is selected, a target ride order to be assigned that has not been combined in the ride orders to be assigned and has the largest ride score with the currently selected vehicle to be assigned is determined, the currently selected vehicle to be assigned and the target ride order to be assigned are combined to obtain an allocation combination method between each ride order to be assigned and each vehicle to be assigned, and the sum of the ride scores corresponding to the combination of each vehicle to be assigned and the ride order to be assigned in the allocation combination method is determined as the total ride score corresponding to the allocation combination method.

[0089] Optionally, the determination module 310 is further configured to, when there is no ride order to be processed with priority, determine a ride order whose order attribute parameters satisfy the attribute parameter conditions as a ride order to be allocated; and determine, among the vehicles to be allocated, a target vehicle to be allocated having the largest ride score with the ride order to be allocated;

[0090] The allocation processing module 320 is also used to perform ride order allocation processing on the ride orders to be allocated based on the target vehicles to be allocated.

[0091] Optionally, the device further comprises:

[0092] The deletion module is used to delete the ride orders that have been processed by the ride order allocation in the ride order queue.

[0093] Regarding the device in the above embodiment, the specific manner in which each module performs operations has been described in detail in the embodiment of the method, and will not be elaborated here.

[0094] Through the device provided by the embodiment of the present disclosure, the situations between the ride orders that are prioritized and non-priority processed and the vehicles to be allocated can be comprehensively considered, and a suitable target allocation combination method can be selected for the ride orders that are prioritized and non-priority processed and the vehicles to be allocated. The target allocation combination method is the allocation combination method with the highest total matching degree between each ride order to be allocated and each vehicle to be allocated. The ride order allocation processing by the target allocation combination method can also improve the ride efficiency.

[0095] It should be noted that: the device for allocating ride orders provided in the above embodiment only uses the division of the above functional modules as an example when allocating ride orders. In actual applications, the above functional distribution can be completed by different functional modules as needed, that is, the internal structure of the server is divided into different functional modules to complete all or part of the functions described above. In addition, the device for allocating ride orders provided in the above embodiment and the method embodiment for allocating ride orders belong to the same concept. The specific implementation process is detailed in the method embodiment and will not be repeated here.

[0096] Figure 4 The schematic diagram of the structure of a server 1900 provided by an exemplary embodiment of the present disclosure is shown. The server 1900 may have relatively large differences due to different configurations or performances, and may include one or more processors (central processing units, CPU) 1910 and one or more memories 1920. The memory 1920 stores at least one instruction, and the at least one instruction is loaded and executed by the processor 1910 to implement the method for allocating ride orders described in the above embodiment.

[0097] Those skilled in the art will readily appreciate other embodiments of the present disclosure after considering the specification and practicing the disclosure disclosed herein. This application is intended to cover any variations, uses or adaptations of the present disclosure, which follow the general principles of the present disclosure and include common knowledge or customary techniques in the art that are not disclosed in the present disclosure. The specification and examples are intended to be exemplary only, and the true scope and spirit of the present disclosure are indicated by the claims.

[0098] It should be understood that the present disclosure is not limited to the exact structures that have been described above and shown in the drawings, and that various modifications and changes may be made without departing from the scope thereof. The scope of the present disclosure is limited only by the appended claims.

Claims

1. A method for allocating ride orders, characterized in that: The method comprises: Among the non-priority ride orders, determine the ride orders whose order attribute parameters meet the attribute parameter conditions; If there are ride orders that are to be processed with priority, the ride orders whose order attribute parameters meet the attribute parameter conditions and the ride orders that are to be processed with priority are determined as ride orders to be allocated; Determine all sorting methods for each vehicle to be assigned; For each sorting method, vehicles to be allocated are selected one by one in order. Each time a vehicle to be allocated is selected, a target ride order to be allocated that has not been combined in each ride order to be allocated and has the largest ride score with the currently selected vehicle to be allocated is determined, the currently selected vehicle to be allocated and the target ride order to be allocated are combined to obtain an allocation combination method between each ride order to be allocated and each vehicle to be allocated, and the sum of the ride scores corresponding to each combination of each vehicle to be allocated and the ride order to be allocated in the allocation combination method is determined as the total ride score corresponding to the allocation combination method, wherein the total ride score indicates the total matching degree between each ride order to be allocated and each vehicle to be allocated in the corresponding allocation combination method, a higher total ride score indicates a higher total matching degree, and the ride score is related to the distance between the current position of the vehicle and the boarding location, and whether the area served by the vehicle includes the route between the boarding location and the destination of the ride order; Among all allocation combinations, determine the target allocation combination corresponding to the maximum total ride score; Based on the target allocation combination method, the ride orders to be allocated are allocated and processed.

2. The method according to claim 1, characterized in that The order attribute parameter includes the order generation time, and the order attribute parameter of the non-priority ride orders is determined to meet the attribute parameter conditions, including: Among the ride orders that are not processed in priority, the ride order with the earliest order generation time is determined as the ride order whose order attribute parameters meet the attribute parameter conditions.

3. The method according to claim 1, characterized in that The order attribute parameters include order generation time and order score. The determining of the ride orders whose order attribute parameters satisfy the attribute parameter conditions among the non-priority ride orders includes: In each ride order queue corresponding to the non-priority ride orders, obtain the ride order with the earliest order generation time; Among the ride orders with the earliest order generation time, the ride order corresponding to the largest order score is determined as the ride order whose order attribute parameters meet the attribute parameter conditions.

4. The method according to any one of claims 1 to 3, characterized in that: The method further comprises: In the ride order queue, delete the ride orders that have been processed by ride order allocation.

5. A device for allocating ride orders, characterized in that: The device comprises: A determination module is used to determine, among the non-priority ride orders, ride orders whose order attribute parameters meet the attribute parameter conditions; if there are priority ride orders, the ride orders whose order attribute parameters meet the attribute parameter conditions and the priority ride orders are determined as ride orders to be allocated; all sorting methods of each to-be-allocated vehicle are determined; for each sorting method, the to-be-allocated vehicles are selected one by one in order, and each time a to-be-allocated vehicle is selected, a target to-be-allocated ride order that has not been combined in each to-be-allocated ride order and has the largest ride score with the currently selected to-be-allocated vehicle is determined, and the currently selected to-be-allocated vehicle and the target to-be-allocated ride order are combined to obtain each to-be-allocated ride order. The allocation combination between the ride order and each vehicle to be allocated, the sum of the ride scores corresponding to the combination of each vehicle to be allocated and the ride order to be allocated in the allocation combination is determined as the total ride score corresponding to the allocation combination, wherein the total ride score indicates the total matching degree between the ride orders to be allocated and the vehicles to be allocated in the corresponding allocation combination, the higher the total ride score is, the higher the total matching degree is, and the ride score is related to the distance between the current position of the vehicle and the ride location, and whether the area served by the vehicle includes the route between the ride location and the destination of the ride order; among all allocation combinations, determine the target allocation combination corresponding to the largest total ride score; The allocation processing module is used to perform ride order allocation processing on the ride orders to be allocated based on the target allocation combination method.

6. A server, characterized in that: The server includes a processor, a communication interface, a memory and a communication bus, wherein: The processor, the communication interface and the memory communicate with each other via the communication bus; The memory is used to store computer programs; The processor is used to execute the program stored in the memory to implement the method steps described in any one of claims 1-4.

7. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the method steps described in any one of claims 1 to 4 are implemented.

Images