An automatic dispatching method based on transport capacity detection, a storage medium and a system

Abstract

The application provides an automatic order dispatching method based on transport capacity detection, a storage medium and a system. The method comprises the following steps: obtaining a to-be-delivered order, identifying a pickup address and a delivery address of the to-be-delivered order, detecting transport capacity state data of a plurality of delivery personnel located within a preset range around the pickup address, obtaining a speed index score of each delivery personnel according to a daily delivery speed of each delivery personnel, obtaining a delivery index score of each delivery personnel according to real-time delivery information of each delivery personnel, obtaining an actual distance ranking between each delivery personnel located within the preset range around the pickup address and the pickup address, obtaining a distance index score of each delivery personnel according to the actual distance ranking, and performing weighted calculation on the speed index score, the delivery index score and the distance index score of each delivery personnel to obtain a total index score of each delivery personnel. The to-be-delivered order is dispatched to the delivery personnel with the highest total index score, so that the automatic order dispatching is prevented from being excessively unbalanced.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of data processing, in particular to an automatic order dispatching method based on transport capacity detection, a storage medium and a system. BACKGROUND

[0002] With the development of online takeout platforms, takeout delivery services have become an indispensable part of daily life. Existing online takeout platforms usually have an automatic order dispatching system. In the order dispatching process, the automatic order dispatching system obtains the current position information of each delivery person, and then dispatches the to-be-delivered order to the delivery person closest to the pickup address. This lacks consideration of the real-time delivery status of the delivery person, and during the meal peak period, it is easy to have an over-unbalanced order dispatching situation where some delivery persons have too many orders to deliver and some delivery persons have too few orders to deliver, reducing the overall delivery efficiency. SUMMARY

[0003] The technical problem to be solved by the present application is how to avoid over-unbalanced automatic order dispatching of takeout delivery.

[0004] To solve the above technical problems, the present application provides an automatic order dispatching method based on transport capacity detection, comprising the following steps:

[0005] A. Obtain a to-be-delivered order, and identify the pickup address and delivery address of the to-be-delivered order;

[0006] B. Detect the transport capacity state data of a plurality of delivery persons located within a predetermined range around the pickup address, the transport capacity state data including the daily cumulative delivery distance, daily cumulative delivery time length and real-time delivery information of each delivery person, wherein the real-time delivery information includes information of being currently in an idle state or information of being currently in a delivery state, and wherein the information of being currently in a delivery state includes the delivery address of the current delivery order;

[0007] C. Calculate the daily delivery speed of each delivery person according to the daily cumulative delivery distance and daily cumulative delivery time length of each delivery person, and analyze the speed index score of each delivery person according to the daily delivery speed of each delivery person;

[0008] D. Analyze the delivery index score of each delivery person according to the real-time delivery information of each delivery person;

[0009] E. Obtain the actual distance ranking between each delivery person located within a predetermined range around the pickup address and the pickup address, and analyze the distance index score of each delivery person according to the actual distance ranking;

[0010] F. The speed index score, the delivery index score and the distance index score of each delivery man are weighted to obtain a total index score of each delivery man, and the to-be-delivered order is assigned to the delivery man with the highest total index score.

[0011] Preferably, in the step B, if the real-time delivery information of the delivery man is information that the delivery man is currently in a delivery state, a difference distance between the delivery address of the current delivery order and the delivery address of the to-be-delivered order is calculated in the step D, and the delivery index score of the delivery man is analyzed according to the difference distance, and specifically, the closer the difference distance, the higher the delivery index score.

[0012] Preferably, in the step B, if the real-time delivery information of the delivery man is information that the delivery man is currently in an idle state, the delivery index score obtained in the step D is the highest.

[0013] Preferably, in the step C, the faster the delivery speed of the delivery man in the day, the higher the speed index score of the delivery man.

[0014] Preferably, in the step E, the closer the actual distance between the delivery man and the pickup address, the higher the distance index score of the delivery man.

[0015] Preferably, the formula for the weighted calculation in the step F is:

[0016] S=k1*S1+k2*S2+k3*S3;

[0017] wherein S is the total index score, S1 is the speed index score, S2 is the delivery index score, S3 is the distance index score, k1 is a pre-set speed index score weight coefficient, k2 is a pre-set delivery index score weight coefficient, and k3 is a pre-set distance index score weight coefficient.

[0018] The application further provides a computer readable storage medium having a computer program stored thereon, wherein the computer program is executed by a processor to implement the steps in the automatic order assigning method.

[0019] The application further provides an automatic order assigning system based on transport capacity detection, comprising a processor and a computer readable storage medium as described above.

[0020] The present invention has the following beneficial effects: During the order dispatching process, the speed index score of each deliveryman is obtained by analyzing the daily delivery speed of each deliveryman, the delivery index score of each deliveryman is obtained by analyzing the real-time delivery information of each deliveryman, and the distance index score of each deliveryman is obtained by ranking the actual distance between each deliveryman and the origin address. Then, the speed index score, delivery index score and distance index score of each deliveryman are weighted and calculated to obtain the total index score of each deliveryman. The order to be delivered is dispatched to the deliveryman with the highest total index score. That is, the daily delivery speed, real-time delivery information and actual distance of each deliveryman are comprehensively considered during the order dispatching process, which can effectively avoid the situation of excessive and unbalanced automatic order dispatching. Attached Figure Description

[0021] Figure 1 This is a flowchart illustrating the automatic order dispatching method based on capacity detection. Detailed Implementation

[0022] The present invention will be further described in detail below with reference to specific embodiments.

[0023] This embodiment provides an automatic dispatching system based on capacity detection. The system includes interconnected processors and a computer-readable storage medium. The computer-readable storage medium stores a computer program, which, when executed by the processor, implements the following... Figure 1 The automatic order dispatching method based on capacity detection is shown, which includes the following steps A, B, C, D, E, and F.

[0024] A. Obtain orders to be delivered and identify the origin and destination addresses of the orders.

[0025] After a consumer places an order on an online food delivery platform, the system generates a delivery order, which includes the origin address (merchant address) and the delivery address (consumer address). The online food delivery platform then sends this delivery order to the automated order dispatch system. Upon receiving the delivery order, the automated order dispatch system identifies the origin and delivery addresses.

[0026] B. Detect the capacity status data of multiple delivery personnel within a preset range around the origin and delivery address. The capacity status data includes the cumulative delivery distance, cumulative delivery time and real-time delivery information of each delivery personnel for the day. The real-time delivery information includes information on whether the delivery personnel is currently idle or in a delivery status. The information on whether the delivery personnel is in a delivery status includes the delivery address of the current delivery order.

[0027] It should be noted that the delivery personnel take orders from the take-out delivery platform through a mobile device (such as a mobile phone), so that the automatic order allocation system can obtain the delivery distance, delivery time, real-time delivery information and other capacity state data of the delivery personnel from the take-out delivery platform. Therefore, after identifying the pickup address and delivery address of the to-be-delivered order, the automatic order allocation system detects the capacity state data of a plurality of delivery personnel located within a predetermined range (for example, within 1 km) around the pickup address of the to-be-delivered order. The capacity state data includes the daily cumulative delivery distance, daily cumulative delivery time and real-time delivery information of each delivery personnel. If a certain delivery personnel is currently not handling other delivery orders, the real-time delivery information of the delivery personnel is information that the current is in an idle state. If a certain delivery personnel is currently handling other delivery orders, the real-time delivery information of the delivery personnel is information that the current is in a delivery state. If it is detected that the real-time delivery information of a certain delivery personnel is information that the current is in a delivery state, the delivery address of the current delivery order of the delivery personnel is also detected, so that the information that the current is in a delivery state includes the delivery address of the current delivery order of the delivery personnel.

[0028] C. According to the daily cumulative delivery distance and the daily cumulative delivery time of each delivery personnel, the daily delivery speed of each delivery personnel is calculated, and the speed index score of each delivery personnel is analyzed according to the daily delivery speed of each delivery personnel.

[0029] After detecting the capacity state data of each delivery personnel, the automatic order allocation system calculates the daily delivery speed of each delivery personnel according to the daily cumulative delivery distance and the daily cumulative delivery time of each delivery personnel. Specifically, the daily cumulative delivery distance is divided by the daily cumulative delivery time to obtain the quotient, which is the daily delivery speed. Then the automatic order allocation system analyzes the speed index score of each delivery personnel according to the daily delivery speed of each delivery personnel. The faster the daily delivery speed of the delivery personnel, the higher the speed index score of the delivery personnel. Specifically, the automatic order allocation system presets a plurality of daily delivery speed intervals, each daily delivery speed interval corresponds to a speed index score, and the speed index score of the delivery personnel is the speed index score corresponding to the interval in which the daily delivery speed of the delivery personnel falls. For example, the automatic order allocation system presets five daily delivery speed intervals, specifically [0, 5km / h), [5km / h, 10km / h), [10km / h, 15km / h), [15km / h, 20km / h), [20km / h, +∞), wherein the speed index score corresponding to the interval [0, 5km / h) is 0.2, the speed index score corresponding to the interval [5km / h, 10km / h) is 0.4, the speed index score corresponding to the interval [10km / h, 15km / h) is 0.6, the speed index score corresponding to the interval [15km / h, 20km / h) is 0.8, and the speed index score corresponding to the interval [20km / h, +∞) is 1.

[0030] D. According to the real-time delivery information of each delivery personnel, the delivery index score of each delivery personnel is analyzed.

[0031] After the speed index score of each delivery personnel is analyzed, the automatic order dispatching system analyzes the delivery index score of each delivery personnel according to the real-time delivery information of each delivery personnel. Specifically, if it is detected in step B that the real-time delivery information of the delivery personnel is information that the delivery personnel is currently in an idle state, the delivery index score of the delivery personnel is the highest, specifically 1; if it is detected in step B that the real-time delivery information of the delivery personnel is information that the delivery personnel is currently in a delivery state, the difference distance between the delivery address of the current delivery order and the delivery address of the to-be-delivered order is calculated, and the delivery index score of the delivery personnel is analyzed according to the difference distance. The closer the difference distance, the higher the delivery index score. Specifically, the automatic order dispatching system is preset with a plurality of difference distance intervals, each difference distance interval corresponds to a delivery index score, and the difference distance between the delivery address of the current delivery order and the delivery address of the to-be-delivered order falls into which interval, the delivery index score of the delivery personnel is the delivery index score corresponding to the interval. For example, the automatic order dispatching system is preset with four difference distance intervals, specifically [0, 300m), [300m, 600m), [600m, 900m), and [900m, +∞), wherein the interval [0, 300m) corresponds to a delivery index score of 0.8, the interval [300m, 600m) corresponds to a delivery index score of 0.6, the interval [600m, 900m) corresponds to a delivery index score of 0.4, and the interval [900m, +∞) corresponds to a delivery index score of 0.2.

[0032] E. The actual distance ranking between each delivery personnel located within a preset range around the pickup address and the pickup address of the to-be-delivered order is obtained, and the distance index score of each delivery personnel is analyzed according to the actual distance ranking.

[0033] After the delivery index score of each delivery personnel is analyzed, the automatic order dispatching system obtains the actual distance between each delivery personnel located within a preset range (for example, within 1 km) around the pickup address of the to-be-delivered order and the pickup address of the to-be-delivered order, ranks each delivery personnel in order of actual distance from near to far, obtains the actual distance ranking of each delivery personnel, and then analyzes the distance index score of each delivery personnel according to the actual distance ranking. The closer the actual distance ranking of the delivery personnel, the higher the distance index score of the delivery personnel. Specifically, if the actual distance ranking of the delivery personnel is first, the distance index score of the delivery personnel is 1, if the actual distance ranking of the delivery personnel is second, the distance index score of the delivery personnel is 0.9, and so on, if the actual distance ranking of the delivery personnel is tenth or later, the distance index score of the delivery personnel is 0.1.

[0034] F.The speed index score, the delivery index score and the distance index score of each delivery person are weighted and calculated to obtain the total index score of each delivery person, and the to-be-delivered order is assigned to the delivery person with the highest total index score.

[0035] After analyzing the speed index score, the delivery index score and the distance index score of each delivery person within the preset range around the pickup address, the automatic order assigning system performs weighted calculation on the speed index score, the delivery index score and the distance index score of each delivery person to obtain the total index score of each delivery person, and the specific calculation formula is as follows: S = k1*S1+k2*S2+k3*S3; wherein, S is the total index score, S1 is the speed index score, S2 is the delivery index score, S3 is the distance index score, k1 is the pre-set speed index score weight coefficient, specifically 0.3, k2 is the pre-set delivery index score weight coefficient, specifically 0.4, and k3 is the pre-set distance index score weight coefficient, specifically 0.3. After calculating the total index score of each delivery person within the preset range around the pickup address, the automatic order assigning system assigns the to-be-delivered order to the delivery person with the highest total index score, so that the daily delivery speed, real-time delivery information and actual distance of each delivery person are comprehensively considered in the order assigning process, and the situation of excessive imbalance in automatic order assigning can be effectively avoided.

[0036] For example, there are three delivery persons within 1 km around the pickup address of the to-be-delivered order, wherein: the daily cumulative delivery distance of delivery person A is 50 km, the daily cumulative delivery time is 4 hours, and the current state is idle, the actual distance between delivery person A and the pickup address is 600 m; the daily cumulative delivery distance of delivery person B is 80 km, the daily cumulative delivery time is 5 hours, and the current state is in delivery, the difference distance between the delivery address of the current delivery order and the delivery address of the to-be-delivered order is 200 m, and the actual distance between delivery person B and the pickup address is 400 m; the daily cumulative delivery distance of delivery person C is 30 km, the daily cumulative delivery time is 3 hours, and the current state is in delivery, the difference distance between the delivery address of the current delivery order and the delivery address of the to-be-delivered order is 500 m, and the actual distance between delivery person B and the pickup address is 200 m.

[0037] In this case, the delivery speed of the delivery person A on the current day is 50km / 4h=12.5km / h, which falls into the interval of [10km / h, 15km / h), so the speed index score S1 is 0.6; the current delivery information is the information that is currently in the delivery state, so the delivery index score S2 is 1; the actual distance between the delivery person A and the delivery address 600m ranks third among the three, so the distance index score S3 is 0.8. Therefore, the total index score S of the delivery person A is S=k1*S1+k2*S2+k3*S3=0.3*0.6+0.4*1+0.3*0.8=0.82.

[0038] The delivery speed of the delivery person B on the current day is 80km / 5h=16km / h, which falls into the interval of [15km / h, 20km / h), so the speed index score S1 is 0.8; the difference distance between the delivery address of the current delivery order and the delivery address of the to-be-delivered order 200m falls into the interval of [0, 300m), so the delivery index score S2 is 0.8; the actual distance between the delivery person B and the delivery address 400m ranks second among the three, so the distance index score S3 is 0.9. Therefore, the total index score S of the delivery person B is S=k1*S1+k2*S2+k3*S3=0.3*0.8+0.4*0.8+0.3*0.9=0.83.

[0039] The delivery speed of the delivery person C on the current day is 30km / 3h=10km / h, which falls into the interval of [10km / h, 15km / h), so the speed index score S1 is 0.6; the difference distance between the delivery address of the current delivery order and the delivery address of the to-be-delivered order 500m falls into the interval of [300m, 600m), so the delivery index score S2 is 0.6; the actual distance between the delivery person C and the delivery address 200m ranks first among the three, so the distance index score S3 is 1. Therefore, the total index score S of the delivery person C is S=k1*S1+k2*S2+k3*S3=0.3*0.6+0.4*0.6+0.3*1=0.72.

[0040] Therefore, after comprehensively considering the delivery speed on the current day, the real-time delivery information and the actual distance of each delivery person, the automatic order dispatching system will assign the to-be-delivered order to the delivery person B with the highest total index score.

[0041] The above is only an embodiment of the present application, which does not limit the scope of patent protection. Those skilled in the art can make non-essential changes or substitutions on the basis of the present application, which still falls within the scope of patent protection.

Claims

1. A method for automatic order dispatching based on capacity detection, characterized in that, The method comprises the following steps: A. obtaining a to-be-delivered order, and identifying a pickup address and a delivery address of the to-be-delivered order; B. detecting capacity state data of a plurality of delivery personnel located within a preset range around the pickup address, the capacity state data comprising daily cumulative delivery distance, daily cumulative delivery time length and real-time delivery information of each delivery personnel, wherein the real-time delivery information comprises information that each delivery personnel is currently in an idle state or information that each delivery personnel is currently in a delivery state, and the information that each delivery personnel is currently in the delivery state comprises a delivery address of a current delivery order; C. calculating a daily delivery speed of each delivery personnel according to the daily cumulative delivery distance and the daily cumulative delivery time length of each delivery personnel, and analyzing a speed index score of each delivery personnel according to the daily delivery speed of each delivery personnel; D. analyzing a delivery index score of each delivery personnel according to the real-time delivery information of each delivery personnel; E. obtaining an actual distance ranking between each delivery personnel and the pickup address located within the preset range around the pickup address, and analyzing a distance index score of each delivery personnel according to the actual distance ranking; F. performing weighted calculation on the speed index score, the delivery index score and the distance index score of each delivery personnel to obtain a total index score of each delivery personnel, and assigning the to-be-delivered order to a delivery personnel with the highest total index score. In the step B, if the real-time delivery information of the delivery personnel is the information that the delivery personnel is currently in the delivery state, a difference distance between the delivery address of the current delivery order and the delivery address of the to-be-delivered order is calculated in the step D, and a delivery index score of the delivery personnel is analyzed according to the difference distance, and the closer the difference distance, the higher the delivery index score. In the step B, if the real-time delivery information of the delivery personnel is the information that the delivery personnel is currently in the idle state, the delivery index score analyzed in the step D is the highest.

2. The automatic dispatching method based on the transport capacity detection according to claim 1, characterized in that, In the step C, the faster the daily delivery speed of the delivery personnel, the higher the speed index score of the delivery personnel. In the step E, the higher the distance index score of the delivery personnel, the higher the actual distance ranking between the delivery personnel and the pickup address.

3. The method of claim 1, wherein the method further comprises: In the step F, the formula for the weighted calculation is as follows:

4. The method of claim 1, wherein the method further comprises: The computer program is executed by the processor to realize the steps in the automatic order assigning method according to any one of claims 1 to 4. ； wherein is the total index score, is the speed index score, is the delivery index score, is the distance index score, is a pre-set speed index score weight coefficient, is a pre-set delivery index score weight coefficient, is a pre-set distance index score weight coefficient.

5. A computer-readable storage medium having stored thereon a computer program, characterized in that, The computer program is executed by the processor to realize the steps in the automatic order assigning method according to any one of claims 1 to 4.

6. An automatic dispatching system based on capacity detection, characterized in that, The computer program is executed by the processor to realize the steps in the automatic order assigning method according to any one of claims 1 to 4.

Images