Order processing method and device, electronic equipment and storage medium

Abstract

The invention relates to an order processing method and apparatus, an electronic device and a storage medium. The method comprises the steps of obtaining a source position and a target position of a to-be-allocated order, and a first neighborhood range of the source position and a second neighborhood range of the target position; determining delivery personnel with a to-be-delivered position falling into the first neighborhood range and a to-be-delivered position falling into the second neighborhood range in a current delivery path as candidate delivery personnel, the current delivery path comprising a position sequence composed of at least one to-be-delivered position; and according to the current delivery path of each candidate delivery person, and the to-be-delivered position falling into the first neighborhood range and the to-be-delivered position falling into the second neighborhood range in the current delivery path, determining a target delivery person and updating the current delivery path of the target delivery person.

Description

Technical Field

[0001] The present disclosure relates to the technical field of delivery order processing, and particularly to an order processing method, apparatus, electronic device, and storage medium. Background Art

[0002] In recent years, delivery services such as takeaway services and express delivery services have brought great convenience to people's lives. The delivery service system needs to coordinate orders and delivery personnel to achieve efficient use of resources and full guarantee of user experience. After a new order is generated in the delivery service system, the new order will be assigned to a delivery person who is currently on delivery, so that the delivery person can complete the delivery of the new order. This process is the order consolidation process of the new order. In the above order consolidation process, the delivery service system will select the most suitable delivery person for order consolidation. For example, it will select the delivery person with the most convenient route (the convenience degree of the route can be measured by the increased distance caused by order consolidation) for order consolidation. However, in related technologies, due to reasons such as a large number of delivery personnel and a large number of orders, the delivery service system often has a large computational load and low efficiency in order consolidation. Summary of the Invention

[0003] The present disclosure provides an order processing method, apparatus, device, and storage medium to solve the defects in related technologies.

[0004] According to a first aspect of an embodiment of the present disclosure, there is provided an order processing method, the method including:

[0005] Obtain the source location and target location of the order to be assigned, as well as the first neighborhood range of the source location and the second neighborhood range of the target location;

[0006] Determine the delivery personnel whose current delivery route has delivery positions falling within the first neighborhood range and delivery positions falling within the second neighborhood range as candidate delivery personnel, where the current delivery route includes a position sequence composed of at least one delivery position;

[0007] Determine the target delivery personnel according to the current delivery route of each candidate delivery personnel, and the delivery positions falling within the first neighborhood range and the delivery positions falling within the second neighborhood range in the current delivery route, and update the current delivery route of the target delivery personnel.

[0008] In an embodiment of the present disclosure, the determining the delivery personnel whose current delivery route has delivery positions falling within the first neighborhood range and delivery positions falling within the second neighborhood range as candidate delivery personnel includes:

[0009] In response to the existence of a to-be-delivered location within the first neighborhood range and a to-be-delivered location within the second neighborhood range in the current delivery route of the delivery person, and any to-be-delivered location within the first neighborhood range precedes any to-be-delivered location within the second neighborhood range in the order in the current delivery route, determine that the delivery person is a candidate delivery person.

[0010] In one embodiment of the present disclosure, the method further includes at least one of the following:

[0011] In response to the existence of a to-be-delivered location within the first neighborhood range in the current delivery route of the delivery person and the source location falling within the second neighborhood range, determine that the delivery person is a candidate delivery person;

[0012] In response to the existence of a to-be-delivered location within the second neighborhood range in the current delivery route of the delivery person and the target location falling within the first neighborhood range, determine that the delivery person is a candidate delivery person.

[0013] In one embodiment of the present disclosure, the determining the target delivery person according to the current delivery route of each candidate delivery person, and the to-be-delivered locations within the first neighborhood range and the to-be-delivered locations within the second neighborhood range in the current delivery route, and updating the current delivery route of the target delivery person includes:

[0014] According to the current delivery route of each candidate delivery person, and the to-be-delivered locations within the first neighborhood range and the to-be-delivered locations within the second neighborhood range in the current delivery route, respectively determine the combined order route of each candidate delivery person and the distance of the combined order route, where the combined order route is the location sequence formed after adding the source location and the target location to the current delivery route;

[0015] Determine the candidate delivery person with the shortest distance of the combined order route as the target delivery person, and update the current delivery route of the target delivery person according to the combined order route of the target delivery person.

[0016] In one embodiment of the present disclosure, the determining the combined order route of each candidate delivery person according to the current delivery route of each candidate delivery person, and the to-be-delivered locations within the first neighborhood range and the to-be-delivered locations within the second neighborhood range in the current delivery route includes:

[0017] According to the current delivery route of the candidate delivery person, the to-be-delivered locations within the first neighborhood range in the current delivery route, and the source location, determine multiple source location combined order routes and the distance of each source location combined order route;

[0018] Determine multiple source location consolidation paths and the distances of each source location consolidation path based on the current delivery path of the candidate delivery person, the to-be-delivered locations within the first neighborhood range in the current delivery path, and the source location;

[0019] Determine the consolidation path of the candidate delivery person based on the source location consolidation path with the shortest distance among the multiple source location consolidation paths and the target location consolidation path with the shortest distance among the multiple target location consolidation paths.

[0020] In one embodiment of the present disclosure, the determining multiple source location consolidation paths based on the current delivery path of the candidate delivery person, the to-be-delivered locations within the first neighborhood range in the current delivery path, and the source location includes:

[0021] In response to the number of to-be-delivered locations within the first neighborhood range in the current delivery path being 1, add the source location before and after the to-be-delivered location within the first neighborhood range in the current delivery path respectively to obtain two source location consolidation paths; or,

[0022] In response to the number of to-be-delivered locations within the first neighborhood range in the current delivery path being greater than 1, add the source location before, after, and between every two adjacent to-be-delivered locations within the first neighborhood range in the current delivery path respectively to obtain at least three source location consolidation paths.

[0023] In one embodiment of the present disclosure, the method further includes:

[0024] Determine the on-the-way score of each delivery person respectively according to the to-be-delivered locations within the first neighborhood range and the to-be-delivered locations within the second neighborhood range in the current delivery path of each delivery person.

[0025] The determining the delivery persons with to-be-delivered locations within the first neighborhood range and to-be-delivered locations within the second neighborhood range in the current delivery path as candidate delivery persons includes:

[0026] Among the top N delivery persons with the highest on-the-way score, determine the delivery persons with to-be-delivered locations within the first neighborhood range and to-be-delivered locations within the second neighborhood range in the current delivery path as candidate delivery persons, where N is a positive integer greater than 1.

[0027] In one embodiment of the present disclosure, the first neighborhood range includes multiple layers of sub-neighborhoods centered on the source location, and the second neighborhood range includes multiple layers of sub-neighborhoods centered on the target location;

[0028] Determining the convenience scores of each delivery person respectively according to the to-be-delivered locations in the current delivery route of each delivery person that fall within the first neighborhood range and the to-be-delivered locations that fall within the second neighborhood range, includes:

[0029] Determining the convenience scores of each delivery person respectively according to the number of to-be-delivered locations in each layer of sub-neighborhoods in the current delivery route of each delivery person that fall within the first neighborhood range and the number of to-be-delivered locations in each layer of sub-neighborhoods that fall within the second neighborhood range.

[0030] In one embodiment of the present disclosure, the method further includes:

[0031] Determining the to-be-allocated order as the unallocated order with the shortest remaining delivery time among multiple unallocated orders.

[0032] In one embodiment of the present disclosure, the method further includes:

[0033] In response to none of the delivery persons being determined as the candidate delivery person, determining the to-be-allocated order as an unallocated order, and determining the to-be-allocated order as the unallocated order with the shortest remaining delivery time among other unallocated orders.

[0034] According to a second aspect of the embodiments of the present disclosure, there is provided an order processing device, the device includes:

[0035] An acquisition module, configured to acquire the source location and the target location of the to-be-allocated order, as well as the first neighborhood range of the source location and the second neighborhood range of the target location;

[0036] A screening module, configured to determine a delivery person whose current delivery route has to-be-delivered locations that fall within the first neighborhood range and to-be-delivered locations that fall within the second neighborhood range as a candidate delivery person, where the current delivery route includes a location sequence composed of at least one to-be-delivered location;

[0037] A determination module, configured to determine a target delivery person according to the current delivery route of each candidate delivery person, and the to-be-delivered locations in the current delivery route that fall within the first neighborhood range and the to-be-delivered locations that fall within the second neighborhood range, and update the current delivery route of the target delivery person.

[0038] In one embodiment of the present disclosure, the screening module is configured to:

[0039] In response to the existence of a to-be-delivered location within the first neighborhood range and a to-be-delivered location within the second neighborhood range in the current delivery route of the delivery person, and any to-be-delivered location within the first neighborhood range precedes any to-be-delivered location within the second neighborhood range in the order in the current delivery route, determine that the delivery person is a candidate delivery person.

[0040] In one embodiment of the present disclosure, the apparatus further includes an adjacent module for at least one of the following:

[0041] In response to the existence of a to-be-delivered location within the first neighborhood range in the current delivery route of the delivery person and the source location falling within the second neighborhood range, determine that the delivery person is a candidate delivery person;

[0042] In response to the existence of a to-be-delivered location within the second neighborhood range in the current delivery route of the delivery person and the target location falling within the first neighborhood range, determine that the delivery person is a candidate delivery person.

[0043] In one embodiment of the present disclosure, the determining module is configured to:

[0044] According to the current delivery route of each candidate delivery person, and the to-be-delivered locations within the first neighborhood range and the to-be-delivered locations within the second neighborhood range in the current delivery route, respectively determine the combined delivery route of each candidate delivery person and the distance of the combined delivery route, where the combined delivery route is the position sequence formed after adding the source location and the target location to the current delivery route;

[0045] Determine the candidate delivery person with the shortest distance of the combined delivery route as the target delivery person, and update the current delivery route of the target delivery person according to the combined delivery route of the target delivery person.

[0046] In one embodiment of the present disclosure, when the determining module is configured to respectively determine the combined delivery route of each candidate delivery person according to the current delivery route of each candidate delivery person, and the to-be-delivered locations within the first neighborhood range and the to-be-delivered locations within the second neighborhood range in the current delivery route, it is configured to:

[0047] According to the current delivery route of the candidate delivery person, the to-be-delivered locations within the first neighborhood range in the current delivery route, and the source location, determine multiple source location combined delivery routes and the distance of each source location combined delivery route;

[0048] Determine multiple target location merging paths and the distances of each target location merging path based on the current delivery path of the candidate delivery person, the to-be-delivered locations within the second neighborhood range in the current delivery path, and the target location.

[0049] Determine the merging path of the candidate delivery person based on the source location merging path with the minimum distance among the multiple source location merging paths and the target location merging path with the minimum distance among the multiple target location merging paths.

[0050] In one embodiment of the present disclosure, when the determining module is used to determine multiple source location merging paths based on the current delivery path of the candidate delivery person, the to-be-delivered locations within the first neighborhood range in the current delivery path, and the source location, it is used for:

[0051] In response to the number of to-be-delivered locations within the first neighborhood range in the current delivery path being 1, add the source location before and after the to-be-delivered location within the first neighborhood range in the current delivery path respectively to obtain two source location merging paths; or,

[0052] In response to the number of to-be-delivered locations within the first neighborhood range in the current delivery path being greater than 1, add the source location before, after, and between every two adjacent to-be-delivered locations within the first neighborhood range in the current delivery path respectively to obtain at least three source location merging paths.

[0053] In one embodiment of the present disclosure, the device further includes a scoring module, which is used for:

[0054] Determine the convenient score of each delivery person respectively according to the to-be-delivered locations within the first neighborhood range and the to-be-delivered locations within the second neighborhood range in the current delivery path of each delivery person.

[0055] The screening module is used for:

[0056] Among the top N delivery persons with the largest convenient scores, determine the delivery persons whose current delivery paths have to-be-delivered locations within the first neighborhood range and to-be-delivered locations within the second neighborhood range as candidate delivery persons, where N is a positive integer greater than 1.

[0057] In one embodiment of the present disclosure, the first neighborhood range includes multiple layers of sub-neighborhoods centered on the source location, and the second neighborhood range includes multiple layers of sub-neighborhoods centered on the target location;

[0058] The scoring module is used for:

[0059] According to the number of delivery positions to be delivered in each layer of sub-neighborhoods within the first neighborhood range and the number of delivery positions to be delivered in each layer of sub-neighborhoods within the second neighborhood range in the current delivery route of each delivery person, the convenient delivery score of each delivery person is determined respectively.

[0060] In one embodiment of the present disclosure, the apparatus further includes an order selection module, configured to:

[0061] Determine the undistributed order with the shortest remaining delivery time among multiple undistributed orders as the to-be-distributed order.

[0062] In one embodiment of the present disclosure, the apparatus further includes an order re-selection module, configured to:

[0063] In response to that each delivery person is not determined as the candidate delivery person, determine the to-be-distributed order as an undistributed order, and determine the undistributed order with the shortest remaining delivery time among other undistributed orders as the to-be-distributed order.

[0064] According to the third aspect of the embodiments of the present disclosure, there is provided an electronic device, including a memory and a processor, where the memory is used to store computer instructions that can run on the processor, and the processor is used to implement the method described in the first aspect when executing the computer instructions.

[0065] According to the fourth aspect of the embodiments of the present disclosure, there is provided a computer-readable storage medium, on which a computer program is stored, and when the program is executed by a processor, the method described in the first aspect is implemented.

[0066] According to the above embodiments, it can be known that the source position and the target position of the to-be-distributed order, the first neighborhood range of the source position, and the second neighborhood range of the target position can be obtained, and the delivery person whose current delivery route has delivery positions to be delivered falling within the first neighborhood range and delivery positions to be delivered falling within the second neighborhood range is determined as a candidate delivery person. Thus, the target delivery person can be determined according to the current delivery route of each candidate delivery person, and the delivery positions to be delivered falling within the first neighborhood range and the delivery positions to be delivered falling within the second neighborhood range in the current delivery route, and the current delivery route of the target delivery person can be updated. That is to say, by judging whether there are both delivery positions to be delivered falling within the first neighborhood range and delivery positions to be delivered falling within the second neighborhood range in the current delivery route of each delivery person, this method can screen out some delivery persons as candidate delivery persons among all delivery persons. Therefore, it is possible to select a suitable delivery person only for the candidate delivery persons, and during the order consolidation process, based on the delivery positions to be delivered falling within the first neighborhood range and the second neighborhood range in the current delivery route, rather than all delivery positions to be delivered in the current delivery route, thereby reducing the computing load during the order consolidation process and improving the efficiency of the order consolidation process.

[0067] It should be understood that the above general description and the following detailed description are merely exemplary and explanatory, and do not limit the present disclosure. BRIEF DESCRIPTION OF THE DRAWINGS

[0068] The accompanying drawings herein are incorporated into and constitute a part of this specification, showing embodiments consistent with the present disclosure, and together with the specification are used to explain the principles of the present disclosure.

[0069] Figure 1 is a schematic diagram of a meal pickup path shown in an embodiment of the present disclosure;

[0070] Figure 2 is a schematic diagram of a meal delivery path shown in an embodiment of the present disclosure;

[0071] Figure 3 is a flowchart of an order processing method shown in an embodiment of the present disclosure;

[0072] Figure 4 is a schematic diagram of a current delivery path that conforms to the pickup-delivery adjacent principle shown in an embodiment of the present disclosure;

[0073] Figure 5 is a schematic diagram of a current delivery path that does not conform to the pickup-delivery adjacent principle shown in an embodiment of the present disclosure;

[0074] Figure 6 is a schematic diagram of a current delivery path that conforms to the pickup-delivery along-the-way principle shown in an embodiment of the present disclosure;

[0075] Figure 7 is a schematic diagram of a current delivery path that does not conform to the pickup-delivery along-the-way principle shown in an embodiment of the present disclosure;

[0076] Figure 8 is a schematic diagram of a current delivery path that conforms to the pickup-delivery proximity principle shown in an embodiment of the present disclosure;

[0077] Figure 9 is a schematic diagram of a neighborhood range composed of multi-layer sub-neighborhoods shown in an embodiment of the present disclosure;

[0078] Figure 10 is a schematic diagram of the structure of an order processing device shown in an embodiment of the present disclosure;

[0079] Figure 11 is a schematic diagram of the structure of an electronic device shown in an embodiment of the present disclosure. DETAILED DESCRIPTION OF THE EMBODIMENTS

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

[0081] The terms used in the present disclosure are for the purpose of describing specific embodiments only and are not intended to limit the present disclosure. The singular forms "a", "the", and "said" used in the present disclosure and the appended claims are also intended to include the plural forms unless the context clearly dictates otherwise. It should also be understood that the term "and / or" as used herein refers to and encompasses any and all possible combinations of one or more of the associated listed items.

[0082] It should be understood that although the terms first, second, third, etc. may be used in the present disclosure to describe various information, such information should not be limited to these terms. These terms are only used to distinguish the same type of information from each other. For example, without departing from the scope of the present disclosure, the first information may also be referred to as the second information, and similarly, the second information may also be referred to as the first information. Depending on the context, the word "if" as used herein may be interpreted as "when" or "while" or "in response to determining".

[0083] In recent years, delivery services such as food delivery services and courier services have brought great convenience to people's lives. The delivery service system needs to coordinate orders and delivery personnel to achieve efficient utilization of resources and full guarantee of user experience. After a new order is generated by the delivery service system, the new order will be assigned to a delivery person who is currently on a delivery route so that the delivery person can complete the delivery of the new order. This process is the order consolidation process for the new order. The delivery service system will select the most suitable delivery person for order consolidation during the above-mentioned order consolidation process. For example, it will select the delivery person with the most convenient route (the convenience of the route can be measured by the additional distance added by order consolidation) for order consolidation.

[0084] However, in the related art, due to reasons such as a large number of delivery personnel and a large number of orders, the delivery service system often has a large computational load and low efficiency for order consolidation. For example, when a new order is generated by the delivery service system, it is necessary to determine all possible order consolidation routes for the current delivery route of each delivery person, and compare the distances of these order consolidation routes to select the delivery person to whom the order consolidation route with the shortest distance belongs as the most suitable delivery person; that is, for each delivery person, first determine all the meal pickup routes in the manner shown in the appendix Figure 1 shown, and then for each meal pickup route, in accordance with the appendix Figure 2 (appendix Figure 2All the delivery routes corresponding to the pick-up routes from o1 to new-s1 to o2 are shown only), and the corresponding all delivery routes are determined in the manner shown to obtain all the combined order routes, where Figure 1 、 2 where now indicates the current position of the delivery person, o1, o2, o3, o4 are the positions to be delivered in the current delivery route of the delivery person, new-s1 is the source position of the new order, and new-o1 is the target position of the new order. It can be seen that the number of delivery persons and the number of orders to be delivered in the current delivery route of each delivery person will both affect the computational load of the combined order process, that is, when the above two aspects have a large number, the computational load is large, and in the actual delivery scenario, the number of the above two aspects is often large.

[0085] Based on this, at least one embodiment of the present disclosure provides an order processing method, which can be applied to a delivery service system, such as a food delivery system, an express delivery system, etc., so that the delivery service system can complete the combined order of the new order with a small computational load and high efficiency when a new order is generated, that is, allocate the new order to the most suitable delivery person.

[0086] Please refer to the appendix Figure 3 , which exemplarily shows the flow of the order processing method, including steps S301 to S303.

[0087] In step S301, obtain the source position and target position of the order to be allocated, as well as the first neighborhood range of the source position and the second neighborhood range of the target position.

[0088] Among them, multiple unallocated orders generated in the delivery service system can be sequentially determined as the order to be allocated according to the generation order and combined into an order according to this method. Or the delivery service system can determine the unallocated order with the shortest remaining delivery time among the multiple unallocated orders as the order to be allocated, where the remaining delivery time can be the difference between the current time and the promised delivery time of the order; this can preferentially allocate the order with the shortest remaining delivery time, thus avoiding problems such as timeout caused by the order not being allocated for a long time.

[0089] Among them, the source position of the order to be allocated can be the pick-up location of the delivered item in the order, such as the location of the restaurant where the food is picked up for a food delivery order. The target position of the order to be allocated can be the delivery location of the order, such as the receiving address, or the pick-up point corresponding to the receiving address, etc.

[0090] Preferably, the first neighborhood range may be a circular area or a square area centered on the source position, etc.; the second neighborhood range may be a circular area or a square area centered on the target position, etc. Exemplarily, the first neighborhood range may include multiple layers of sub-neighborhoods centered on the source position, and the second neighborhood range may include multiple layers of sub-neighborhoods centered on the target position.

[0091] It should be understood that the first neighborhood range of the source position is used to define the area relatively close to the source position, that is, the positions falling within the first neighborhood range are relatively close to the source position, while the positions not falling within the first neighborhood range are relatively far from the source position. Further, if the first neighborhood range includes multiple layers of sub-neighborhoods, the positions in the sub-neighborhood closer to the center of the first neighborhood range are closer to the source position, and the positions in the sub-neighborhood farther from the center of the first neighborhood range are farther from the source position.

[0092] Similarly, the second neighborhood range of the target position is used to define the area relatively close to the target position, that is, the positions falling within the second neighborhood range are relatively close to the target position, while the positions not falling within the second neighborhood range are relatively far from the target position. Further, if the second neighborhood range includes multiple layers of sub-neighborhoods, the positions in the sub-neighborhood closer to the center of the second neighborhood range are closer to the target position, and the positions in the sub-neighborhood farther from the center of the second neighborhood range are farther from the target position.

[0093] In step S302, the delivery personnel whose current delivery route has delivery positions falling within the first neighborhood range and delivery positions falling within the second neighborhood range are determined as candidate delivery personnel, where the current delivery route includes a sequence of positions composed of at least one delivery position.

[0094] As described above, the first neighborhood range can be used to measure the distance from the source position, and the second neighborhood range can be used to measure the distance from the target position. Therefore, when determining the distance between the source position, the target position and the current delivery route of a certain delivery personnel, the delivery positions falling within the first neighborhood range can be determined to be close to the source position, the delivery positions not falling within the first neighborhood range can be determined to be far from the source position, the delivery positions falling within the second neighborhood range can be determined to be close to the target position, and the delivery positions not falling within the second neighborhood range can be determined to be far from the target position. In other words, the fact that there are delivery positions falling within the first neighborhood range and delivery positions falling within the second neighborhood range in the current delivery route in this step means that there are delivery positions that are relatively close to the source position and delivery positions that are relatively close to the target position in the current delivery route at the same time.

[0095] Please refer to the appendix Figure 4, which shows an example of the relative position between the current delivery route of the candidate delivery staff and the order to be delivered in this step. Please refer to the appendix Figure 5 , which shows an example of the relative position between the current delivery route of the delivery staff who cannot be a candidate delivery staff and the order to be delivered in this step (because there is no to-be-delivered position within the first neighborhood range in the current delivery route of this delivery staff). Appendix Figure 4 , 5 In the figure, now indicates the current position of the delivery staff, o1, o2, o3, o4 are the to-be-delivered positions in the current delivery route of the delivery staff, new-s1 is the source position of the new order, the two-layer dotted line box around new-s1 is the first neighborhood range composed of two sub-neighborhoods, new-o1 is the target position of the new order, and the two-layer dotted line box around new-o1 is the second neighborhood range composed of two sub-neighborhoods.

[0096] The principle for determining candidate delivery staff in this step can be called the pick-up and delivery adjacency principle, that is, the source position of the pick-up delivery item is adjacent to a to-be-delivered position in the current delivery route, and the target position of the delivery of the delivery item is adjacent to a to-be-delivered position in the current delivery route. If the current delivery route of a certain delivery staff conforms to this principle, when the order to be delivered is merged with this delivery staff, this delivery staff picks up the delivery item at the source position before or after delivering the to-be-delivered position adjacent to the source position, and will not increase too much distance on the original route. This delivery staff delivers the delivery item to the target position before or after delivering the to-be-delivered position adjacent to the target position, and will not increase too much distance on the original route either, so that the new route after order merging does not increase too much distance.

[0097] Conversely, if the current delivery route of a certain delivery staff does not conform to this principle, the order to be delivered will increase too much distance on the basis of its current delivery route after being merged with this delivery staff, wasting more delivery costs, and not conforming to the principle of low cost and high efficiency of order merging.

[0098] Based on the above analysis, it can be seen that the delivery staff who conforms to this principle is more suitable for delivering the order to be delivered than the delivery staff who does not conform to this principle. Therefore, in this step, the delivery staff who conforms to this principle is determined as the candidate delivery staff, and the delivery staff who does not conform to this principle can be directly filtered out, thus saving the computing process wasted on the delivery staff who does not conform to this principle, improving the order merging efficiency and reducing the computing load on the premise of ensuring the accuracy of order merging.

[0099] It is particularly worth noting that this method only needs simple operations to determine whether the to-be-delivered position falls within the first neighborhood range and the second neighborhood range, avoiding complex operations such as quadratic squares and square roots for calculating the increased distance before and after order merging in the related technology.

[0100] Further, this step may determine that the delivery person is a candidate delivery person in response to the existence of a to-be-delivered location within the first neighborhood range and a to-be-delivered location within the second neighborhood range in the current delivery route of the delivery person, and any to-be-delivered location within the first neighborhood range precedes any to-be-delivered location within the second neighborhood range in the order in the current delivery route.

[0101] Among them, that any to-be-delivered location within the first neighborhood range precedes any to-be-delivered location within the second neighborhood range in the order in the current delivery route can be called the principle of picking up and delivering in the same route, that is, in the current delivery route, the to-be-delivered location adjacent to the source location is ahead of the to-be-delivered location adjacent to the target location. If the current delivery route of a certain delivery person conforms to this principle, then it is in the same route for this delivery person to pick up the delivery item at the source location and deliver the delivery item to the target location; if the current delivery route of a certain delivery person does not conform to this principle, then it is not in the same route for this delivery person to pick up the delivery item at the source location and deliver the delivery item to the target location, which will cause waste of the journey and does not conform to the principle of low cost and high efficiency of order consolidation.

[0102] Next, take Example 1 that conforms to the principle of picking up and delivering in the same route and Example 2 that does not conform to the principle of picking up and delivering in the same route as examples to introduce the principle of picking up and delivering in the same route more vividly.

[0103] In Appendix Figure 6 In Example 1 shown, the current location of the delivery person is now, and the current delivery route of the delivery person includes to-be-delivered locations o1, o2, o3, o4 arranged in sequence. The to-be-delivered location o1 is within the first neighborhood range of the source location new-s1 of the to-be-delivered order, and the to-be-delivered locations o2, o3 are within the second neighborhood range of the target location new-o1 of the to-be-delivered order. Therefore, the delivery person picks up the delivery item at the source location new-s1 before or after delivering at the to-be-delivered location o1, and then the delivery person delivers the delivery item to the target location new-o1 before, after or between delivering at the to-be-delivered locations o2, o3, and then continues to deliver to other to-be-delivered locations, and there is no waste of the journey in this delivery process.

[0104] In Appendix Figure 7In the example 2 shown, the current location of the delivery person is now, and the current delivery path of the delivery person includes the delivery locations o1, o2, o3, and o4 arranged in sequence. The delivery location o1 is within the second neighborhood of the target location new-o1 of the delivery order, and the delivery location o2 is within the first neighborhood of the source location new-s1 of the delivery order. Therefore, after the delivery person is at the delivery location o1 and completes the delivery, he continues to go to the delivery location o2 for delivery, and after completing the delivery at the delivery location o2, he goes to the source location new-s1 to pick up the delivery items, and then returns to the target location new-o1 adjacent to the delivery location o1 to deliver the delivery items, and finally goes from the target location new-o1 adjacent to the delivery configuration 1 to the delivery location o3 for delivery. Obviously, there is a return trip and a waste of trip in this process.

[0105] This optional example further adds the principle of picking up and delivering in the same route on the basis of the above-mentioned principle of adjacent picking up and delivering, which can further reduce the increase in distance caused by merging and improve delivery efficiency.

[0106] This step screens candidate delivery personnel based on the principle of similar pick-up and delivery, or screens delivery personnel based on the principle of similar pick-up and delivery and on-the-way pick-up and delivery, which can effectively filter out delivery personnel who are not suitable for the orders to be delivered, thereby reducing the computational load of order consolidation and improving the efficiency and accuracy of order consolidation. Furthermore, the method may also include at least one of the following: in response to the presence of a to-be-delivered location falling within the first neighborhood range in the current delivery path of the delivery personnel, and the source location falling within the second neighborhood range, determining the delivery personnel as a candidate delivery personnel; in response to the presence of a to-be-delivered location falling within the second neighborhood range in the current delivery path of the delivery personnel, and the target location falling within the first neighborhood range, determining the delivery personnel as a candidate delivery personnel.

[0107] The above two items can be called the principle of close pickup and delivery. The principle of close pickup and delivery means that there is a location to be delivered within the neighborhood of one of the source location and the target location, and the location exists within the neighborhood of the other location. Figure 8(The current position of the delivery person is now. The current delivery route of the delivery person includes the to-be-delivered positions o1, o2, o3, and o4 arranged in sequence. The to-be-delivered position o1 is within the first neighborhood range of the source position new-s1 of the to-be-delivered order, and the source position new-s1 is within the second neighborhood range of the target position new-o1 of the to-be-delivered order) Taking the case where there is a to-be-delivered position falling within the first neighborhood range and the source position falling within the second neighborhood range in the current delivery route of the delivery person shown as an example, if a certain delivery person meets this principle, then the delivery person picks up the delivery item at the source position before or after delivering the to-be-delivered position adjacent to the source position, and delivers the delivery item to the target position adjacent to the delivery item after picking up the delivery item, and then continues to deliver to other to-be-delivered positions. This process will not cause waste of the journey, which conforms to the principle of low cost and high efficiency of order consolidation. Therefore, this delivery person is suitable for the delivery of the to-be-delivered order.

[0108] This optional example avoids the filtering of delivery personnel suitable for the to-be-delivered order and being unable to become candidate delivery personnel through the principle of picking up and delivering nearby, thereby further improving the accuracy of candidate delivery personnel and the accuracy of order consolidation for the to-be-delivered order.

[0109] In step S303, according to the current delivery route of each candidate delivery person, and the to-be-delivered positions falling within the first neighborhood range and the to-be-delivered positions falling within the second neighborhood range in the current delivery route, determine the target delivery person and update the current delivery route of the target delivery person.

[0110] Exemplarily, this step can be executed in the manner shown in the appendix Figure 4 to execute this step, including sub-steps S3031 to S3032.

[0111] In sub-step S3031, according to the current delivery route of each candidate delivery person, and the to-be-delivered positions falling within the first neighborhood range and the to-be-delivered positions falling within the second neighborhood range in the current delivery route, correspondingly determine the order consolidation route of each candidate delivery person and the distance of the order consolidation route.

[0112] Among them, the order consolidation route is the position sequence formed after adding the source position and the target position to the current delivery route.

[0113] Preferably, this sub-step is executed in the following manner:

[0114] First, according to the current delivery route of the candidate delivery person, the to-be-delivered positions falling within the first neighborhood range in the current delivery route, and the source position, determine multiple source position order consolidation routes and the distance of each source position order consolidation route.

[0115] For example, in response to the number of delivery positions to be delivered within the first neighborhood range in the current delivery route being 1, the source position is respectively added before and after the delivery position to be delivered within the first neighborhood range in the current delivery route, obtaining two source-position combined single routes. For another example, in response to the number of delivery positions to be delivered within the first neighborhood range in the current delivery route being greater than 1, the source position is respectively added before and after the delivery position to be delivered within the first neighborhood range in the current delivery route, as well as between every two adjacent delivery positions to be delivered, obtaining at least three source-position combined single routes. This method can enumerate all source-position combined single routes, thereby obtaining all possible combined single routes, making the combined single effect of this method relatively precise.

[0116] For example, when determining the distance of a source-position combined single route, the distances between adjacent positions in the route can be determined in sequence, and the sum of these distances is used as the distance of the route.

[0117] Next, based on the current delivery route of the candidate delivery person, the delivery positions to be delivered within the second neighborhood range in the current delivery route, and the target position, multiple target-position combined single routes and the distance of each target-position combined single route are determined.

[0118] For example, in response to the number of delivery positions to be delivered within the second neighborhood range in the current delivery route being 1, the target position is respectively added before and after the delivery position to be delivered within the second neighborhood range in the current delivery route, obtaining two target-position combined single routes. For another example, in response to the number of delivery positions to be delivered within the second neighborhood range in the current delivery route being greater than 1, the target position is respectively added before and after the delivery position to be delivered within the second neighborhood range in the current delivery route, as well as between every two adjacent delivery positions to be delivered, obtaining at least three target-position combined single routes. This method can enumerate all target-position combined single routes, thereby obtaining all possible combined single routes, making the combined single effect of this method relatively precise.

[0119] For example, when determining the distance of a target-position combined single route, the distances between adjacent positions in the route can be determined in sequence, and the sum of these distances is used as the distance of the route.

[0120] Finally, based on the source-position combined single route with the minimum distance among the multiple source-position combined single routes and the target-position combined single route with the minimum distance among the multiple target-position combined single routes, the combined single route of the candidate delivery person is determined.

[0121] That is to say, according to the source location with the shortest distance and the adding position of the source location in the single path (i.e., before or after which to-be-delivered position in the current delivery path), and the destination location with the shortest distance and the adding position of the destination location in the single path, the source location and the destination location are respectively added to the current delivery path to obtain the combined order path and the distance of the combined order path.

[0122] The combined order path determined by this method is the path with the shortest distance among all the paths that can be combined by the current delivery paths of all candidate delivery personnel, the source location, and the destination location. This path can complete the delivery of the to-be-delivered orders with the lowest delivery cost, resulting in the lowest combined order cost and the highest efficiency.

[0123] In sub-step S3032, the candidate delivery personnel with the shortest distance of the combined order path is determined as the target delivery personnel, and the current delivery path of the target delivery personnel is updated according to the combined order path of the target delivery personnel.

[0124] That is, the combined order path of the target delivery personnel is determined as the new current delivery path, so as to minimize the distance after the combined order to-be-allocated orders and improve the delivery efficiency of the to-be-allocated orders.

[0125] According to the above embodiments, the source location and the destination location of the to-be-allocated orders, the first neighborhood range of the source location, and the second neighborhood range of the destination location can be obtained, and the delivery personnel whose current delivery paths have to-be-delivered positions falling within the first neighborhood range and to-be-delivered positions falling within the second neighborhood range are determined as candidate delivery personnel. Thus, based on the current delivery paths of each candidate delivery personnel, and the to-be-delivered positions falling within the first neighborhood range and the to-be-delivered positions falling within the second neighborhood range in the current delivery path, the target delivery personnel can be determined and the current delivery path of the target delivery personnel can be updated. That is to say, by judging whether there are both to-be-delivered positions falling within the first neighborhood range and to-be-delivered positions falling within the second neighborhood range in the current delivery path of each delivery personnel, this method can screen out some delivery personnel as candidate delivery personnel among all delivery personnel. Therefore, it is only necessary to select a suitable delivery personnel from the candidate delivery personnel, and during the combined order process, based on the to-be-delivered positions falling within the first neighborhood range and the second neighborhood range in the current delivery path, rather than all the to-be-delivered positions in the current delivery path, thus reducing the computing load during the combined order process and improving the efficiency of the combined order process.

[0126] In some embodiments of the present disclosure, when executing step S302, all delivery personnel in the service area of ​​the delivery service system, or some delivery personnel screened according to certain conditions, can be selected. For example, among the top N delivery personnel with the largest on-the-way scores, the delivery personnel whose to-be-delivered positions fall within the first neighborhood range and the to-be-delivered positions fall within the second neighborhood range in the current delivery path are determined as candidate delivery personnel.

[0127] The on-the-way score can be determined in the following manner: determine the on-the-way score of each delivery personnel according to the locations to be delivered that fall within the first neighborhood range and the locations to be delivered that fall within the second neighborhood range in the current delivery path of each delivery personnel. Optionally, the sum of the number of locations to be delivered that fall within the first neighborhood range and the number of locations to be delivered that fall within the second neighborhood range in the current delivery path is used as the on-the-way score of the delivery personnel. For example, if there are n locations to be delivered that fall within the first neighborhood range and m locations to be delivered that fall within the second neighborhood range in the current delivery path of a delivery personnel, the on-the-way score of the delivery personnel is n+m.

[0128] When the first neighborhood range may include multiple layers of sub-neighborhoods centered on the source location, and the second neighborhood range may include multiple layers of sub-neighborhoods centered on the target location, the en-route score of each delivery personnel may be determined according to the number of to-be-delivered locations falling within each layer of sub-neighborhoods of the first neighborhood range and the number of to-be-delivered locations falling within each layer of sub-neighborhoods of the second neighborhood range in the current delivery path of each delivery personnel.

[0129] For example, you can configure scores for each layer of sub-neighborhoods. The closer the sub-neighborhood is to the center of the neighborhood, the higher the score is, and the farther the sub-neighborhood is from the center of the neighborhood, the lower the score is. Figure 9 Taking the neighborhood range consisting of three layers of sub-neighborhoods j=1, 2, and 3 as an example, the score of the sub-neighborhood of j=1 can be 3, the score of the sub-neighborhood of j=2 can be 2, and the score of the sub-neighborhood of j=3 can be 1. Then, taking the score of each layer of sub-neighborhood as the weight, the number of locations to be delivered in each layer of sub-neighborhoods of the first neighborhood range and the second neighborhood range is weighted and summed to obtain the on-the-way score. That is, the on-the-way score of the delivery personnel is calculated according to the following formula:

[0130]

[0131] In the above formula, is the on-the-way score of the i-th delivery person relative to the k-th order, b k,j is the number of configurations to be delivered that fall within the j-th sub-neighborhood of the first neighborhood of the k-th order in the current delivery path of the i-th delivery person, c k,jis the number of configurations to be delivered that fall within the j-th sub-neighborhood of the second neighborhood of the k-th order in the current delivery path of the i-th delivery person, a j is the score of the j-th sub-neighborhood, and M is the number of sub-neighborhood layers.

[0132] In this embodiment, the delivery personnel are pre-screened by the on-the-way score, so that only the delivery personnel with higher on-the-way scores are determined as candidate delivery personnel, which further reduces the computational load of the order consolidation and improves the efficiency of the order consolidation. In particular, when the on-the-way score is determined in combination with different scores of multiple sub-neighborhoods, the candidate delivery personnel suitable for the order to be delivered can be screened more accurately.

[0133] In some embodiments of the present disclosure, if at least one candidate delivery personnel is obtained in step S302, step S303 is executed to determine the target delivery personnel; the method can also determine that the order to be assigned is determined as an unassigned order in response to each delivery personnel not being determined as the candidate delivery personnel, and determine the unassigned order with the shortest remaining delivery time among other unassigned orders as the order to be assigned. In other words, if each delivery personnel is currently not suitable for delivering the order to be delivered, other orders are directly merged to avoid the problem of excessive delivery costs and waste of delivery personnel caused by merging the order to be delivered to unsuitable delivery personnel. After the order to be delivered is added back to the undelivered orders, the order can still participate and be ordered in the next round of determining the order to be delivered, so that the order can be successfully merged when there is a delivery personnel suitable for delivery.

[0134] According to a second aspect of the embodiment of the present disclosure, an order processing device is provided. Figure 10 , the device comprises:

[0135] An acquisition module 1001 is used to acquire a source location and a target location of an order to be allocated, as well as a first neighborhood range of the source location and a second neighborhood range of the target location;

[0136] A screening module 1002 is used to determine, as candidate delivery personnel, delivery personnel who have a to-be-delivered location falling within the first neighborhood range and a to-be-delivered location falling within the second neighborhood range in a current delivery path, wherein the current delivery path includes a location sequence consisting of at least one to-be-delivered location;

[0137] The determination module 1003 is used to determine the target delivery personnel and update the current delivery path of the target delivery personnel based on the current delivery path of each candidate delivery personnel, and the to-be-delivered locations in the current delivery path that fall within the first neighborhood range and the to-be-delivered locations that fall within the second neighborhood range.

[0138] In one embodiment of the present disclosure, the screening module is used to:

[0139] In response to the existence of a to-be-delivered location within the first neighborhood range and a to-be-delivered location within the second neighborhood range in the current delivery route of the delivery person, and any to-be-delivered location within the first neighborhood range precedes any to-be-delivered location within the second neighborhood range in the order in the current delivery route, determine that the delivery person is a candidate delivery person.

[0140] In one embodiment of the present disclosure, the apparatus further includes an adjacent module for at least one of the following:

[0141] In response to the existence of a to-be-delivered location within the first neighborhood range in the current delivery route of the delivery person and the source location falling within the second neighborhood range, determine that the delivery person is a candidate delivery person;

[0142] In response to the existence of a to-be-delivered location within the second neighborhood range in the current delivery route of the delivery person and the target location falling within the first neighborhood range, determine that the delivery person is a candidate delivery person.

[0143] In one embodiment of the present disclosure, the determining module is configured to:

[0144] According to the current delivery route of each candidate delivery person, and the to-be-delivered locations within the first neighborhood range and the to-be-delivered locations within the second neighborhood range in the current delivery route, respectively determine the combined delivery route of each candidate delivery person and the distance of the combined delivery route, where the combined delivery route is the position sequence formed after adding the source location and the target location to the current delivery route;

[0145] Determine the candidate delivery person with the shortest distance of the combined delivery route as the target delivery person, and update the current delivery route of the target delivery person according to the combined delivery route of the target delivery person.

[0146] In one embodiment of the present disclosure, when the determining module is configured to respectively determine the combined delivery route of each candidate delivery person according to the current delivery route of each candidate delivery person, and the to-be-delivered locations within the first neighborhood range and the to-be-delivered locations within the second neighborhood range in the current delivery route, it is configured to:

[0147] According to the current delivery route of the candidate delivery person, the to-be-delivered locations within the first neighborhood range in the current delivery route, and the source location, determine multiple source location combined delivery routes and the distance of each source location combined delivery route;

[0148] Determine multiple source location combined delivery paths and the distances of each source location combined delivery path according to the current delivery path of the candidate delivery person, the to-be-delivered locations within the second neighborhood range in the current delivery path, and the target location.

[0149] Determine the union of the source location combined delivery path with the minimum distance among the multiple source location combined delivery paths and the target location combined delivery path with the minimum distance among the multiple target location combined delivery paths as the combined delivery path of the candidate delivery person.

[0150] In one embodiment of the present disclosure, when the determining module is used to determine multiple source location combined delivery paths according to the current delivery path of the candidate delivery person, the to-be-delivered locations within the first neighborhood range in the current delivery path, and the source location, it is used for:

[0151] In response to the number of to-be-delivered locations within the first neighborhood range in the current delivery path being 1, add the source location before and after the to-be-delivered location within the first neighborhood range in the current delivery path respectively to obtain two source location combined delivery paths.

[0152] In response to the number of to-be-delivered locations within the first neighborhood range in the current delivery path being greater than 1, add the source location before, after, and between every two adjacent to-be-delivered locations within the first neighborhood range in the current delivery path respectively to obtain at least three source location combined delivery paths.

[0153] In one embodiment of the present disclosure, the device further includes a scoring module, which is used for:

[0154] Respectively determine the convenient delivery scores of each delivery person according to the to-be-delivered locations within the first neighborhood range and the to-be-delivered locations within the second neighborhood range in the current delivery path of each delivery person.

[0155] The screening module is used for:

[0156] Among the top N delivery persons with the maximum convenient delivery scores, determine the delivery persons with to-be-delivered locations within the first neighborhood range and to-be-delivered locations within the second neighborhood range in the current delivery path as candidate delivery persons.

[0157] In one embodiment of the present disclosure, the first neighborhood range includes multiple layers of sub-neighborhoods centered on the source location, and the second neighborhood range includes multiple layers of sub-neighborhoods centered on the target location;

[0158] The scoring module is used for:

[0159] According to the number of delivery positions to be delivered in each sub - neighborhood within the first neighborhood range and the number of delivery positions to be delivered in each sub - neighborhood within the second neighborhood range in the current delivery route of each delivery person respectively, the convenient - route score of each delivery person is determined correspondingly.

[0160] In one embodiment of the present disclosure, the device further includes an order selection module, configured to:

[0161] Determine the undistributed order with the shortest remaining delivery time among multiple undistributed orders as the to - be - distributed order.

[0162] In one embodiment of the present disclosure, the device further includes an order re - selection module, configured to:

[0163] In response to that each delivery person is not determined as the candidate delivery person, determine the to - be - distributed order as an undistributed order, and determine the undistributed order with the shortest remaining delivery time among other undistributed orders as the to - be - distributed order.

[0164] Regarding the device in the above - mentioned embodiment, the specific manners in which each module performs operations have been described in detail in the embodiment of the method in the first aspect, and will not be elaborated here in detail.

[0165] At least one embodiment of the present disclosure further provides a device. Please refer to the appendix Figure 11 , which shows the structure of the device. The device includes a memory and a processor. The memory is used to store computer instructions that can run on the processor, and the processor is used to process orders based on the method described in the first aspect when executing the computer instructions.

[0166] At least one embodiment of the present disclosure further provides a computer - readable storage medium, on which a computer program is stored. When the program is executed by a processor, the method described in the first aspect is implemented.

[0167] In the present disclosure, the terms “first” and “second” are only used for descriptive purposes and cannot be understood as indicating or implying relative importance. The term “plurality” means two or more, unless otherwise clearly defined.

[0168] After considering the specification and practicing the disclosure here, those skilled in the art will easily think of other implementation schemes of the present disclosure. The present disclosure aims to cover any variations, uses, or adaptive changes of the present disclosure. These variations, uses, or adaptive changes follow the general principles of the present disclosure and include common general knowledge or conventional technical means in the technical field not disclosed in the present disclosure. The specification and embodiments are only regarded as exemplary, and the true scope and spirit of the present disclosure are pointed out by the following claims.

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

Claims

1. An order processing method, characterized in that, The method includes: Obtaining the source location and the destination location of the order to be assigned, as well as the first neighborhood range of the source location and the second neighborhood range of the destination location; Determining, as candidate delivery personnel, the delivery personnel whose current delivery path has delivery positions falling within the first neighborhood range and delivery positions falling within the second neighborhood range, where the current delivery path includes a sequence of positions composed of at least one delivery position; Determining a target delivery personnel based on the current delivery path of each candidate delivery personnel, and the delivery positions falling within the first neighborhood range and the delivery positions falling within the second neighborhood range in the current delivery path, and updating the current delivery path of the target delivery personnel.

2. The order processing method according to claim 1, wherein The determining, as candidate delivery personnel, the delivery personnel whose current delivery path has delivery positions falling within the first neighborhood range and delivery positions falling within the second neighborhood range includes: In response to the fact that there are delivery positions falling within the first neighborhood range and delivery positions falling within the second neighborhood range in the current delivery path of the delivery personnel, and any delivery position falling within the first neighborhood range precedes any delivery position falling within the second neighborhood range in the order in the current delivery path, determining the delivery personnel as candidate delivery personnel.

3. The order processing method according to claim 1 or 2, characterized in that The method further includes at least one of the following: In response to the fact that there are delivery positions falling within the first neighborhood range in the current delivery path of the delivery personnel and the source location falls within the second neighborhood range, determining the delivery personnel as candidate delivery personnel; In response to the fact that there are delivery positions falling within the second neighborhood range in the current delivery path of the delivery personnel and the destination location falls within the first neighborhood range, determining the delivery personnel as candidate delivery personnel.

4. The order processing method according to claim 1, wherein The determining a target delivery personnel based on the current delivery path of each candidate delivery personnel, and the delivery positions falling within the first neighborhood range and the delivery positions falling within the second neighborhood range in the current delivery path, and updating the current delivery path of the target delivery personnel includes: Correspondingly determining, for each candidate delivery personnel, the combined order path and the distance of the combined order path based on the current delivery path of each candidate delivery personnel, and the delivery positions falling within the first neighborhood range and the delivery positions falling within the second neighborhood range in the current delivery path, where the combined order path is a sequence of positions formed after adding the source location and the destination location to the current delivery path; Determining, as the target delivery personnel, the candidate delivery personnel with the shortest distance of the combined order path, and updating the current delivery path of the target delivery personnel according to the combined order path of the target delivery personnel.

5. The order processing method according to claim 4, wherein The correspondingly determining, for each candidate delivery personnel, the combined order path based on the current delivery path of each candidate delivery personnel, and the delivery positions falling within the first neighborhood range and the delivery positions falling within the second neighborhood range in the current delivery path includes: Determine multiple source location combined paths and the distances of each source location combined path according to the current delivery path of the candidate delivery person, the to-be-delivered locations within the first neighborhood range in the current delivery path, and the source location; Determine multiple destination location combined paths and the distances of each destination location combined path according to the current delivery path of the candidate delivery person, the to-be-delivered locations within the second neighborhood range in the current delivery path, and the destination location; Determine the combined path of the candidate delivery person according to the source location combined path with the minimum distance among the multiple source location combined paths and the destination location combined path with the minimum distance among the multiple destination location combined paths; 6. The order processing method according to claim 5, wherein The determining multiple source location combined paths according to the current delivery path of the candidate delivery person, the to-be-delivered locations within the first neighborhood range in the current delivery path, and the source location includes: In response to the number of to-be-delivered locations within the first neighborhood range in the current delivery path being 1, add the source location before and after the to-be-delivered location within the first neighborhood range in the current delivery path respectively to obtain two source location combined paths; or, In response to the number of to-be-delivered locations within the first neighborhood range in the current delivery path being greater than 1, add the source location before and after the to-be-delivered location within the first neighborhood range in the current delivery path, and between every two adjacent to-be-delivered locations respectively to obtain at least three source location combined paths; 7. The order processing method according to claim 1, wherein The method further includes: Respectively determine the convenience score of each delivery person according to the to-be-delivered locations within the first neighborhood range and the to-be-delivered locations within the second neighborhood range in the current delivery path of each delivery person; The determining the delivery persons with to-be-delivered locations within the first neighborhood range and to-be-delivered locations within the second neighborhood range in the current delivery path as candidate delivery persons includes: Among the top N delivery persons with the maximum convenience score, determine the delivery persons with to-be-delivered locations within the first neighborhood range and to-be-delivered locations within the second neighborhood range in the current delivery path as candidate delivery persons, where N is a positive integer greater than 1; 8. The order processing method according to claim 7, characterized in that, The first neighborhood range includes multiple layers of sub-neighborhoods centered on the source location, and the second neighborhood range includes multiple layers of sub-neighborhoods centered on the destination location; The respectively determining the convenience score of each delivery person according to the to-be-delivered locations within the first neighborhood range and the to-be-delivered locations within the second neighborhood range in the current delivery path of each delivery person includes: Respectively determine the convenience score of each delivery person according to the number of to-be-delivered locations within each layer of sub-neighborhood in the first neighborhood range and the number of to-be-delivered locations within each layer of sub-neighborhood in the second neighborhood range in the current delivery path of each delivery person; 9. The order processing method according to claim 1, wherein The method further includes: Determine the to-be-allocated order as the unallocated order with the shortest remaining delivery time among multiple unallocated orders; 10. The order processing method according to claim 9, wherein The method further includes: In response to none of the delivery personnel being determined as the candidate delivery personnel, determine that the order to be assigned is an unassigned order, and determine the unassigned order with the shortest remaining delivery time among other unassigned orders as the order to be assigned.

11. An order processing device, characterized in that, The device includes: An acquisition module, configured to acquire the source location and the target location of the order to be assigned, as well as the first neighborhood range of the source location and the second neighborhood range of the target location; A screening module, configured to determine, as candidate delivery personnel, the delivery personnel whose current delivery route has delivery locations to be delivered that fall within the first neighborhood range and delivery locations to be delivered that fall within the second neighborhood range, where the current delivery route includes a sequence of locations composed of at least one delivery location to be delivered; A determination module, configured to determine a target delivery personnel according to the current delivery route of each candidate delivery personnel, and the delivery locations to be delivered that fall within the first neighborhood range and the delivery locations to be delivered that fall within the second neighborhood range in the current delivery route, and update the current delivery route of the target delivery personnel.

12. An electronic device, characterized in that, The device includes a memory and a processor. The memory is configured to store computer instructions that can run on the processor, and the processor is configured to implement the method according to any one of claims 1 to 10 when executing the computer instructions.

13. A computer-readable storage medium having a computer program stored thereon, characterized in that, When the program is executed by the processor, it implements the method according to any one of claims 1 to 10.

Images