Methods, apparatus, equipment and readable media for dispatching delivery parties

Abstract

Embodiments of this disclosure provide a method, apparatus, device, and medium for scheduling delivery providers. The method includes: determining a set of stable routes based on the scheduling frequency of a set of candidate routes within a predetermined time period; determining scheduling characteristics of the set of stable routes based on historical scheduling schemes of the set of stable routes, the scheduling characteristics indicating the type and number of stable delivery providers allocated to the corresponding stable routes within the predetermined time period; and providing scheduling analysis information generated based on the scheduling characteristics for generating a scheduling scheme for a target route. The solution of this disclosure can generate route scheduling schemes based on the analysis results of historical scheduling schemes of stable routes, thereby automatically generating scheduling schemes and implementing scheduling, and improving scheduling efficiency.

Description

Technical Field

[0001] The exemplary embodiments disclosed herein generally relate to the field of computer technology, and more specifically, to methods, apparatus, devices, and computer-readable storage media for scheduling delivery parties. Background Technology

[0002] With societal development, the logistics industry is also rapidly evolving. In logistics scenarios, scheduling plans can typically be generated on the dispatching side to allocate and dispatch delivery providers (e.g., logistics vehicles) for transporting goods. Correspondingly, these scheduling plans can be used to control logistics vehicles to provide services based on the time, route, and stops specified in the plan. Therefore, improving the quality of scheduling plans and enhancing the efficiency of the scheduling process are crucial and urgent needs. Summary of the Invention

[0003] In a first aspect of this disclosure, a method for scheduling delivery providers is provided. The method includes: determining a set of stable routes based on the scheduling frequency of a set of candidate routes within a predetermined time period; determining scheduling characteristics of a set of stable routes under a historical scheduling scheme based on historical scheduling schemes, wherein the scheduling characteristics of the historical scheduling scheme indicate the type and number of stable delivery providers allocated to the corresponding stable routes within the predetermined time period of the historical scheduling scheme; and providing scheduling analysis information generated based on the scheduling characteristics of the historical scheduling scheme for generating a scheduling scheme for a target route.

[0004] In a second aspect of this disclosure, an apparatus for scheduling delivery providers is provided. The apparatus includes: a first determining module configured to determine a set of stable routes based on the scheduling frequency of a set of candidate routes within a predetermined time period; a second determining module configured to determine scheduling characteristics of a set of stable routes under a historical scheduling scheme, based on a historical scheduling scheme indicating the type and number of stable delivery providers allocated to the corresponding stable routes within the predetermined time period of the historical scheduling scheme; and a providing module configured to provide scheduling analysis information generated based on the scheduling characteristics of the historical scheduling scheme for generating a scheduling scheme for a target route.

[0005] In a third aspect of this disclosure, an electronic device is provided. The electronic device includes at least one processing unit; and at least one memory coupled to the at least one processing unit and storing instructions for execution by the at least one processing unit, the instructions causing the electronic device to perform the method of the first aspect of this disclosure when executed by the at least one processing unit.

[0006] In a fourth aspect of this disclosure, a computer-readable storage medium is provided. This computer-readable storage medium stores a computer program that can be executed by a processor to perform the method according to a first aspect of this disclosure.

[0007] It should be understood that the description in the Summary of the Invention section is not intended to limit the key or essential features of the embodiments of this disclosure, nor is it intended to restrict the scope of this disclosure. Other features of this disclosure will become readily apparent from the following description. Attached Figure Description

[0008] The above and other features, advantages, and aspects of various implementations of this disclosure will become more apparent in the following detailed description, taken in conjunction with the accompanying drawings. In the drawings, the same or similar reference numerals denote the same or similar elements, wherein:

[0009] Figure 1 A schematic diagram of an example environment in which embodiments of the present disclosure can be implemented is shown;

[0010] Figure 2A A schematic diagram illustrating the process of determining a stable route according to some embodiments of the present disclosure is shown;

[0011] Figure 2B A schematic diagram illustrating the process of generating prompt information according to some embodiments of the present disclosure is shown;

[0012] Figure 3 A flowchart illustrating the process of dispatching delivery parties according to some embodiments of this disclosure is shown;

[0013] Figure 4 A block diagram of an apparatus for dispatching delivery personnel according to some embodiments of the present disclosure is shown; and

[0014] Figure 5 A block diagram of an electronic device in which one or more embodiments of the present disclosure may be implemented is shown. Detailed Implementation

[0015] Embodiments of this disclosure will now be described in more detail with reference to the accompanying drawings. While some embodiments of this disclosure are shown in the drawings, it should be understood that this disclosure can be implemented in various forms and should not be construed as limited to the embodiments set forth herein. Rather, these embodiments are provided to provide a more thorough and complete understanding of this disclosure. It should be understood that the accompanying drawings and embodiments of this disclosure are for illustrative purposes only and are not intended to limit the scope of protection of this disclosure.

[0016] In the description of embodiments of this disclosure, the term "comprising" and similar terms should be understood as open-ended inclusion, i.e., "including but not limited to". The term "based on" should be understood as "at least partially based on". The term "one embodiment" or "the embodiment" should be understood as "at least one embodiment". The term "some embodiments" should be understood as "at least some embodiments". Other explicit and implicit definitions may also be included below.

[0017] It should be noted that the acquisition, storage, and application of user personal information involved in the technical solution disclosed herein comply with the provisions of relevant laws and regulations and do not violate public order and good morals.

[0018] It is understood that before using the technical solutions disclosed in the various embodiments of this disclosure, users should be informed of the types, scope of use, and usage scenarios of the personal information involved in this disclosure through appropriate means in accordance with relevant laws and regulations, and user authorization should be obtained.

[0019] For example, in response to receiving a user's active request, a prompt message is sent to the user to clearly inform the user that the requested operation will require the acquisition and use of the user's personal information, thereby enabling the user to choose whether to provide personal information to the software or hardware such as electronic devices, applications, servers or storage media that perform the operation of the technical solution disclosed herein, based on the prompt message.

[0020] As an optional but non-restrictive implementation, in response to a user's active request, a prompt message can be sent to the user, for example, via a pop-up window, where the prompt message can be presented in text format. Furthermore, the pop-up window can also include a selection control allowing the user to choose whether to "agree" or "disagree" to provide personal information to the electronic device.

[0021] In logistics, the efficiency of generating scheduling plans and the quality of the final plans directly impact logistics efficiency. For example, generating scheduling plans faster allows for earlier instructing delivery providers, improving efficiency. Conversely, using higher-quality scheduling plans enables more efficient allocation of dispatchers, enhancing resource utilization and overall logistics efficiency.

[0022] According to embodiments of this disclosure, a set of stable routes is determined based on the scheduling frequency of a set of candidate routes within a predetermined time period; scheduling characteristics of the set of stable routes under historical scheduling schemes are determined based on historical scheduling schemes, whereby the historical scheduling characteristics indicate the type and number of stable delivery parties allocated to the corresponding stable routes within the predetermined time period of the historical scheduling schemes; and scheduling analysis information generated based on the scheduling characteristics of historical scheduling schemes is provided for generating scheduling schemes for target routes. Thus, scheduling schemes for routes can be generated based on the analysis results of historical scheduling schemes for stable routes, enabling automated generation of scheduling schemes and implementation of scheduling, thereby improving scheduling efficiency.

[0023] The following description will focus on exemplary embodiments of the present disclosure with reference to the accompanying drawings.

[0024] Figure 1 A schematic diagram of an example environment 100 in which embodiments of the present disclosure can be implemented is shown. Figure 1 In environment 100, electronic device 110 can process an input set of candidate routes (e.g., a set of candidate routes 120 consisting of at least candidate route A 121, candidate route B 122, and candidate route C 123). The candidate routes in candidate routes 120 can be routes that have been scheduled in the past (i.e., there are delivery drivers scheduled for the candidate routes). They can also be routes that are allowed to be scheduled but have not actually been scheduled. For example, route A may be allowed to be used, or in other words, route A is allowed to be scheduled with delivery drivers, but in the past, there may not have been any delivery drivers actually scheduled for such route A. When a candidate route has been scheduled, the candidate route can also be associated with specific scheduling information, such as the scheduling time and specific information about the dispatched delivery drivers (e.g., the type and number of delivery drivers). For example, if the delivery driver is a vehicle, its type could be the specific model of the vehicle, as well as the total number, the number corresponding to the specific model, etc. After processing, the electronic device 110 can subsequently obtain a "scheduling strategy" based on the processing result to provide a corresponding scheduling scheme 140 based on the specific target route 130. Further, after providing the target route 130 to the electronic device 110, the electronic device 110 can provide a corresponding scheduling scheme 140 for the target route 130 based on the aforementioned "scheduling strategy." Thus, the obtained scheduling scheme 140 can be used to provide scheduling for the target route 130 (e.g., determining the specific type and number of vehicles allocated to the target route 130).

[0025] exist Figure 1In this context, electronic device 110 can include any computing system with computing capabilities, such as various computing devices / systems, terminal devices, servers, etc. Terminal devices can involve any type of mobile terminal, fixed terminal, or portable terminal, including mobile phones, desktop computers, laptop computers, notebook computers, netbook computers, tablet computers, media computers, multimedia tablets, or any combination thereof, including accessories and peripherals of these devices or any combination thereof. Servers include, but are not limited to, mainframes, edge computing nodes, computing devices in cloud environments, etc.

[0026] It should be understood that Figure 1 The components and arrangements shown in environment 100 are merely examples, and a computing system suitable for implementing the exemplary implementations described in this disclosure may include one or more different components, other components, and / or different arrangements. Implementations of this disclosure are not limited in this respect.

[0027] As explained above, logistics scheduling relies on scheduling schemes.

[0028] In some schemes, the scheduling plan can be implemented by manual input. For example, transportation dispatchers can retrieve the waybills that need to be scheduled based on the basic form query conditions presented on the webpage. Then, based on the actual situation and experience, they can group the transportation departure plans of the same or roughly directional routes together to form a scheduling order, which will guide the vehicles to carry out transportation.

[0029] However, this approach has several drawbacks and shortcomings:

[0030] 1. The scheduling process is completed through a web page list, which places high demands on the scheduling personnel's operational proficiency, business acumen, and usage habits.

[0031] 2. The retrieval process before and after scheduling is quite complex, requiring the repeated input of different combinations of conditions to find waybill information that matches the current scheduling needs, resulting in low efficiency and success rate in completing the scheduling.

[0032] 3. In special scenarios, such as scheduling large-item waybills, there are no particularly prominent labels or reminders, and the system relies entirely on the dispatcher's knowledge and understanding of the system, leading to different people having different opinions on the usage scenarios of the same function.

[0033] 4. The inability to effectively combine and associate information from multiple transport orders makes it impossible for dispatchers to have a global grasp of resources, and situations of underloading or overloading cannot be detected in a timely manner;

[0034] 5. It cannot control the loading and unloading sequence of goods based on the actual route and location, nor can it guide site personnel to load goods onto vehicles in sequence.

[0035] This reveals that these methods suffer from several drawbacks: scheduling personnel face cumbersome and unintuitive task retrieval of waybills during actual scheduling operations; the guidance provided is limited; and manual operation in scheduling scenarios is time-consuming and labor-intensive. This not only reduces the efficiency of generating scheduling plans but also affects the quality of the final scheduling plan.

[0036] This disclosure provides an improved scheme for scheduling delivery providers. In this scheme, a set of stable routes can be determined based on the scheduling frequency of a set of candidate routes within a predetermined time period. A stable route can be understood, for example, as a route with stable scheduling within the predetermined time period (e.g., route A, which is called multiple times within the predetermined time period). This allows for the analysis of the scheduling patterns corresponding to these stable routes to guide the subsequent proposed scheduling scheme. For example, the scheduling characteristics of a set of stable routes can be determined by analyzing historical scheduling schemes for stable routes. The scheduling characteristics of historical scheduling schemes indicate the type and number of stable delivery providers allocated to the corresponding stable routes within the predetermined time period of the historical scheduling schemes.

[0037] Furthermore, scheduling analysis information can be generated based on the analysis of the types and quantities of these stable delivery providers. For example, the types and quantities of stable delivery providers that are "stable" dispatched to stable routes within a predetermined time period can be determined to generate scheduling analysis information, or in other words, to establish a correlation between stable routes and stable delivery providers. Furthermore, these stable delivery providers associated with stable routes can be used as pre-set information, allowing for the pre-scheduling and allocation of delivery providers, either partially or entirely, to obtain a delivery plan for implementing the scheduling. Thus, scheduling plans for routes can be generated based on the analysis results of historical scheduling plans for stable routes, automatically generating and implementing scheduling plans, thereby improving scheduling efficiency.

[0038] The following description continues with reference to the accompanying drawings, outlining some exemplary embodiments of this disclosure. For ease of understanding, the above description can be used in conjunction with the accompanying drawings. Figure 1 For example, the process of scheduling delivery personnel can be implemented by electronic device 110.

[0039] In embodiments of this disclosure, electronic device 110 acquires a set of candidate routes. These candidate routes can be pre-configured. For example, electronic device 110 can determine candidate routes based on routes that need to be provided to the delivery party in the required logistics information. Typically, candidate routes include at least a start point and an end point, such as from location A to location B. In some embodiments, candidate routes may also include more information, such as indicating the actual path taken from location A to B (e.g., via route C from location A to location B).

[0040] Furthermore, the electronic device 110 can acquire a set of candidate routes and determine whether each candidate route is scheduled within a certain period based on historical scheduling schemes. For example, the electronic device 110 can acquire historical scheduling schemes within a certain period to determine whether a delivery provider has been assigned to the candidate route. The historical scheduling scheme can indicate whether a delivery provider has been assigned to the candidate route, and the type and number of delivery providers assigned. In some embodiments, the historical scheduling scheme can also be associated with the allocation time to provide more granular information on the allocation of delivery providers. If the historical scheduling scheme indicates that a delivery provider has been assigned within a certain period, it is determined that there is scheduling for the candidate route within that period. In embodiments of this disclosure, the electronic device 110 can determine a predetermined time period to analyze the historical scheduling situation holistically. For example, this predetermined time period can be a pre-configured time period (e.g., 40 days). In some embodiments, the predetermined time period can be determined based on the cycle of logistics-related goods, orders, etc.

[0041] Electronic device 110 can determine whether a candidate route is a stable route based on the scheduling frequency of the candidate route within a predetermined time period. A stable route can be considered a frequently used route among a set of candidate routes, or a route with a high usage frequency. In some scenarios, a stable route can also be referred to as a "fixed route," which can be approximated as a route where delivery parties are consistently and regularly assigned to transport goods and realize logistics within the predetermined time period. For example, in a calendar month, if every calendar day of that month (or more than a preset proportion of calendar days) provides scheduling for the route from point A to point B (for example, delivery party X is configured to depart from point A to point B every calendar day), then the route from point A to point B in that calendar month can be considered a stable route.

[0042] In some embodiments, for more accurate analysis, a portion of a preset time period can be selected for analysis. For example, a first period within the preset time period can be selected for analysis. For instance, if the preset time period is 40 days, the 30 days included can be analyzed to achieve, for example, natural monthly data. Thus, by splitting the preset time period, analysis can be performed according to, for example, natural months, natural weeks, etc., to better discover its scheduling "patterns". Further, after determining the first predetermined time period, the electronic device 110 can determine a first group of candidate routes from a set of candidate routes corresponding to the first predetermined time period. For example, the first group of candidate routes can consist of candidate routes that are scheduled within the predetermined time period. Accordingly, the electronic device 110 can count the frequency of scheduling of each candidate route within the first predetermined time period (for example, there is scheduling of route A to B on 15 out of 30 days). Further, the electronic device 110 can determine the first candidate route from the first group of candidate routes whose scheduling frequency is greater than a first threshold. In other words, if a route has a scheduling frequency greater than the first threshold within the predetermined time period, that route can be determined as the first candidate route. Accordingly, the electronic device 110 can at least determine the first candidate route as a stable route (e.g., by adding an identifier to the first candidate route to indicate that it is a stable route). It should be understood that the first threshold can be determined based on a standard considered "stable," for example, for a first predetermined period of 30 days, the first threshold could be set to 22 days. In some embodiments, the first threshold can also be a proportional value, thereby allowing the same "stable" standard to be set for different lengths of the "first predetermined period." Thus, the scheduling frequency can be used to determine whether a candidate route corresponds to a stable schedule, and whether it is a stable route.

[0043] In some embodiments, the electronic device 110 can also determine whether a candidate route is a stable route through periodic analysis. For example, the electronic device 110 can determine a second predetermined time period from a predetermined time period. The length of the second predetermined time period can be the same as or different from the first predetermined time period. The electronic device 110 can divide the second predetermined time period into multiple time periods. For example, if the second predetermined time period corresponds to a "natural month," the time period can be the natural week included in the natural month. Further, each time period corresponds to multiple scheduling time units. The electronic device 110 can determine the scheduling time unit in each time period. For example, if the time period corresponds to a natural week, the scheduling time unit can be a natural day.

[0044] Electronic device 110 can also analyze historical scheduling schemes based on the "same-period ratio". Similar to the method for determining the first group of candidate routes, electronic device 110 can determine the second group of candidate routes from a group of stable routes. Furthermore, electronic device 110 can determine whether a candidate route is a second candidate route by whether the candidate route is scheduled in a specific scheduling time unit of each time period in multiple time periods.

[0045] Taking a "natural week" as the time period and a "natural day" as the scheduling time unit as an example, electronic device 110 can determine whether a candidate route is a second candidate route by determining whether the candidate route is scheduled on Mondays of the first week, the second week, the third week, and the fourth week. It should be understood that the aforementioned "Monday" is merely illustrative; electronic device 110 can similarly determine whether a candidate route is a second candidate route by determining whether it is scheduled on "Tuesday," "Wednesday," etc., in all four weeks. Accordingly, electronic device 110 can at least determine that the second candidate route is a stable route. Therefore, based on the periodic analysis of historical scheduling schemes, it is possible to determine whether a candidate route is a stable route.

[0046] Additionally, the electronic device 110 can also discover recent scheduling patterns and determine stable routes based on historical scheduling schemes in adjacent time periods within a predetermined time period. In some embodiments, the electronic device 110 can determine adjacent time periods before the current time from the predetermined time period (e.g., if the predetermined time period is 40 days before the current day, the adjacent time period can be the last 3 days of those 40 days). Similarly, such adjacent time periods can also correspond to multiple scheduling time units, which can be used for analysis to discover "scheduling patterns" within the adjacent time periods. For example, if the adjacent time period is 3 days, the scheduling time unit can also be a complete calendar day. Similarly, after determining a third candidate route from a set of candidate routes, the electronic device 110 can determine the third candidate route by determining whether the candidate route is scheduled in every scheduling time unit within the adjacent time period. For example, the electronic device 110 can determine the candidate route that is scheduled in every scheduling time unit within the adjacent time period as the third candidate route. Thus, the electronic device 110 can determine a stable route by at least identifying the third candidate route as a stable route. Therefore, stable routes can be determined based on recent scheduling data to enhance the timeliness of stable routes.

[0047] It should be understood that the aforementioned scheduling time unit is usually associated with the delivery party's scheduling mode. For example, if the scheduling mode involves scheduling once per calendar day or using one calendar day as the effective scheduling time length, the scheduling time unit can be correspondingly determined as "one calendar day".

[0048] In embodiments of this disclosure, after determining a set of stable routes, the electronic device 110 can acquire historical scheduling schemes for the set of stable routes. For example, a historical scheduling scheme can indicate the type and number of delivery parties assigned to stable routes over a historical period. In some embodiments, the historical scheduling scheme indicates the type and number of delivery parties assigned to stable routes of the historical scheduling scheme in the historical scheduling of the corresponding scheduling time unit (e.g., the type and number of delivery objects actually assigned in the corresponding scheduling time unit). Taking delivery parties as logistics vehicles as an example, the historical scheduling scheme can indicate the logistics vehicle scheduling status for stable routes in each scheduling time unit (e.g., calendar day) within a predetermined time period (e.g., the aforementioned 40 days). For example, on the first calendar day, 10 logistics vehicles of type XX were scheduled for stable route A. Taking logistics vehicles as an example, their type can be determined based on the size of the logistics vehicles, for example, 5m logistics vehicles, 10m logistics vehicles.

[0049] Furthermore, the electronic device 110 can determine the scheduling characteristics of a set of stable routes based on a set of historical scheduling schemes. In embodiments of this disclosure, the scheduling characteristics indicate the type and number of stable delivery parties allocated to the corresponding stable route within a predetermined time period of the historical scheduling scheme. A stable delivery party refers to a delivery party that is consistently scheduled for a "stable route," for example, a delivery party that is assigned every time a stable route is scheduled. For example, if delivery party A is scheduled to the stable route every day within 23 days of a month, then delivery party A can be identified as a "stable delivery party." The electronic device 110 can analyze the scheduling characteristics of stable routes within a predetermined time period based on historical scheduling schemes. For example, the electronic device 110 can obtain the scheduling status of the corresponding stable route in each scheduling time unit within the predetermined time period, such as obtaining the type and number of delivery parties allocated to the corresponding stable route in the scheduling time unit. Furthermore, the electronic device 110 determines the stable type of the delivery parties present in each scheduling time unit. If the minimum quantity corresponding to the stable type is not 0, or in other words, at least one delivery party of the stable type is configured for the stable route in each scheduling time unit, then the electronic device 110 can identify the delivery party as a stable delivery party and use its type and the corresponding minimum quantity as the type and quantity of the stable delivery party.

[0050] In some embodiments, the electronic device 110 can determine the type and quantity of delivery parties present in each scheduling time unit based on historical scheduling schemes for stable routes. If the delivery parties present in each scheduling time unit are of the same type and the same quantity, the electronic device 110 can determine the delivery parties of the same type and the same quantity as those in the historical scheduling scheme as the scheduling characteristics corresponding to the stable route.

[0051] In some embodiments, for the process of determining a stable route described above, the electronic device 110 can also determine a stable route based on a first stable route and a second stable route, or in other words, determine the final stable route by using a combination of determination strategies. In some embodiments, the electronic device 110 can determine a first set of candidate stable routes based on a first determination strategy (e.g., the method for determining a first candidate route described above). The electronic device 110 can also determine a second set of candidate stable routes based on a second determination strategy (e.g., the method for determining a second candidate route described above).

[0052] Furthermore, the electronic device 110 can determine a set of stable routes under the historical scheduling scheme based at least on a first set of candidate stable routes and a second set of candidate stable routes under the historical scheduling scheme. For example, for a candidate route, the electronic device 110 can compare the historical scheduling scheme referenced when it was determined to be a first stable route with the historical scheduling scheme referenced when it was determined to be a second stable route. Thus, by using multiple strategies (or multiple data processing methods for determining stable routes) in combination, a "stable route" can be determined more accurately. For example, by using the first and second stable routes in combination, it is possible to determine whether a candidate route is a stable route from two perspectives: "scheduling frequency" and "same-week ratio." The stable routes determined in this way have higher accuracy than those determined using only one of the first or second stable routes.

[0053] In some embodiments, determining a set of stable routes for a historical scheduling scheme based at least on a first set of candidate stable routes and a second set of candidate stable routes for a historical scheduling scheme includes: determining a common route for the first set of candidate stable routes and the second set of candidate stable routes for a historical scheduling scheme; determining a first historical scheduling characteristic and a second historical scheduling characteristic of the common route, wherein the first historical scheduling characteristic corresponds to a first determination strategy of the historical scheduling scheme and the second historical scheduling characteristic corresponds to a second determination strategy of the historical scheduling scheme; and determining the common route of the historical scheduling scheme as a stable route in the set of stable routes for a historical scheduling scheme based at least on the matching of the first historical scheduling characteristic and the second historical scheduling characteristic.

[0054] Specifically, the electronic device 110 can determine the common route of the first group of candidate stable routes and the second group of candidate stable routes in the historical scheduling scheme. For example, if the first and second candidate stable routes point to the same candidate route, then the common route corresponds to all of the candidate routes. In some embodiments, the candidate routes corresponding to the candidate stable routes may differ. For example, although the types and numbers of delivery parties corresponding to the first and second candidate stable routes are the same, the candidate routes corresponding to the first and second candidate stable routes may not be the same. For example, the first candidate stable route is route A, and the route B corresponding to the second candidate stable route may be, for example, a part of route A, or include, for example, a part of route A. The electronic device 110 can determine the common route of the first group of candidate stable routes and the second group of candidate stable routes in the historical scheduling scheme (for example, in the above example, the common route may be the overlapping part of route A and route B).

[0055] Furthermore, the electronic device 110 can determine a first historical scheduling characteristic and a second historical scheduling characteristic of the common route in the historical scheduling scheme. The first historical scheduling characteristic corresponds to a first determination strategy of the historical scheduling scheme, and the second historical scheduling characteristic corresponds to a second determination strategy of the historical scheduling scheme. Specifically, the first scheduling characteristic can be the type and quantity of stable delivery parties allocated to the first candidate stable route within a predetermined time period of the historical scheduling scheme, and the second scheduling characteristic can be the type and quantity of stable delivery parties allocated to the first candidate stable route within a predetermined time period of the historical scheduling scheme. The generation method of the first and second scheduling characteristics can refer to the above-described processing of the historical scheduling scheme to generate the corresponding scheduling characteristics, and will not be repeated here. Furthermore, the electronic device 110 can compare the first and second historical scheduling characteristics. If the two first and second historical scheduling characteristics indicate the same content, such as indicating the same type and quantity of delivery parties, then the candidate route can be determined to be a "stable route". For example, for a candidate route, when it is determined to be a first candidate stable route, the type of delivery party is A and the quantity is X. If, when a candidate route is identified as a second candidate stable route, the type of its corresponding delivery party remains A and the quantity remains X, then the candidate route can be identified as a "stable route." Therefore, multiple strategies (or various data processing methods for determining stable routes) can be used in combination to more accurately determine "stable routes." For example, by combining the first and second stable routes, it is possible to determine whether a candidate route is stable based on two factors: "scheduling frequency" and "same-week comparison." Stable routes determined in this way have higher accuracy than those determined using only one of the first or second stable routes.

[0056] Similarly, electronic device 110 can also determine a third set of candidate stable routes based on a third determination strategy (e.g., the method for determining the third candidate route described above). Accordingly, electronic device 110 can similarly select a combination of the first and third determination strategies, or a combination of the second and third determination strategies, to ultimately output a stable route.

[0057] In some embodiments, the electronic device 110 may also determine a stable route based on a combination of three determination strategies. For example, it may determine a stable route based on a combination of a first determination strategy, a second determination strategy, and a third determination strategy; or, it may determine a set of stable routes based on a first set of candidate stable routes, a second set of candidate stable routes, and a third set of candidate stable routes from historical scheduling schemes. In this case, the electronic device 110 can also determine a stable route by comparing historical scheduling schemes. In some embodiments, when determining a stable route based on a combination of the first determination strategy, the second determination strategy, and the third determination strategy, the electronic device 110 may determine a candidate route as a stable route if at least two historical scheduling schemes indicate the same type and quantity of delivery parties.

[0058] For example, refer to Figure 2A , Figure 2A A schematic diagram of a process 200A for determining a stable route according to some embodiments of the present disclosure is shown.

[0059] The electronic device 110 can acquire historical scheduling schemes 210 within a predetermined time period. Further, the electronic device 110 can determine a first candidate stable route 224 based on a first determination strategy 221, a second candidate stable route 225 based on a second determination strategy 222, and a third candidate stable route 226 based on a third determination strategy 223. Further, the electronic device 110 can determine a stable route 230 by comparing the first historical scheduling characteristics, second historical scheduling characteristics, and third historical scheduling characteristics corresponding to the first candidate stable route 224, the second candidate stable route 225, and the third candidate stable route 226.

[0060] In some embodiments, for a stable route 230 that has been identified, the electronic device 110 may also store it and the type and number of the corresponding stable delivery party in a data pool 240 so that the stable route and the type and number of the corresponding stable delivery party can be extracted from the data pool 240 later.

[0061] Furthermore, the electronic device 110 provides scheduling analysis information generated based on the scheduling characteristics of historical scheduling schemes, for use in generating scheduling schemes for target routes. The electronic device 110 can generate scheduling analysis information based on the scheduling characteristics corresponding to stable routes, and this information can indicate the type and quantity of stable delivery providers indicated by the scheduling characteristics of each stable route. Accordingly, after the electronic device 110 obtains a target route (e.g., a target route uploaded by a dispatcher and intended for scheduling, or a target route pre-configured for the electronic device 110), the electronic device 110 can find stable routes corresponding to that target route. For example, if the target route is route D, the electronic device 110 can determine the stable route E corresponding to route D based on information such as the start and end points of route D. Furthermore, the electronic device 110 can schedule the type and quantity of stable delivery providers corresponding to stable route E to route D.

[0062] In some embodiments, the electronic device 110 may also, in response to receiving actual scheduling information, obtain the difference between the actual scheduling information and the historical scheduling scheme. The actual scheduling information may be sent, for example, by a user, to indicate the actual type and actual quantity of the delivery party responding to the historical scheduling scheme. Further, the electronic device 110 may determine whether there is a difference between the actual type in the actual scheduling information and the expected type indicated in the scheduling scheme, and / or whether there is a difference between the actual quantity and the expected quantity indicated in the scheduling scheme.

[0063] Furthermore, if the electronic device 110 determines that the actual type in the actual dispatch information does not meet the expected type indicated in the dispatch scheme, it can determine a first difference between the two. Similarly, if the electronic device 110 determines that the actual quantity does not meet the expected quantity indicated in the dispatch scheme, it can determine a second difference between the two. Further, the electronic device 110 can generate indication information based on the first and / or second differences to instruct, for example, dispatchers to supplement the missing personnel. Thus, indication information can be generated based on the portion of the actual dispatch that does not meet the dispatch scheme, so that dispatchers can use this indication information to supplement delivery personnel (e.g., the type and quantity of missing delivery personnel). In some embodiments, after receiving the indication information, the electronic device 110 can also notify the dispatch system via an asynchronous message queue (MQ) message to complete the automatic dispatch of the vehicle dispatch task, thereby achieving linkage between dispatch and supplementation.

[0064] For example, refer to Figure 2B , Figure 2B A schematic diagram of a process 200B for generating prompt information according to some embodiments of the present disclosure is shown. Figure 2BIn this process, electronic device 110 can obtain scheduling scheme 140 and actual scheduling information 260 and then compare the two. If the comparison result indicates that the actual type and / or actual quantity in the actual scheduling information 260 does not meet the scheduling scheme 140, electronic device 110 can output prompt information 280 to instruct, for example, the dispatcher to supplement the missing personnel.

[0065] Therefore, according to the embodiments of this disclosure, the problem of dispatchers lacking intuitive understanding and control over the dispatching scenario during actual production processes can be solved. It reduces the number of page operations required by dispatchers, optimizes the dispatching scenario experience, and enhances the system's self-collection capabilities. It enables the analysis of "patterns" using dispatching schemes, reducing the workload of dispatchers in vehicle dispatching and saving costs. It makes the dispatching process more intelligent, efficient, and accurate, and improves the algorithmic capabilities for automatically generating dispatching schemes.

[0066] Subsequently, according to embodiments of this disclosure, a set of stable routes is determined based on the scheduling frequency of a set of candidate routes within a predetermined time period; based on the historical scheduling schemes of the set of stable routes, the scheduling characteristics of the set of stable routes under the historical scheduling scheme are determined, wherein the scheduling characteristics of the historical scheduling scheme indicate the type and number of stable delivery parties allocated to the corresponding stable routes within the predetermined time period of the historical scheduling scheme; and scheduling analysis information generated based on the scheduling characteristics of the historical scheduling scheme is provided for generating a scheduling scheme for the target route. The solution of this disclosure can generate a route scheduling scheme based on the analysis results of the historical scheduling schemes of stable routes, thereby automatically generating scheduling schemes and implementing scheduling, and improving scheduling efficiency.

[0067] Figure 3 A flowchart of a dispatching process 300 according to some embodiments of the present disclosure is shown. Process 300 can be implemented at electronic device 110.

[0068] In box 310, electronic device 110 determines a set of stable routes based on the scheduling frequency of a set of candidate routes within a predetermined time period.

[0069] In box 320, electronic device 110 determines the scheduling characteristics of a set of stable routes based on the historical scheduling scheme of a set of stable routes.

[0070] In embodiments of this disclosure, the historical scheduling scheme scheduling characteristics indicate the type and number of stable delivery parties allocated to the corresponding stable route within a predetermined time period of the historical scheduling scheme.

[0071] In box 330, electronic device 110 provides scheduling analysis information generated based on the scheduling characteristics of historical scheduling schemes for generating a scheduling scheme for the target route.

[0072] In some embodiments, the predetermined time period of the historical scheduling scheme includes a first predetermined time period, the set of candidate routes of the historical scheduling scheme includes a first set of candidate routes, and determining a stable route includes: determining a first candidate route from the first set of candidate routes of the historical scheduling scheme whose scheduling frequency is greater than a first threshold; and determining a stable route of the historical scheduling scheme based on the first candidate route of the historical scheduling scheme.

[0073] In some embodiments, the predetermined time period of the historical scheduling scheme includes a second predetermined time period, the second predetermined time period of the historical scheduling scheme corresponds to multiple time periods, each time period corresponds to multiple scheduling time units, a set of candidate routes of the historical scheduling scheme includes a second set of candidate routes, and determining a stable route includes: determining a second candidate route from the second set of candidate routes of the historical scheduling scheme, wherein the second candidate route of the historical scheduling scheme is scheduled in a specific scheduling time unit of each time period in the multiple time periods of the historical scheduling scheme; and determining a stable route of the historical scheduling scheme based on the second candidate route of the historical scheduling scheme.

[0074] In some embodiments, the predetermined time period of the historical scheduling scheme includes the adjacent time period before the current time, the adjacent time period of the historical scheduling scheme corresponds to multiple scheduling time units, a set of candidate routes of the historical scheduling scheme includes a third set of candidate routes, and determining a stable route includes: determining a third candidate route from the third set of candidate routes of the historical scheduling scheme, wherein the third candidate route of the historical scheduling scheme is scheduled in each scheduling time unit within the adjacent time period of the historical scheduling scheme; and determining a stable route of the historical scheduling scheme based on the third candidate route of the historical scheduling scheme.

[0075] In some embodiments, determining a set of stable routes based on the scheduling frequency of a set of candidate routes within a predetermined time period includes: determining a first set of candidate stable routes based on a first determination strategy; determining a second set of candidate stable routes based on a second determination strategy; and determining a set of stable routes for a historical scheduling scheme based at least on the first set of candidate stable routes and the second set of candidate stable routes for a historical scheduling scheme.

[0076] In some embodiments, determining a set of stable routes for a historical scheduling scheme based at least on a first set of candidate stable routes and a second set of candidate stable routes for a historical scheduling scheme includes: determining a common route for the first set of candidate stable routes and the second set of candidate stable routes for a historical scheduling scheme; determining a first historical scheduling characteristic and a second historical scheduling characteristic of the common route, wherein the first historical scheduling characteristic corresponds to a first determination strategy of the historical scheduling scheme and the second historical scheduling characteristic corresponds to a second determination strategy of the historical scheduling scheme; and determining the common route of the historical scheduling scheme as a stable route in the set of stable routes for a historical scheduling scheme based at least on the matching of the first historical scheduling characteristic and the second historical scheduling characteristic.

[0077] In some embodiments, the historical scheduling scheme indicates the type and number of delivery parties assigned to the historical scheduling scheme stable route in the historical scheduling of the corresponding scheduling time unit.

[0078] In some embodiments, determining the scheduling characteristics of a historical scheduling scheme includes: based on the historical scheduling scheme, determining the same type and the same quantity of delivery parties that exist in each scheduling time unit; and determining the delivery parties with the same type and the same quantity in the historical scheduling scheme as the scheduling characteristics of the historical scheduling scheme.

[0079] In some embodiments, process 300 further includes: in response to receiving actual scheduling information, obtaining the difference between the actual scheduling information of the historical scheduling scheme and the historical scheduling scheme, wherein the actual scheduling information of the historical scheduling scheme indicates the actual type and actual quantity of the delivery party responding to the historical scheduling scheme, and the difference in the historical scheduling scheme indicates at least one of the following: a first difference where the actual type of the historical scheduling scheme does not meet the expected type of the historical scheduling scheme, and a second difference where the actual quantity of the historical scheduling scheme does not meet the expected quantity of the historical scheduling scheme; in response to the difference in the historical scheduling scheme indicating that the actual scheduling information of the historical scheduling scheme does not meet the historical scheduling scheme, generating indication information based on the difference in the historical scheduling scheme to indicate the first difference and / or the second difference in the historical scheduling scheme.

[0080] Figure 4 A block diagram of an apparatus 400 for dispatching delivery personnel according to some embodiments of the present disclosure is shown. The apparatus 400 may be implemented as or include electronic device 110.

[0081] The device 400 includes a first determining module 410 configured to determine a set of stable routes based on the scheduling frequency of a set of candidate routes within a predetermined time period; a second determining module 420 configured to determine the scheduling characteristics of a set of stable routes under a historical scheduling scheme based on the historical scheduling scheme of the set of stable routes, wherein the scheduling characteristics of the historical scheduling scheme indicate the type and number of stable delivery parties allocated to the corresponding stable routes within the predetermined time period of the historical scheduling scheme; and a providing module 430 configured to provide scheduling analysis information generated based on the scheduling characteristics of the historical scheduling scheme for generating a scheduling scheme for the target route.

[0082] In some embodiments, the predetermined time period of the historical scheduling scheme includes a first predetermined time period, the set of candidate routes of the historical scheduling scheme includes a first set of candidate routes, and determining a stable route includes: determining a first candidate route from the first set of candidate routes of the historical scheduling scheme whose scheduling frequency is greater than a first threshold; and determining a stable route of the historical scheduling scheme based on the first candidate route of the historical scheduling scheme.

[0083] In some embodiments, the predetermined time period of the historical scheduling scheme includes a second predetermined time period, the second predetermined time period of the historical scheduling scheme corresponds to multiple time periods, each time period corresponds to multiple scheduling time units, a set of candidate routes of the historical scheduling scheme includes a second set of candidate routes, and determining a stable route includes: determining a second candidate route from the second set of candidate routes of the historical scheduling scheme, wherein the second candidate route of the historical scheduling scheme is scheduled in a specific scheduling time unit of each time period in the multiple time periods of the historical scheduling scheme; and determining a stable route of the historical scheduling scheme based on the second candidate route of the historical scheduling scheme.

[0084] In some embodiments, the predetermined time period of the historical scheduling scheme includes the adjacent time period before the current time, the adjacent time period of the historical scheduling scheme corresponds to multiple scheduling time units, a set of candidate routes of the historical scheduling scheme includes a third set of candidate routes, and determining a stable route includes: determining a third candidate route from the third set of candidate routes of the historical scheduling scheme, wherein the third candidate route of the historical scheduling scheme is scheduled in each scheduling time unit within the adjacent time period of the historical scheduling scheme; and determining a stable route of the historical scheduling scheme based on the third candidate route of the historical scheduling scheme.

[0085] In some embodiments, determining a set of stable routes based on the scheduling frequency of a set of candidate routes within a predetermined time period includes: determining a first set of candidate stable routes based on a first determination strategy; determining a second set of candidate stable routes based on a second determination strategy; and determining a set of stable routes for a historical scheduling scheme based at least on the first set of candidate stable routes and the second set of candidate stable routes for a historical scheduling scheme.

[0086] In some embodiments, determining a set of stable routes for a historical scheduling scheme based at least on a first set of candidate stable routes and a second set of candidate stable routes for a historical scheduling scheme includes: determining a common route for the first set of candidate stable routes and the second set of candidate stable routes for a historical scheduling scheme; determining a first historical scheduling characteristic and a second historical scheduling characteristic of the common route, wherein the first historical scheduling characteristic corresponds to a first determination strategy of the historical scheduling scheme and the second historical scheduling characteristic corresponds to a second determination strategy of the historical scheduling scheme; and determining the common route of the historical scheduling scheme as a stable route in the set of stable routes for a historical scheduling scheme based at least on the matching of the first historical scheduling characteristic and the second historical scheduling characteristic.

[0087] In some embodiments, the historical scheduling scheme indicates the type and number of delivery parties assigned to the historical scheduling scheme stable route in the historical scheduling of the corresponding scheduling time unit.

[0088] In some embodiments, determining the scheduling characteristics of a historical scheduling scheme includes: based on the historical scheduling scheme, determining the same type and the same quantity of delivery parties that exist in each scheduling time unit; and determining the delivery parties with the same type and the same quantity in the historical scheduling scheme as the scheduling characteristics of the historical scheduling scheme.

[0089] In some embodiments, the system further includes: an indication module configured to, in response to receiving actual scheduling information, obtain the difference between the actual scheduling information of the historical scheduling scheme and the historical scheduling scheme, wherein the actual scheduling information of the historical scheduling scheme indicates the actual type and actual quantity of the delivery party responding to the historical scheduling scheme, and the difference in the historical scheduling scheme indicates at least one of the following: a first difference where the actual type of the historical scheduling scheme does not meet the expected type of the historical scheduling scheme, and a second difference where the actual quantity of the historical scheduling scheme does not meet the expected quantity of the historical scheduling scheme; and in response to the historical scheduling scheme difference indicating that the actual scheduling information of the historical scheduling scheme does not meet the historical scheduling scheme, generating indication information based on the historical scheduling scheme difference to indicate the first difference and / or the second difference in the historical scheduling scheme.

[0090] The modules included in device 400 can be implemented in various ways, including software, hardware, firmware, or any combination thereof. In some embodiments, one or more units can be implemented using software and / or firmware, such as machine-executable instructions stored on a storage medium. In addition to or as an alternative to machine-executable instructions, some or all of the units in device 400 can be implemented at least partially by one or more hardware logic components. By way of example, and not limitation, exemplary types of hardware logic components that can be used include field-programmable gate arrays (FPGAs), application-specific integrated circuits (ASICs), application-specific standard products (ASSPs), systems-on-a-chip (SoCs), complex programmable logic devices (CPLDs), and so on.

[0091] Figure 5 A block diagram of an electronic device 500 in which one or more embodiments of the present disclosure may be implemented is shown. It should be understood that... Figure 5 The electronic device 500 shown is merely exemplary and should not be construed as limiting the functionality and scope of the embodiments described herein.

[0092] like Figure 5 As shown, electronic device 500 is in the form of a general-purpose electronic device. Components of electronic device 500 may include, but are not limited to, one or more processors or processing units 510, memory 520, storage device 530, one or more communication units 540, one or more input devices 550, and one or more output devices 560. Processing unit 510 may be a physical or virtual processor and is capable of performing various processes according to programs stored in memory 520. In a multiprocessor system, multiple processing units execute computer-executable instructions in parallel to improve the parallel processing capability of electronic device 500.

[0093] Electronic device 500 typically includes multiple computer storage media. Such media can be any available media accessible to electronic device 500, including but not limited to volatile and non-volatile media, removable and non-removable media. Memory 520 can be volatile memory (e.g., registers, cache, random access memory (RAM)), non-volatile memory (e.g., read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory), or some combination thereof. Storage device 530 can be removable or non-removable media and can include machine-readable media, such as flash drives, disks, or any other media capable of storing information and / or data and accessible within electronic device 500.

[0094] Electronic device 500 may further include additional removable / non-removable, volatile / non-volatile storage media. Although not explicitly stated... Figure 5As shown, disk drives for reading from or writing to removable, non-volatile disks (e.g., "floppy disks") and optical disk drives for reading from or writing to removable, non-volatile optical disks can be provided. In these cases, each drive can be connected to a bus (not shown) via one or more data media interfaces. Memory 520 may include computer program product 525 having one or more program modules configured to perform various methods or actions of various embodiments of this disclosure.

[0095] Communication unit 540 enables communication with other electronic devices via a communication medium. Additionally, the functionality of components of electronic device 500 can be implemented using a single computing cluster or multiple computing machines capable of communicating via communication connections. Therefore, electronic device 500 can operate in a networked environment using logical connections to one or more other servers, network personal computers (PCs), or another network node.

[0096] Input device 550 can be one or more input devices, such as a mouse, keyboard, trackball, etc. Output device 560 can be one or more output devices, such as a monitor, speaker, printer, etc. Electronic device 500 can also communicate with one or more external devices (not shown) via communication unit 540 as needed. These external devices include storage devices, display devices, etc., and can communicate with one or more devices that enable user interaction with electronic device 500, or with any device that enables electronic device 500 to communicate with one or more other electronic devices (e.g., network card, modem, etc.). Such communication can be performed via input / output (I / O) interface (not shown).

[0097] According to an exemplary implementation of this disclosure, a computer-readable storage medium is provided that stores one or more computer instructions, wherein the one or more computer instructions are executed by a processor to implement the methods described above. According to an exemplary implementation of this disclosure, a computer program product is also provided, which is tangibly stored on a non-transient computer-readable medium and includes computer-executable instructions that are executed by a processor to implement the methods described above.

[0098] Various aspects of this disclosure are described herein with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems), and computer program products implemented according to this disclosure. It should be understood that each block of the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer-readable program instructions.

[0099] These computer-readable program instructions can be provided to a processing unit of a general-purpose computer, a special-purpose computer, or other programmable data processing apparatus to produce a machine such that, when executed by the processing unit of the computer or other programmable data processing apparatus, they create means for implementing the functions / actions specified in one or more blocks of the flowchart and / or block diagram. These computer-readable program instructions can also be stored in a computer-readable storage medium that causes a computer, programmable data processing apparatus, and / or other device to operate in a particular manner. Thus, the computer-readable medium storing the instructions comprises an article of manufacture that includes instructions for implementing aspects of the functions / actions specified in one or more blocks of the flowchart and / or block diagram.

[0100] Computer-readable program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other device to cause a series of operational steps to be performed on the computer, other programmable data processing apparatus, or other device to produce a computer-implemented process, thereby causing the instructions that execute on the computer, other programmable data processing apparatus, or other device to perform the functions / actions specified in one or more boxes of a flowchart and / or block diagram.

[0101] The flowcharts and block diagrams in the accompanying drawings illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer program products according to various embodiments of this disclosure. In this regard, each block in a flowchart or block diagram may represent a module, segment, or portion of an instruction, which contains one or more executable instructions for implementing the specified logical function. In some alternative implementations, the functions indicated in the blocks may occur in a different order than those indicated in the drawings. For example, two consecutive blocks may actually be executed substantially in parallel, and they may sometimes be executed in reverse order, depending on the functions involved. It should also be noted that each block in the block diagrams and / or flowcharts, and combinations of blocks in the block diagrams and / or flowcharts, may be implemented using a dedicated hardware-based system that performs the specified function or action, or using a combination of dedicated hardware and computer instructions.

[0102] Various implementations of this disclosure have been described above. The foregoing description is exemplary and not exhaustive, nor is it limited to the disclosed implementations. Many modifications and variations will be apparent to those skilled in the art without departing from the scope and spirit of the described implementations. The terminology used herein is chosen to best explain the principles, practical applications, or improvements to technology in the market, or to enable others skilled in the art to understand the implementations disclosed herein.

Claims

1. A method for scheduling delivery providers, comprising: Based on the scheduling frequency of a set of candidate routes within a predetermined time period, a set of stable routes is determined, wherein the scheduling frequency includes the number of scheduling times, the scheduling status of a specific scheduling time unit in each time period in multiple time periods, or the scheduling status of each scheduling time unit in adjacent time periods. Based on the historical scheduling schemes of the set of stable routes, the scheduling characteristics of the set of stable routes are determined. These scheduling characteristics indicate the type and number of stable delivery providers allocated to the corresponding stable routes within the predetermined time period. The historical scheduling schemes indicate the type and number of delivery providers allocated to the stable routes in the historical scheduling of the corresponding scheduling time unit. Determining the scheduling characteristics includes: Based on the historical scheduling scheme, determine the same type and quantity of delivery parties that exist in each scheduling time unit; and The same type and the same number of delivery parties are identified as the scheduling characteristic; and Provide scheduling analysis information based on the aforementioned scheduling characteristics to generate a scheduling scheme for the target route.

2. The method of claim 1, wherein the predetermined time period includes a first predetermined time period, the set of candidate routes includes a first set of candidate routes, and determining a stable route includes: A first candidate route whose scheduling count is greater than a first threshold is determined from the first group of candidate routes; as well as Based on the first candidate route, the stable route is determined.

3. The method according to claim 1, wherein the predetermined time period includes a second predetermined time period, the second predetermined time period corresponds to a plurality of time cycles, each time cycle corresponds to a plurality of scheduling time units, the set of candidate routes includes a second set of candidate routes, and determining a stable route includes: A second candidate route is determined from the second group of candidate routes, and the second candidate route is scheduled in a specific scheduling time unit of each of the plurality of time periods; as well as Based on the second candidate route, the stable route is determined.

4. The method of claim 1, wherein the predetermined time period includes adjacent time periods before the current time, the adjacent time periods corresponding to multiple scheduling time units, the set of candidate routes includes a third set of candidate routes, and determining a stable route includes: A third candidate route is determined from the third group of candidate routes, wherein the third candidate route is scheduled in each scheduling time unit within the adjacent time period; as well as Based on the third candidate route, the stable route is determined.

5. The method according to claim 1, wherein determining a set of stable routes based on the scheduling frequency of a set of candidate routes within a predetermined time period comprises: Based on a first determination strategy, a first group of candidate stable routes is determined, wherein the first determination strategy includes determining the first candidate routes based on scheduling times exceeding a first threshold. Based on the second determination strategy, a second set of candidate stable routes is determined, wherein the second determination strategy includes determining the second candidate route based on the fact that a specific scheduling time unit of each time period in multiple time periods corresponding to the predetermined time period is scheduled. as well as The set of stable routes is determined based at least on the first set of candidate stable routes and the second set of candidate stable routes.

6. The method of claim 5, wherein determining the set of stable routes based at least on the first set of candidate stable routes and the second set of candidate stable routes comprises: Determine the common route between the first group of candidate stable routes and the second group of candidate stable routes; Determine a first historical scheduling characteristic and a second historical scheduling characteristic of the public route, wherein the first historical scheduling characteristic corresponds to the first determined strategy and the second historical scheduling characteristic corresponds to the second determined strategy; as well as Based at least on the matching of the first historical scheduling characteristics and the second historical scheduling characteristics, the common route is determined as a stable route in the set of stable routes.

7. The method according to claim 1, further comprising: In response to receiving actual scheduling information, the difference between the actual scheduling information and the scheduling scheme is obtained, wherein the actual scheduling information indicates the actual type and actual quantity of the delivery party responding to the scheduling scheme, and the difference indicates at least one of the following: a first difference where the actual type does not meet the expected type of the scheduling scheme, and a second difference where the actual quantity does not meet the expected quantity of the scheduling scheme; In response to the difference indicating that the actual scheduling information does not satisfy the scheduling scheme, indication information is generated based on the difference to indicate the first difference and / or the second difference.

8. An apparatus for dispatching delivery personnel, comprising: The first determining module is configured to determine a set of stable routes based on the scheduling frequency of a set of candidate routes within a predetermined time period, wherein the scheduling frequency includes the number of scheduling times, the scheduling status of a specific scheduling time unit in each time period in multiple time periods, or the scheduling status of each scheduling time unit in adjacent time periods. The second determining module is configured to determine the scheduling characteristics of the set of stable routes based on historical scheduling schemes of the set of stable routes. The scheduling characteristics indicate the type and number of stable delivery providers allocated to the corresponding stable routes within the predetermined time period. The historical scheduling scheme indicates the type and number of delivery providers allocated to the stable routes in the historical scheduling of the corresponding scheduling time unit. Determining the scheduling characteristics includes: Based on the historical scheduling scheme, determine the same type and quantity of delivery parties that exist in each scheduling time unit; and The same type and the same number of delivery parties are identified as the scheduling characteristic; and A module is configured to provide scheduling analysis information generated based on the scheduling characteristics for generating a scheduling scheme for the target route.

9. An electronic device, comprising: At least one processing unit; as well as At least one memory, coupled to the at least one processing unit and storing instructions for execution by the at least one processing unit, the instructions causing the electronic device to perform the method according to any one of claims 1 to 7 when executed by the at least one processing unit.

10. A computer-readable storage medium having a computer program stored thereon, the computer program being executable by a processor to implement the method according to any one of claims 1 to 7.

Images