Intelligent delivery order distribution method, device and equipment and storage medium

Abstract

The invention relates to the field of logistics, and discloses a delivery order intelligent distribution method, device and equipment and a storage medium, and the method is used for intelligent distribution of delivery orders based on delivery codes. The method comprises the steps of obtaining a to-be-matched courier set, and obtaining a preliminarily screened to-be-matched courier set when couriers which are collection personnel of a delivery order in the to-be-matched courier set are removed; calculating the passing distance between the current position of the courier and the delivery address of the delivery order; if the passing distance exceeds the dynamic distance threshold value, the corresponding couriers are removed from the primary screening to-be-matched courier set, and a secondary screening to-be-matched courier set is obtained; determining a preferred courier set from the secondary screening to-be-matched courier set according to a multi-dimensional priority queue algorithm; and outputting the delivery order to a to-be-received list of couriers in the preferable courier set, and after any courier in the preferable courier set receives the delivery order, associating the delivery code of the delivery order with the received courier.

Description

Technical Field

[0001] The present invention relates to the field of logistics technology, and in particular to a method, device, equipment and storage medium for intelligently splitting delivery orders. Background Art

[0002] In the logistics industry, order splitting often relies on fixed rules to assign couriers. However, this method of assigning orders to couriers based on fixed rules has many shortcomings in practical applications, including the following:

[0003] 1. Lack of dynamic distance judgment mechanism

[0004] Traditional order splitting methods assign couriers solely based on pickup or dispatch codes, seriously lacking dynamic assessment of the distance between the courier and the order. This can result in some couriers being assigned orders that are too far from their intended location, preventing them from successfully picking up their orders. This not only reduces courier efficiency but also impacts the timeliness of the entire delivery process.

[0005] 2. Lack of mechanisms for handling duplicate allocations

[0006] When a delivery code assigns a courier to a pickup code that duplicates a delivery code, existing technologies don't provide an effective mechanism to prevent duplicate display. This duplicate display can lead to redundant and cluttered lists of pending orders, increasing the courier's time spent on sorting through valid orders and reducing work efficiency.

[0007] 3. Insufficient ability to integrate multi-dimensional information

[0008] Existing order splitting methods fail to integrate multi-dimensional information, making it difficult to intuitively demonstrate order splitting logic and anomalies. This not only hinders express delivery managers from monitoring and optimizing the order splitting process, but also makes it difficult to quickly and accurately identify the root cause of order splitting anomalies, thus affecting the operational efficiency and service quality of the entire express delivery business.

[0009] Therefore, the existing technology still needs to be improved and developed. Summary of the Invention

[0010] The present invention provides a method, device, equipment and storage medium for intelligently splitting delivery orders, which are used to intelligently split delivery orders based on delivery codes.

[0011] According to a first aspect of the present invention, there is provided a method for intelligently splitting delivery orders, the method comprising: obtaining a set of couriers to be matched, and when a courier in the set of couriers to be matched is a pickup person for a delivery order, excluding the courier from the set of couriers to be matched to obtain a pre-screened set of couriers to be matched; obtaining the current position of the courier in the pre-screened set of couriers to be matched in real time, and calculating the travel distance between the courier's current position and the delivery address of the delivery order; adjusting a preset distance threshold according to the priority level of the delivery order to obtain a dynamic distance threshold, and if the travel distance exceeds the dynamic distance threshold, excluding the corresponding courier from the pre-screened set of couriers to be matched to obtain a second-screened set of couriers to be matched; determining a preferred set of couriers from the second-screened set of couriers to be matched according to a multi-dimensional priority queue algorithm; outputting the delivery order to a to-be-collected list of couriers in the preferred set of couriers, and when any courier in the preferred set of couriers collects the delivery order, associating the delivery code of the delivery order with the courier who collected it.

[0012] Optionally, in a first implementation method of the first aspect of the present invention, the set of couriers to be matched is obtained, and when a courier in the set of couriers to be matched is a pickup person for a delivery order, the courier is removed from the set of couriers to be matched to obtain a pre-screened set of couriers to be matched, including: obtaining a list of currently available couriers, and generating a set of couriers to be matched based on the currently available couriers list; traversing the set of couriers to be matched, and when the current courier is a pickup person for a delivery order, marking the current courier as a pickup person, and stopping traversing the set of couriers to be matched; removing the marked courier from the set of couriers to be matched to obtain the pre-screened set of couriers to be matched.

[0013] Optionally, in a second implementation method of the first aspect of the present invention, the real-time acquisition of the current location of the courier in the pre-screened set of couriers to be matched, and calculation of the travel distance between the courier's current location and the delivery address of the delivery order, include: for each courier in the pre-screened set of couriers to be matched, acquiring the courier's current location in real time; converting the courier's current location and the delivery address of the delivery order into longitude and latitude coordinates respectively to obtain the courier's longitude and latitude coordinates and the delivery order's longitude and latitude coordinates; and calculating the travel distance between the courier's current location and the delivery address of the delivery order in real time through a GIS distance calculation algorithm based on the courier's longitude and latitude coordinates and the delivery order's longitude and latitude coordinates.

[0014] Optionally, in a third implementation method of the first aspect of the present invention, the preset distance threshold is adjusted according to the priority level of the delivery order to obtain a dynamic distance threshold. If the travel distance exceeds the dynamic distance threshold, the corresponding courier is eliminated from the initial screening of couriers to be matched to obtain a second screening set of couriers to be matched, including: obtaining the priority level of the delivery order, and obtaining a threshold adjustment strategy corresponding to the priority level according to the priority level of the delivery order; adjusting the preset distance threshold according to the threshold adjustment strategy to obtain a dynamic distance threshold; comparing the travel distance with the dynamic distance threshold. If the travel distance exceeds the dynamic distance threshold, the corresponding courier is eliminated from the initial screening of couriers to be matched to obtain a second screening set of couriers to be matched.

[0015] Optionally, in a fourth implementation of the first aspect of the present invention, the determining of a preferred set of couriers from the second-screened set of couriers to be matched based on a multi-dimensional priority queue algorithm includes: obtaining multiple dimensions of priority levels, the multiple dimensions of priority levels including workload, delivery efficiency, and service evaluation; calculating the matching score of each courier in the second-screened set of couriers to be matched based on the multiple dimensions of priority levels; sorting the couriers in descending order based on the scores of each courier to obtain a courier priority queue, and selecting the top 3 couriers in the courier priority queue to form a preferred set of couriers.

[0016] Optionally, in a fifth implementation of the first aspect of the present invention, the matching score of each courier in the second-screened set of couriers to be matched is calculated based on multiple dimensions of the priority level, including: obtaining the original workload value, delivery efficiency original value and service evaluation original value of each courier, and converting the original workload value, the original delivery efficiency original value and the service evaluation original value into standard values ​​to obtain the workload standard value, the delivery efficiency standard value and the service evaluation standard value; calculating the courier's workload score, delivery efficiency score and service evaluation score based on the workload standard value, the delivery efficiency standard value and the service evaluation standard value; and weightedly adding the workload score, delivery efficiency score and service evaluation score to obtain the matching score of each courier.

[0017] Optionally, in a sixth implementation method of the first aspect of the present invention, the delivery order is output to the to-be-collected list of couriers in the preferred courier set, and when any courier in the preferred courier set picks up the delivery order, the delivery code of the delivery order is associated with the courier who picked it up, including: outputting the delivery order to the to-be-collected list of couriers in the preferred courier set; when any courier in the preferred courier set picks up the delivery order, the delivery code of the delivery order is associated with the courier who picked it up; changing the status of the delivery order to picked up, and deleting the to-be-delivered order from the courier's to-be-collected list.

[0018] The second aspect of the present invention provides an intelligent order splitting device for delivery orders, comprising: a primary screening module for obtaining a set of couriers to be matched, and when a courier in the set of couriers to be matched is a collection person of a delivery order, the courier is removed from the set of couriers to be matched to obtain a preliminary screening set of couriers to be matched; a calculation module for obtaining the current location of the couriers in the preliminary screening set of couriers to be matched in real time, and calculating the travel distance between the current location of the courier and the delivery address of the delivery order; a secondary screening module for adjusting the priority level of the delivery order according to the priority level of the delivery order. A distance threshold is preset to obtain a dynamic distance threshold. If the travel distance exceeds the dynamic distance threshold, the corresponding courier will be eliminated from the initial screening set of couriers to be matched, and a second screening set of couriers to be matched will be obtained; a determination module is used to determine a preferred set of couriers from the second screening set of couriers to be matched based on a multi-dimensional priority queue algorithm; an association module is used to output the delivery order to the to-be-collected list of the couriers in the preferred courier set, and when any courier in the preferred courier set collects the delivery order, the delivery code of the delivery order is associated with the courier who collected it.

[0019] Optionally, in a first implementation method of the second aspect of the present invention, the one-time screening module includes: a generation unit, used to obtain a list of currently available couriers, and generate a set of couriers to be matched based on the currently available courier list; a traversal unit, used to traverse the set of couriers to be matched, and when the current courier is the pickup person for the delivery order, mark the current courier as the pickup person, and stop traversing the set of couriers to be matched; a first screening unit, used to remove the marked couriers from the set of couriers to be matched, to obtain the initially screened set of couriers to be matched.

[0020] Optionally, in a second implementation of the second aspect of the present invention, the calculation module includes: a first acquisition unit, used to obtain the current location of the courier in real time for each courier in the set of couriers to be matched in the initial screening; a conversion unit, used to convert the courier's current location and the delivery address of the delivery order into longitude and latitude coordinates respectively, to obtain the courier's longitude and latitude coordinates and the delivery order's longitude and latitude coordinates; a first calculation unit, used to calculate the travel distance between the courier's current location and the delivery address of the delivery order in real time through a GIS distance calculation algorithm based on the courier's longitude and latitude coordinates and the delivery order's longitude and latitude coordinates.

[0021] Optionally, in a third implementation of the second aspect of the present invention, the secondary screening module includes: a second acquisition unit, used to obtain the priority level of the delivery order, and obtain a threshold adjustment strategy corresponding to the priority level according to the priority level of the delivery order; an adjustment unit, used to adjust the preset distance threshold according to the threshold adjustment strategy to obtain a dynamic distance threshold; a second screening unit, used to compare the passing distance with the dynamic distance threshold, and if the passing distance exceeds the dynamic distance threshold, the corresponding courier will be eliminated from the initial screening set of couriers to be matched, to obtain a second screening set of couriers to be matched.

[0022] Optionally, in a fourth implementation of the second aspect of the present invention, the determination module includes: a third acquisition unit, used to acquire multiple dimensions of priority levels, wherein the multiple dimensions of priority levels include workload, delivery efficiency, and service evaluation; a second calculation unit, used to calculate the matching score of each courier in the second-screened set of couriers to be matched based on the multiple dimensions of priority levels; a determination unit, used to sort the couriers in descending order according to the scores of each courier, obtain a courier priority queue, and select the top 3 couriers in the courier priority queue to form a preferred courier set.

[0023] Optionally, in a fifth implementation of the second aspect of the present invention, the association module includes: an output unit for outputting the delivery order to the to-be-collected list of couriers in the preferred courier set; an association unit for associating the delivery code of the delivery order with the courier who picks up the delivery order when any courier in the preferred courier set picks up the delivery order; and a deletion unit for changing the status of the delivery order to picked up and deleting the to-be-delivered order from the courier's to-be-collected list.

[0024] The third aspect of the present invention provides an intelligent delivery order splitting device, comprising: a memory and at least one processor, wherein the memory stores computer-readable instructions, and the memory and the at least one processor are interconnected through lines; the at least one processor calls the computer-readable instructions in the memory so that the intelligent delivery order splitting device executes each step of the intelligent delivery order splitting method as described above.

[0025] A fourth aspect of the present invention provides a computer-readable storage medium, which stores computer-readable instructions. When the computer-readable storage medium is run on a computer, it enables the computer to execute the various steps of the above-mentioned method for intelligent order splitting of delivery orders.

[0026] In the technical solution provided by the present invention, collection personnel are eliminated through database association query to avoid duplication of work by the same person and optimize the delivery process; then, positioning and map services are used to calculate the travel distance, and the distance threshold is dynamically adjusted in combination with the order priority to ensure that the courier allocation not only meets the actual delivery needs, but also gives priority to the rapid delivery of urgent orders; then, with the help of a multi-dimensional priority queue algorithm, factors such as the courier's workload, delivery timeliness and service evaluation are comprehensively considered to make the order distribution results more scientific and reasonable; finally, a clear order and courier association mechanism facilitates order tracking, status updates and responsibility tracing, thereby improving express delivery efficiency and reducing operating costs. BRIEF DESCRIPTION OF THE DRAWINGS

[0027] Figure 1 A first flow chart of the method for intelligently splitting delivery orders provided by an embodiment of the present invention;

[0028] Figure 2 A second flow chart of the method for intelligently splitting delivery orders provided by an embodiment of the present invention;

[0029] Figure 3 A third flow chart of the method for intelligently splitting delivery orders provided by an embodiment of the present invention;

[0030] Figure 4 A fourth flow chart of the method for intelligently splitting delivery orders provided by an embodiment of the present invention;

[0031] Figure 5 A fifth flow chart of the method for intelligently splitting delivery orders provided by an embodiment of the present invention;

[0032] Figure 6 A sixth flow chart of the method for intelligently splitting delivery orders provided by an embodiment of the present invention;

[0033] Figure 7 A schematic diagram of the structure of an intelligent dispatch order splitting device provided by an embodiment of the present invention;

[0034] Figure 8 A schematic diagram of the structure of the intelligent delivery order splitting device provided in an embodiment of the present invention. DETAILED DESCRIPTION

[0035] Embodiments of the present invention provide a method, apparatus, device, and storage medium for intelligently splitting delivery orders. The method is used to intelligently split delivery orders based on delivery codes. The method includes: obtaining a set of couriers to be matched, and when a courier in the set of couriers to be matched is a collection person for a delivery order, excluding the courier from the set of couriers to be matched to obtain a pre-screened set of couriers to be matched; obtaining the current position of the courier in the pre-screened set of couriers to be matched in real time, and calculating the travel distance between the courier's current position and the delivery address of the delivery order; adjusting a preset distance threshold according to the priority level of the delivery order to obtain a dynamic distance threshold, and if the travel distance exceeds the dynamic distance threshold, excluding the corresponding courier from the pre-screened set of couriers to be matched to obtain a second-screened set of couriers to be matched; determining a preferred set of couriers from the second-screened set of couriers to be matched according to a multi-dimensional priority queue algorithm; outputting the delivery order to a to-be-collected list of couriers in the preferred courier set, and when any courier in the preferred courier set collects the delivery order, associating the delivery code of the delivery order with the courier who collected it.

[0036] The terms "first," "second," "third," "fourth," and the like (if any) in the description and claims of the present invention and in the accompanying drawings are used to distinguish similar objects and are not necessarily used to describe a particular order or precedence. It should be understood that the terms used in this manner are interchangeable where appropriate so that the embodiments described herein can be implemented in an order other than that illustrated or described herein. In addition, the terms "including" or "having" and any variations thereof are intended to cover non-exclusive inclusions, for example, a process, method, system, product, or apparatus that includes a series of steps or units is not necessarily limited to those steps or units explicitly listed, but may include other steps or units that are not explicitly listed or that are inherent to these processes, methods, products, or apparatus.

[0037] For ease of understanding, the specific process of the embodiment of the present invention is described below. Figure 1 A first embodiment of a method for intelligently splitting delivery orders in an embodiment of the present invention includes:

[0038] S101. Obtain a set of couriers to be matched, and when a courier in the set of couriers to be matched is a pickup person for a delivery order, remove the courier from the set of couriers to be matched to obtain a pre-screened set of couriers to be matched.

[0039] It is understandable that the execution subject of the present invention can be a delivery order intelligent order distribution device, or a terminal or a server, which is not limited here. The embodiment of the present invention is described by taking the server as the execution subject as an example.

[0040] In this embodiment, the logistics information system stores the work task records of all couriers and the collection personnel information corresponding to each delivery order.

[0041] In this embodiment, information of all couriers who are currently in a state of being available for delivery is retrieved from the database to form a set of couriers to be matched.

[0042] In this embodiment, the couriers in the set of couriers to be matched who are the same as the person who picks up the delivery order are screened out and eliminated, thereby obtaining a preliminary set of couriers to be matched.

[0043] S102: Obtain the current location of the couriers in the initial screening of the set of couriers to be matched in real time, and calculate the travel distance between the current location of the courier and the delivery address of the delivery order.

[0044] In this embodiment, the courier's mobile device (such as a mobile phone or handheld terminal) is usually installed with an APP with a positioning function, which uploads the courier's location information to the logistics information system in real time through positioning technologies such as GPS or Beidou.

[0045] In this embodiment, after obtaining the current location of the couriers in the initial screening of the couriers to be matched in real time, combined with the map service (such as Amap API, Baidu Map API), the travel distance between the courier's current location and the delivery address of the delivery order is calculated, including the actual travelable distance after considering factors such as road conditions and traffic congestion.

[0046] S103. Adjust the preset distance threshold according to the priority level of the delivery order to obtain a dynamic distance threshold. If the travel distance exceeds the dynamic distance threshold, the corresponding courier is removed from the initial screening set of couriers to be matched, and a second screening set of couriers to be matched is obtained.

[0047] In this embodiment, a priority level field is pre-set for each delivery order, such as "expedited", "normal", "economy", etc. The basic distance thresholds for different priority levels are pre-set, for example, the basic threshold for expedited orders is 5 kilometers, and for normal orders it is 10 kilometers. When a new delivery order is received, the basic distance threshold is adjusted according to the priority of the order. For example, the threshold for expedited orders can be reduced to 3 kilometers during peak hours. The calculated travel distance between the courier and the delivery address is then compared with the dynamic distance threshold. If the threshold is exceeded, the courier is removed from the set of couriers to be matched in the initial screening, thereby obtaining the set of couriers to be matched in the second screening.

[0048] S104. Determine a preferred set of couriers from the second-screened set of couriers to be matched according to a multi-dimensional priority queue algorithm.

[0049] In this embodiment, the multi-dimensional priority queue algorithm integrates data from multiple dimensions to evaluate the courier's suitability.

[0050] In this embodiment, data such as the current workload (e.g., number of uncompleted delivery orders), historical delivery efficiency (average delivery time, on-time delivery rate), and service evaluation (customer rating, complaint rate) of each courier in the second-screened matching courier set is obtained from the logistics information system database. This data is weighted according to certain weights (e.g., current workload accounts for 30%, historical delivery efficiency accounts for 40%, and service evaluation accounts for 30%) to obtain a comprehensive score for each courier. The couriers are then ranked according to their scores, and the top-ranked couriers are selected to form the preferred courier set.

[0051] S105: Output the delivery order to a waiting list of couriers in the preferred courier set. When any courier in the preferred courier set picks up the delivery order, associate the delivery code of the delivery order with the courier who picked up the order.

[0052] In this embodiment, delivery order information is synchronized to the pending pickup list on each courier's mobile device application within the preferred courier collection system. Couriers can view the details of pending delivery orders in the list. When a courier chooses to pick up an order, the unique delivery code for that order is associated and stored with the identity of the courier who picked it up, facilitating subsequent order tracking, status updates, and accountability.

[0053] This embodiment provides a method for intelligently splitting delivery orders. It eliminates pickup personnel through database association queries to avoid duplication of work by the same person and optimize the delivery process. Next, it uses positioning and map services to calculate the travel distance, and dynamically adjusts the distance threshold based on order priority to ensure that courier allocation not only meets actual delivery needs but also prioritizes the rapid delivery of urgent orders. Then, with the help of a multi-dimensional priority queue algorithm, it comprehensively considers factors such as courier workload, delivery timeliness, and service evaluation to make the order splitting results more scientific and reasonable. Finally, a clear order and courier association mechanism facilitates order tracking, status updates, and responsibility tracing, thereby improving express delivery efficiency and reducing operating costs.

[0054] See also Figure 2 The second embodiment of the method for intelligently splitting delivery orders in the embodiment of the present invention includes:

[0055] S201. Obtain a list of currently available couriers, and generate a set of couriers to be matched based on the currently available couriers list.

[0056] In this embodiment, a table structure specifically stores courier information and work status within the logistics information system's database. The system executes an SQL query, such as SELECT * FROM courier_table WHERE work_status = 'available', to filter out records from this table for couriers who are currently available and available for delivery (i.e., whose work_status field value is "available"). This retrieves a list of currently available couriers. The system then integrates the relevant information for these available couriers to generate a set of couriers to be matched, which serves as the basis for subsequent filtering operations.

[0057] S202: traverse the set of couriers to be matched. When the current courier is the pickup person for the delivery order, mark the current courier as the pickup person and stop traversing the set of couriers to be matched.

[0058] In this embodiment, the set of couriers to be matched is processed in a loop traversal manner. In each loop, the system compares the unique identifier of the current courier (such as the courier ID) with the identification field of the pickup person in the delivery order record through a database association query. If the two are found to be consistent, the current courier is determined to be the pickup person for the delivery order. At this time, the system will add a marking field (such as is_pickup = True) to the courier information record to mark it as the pickup person. At the same time, by executing the break statement (taking Python as an example), the traversal operation of the entire set of couriers to be matched is stopped, avoiding unnecessary loop calculations and improving screening efficiency.

[0059] S203: Eliminate the marked couriers from the set of couriers to be matched, and obtain a pre-screened set of couriers to be matched.

[0060] In this example, a database operation executes a delete statement, such as DELETE FROM courier_set_table WHERE is_pickup = True in SQL, to remove the courier records marked as pickup personnel from the database table corresponding to the courier set to be matched. After this operation, the remaining courier set becomes the initial screening courier set to be matched. Couriers in this set have not participated in the pickup work for the current delivery order and are eligible for subsequent screening.

[0061] In this embodiment, efficient preliminary screening of delivery personnel is achieved through precise screening and processing of courier data. When obtaining a list of available couriers and generating a set of couriers to be matched, database queries are used to quickly locate available delivery personnel, ensuring the timeliness and accuracy of the data. During the traversal process, an associated query and marking mechanism is used to quickly identify the collection personnel and save system resources by stopping the traversal in time. Finally, the marked personnel are eliminated to obtain a pure set of couriers to be matched, laying a good foundation for subsequent order distribution.

[0062] See also Figure 3 A third embodiment of a method for intelligently splitting delivery orders according to an embodiment of the present invention includes:

[0063] S301. For each courier in the set of initially screened couriers to be matched, obtain the current location of the courier in real time.

[0064] In this embodiment, the courier is usually equipped with an intelligent terminal device (such as a smart phone, a handheld terminal) installed with a dedicated logistics distribution APP. The APP will call the positioning function of the device and obtain the courier's location information in real time based on positioning technologies such as the Global Positioning System (GPS) and the Beidou Satellite Navigation System. At the same time, the APP will upload the acquired location information to the server of the logistics information system in the form of an API interface call through a wireless network (4G / 5G, Wi-Fi) at regular intervals (such as once every 30 seconds). The server will store the received location information of each courier in the database, thereby realizing real-time acquisition of the current location of each courier in the initial screening of the couriers to be matched.

[0065] S302: Convert the current location of the courier and the delivery address of the delivery order into longitude and latitude coordinates respectively, to obtain the longitude and latitude coordinates of the courier and the longitude and latitude coordinates of the delivery order.

[0066] In this embodiment, the logistics information system connects to professional map service APIs (such as the AutoNavi Map API and the Baidu Map API). For the courier's current location, the system reads the courier's location description (such as detailed address text) from the database and converts it into corresponding longitude and latitude coordinates by calling the geocoding interface in the map service API. For the delivery address of a delivery order, the address text is similarly extracted from the order information database and converted into precise longitude and latitude coordinates using the geocoding interface.

[0067] S303. Based on the courier's longitude and latitude coordinates and the delivery order's longitude and latitude coordinates, a GIS distance calculation algorithm is used to calculate in real time the distance between the courier's current location and the delivery address of the delivery order.

[0068] In this embodiment, the geographic information system (GIS) includes a variety of distance calculation algorithms, the most common of which are the Haversine formula algorithm, the Vincenty formula algorithm, etc. Taking the Haversine formula algorithm as an example, the algorithm is based on the assumption that the earth is a sphere. It uses the latitude and longitude differences in the courier's longitude and latitude coordinates and the delivery order's longitude and latitude coordinates to calculate the shortest distance between two points on the sphere through a series of mathematical operations (such as trigonometric function calculations). The system substitutes the two sets of longitude and latitude coordinate data obtained into the corresponding algorithm formula, performs real-time calculations on the server side, and finally obtains the travel distance between the courier's current location and the delivery address of the delivery order. In addition, the calculation results can be corrected in combination with the real-time traffic data provided by the map service to make the travel distance more in line with the actual delivery situation.

[0069] In this embodiment, the location acquisition process uses smart terminal devices and positioning technology to ensure the real-time update and accurate transmission of courier location information. During the coordinate conversion process, relying on professional map service APIs, address information is efficiently converted into latitude and longitude coordinates that can be used for calculations. When calculating distance, GIS algorithms are combined with road condition data to determine the travel distance that conforms to the actual delivery scenario. This series of operations not only provides a reliable basis for subsequent distance-based courier screening, avoiding the inefficient delivery time caused by assigning couriers who are too far away, but also dynamically adjusts the order distribution strategy based on real-time location, optimizes resource allocation, improves the overall efficiency of express delivery, reduces the time and cost waste caused by unreasonable route planning, enhances the timeliness and reliability of express delivery services, and provides customers with a better service experience.

[0070] See also Figure 4 A fourth embodiment of a method for intelligently splitting delivery orders according to an embodiment of the present invention includes:

[0071] S401: Obtain the priority level of the delivery order, and obtain a threshold adjustment strategy corresponding to the priority level according to the priority level of the delivery order.

[0072] In this embodiment, the database table of each delivery order will have a special "priority level" field, and common priority level identifiers include "expedited", "normal", "economy", etc.

[0073] In this embodiment, the priority level of the corresponding delivery order is extracted from the order table by executing an SQL query statement, such as SELECT priority_levelFROMdelivery_order_table WHERE order_id='specific order number'. The system also has a pre-set "priority-threshold adjustment strategy" mapping table that stores the threshold adjustment rules corresponding to different priority levels.

[0074] After obtaining the order priority, the matching threshold adjustment strategy is obtained according to the mapping table. For example, for expedited orders, the distance threshold is shortened, for ordinary orders, the default threshold is maintained, and for economic orders, the threshold can be appropriately relaxed.

[0075] S402: Adjust the preset distance threshold according to the threshold adjustment strategy to obtain a dynamic distance threshold.

[0076] In this embodiment, a basic preset distance threshold, for example, 10 kilometers, is pre-set. After obtaining the threshold adjustment policy, the preset distance threshold is adjusted according to the policy. If the policy is to shorten the threshold by 50%, the preset 10 kilometers is adjusted to 5 kilometers through calculation; if the policy is to relax the threshold by 20%, the 10 kilometers is adjusted to 12 kilometers.

[0077] S403. Compare the travel distance with the dynamic distance threshold. If the travel distance exceeds the dynamic distance threshold, the corresponding courier is removed from the initial screening set of couriers to be matched, and a second screening set of couriers to be matched is obtained.

[0078] In this embodiment, the previously calculated distance data between each courier and the delivery address of the delivery order is read, and the newly calculated dynamic distance threshold is retrieved. Each courier's distance is compared against the dynamic distance threshold one by one using a conditional statement in a programming language (such as an if statement in Python). If a courier's distance is greater than the dynamic distance threshold, a delete operation is executed, removing the courier from the initial set of couriers to be matched. After comparing and screening all couriers, the remaining set of couriers is the second set of couriers to be matched.

[0079] In this embodiment, the rationality and flexibility of express delivery order splitting are significantly improved through the intelligent dynamic distance threshold adjustment and screening mechanism. In the order priority acquisition and strategy matching link, relying on the orderly storage and efficient query of the system database, the adaptive threshold adjustment rules are quickly determined; in the threshold adjustment process, the dynamic distance threshold is accurately set according to the clear calculation logic, so that the order splitting standard fits the needs of different orders; the courier screening operation is strictly performed according to the threshold comparison results, effectively excluding couriers who are too far away. This order splitting method can not only ensure that expedited orders are delivered first by couriers who are close to the delivery point to ensure timeliness, but also make rational use of resources when allocating ordinary and economic orders, avoiding the waste of resources caused by excessive pursuit of close-range distribution. By flexibly adjusting the order splitting distance standard, the courier resource allocation is optimized, the overall delivery efficiency is improved, and while meeting the diverse needs of customers, the company's operating costs are reduced, and the market competitiveness of express delivery services is enhanced.

[0080] See also Figure 5 A fifth embodiment of a method for intelligently splitting delivery orders according to an embodiment of the present invention includes:

[0081] S501. Acquire multiple dimensions of priority levels, where the multiple dimensions of priority levels include workload, delivery efficiency, and service evaluation.

[0082] S502: Calculate the matching score of each courier in the second-screened set of couriers to be matched based on multiple dimensions of priority levels.

[0083] In this embodiment, the matching score of each courier in the second-screened set of couriers to be matched is calculated based on multiple dimensions of priority level, specifically including: obtaining the original value of workload, original value of delivery efficiency and original value of service evaluation of each courier, and converting the original value of workload, original value of delivery efficiency and original value of service evaluation into standard values ​​to obtain standard value of workload, standard value of delivery efficiency and standard value of service evaluation; calculating the workload score, delivery efficiency score and service evaluation score of the courier based on the standard value of workload, standard value of delivery efficiency and standard value of service evaluation; and weighted addition of the workload score, delivery efficiency score and service evaluation score to obtain the matching score of each courier.

[0084] In this embodiment, for the workload dimension, the number of currently uncompleted delivery orders for each courier is extracted from the order allocation database; the data for the delivery efficiency dimension comes from historical delivery records, and the average delivery time for each courier in the past week is calculated; the data for the service evaluation dimension is obtained from the customer feedback system, and the average customer rating of each courier is extracted.

[0085] In this example, the raw data of each courier is read from the data warehouse. The raw workload value (number of unfulfilled orders) is mapped to a range of 0-100 using the Min-Max normalization method, with fewer orders giving higher scores. The raw delivery efficiency value (average delivery time) is converted to a standard normal distribution using the Z-Score normalization method, with shorter delivery times giving higher scores. The raw service evaluation value (customer rating) is directly scaled to a range of 0-100.

[0086] For example, if a courier's customer rating is 4.5 points (out of 5 points), then the service evaluation standard value is 4.5 / 5*100=90 points.

[0087] In this embodiment, weight coefficients for each dimension are pre-set, such as workload accounting for 30%, delivery efficiency accounting for 40%, and service evaluation accounting for 30%. The final matching score for each courier is calculated by weighted summation. For example, if a courier has a workload score of 80, a delivery efficiency score of 90, and a service evaluation score of 85, their matching score is 80*0.3+90*0.4+85*0.3=85.5.

[0088] S503 , sort the couriers in descending order according to their scores to obtain a courier priority queue, and select the top three couriers in the courier priority queue to form a preferred courier set.

[0089] In this example, an efficient sorting algorithm, such as quick sort or heap sort, is used to sort all couriers' matching scores in descending order, forming a priority queue. Then, through array slicing, the top three couriers in the queue are selected, and their IDs and related information are stored in the data structure of the preferred courier set, completing the final screening.

[0090] In this embodiment, standardization eliminates the dimensionality impact of data from different dimensions, making the scores comparable; the nonlinear score conversion function highlights the advantages of efficient couriers, meeting actual business needs; the weighted summation comprehensively considers the importance of each dimension, making the final score more objective and fair; priority queue sorting quickly locates the optimal resource. This intelligent order distribution method avoids the one-sidedness of single-dimensional decision-making and can accurately identify the courier most suitable for the current order, ensuring efficient order delivery while optimizing overall resource allocation, improving customer satisfaction and enterprise operational efficiency.

[0091] See also Figure 6 A sixth embodiment of a method for intelligently splitting delivery orders in an embodiment of the present invention includes:

[0092] S601: Output the delivery order to the to-be-collected list of the couriers in the preferred courier set.

[0093] In this embodiment, delivery order notifications are pushed to each courier in the preferred courier set via a message queue (e.g., RabbitMQ). Separate message queues (e.g., courier_123_orders_queue) are then created for each courier, and order messages are sent to these queues. The courier's mobile app (APP) continuously monitors its respective message queues via a persistent connection. When a new order message is received, the app displays the delivery order information in real time on the pending order list and triggers a push notification (e.g., sound or vibration).

[0094] S602: When any courier in the preferred courier set picks up the delivery order, the delivery code of the delivery order is associated with the courier who picked up the order.

[0095] In this example, when the courier clicks the "Get" button in the pending collection list on the mobile app, the app sends an HTTP request to the server containing the order ID and courier ID. Upon receiving the request, the server first verifies the legitimacy of the courier's identity and order status. It then performs a database transaction: inserting a record into the order allocation table, associating the delivery code (e.g., PC789012) with the courier ID (e.g., COU456789), and recording the collection timestamp.

[0096] S603: Change the status of the delivery order to "collected" and delete the delivery order from the courier's collection list.

[0097] In this example, the order status is updated from "pending" to "collected," and the courier ID assigned to the order is recorded. Simultaneously, the system sends a notification of the order status change to all relevant courier apps via a message queue. When other courier apps receive the notification, they automatically remove the order from their respective pending collection lists to ensure data consistency.

[0098] In this embodiment, real-time push of orders is achieved through message queues, ensuring that couriers can obtain assigned tasks in a timely manner; database transactions are used to ensure the atomicity of the association between delivery codes and couriers, avoiding data inconsistency problems; the state management mechanism realizes the tracking and visualization of the entire life cycle of orders, reducing errors that may be caused by manual intervention. At the same time, through real-time data synchronization, it provides couriers with a clear task view, reduces communication costs, and improves overall delivery efficiency and customer satisfaction.

[0099] The above describes the intelligent order splitting method of the delivery order in the embodiment of the present invention. The following describes the device in the embodiment of the present invention. Figure 7 , the implementation of the intelligent dispatch order splitting device in the embodiment of the present invention includes:

[0100] A primary screening module 701 is configured to obtain a set of couriers to be matched, and if a courier in the set of couriers to be matched is a pickup person for a delivery order, the courier is removed from the set of couriers to be matched, thereby obtaining a preliminary screened set of couriers to be matched;

[0101] A calculation module 702 is used to obtain the current location of the courier in the pre-screened set of couriers to be matched in real time, and calculate the travel distance between the courier's current location and the delivery address of the delivery order;

[0102] Secondary screening module 703 is configured to adjust the preset distance threshold according to the priority level of the delivery order to obtain a dynamic distance threshold. If the travel distance exceeds the dynamic distance threshold, the corresponding courier is removed from the primary screening set of couriers to be matched, thereby obtaining a secondary screening set of couriers to be matched.

[0103] A determination module 704 is configured to determine a preferred set of couriers from the second screened set of couriers to be matched based on a multi-dimensional priority queue algorithm;

[0104] The association module 705 is used to output the delivery order to the to-be-collected list of couriers in the preferred courier set. When any courier in the preferred courier set collects the delivery order, the delivery code of the delivery order is associated with the courier who collected the delivery order.

[0105] In this embodiment, the primary screening module 701 includes: a generation unit 7011, used to obtain a list of currently available couriers, and generate a set of couriers to be matched based on the currently available courier list; a traversal unit 7012, used to traverse the set of couriers to be matched, and when the current courier is the pickup person for the delivery order, mark the current courier as the pickup person, and stop traversing the set of couriers to be matched; a first screening unit 7013, used to remove the marked couriers from the set of couriers to be matched, to obtain the initially screened set of couriers to be matched.

[0106] In this embodiment, the calculation module 702 includes: a first acquisition unit 7021, which is used to obtain the current location of the courier in real time for each courier in the set of couriers to be matched in the initial screening; a conversion unit 7022, which is used to convert the current location of the courier and the delivery address of the delivery order into longitude and latitude coordinates respectively, to obtain the longitude and latitude coordinates of the courier and the longitude and latitude coordinates of the delivery order; a first calculation unit 7023, which is used to calculate the travel distance between the current location of the courier and the delivery address of the delivery order in real time based on the longitude and latitude coordinates of the courier and the longitude and latitude coordinates of the delivery order through a GIS distance calculation algorithm.

[0107] In this embodiment, the secondary screening module 703 includes: a second acquisition unit 7031, used to obtain the priority level of the delivery order, and obtain a threshold adjustment strategy corresponding to the priority level according to the priority level of the delivery order; an adjustment unit 7032, used to adjust the preset distance threshold according to the threshold adjustment strategy to obtain a dynamic distance threshold; a second screening unit 7033, used to compare the passing distance with the dynamic distance threshold. If the passing distance exceeds the dynamic distance threshold, the corresponding courier will be eliminated from the initial screening set of couriers to be matched, and a second screening set of couriers to be matched will be obtained.

[0108] In this embodiment, the determination module 704 includes: a third acquisition unit 7041, which is used to obtain multiple dimensions of priority levels, and the multiple dimensions of priority levels include workload, delivery efficiency and service evaluation; a second calculation unit 7042, which is used to calculate the matching score of each courier in the second-screened set of couriers to be matched based on the multiple dimensions of priority levels; a determination unit 7043, which is used to sort the couriers in descending order according to the scores of each courier to obtain a courier priority queue, and select the top 3 couriers in the courier priority queue to form a preferred courier set.

[0109] In this embodiment, the association module 705 includes: an output unit 7051, which is used to output the delivery order to the to-be-collected list of the couriers in the preferred courier set; an association unit 7052, which is used to associate the delivery code of the delivery order with the courier who picked up the delivery order when any courier in the preferred courier set picks up the delivery order; a deletion unit 7053, which is used to change the status of the delivery order to picked up and delete the to-be-delivered order from the courier's to-be-collected list.

[0110] In this embodiment, collection personnel are eliminated through database association query to avoid duplication of work by the same person and optimize the delivery process; then, positioning and map services are used to calculate the travel distance, and the distance threshold is dynamically adjusted in combination with the order priority to ensure that the courier allocation not only meets the actual delivery needs, but also gives priority to the rapid delivery of urgent orders; then, with the help of a multi-dimensional priority queue algorithm, factors such as the courier's workload, delivery timeliness and service evaluation are comprehensively considered to make the order distribution results more scientific and reasonable; finally, a clear order and courier association mechanism facilitates order tracking, status updates and responsibility tracing, thereby improving express delivery efficiency and reducing operating costs.

[0111] Figure 7 The structure of the intelligent delivery order splitting device shown does not constitute a limitation on the intelligent delivery order splitting device, and can implement the steps of the intelligent delivery order splitting method provided by the above-mentioned method embodiments.

[0112] above Figure 7 The intelligent dispatch order splitting device in the embodiment of the present invention is described in detail from the perspective of modular functional entities, and the intelligent dispatch order splitting device in the embodiment of the present invention is described in detail from the perspective of hardware processing.

[0113] Figure 8It is a structural diagram of an intelligent dispatch order distribution device provided by an embodiment of the present invention. The device 800 may have relatively large differences due to different configurations or performances, and may include one or more processors (central processing units, CPU) 810 (for example, one or more processors) and memory 820, one or more storage media 830 (for example, one or more massive storage devices) storing application programs 833 or data 832. Among them, the memory 820 and the storage medium 830 can be short-term storage or persistent storage. The program stored in the storage medium 830 may include one or more modules (not shown), and each module may include a series of instruction operations on the device 800. Furthermore, the processor 810 may be configured to communicate with the storage medium 830 to execute a series of instruction operations in the storage medium on the device 800.

[0114] The device 800 may also include one or more power supplies 840, one or more wired or wireless network interfaces 850, one or more input and output interfaces 860, and / or one or more operating systems 831, such as Windows Server, Mac OS X, Unix, Linux, FreeBSD, etc.

[0115] An embodiment of the present invention also provides a computer-readable storage medium, which may be a non-volatile computer-readable storage medium or a volatile computer-readable storage medium. Instructions are stored in the computer-readable storage medium. When the instructions are executed on a computer, the computer executes the steps of the method for intelligent order splitting of delivery orders.

[0116] Those skilled in the art will clearly understand that, for the convenience and brevity of description, the specific working processes of the above-described systems, devices, and units can refer to the corresponding processes in the aforementioned method embodiments and will not be repeated here.

[0117] If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present invention is essentially or the part that contributes to the prior art or all or part of the technical solution can be embodied in the form of a software product. The computer software product is stored in a storage medium and includes several instructions for enabling a computer device (which can be a personal computer, server, or network device, etc.) to perform all or part of the steps of the method described in each embodiment of the present invention. The aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (ROM), random access memory (RAM), magnetic disk or optical disk, etc., various media that can store program code.

[0118] As described above, the above embodiments are only used to illustrate the technical solutions of the present invention, rather than to limit the same. Although the present invention has been described in detail with reference to the above embodiments, those skilled in the art should understand that the technical solutions described in the above embodiments can still be modified, or some of the technical features thereof can be replaced by equivalents. However, these modifications or replacements do not deviate the essence of the corresponding technical solutions from the spirit and scope of the technical solutions of the embodiments of the present invention.

Claims

1. A method for intelligent order splitting of delivery orders, characterized in that: The intelligent order splitting method for delivery orders includes: Obtain a set of couriers to be matched, and if a courier in the set of couriers to be matched is a pickup person for a delivery order, remove the courier from the set of couriers to be matched, thereby obtaining a pre-screened set of couriers to be matched; Obtaining the current location of the courier in the pre-screened set of couriers to be matched in real time, and calculating the travel distance between the courier's current location and the delivery address of the delivery order; Adjusting the preset distance threshold according to the priority level of the delivery order to obtain a dynamic distance threshold; if the travel distance exceeds the dynamic distance threshold, the corresponding courier is removed from the initial screening set of couriers to be matched, thereby obtaining a second screening set of couriers to be matched; Determine a preferred set of couriers from the second set of couriers to be matched according to a multi-dimensional priority queue algorithm; The delivery order is output to a waiting list of couriers in the preferred courier set. When any courier in the preferred courier set picks up the delivery order, the delivery code of the delivery order is associated with the courier who picked up the order.

2. The intelligent order splitting method according to claim 1, characterized in that: The process of obtaining a set of couriers to be matched and excluding a courier from the set of couriers to be matched when the courier is a pickup person for a delivery order, thereby obtaining a pre-screened set of couriers to be matched, including: Obtain a list of currently available couriers, and generate a set of couriers to be matched based on the currently available couriers list; Traversing the set of couriers to be matched, when the current courier is the pickup person for the delivery order, marking the current courier as the pickup person, and stopping traversing the set of couriers to be matched; The marked couriers are removed from the set of couriers to be matched to obtain the initially screened set of couriers to be matched.

3. The intelligent order splitting method according to claim 1, characterized in that: The real-time acquisition of the current location of the courier in the set of initially screened couriers to be matched, and calculation of the travel distance between the courier's current location and the delivery address of the delivery order, includes: For each courier in the set of initially screened couriers to be matched, obtaining the current location of the courier in real time; Convert the courier's current location and the delivery address of the delivery order into longitude and latitude coordinates respectively, and obtain the courier's longitude and latitude coordinates and the delivery order's longitude and latitude coordinates; Based on the courier's longitude and latitude coordinates and the delivery order's longitude and latitude coordinates, the distance between the courier's current location and the delivery address of the delivery order is calculated in real time using a GIS distance calculation algorithm.

4. The intelligent order splitting method according to claim 1, characterized in that: The preset distance threshold is adjusted according to the priority level of the delivery order to obtain a dynamic distance threshold. If the travel distance exceeds the dynamic distance threshold, the corresponding courier is removed from the set of couriers to be matched in the initial screening, and a set of couriers to be matched in the second screening is obtained, including: Obtain the priority level of the delivery order, and obtain the threshold adjustment strategy corresponding to the priority level according to the priority level of the delivery order; Adjust the preset distance threshold according to the threshold adjustment strategy to obtain a dynamic distance threshold; The travel distance is compared with the dynamic distance threshold. If the travel distance exceeds the dynamic distance threshold, the corresponding courier is removed from the initial screening set of couriers to be matched, and a second screening set of couriers to be matched is obtained.

5. The intelligent order splitting method according to claim 1, characterized in that: Determining the preferred courier set from the second screened set of couriers to be matched according to the multi-dimensional priority queue algorithm includes: Obtaining multiple dimensions of priority levels, wherein the multiple dimensions of priority levels include workload, delivery efficiency, and service evaluation; Calculating a matching score for each courier in the second-screened set of couriers to be matched based on the multiple dimensions of the priority level; The couriers are sorted in descending order according to their scores to obtain a courier priority queue, and the top three couriers in the courier priority queue are selected to form a preferred courier set.

6. The intelligent order splitting method according to claim 5, characterized in that: The calculating of the matching score of each courier in the second screening set of couriers to be matched based on the multiple dimensions of the priority level includes: Obtain the original workload value, delivery efficiency value, and service evaluation value of each courier, and convert the original workload value, delivery efficiency value, and service evaluation value into standard values ​​to obtain standard workload values, standard delivery efficiency values, and service evaluation standard values; The courier's workload score, delivery efficiency score, and service evaluation score are calculated based on the workload standard value, delivery efficiency standard value, and service evaluation standard value; The workload score, delivery efficiency score, and service evaluation score are weighted and added together to obtain the matching score of each courier.

7. The intelligent order splitting method according to claim 1, characterized in that: Outputting the delivery order to a to-be-collected list of couriers in the preferred courier set, and associating the delivery code of the delivery order with the courier who has collected the delivery order when any courier in the preferred courier set collects the delivery order, includes: Output the delivery order to the courier's waiting list in the preferred courier collection; When any courier in the preferred courier set picks up the delivery order, the delivery code of the delivery order is associated with the courier who picked up the order; Change the status of the delivery order to "collected" and delete the delivery order from the courier's collection list.

8. An intelligent dispatch order splitting device, characterized in that: include: A primary screening module is used to obtain a set of couriers to be matched, and when a courier in the set of couriers to be matched is a pickup person for a delivery order, the courier is removed from the set of couriers to be matched, thereby obtaining a preliminary set of couriers to be matched; A calculation module, configured to obtain in real time the current location of the courier in the set of couriers to be matched in the initial screening, and calculate the travel distance between the courier's current location and the delivery address of the delivery order; A secondary screening module is configured to adjust a preset distance threshold according to the priority level of the delivery order to obtain a dynamic distance threshold. If the travel distance exceeds the dynamic distance threshold, the corresponding courier is removed from the set of couriers to be matched in the primary screening, thereby obtaining a set of couriers to be matched in the secondary screening; A determination module, configured to determine a preferred set of couriers from the second set of couriers to be matched according to a multi-dimensional priority queue algorithm; The association module is used to output the delivery order to the to-be-collected list of couriers in the preferred courier set, and when any courier in the preferred courier set collects the delivery order, the delivery code of the delivery order is associated with the courier who collected the order.

9. An intelligent dispatch order splitting device, characterized in that: comprising a memory and at least one processor, wherein the memory has computer-readable instructions stored therein; The at least one processor calls the computer-readable instructions in the memory to execute the various steps of the intelligent order splitting method for delivery orders as described in any one of claims 1-7.

10. A computer-readable storage medium having computer-readable instructions stored thereon, characterized in that: When the computer-readable instructions are executed by a processor, the various steps of the method for intelligent order splitting of delivery orders as described in any one of claims 1 to 7 are implemented.

Images