Delivery man scheduling method and device

Abstract

The invention discloses a dispatch method and device for deliverymen, and relates to the technical field of computers. A specific embodiment of the method comprises the following steps: in response to a received deliveryman scheduling request, obtaining scheduling deliverymen in a delivery road area and a predicted total to-be-delivered order amount of the delivery road area; when the delivery capability of the scheduling deliveryman does not meet the predicted total to-be-delivered order quantity, searching for a scheduling deliveryman which is familiar with the delivery road area and has the remaining delivery capability from deliverymen in the adjacent road area of the delivery road area; and distributing the predicted residual quantity of the to-be-delivered orders exceeding the delivery capability of the scheduling deliveryman in the predicted total quantity of the to-be-delivered orders to the scheduling deliveryman to obtain a scheduling result corresponding to the scheduling request of the deliveryman. According to the embodiment of the invention, automatic and intelligent dispatch of deliverymen is realized, manual dispatch is omitted, and the dispatch reasonability is ensured, so that punctual and efficient delivery service is provided.

Description

Technical Field

[0001] This invention relates to the field of computer technology, and in particular to a method and apparatus for scheduling delivery personnel. Background Technology

[0002] In the express delivery business, deliverymen at express stations are responsible for picking up and delivering packages according to the assigned routes by the station manager. If a deliveryman is off for the day, the station manager will, based on experience, reassign deliverymen to routes that are short of deliverymen.

[0003] In the process of realizing this invention, the inventors discovered the following problems in the prior art: The existing delivery dispatching method relies solely on experience to assign delivery personnel, lacking necessary data support. This leads to unreasonable delivery dispatching, which may result in low delivery efficiency or even failure to complete the day's delivery tasks due to delivery personnel's unfamiliarity with the route area or their switching between their original responsibility area and the newly assigned area. Summary of the Invention

[0004] In view of this, embodiments of the present invention provide a method and apparatus for dispatching delivery personnel, which realizes automatic and intelligent dispatching of delivery personnel, eliminating manual dispatching and ensuring the rationality of dispatching, so as to provide timely and efficient delivery services.

[0005] To achieve the aforementioned objective, according to a first aspect of the present invention, a method for dispatching delivery personnel is provided, comprising: In response to receiving a delivery dispatch request, the system obtains the scheduled delivery personnel for the delivery route area and the predicted total number of orders to be delivered for the delivery route area. If the delivery capacity of the scheduled delivery personnel does not meet the predicted total number of orders to be delivered, a dispatched delivery personnel who are familiar with the delivery area and have spare delivery capacity are selected from the delivery personnel in the neighboring areas of the delivery area. The predicted remaining number of orders to be delivered that exceeds the delivery capacity of the scheduled delivery personnel is allocated to the dispatched delivery personnel to obtain the dispatch result corresponding to the dispatch request of the delivery personnel.

[0006] Optionally, the predicted total number of orders to be delivered in the delivery route area is composed of the predicted number of orders to be delivered in each interest area included in the delivery route area; finding dispatched delivery personnel familiar with the delivery route area and with spare delivery capacity from delivery personnel in neighboring routes of the delivery route area includes: determining the pending interest area to which the predicted remaining pending order volume exceeds the delivery capacity of the scheduled delivery personnel; recursively searching for the target interest area closest to the pending interest area from each interest area included in the neighboring routes of the delivery route area, or from the neighboring interest areas of the pending interest area; and determining dispatched delivery personnel familiar with the pending interest area and with spare delivery capacity from the delivery personnel corresponding to the route area to which the target interest area belongs.

[0007] Optionally, before recursively searching for the target interest surface closest to the interest surface to be processed from the neighboring interest surfaces of the delivery route area, or from the neighboring interest surfaces of the interest surface to be processed, the method further includes: obtaining a route area set of the delivery station; determining the neighboring route areas of each route area and the neighboring route areas of the neighboring route areas based on the fence information of each route area in the route area set, thereby obtaining the neighboring route areas of each route area in the route area set; or, obtaining a set of interest surfaces of the delivery station; determining the neighboring interest surfaces of each interest surface and the neighboring interest surfaces of the neighboring interest surfaces based on the fence information of each interest surface in the set of interest surfaces, thereby obtaining the neighboring interest surfaces of each interest surface in the set of interest surfaces.

[0008] Optionally, before determining the dispatchable delivery personnel who are familiar with the target interest area and have spare delivery capacity from the delivery personnel corresponding to the adjacent road areas to which the target interest area belongs, the method further includes: querying the historical delivery data of the delivery personnel of the delivery station, and determining the familiarity of the delivery personnel of the delivery station with each delivery road area in the delivery station based on the historical delivery data and a preset threshold, thereby determining the familiarity of the delivery personnel of the delivery station with the interest areas contained in each delivery road area.

[0009] Optionally, if the predicted remaining number of orders to be delivered exceeds the delivery capacity of the dispatched delivery personnel, the method further includes: allocating the excess number of orders exceeding the delivery capacity of the dispatched delivery personnel from the predicted remaining number of orders to all other scheduled delivery personnel familiar with the delivery route area.

[0010] Optionally, the scheduling result includes the scheduled delivery personnel and / or dispatched delivery personnel corresponding to the interest areas included in the delivery route area. The method further includes: in response to receiving a scheduling result query request, querying the interest areas responsible for the requesting party from the scheduling result, and classifying the interest areas responsible for the requesting party into original responsible interest areas and / or newly added responsible interest areas according to the scheduled delivery personnel and / or dispatched delivery personnel corresponding to the interest areas responsible for the requesting party in the scheduling result; and displaying the original responsible interest areas and / or the newly added responsible interest areas on the visualization map page according to the preset display rules.

[0011] According to a second aspect of the present invention, a method for dispatching delivery personnel is provided, comprising: Monitor the on-duty status of delivery personnel in the delivery route area and the actual total number of orders to be delivered in the delivery route area; If the delivery capacity of the on-duty delivery personnel does not meet the actual total number of orders to be delivered, the on-duty delivery personnel are used to replace the scheduled delivery personnel, and the actual total number of orders to be delivered is used to replace the predicted total number of orders to be delivered. The dispatched delivery personnel are then searched from the on-duty delivery personnel in the adjacent areas of the delivery area according to any of the methods described in the first aspect of the present invention, and the remaining number of orders to be delivered that exceeds the delivery capacity of the on-duty delivery personnel in the actual total number of orders to be delivered is allocated to the dispatched delivery personnel.

[0012] According to a third aspect of the present invention, a dispatching device for delivery personnel is provided, comprising: The delivery information acquisition module is used to respond to receiving a delivery dispatch request and acquire the scheduled delivery personnel for the delivery route area and the predicted total number of orders to be delivered for the delivery route area. The delivery dispatch module is used to, when the delivery capacity of the scheduled delivery personnel does not meet the predicted total number of orders to be delivered, find a dispatchable delivery personnel from the delivery personnel in the neighboring areas of the delivery area who are familiar with the delivery area and have spare delivery capacity, and allocate the predicted remaining number of orders to be delivered that exceeds the delivery capacity of the scheduled delivery personnel to the dispatchable delivery personnel, thereby obtaining a dispatch result corresponding to the delivery personnel dispatch request.

[0013] According to a fourth aspect of the present invention, an electronic dispatching device for delivery personnel is provided, comprising: One or more processors; Storage device for storing one or more programs. When the one or more programs are executed by the one or more processors, the one or more processors implement the method provided in the first aspect of the embodiments of the present invention.

[0014] According to a fifth aspect of the present invention, a computer-readable medium is provided having a computer program stored thereon, which, when executed by a processor, implements the method provided in the first aspect of the present invention.

[0015] One embodiment of the invention has the following advantages or beneficial effects: by responding to a delivery dispatch request, obtaining the scheduled delivery personnel and the predicted total number of orders to be delivered in the delivery area; when the delivery capacity of the scheduled delivery personnel does not meet the predicted total number of orders to be delivered, finding a dispatchable delivery personnel familiar with the delivery area and with spare delivery capacity from the delivery personnel in the neighboring areas of the delivery area, and allocating the predicted remaining number of orders to be delivered that exceeds the delivery capacity of the scheduled delivery personnel to the dispatchable delivery personnel, thus obtaining the dispatch result corresponding to the delivery dispatch request, the technical solution realizes an automatic and intelligent delivery dispatch method, which not only saves manual dispatch but also ensures the rationality of dispatch, so as to provide timely and efficient delivery services. Attached Figure Description

[0016] The accompanying drawings are provided to better understand the invention and are not intended to unduly limit the scope of the invention. Wherein: Figure 1 This is a schematic diagram of the main flow of the deliveryman dispatching method according to an embodiment of the present invention; Figure 2 This is a schematic diagram of the overall process of the delivery personnel scheduling method according to an embodiment of the present invention; Figure 3 This is a schematic diagram of the main modules of a deliveryman dispatching device according to an embodiment of the present invention; Figure 4 This is an exemplary system architecture diagram in which embodiments of the present invention can be applied; Figure 5 This is a schematic diagram of the structure of a computer system suitable for implementing terminal devices or servers of the present invention. Detailed Implementation

[0017] It should be noted that the collection, updating, analysis, use, transmission, and storage of user personal information involved in the technical solution of this invention all comply with relevant laws and regulations, are used for legitimate and reasonable purposes, and are not shared, disclosed, or sold outside of these legitimate uses, and are subject to supervision and management by national regulatory authorities. Necessary measures should be taken to selectively block the use or access to personal information data to prevent unauthorized access to such personal information data, ensure that personnel authorized to access personal information data comply with relevant laws and regulations, and ensure the security of user personal information. Furthermore, once this user personal information data is no longer needed, the risk should be minimized by restricting or even prohibiting data collection and / or deleting the data.

[0018] The following description, in conjunction with the accompanying drawings, illustrates exemplary embodiments of the present invention, including various details to aid understanding. These details should be considered merely exemplary. Therefore, those skilled in the art will recognize that various changes and modifications can be made to the embodiments described herein without departing from the scope and spirit of the invention. Similarly, for clarity and brevity, descriptions of well-known functions and structures are omitted in the following description.

[0019] The existing delivery dispatching method relies solely on experience to assign delivery personnel, lacking necessary data support. This leads to unreasonable delivery dispatching, which may result in low delivery efficiency or even failure to complete the day's delivery tasks due to delivery personnel's unfamiliarity with the route area or their switching between their original responsibility area and the newly assigned area.

[0020] To address the aforementioned problems in existing technologies, this invention proposes a delivery rider scheduling method. This method obtains the scheduled delivery riders and the predicted total number of orders to be delivered in a given delivery area. When the delivery capacity of the scheduled riders is insufficient to meet the predicted total number of orders, delivery riders are selected from neighboring areas based on distance and the rider's familiarity with the area. This solves the problem of insufficient delivery capacity among scheduled riders in a given delivery area. This achieves an automated and intelligent delivery rider scheduling method, eliminating manual scheduling while ensuring the rationality of scheduling, thus providing timely and efficient delivery services.

[0021] In the description of the embodiments of the present invention, the terms involved and their meanings are as follows: GIS: Geographic Information System is a specific and important spatial information system that uses computer hardware and software to collect, store, manage, process, analyze, display, and describe geographic distribution data on the Earth's surface. AOI: Area of ​​Interest, is a concept in Geographic Information Systems (GIS) that refers to a set of areas of interest on a map.

[0022] Figure 1 This is a schematic diagram of the main flow of the deliveryman dispatching method according to an embodiment of the present invention, as shown below. Figure 1 As shown, the deliveryman scheduling method of this embodiment includes the following steps S101 to S103.

[0023] Step S101: In response to receiving a delivery dispatch request, obtain the scheduled delivery personnel for the delivery route area and the predicted total number of orders to be delivered for the delivery route area.

[0024] Specifically, before the start of each day's deliveries, a pre-set timed task triggers a delivery rider dispatch request to obtain information on the scheduled delivery riders for each delivery zone of the delivery station that day, as well as the predicted total number of orders to be delivered for that zone. Typically, around 6:00 AM, the system queries the sorting system for the details of orders that are about to arrive at or have already arrived at the stations that day. Based on these details, it predicts the total number of orders to be delivered for each delivery zone that day.

[0025] Step S102: If the delivery capacity of the scheduled delivery personnel does not meet the predicted total number of orders to be delivered, find a dispatched delivery personnel from the delivery personnel in the adjacent areas of the delivery area who are familiar with the delivery area and have spare delivery capacity. Allocate the predicted remaining number of orders to be delivered that exceeds the delivery capacity of the scheduled delivery personnel to the dispatched delivery personnel to obtain the dispatch result corresponding to the dispatch request of the delivery personnel.

[0026] Specifically, each delivery person at a station has a delivery capacity limit that represents their delivery capabilities. The station manager assesses each delivery person's delivery capacity limit based on their most recent daily delivery data and submits it to the dispatch system. The dispatch system then calculates the delivery capacity of scheduled delivery people in each area based on each delivery person's delivery capacity limit, and compares the delivery capacity with the predicted total number of orders to be delivered in the corresponding area to make a judgment.

[0027] When the delivery capacity of the scheduled delivery personnel in a delivery area does not meet the projected total number of orders to be delivered in that area, it is necessary to dispatch delivery personnel from other areas within the same station to assist in completing the delivery tasks. Considering the geographical coverage of the station, the distances between areas within the station vary. To facilitate the transfer of delivery personnel from their original responsibility areas to the delivery area, priority is given to delivery personnel from areas adjacent to the delivery area. Although delivery personnel from adjacent areas are generally more likely to be familiar with the delivery area, there are unavoidable exceptions. Therefore, it is also necessary to select delivery personnel who are familiar with the delivery area and whose delivery capacity, in addition to meeting the order requirements of their own area, has surplus capacity to share the order requirements of the delivery area as dispatched delivery personnel. Subsequently, the projected remaining number of orders to be delivered beyond the delivery capacity of the scheduled delivery personnel is allocated to the dispatched delivery personnel to obtain the dispatching results.

[0028] According to one embodiment of the present invention, the predicted total number of orders to be delivered in the delivery route area is composed of the predicted number of orders to be delivered in each interest area included in the delivery route area; finding a dispatched delivery person familiar with the delivery route area and with spare delivery capacity from the delivery persons in the neighboring routes of the delivery route area includes: determining the pending interest area to which the predicted remaining pending order volume exceeds the delivery capacity of the scheduled delivery person; recursively searching for the target interest area closest to the pending interest area from each interest area included in the neighboring routes of the delivery route area, or from the neighboring interest areas of the pending interest area; and determining a dispatched delivery person familiar with the pending interest area and with spare delivery capacity from the delivery persons corresponding to the route area to which the target interest area belongs.

[0029] Specifically, the current organizational structure of delivery stations can be divided into three layers: the delivery station at the top layer, the management layer at the second layer (delivery routes), and the delivery personnel within those routes. Each delivery route is further divided into multiple Areas of Interest (AOIs), such as residential communities. As the smallest operational area within a route, each AOI is associated with specific orders awaiting delivery. Therefore, the predicted total number of orders awaiting delivery for a delivery route is composed of the predicted order volumes for each AOI within that route. Since the order volume corresponds to an AOI, the AOI to which the predicted remaining order volume exceeding the scheduled delivery personnel's capacity belongs can be identified. Based on the geographical location of this AOI, target AOIs can be found from both the route area and AOI perspectives. This can be done by recursively searching for the closest target AOI among the AOIs within neighboring routes adjacent to the delivery route, or by recursively searching for the closest target AOI among neighboring AOIs adjacent to the AOI. Then, from the delivery personnel corresponding to the road area to which the target interest area belongs, we can identify the dispatch delivery personnel who are familiar with the AOI to be processed and have spare delivery capacity.

[0030] According to another embodiment of the present invention, before recursively searching for the target interest surface closest to the interest surface to be processed from the neighboring interest surfaces included in the delivery road area, or from the neighboring interest surfaces of the interest surface to be processed, the method further includes: obtaining a road area set of the delivery station, determining the neighboring road areas of each road area and the neighboring road areas of the neighboring road areas based on the fence information of each road area in the road area set, thereby obtaining the neighboring road areas of each road area in the road area set; or, obtaining a set of interest surfaces of the delivery station, determining the neighboring interest surfaces of each interest surface and the neighboring interest surfaces of the neighboring interest surfaces based on the fence information of each interest surface in the interest surface set, thereby obtaining the neighboring interest surfaces of each interest surface in the interest surface set.

[0031] Specifically, to improve the efficiency of finding target interest surfaces, before recursively searching for the target interest surface closest to the target interest surface from among the interest surfaces contained in the neighboring road areas of the delivery road area, or from among the neighboring interest surfaces of the interest surface to be processed, the neighboring road areas of each road area in the road area dimension and the neighboring AOIs of each AOI in the AOI dimension within the delivery station can be determined in advance. The specific determination method can be as follows: first, obtain the road area set of the delivery station; then, use GIS-related algorithms to determine whether the fence polygons of each road area in the road area set intersect; if they intersect, they are adjacent, and adjacent road areas are defined as first-order neighbors. Next, calculate the second-order neighbors of the road areas, that is, the neighboring road areas of adjacent road areas. Define the first-order and second-order neighboring road areas as the neighboring road areas of the road area, thus obtaining the neighboring road areas of each road area in the road area set. Alternatively, similar to the method for determining adjacent road zones, all AOIs of the delivery station are obtained and formed into an AOI set. GIS-related algorithms are used to determine whether the fence polygons of each AOI in the AOI set intersect. If they intersect, they are adjacent, and adjacent AOIs are defined as first-order neighbors. Then, second-order neighbors (i.e., neighboring AOIs of adjacent AOIs) are calculated, and the first-order and second-order neighboring AOIs are defined as neighboring AOIs of the AOI. Thus, when recursively searching for the nearest target interest surface to the interest surface to be processed from the adjacent road zones of the delivery road zone, or from the neighboring interest surfaces of the interest surface to be processed, the pre-determined adjacent road zones of each road zone or the neighboring AOIs of each AOI can be used directly.

[0032] According to another embodiment of the present invention, before determining the dispatchable delivery personnel who are familiar with the target interest area and have spare delivery capacity from the delivery personnel corresponding to the adjacent road areas to which the target interest area belongs, the method further includes: querying the historical delivery data of the delivery personnel of the delivery station, and determining the familiarity of the delivery personnel of the delivery station with each delivery road area in the delivery station according to the historical delivery data and a preset threshold, thereby determining the familiarity of the delivery personnel of the delivery station with the interest areas contained in each delivery road area.

[0033] Specifically, a deliveryman's familiarity with the road area directly affects delivery efficiency. Before selecting a deliveryman familiar with the target interest area and with spare delivery capacity from the deliverymen corresponding to the nearby road areas, the historical order dispatch data of each deliveryman at the delivery station is queried. Based on the address details of the order dispatch data, the number of orders dispatched by each deliveryman in each road area within a specified time period can be counted. Combined with a preset familiarity threshold, if the familiarity threshold is exceeded, it is determined to be a familiar road area. Accordingly, each AOI in the familiar road area is also determined to be a familiar AOI.

[0034] According to another embodiment of the present invention, when the predicted remaining number of orders to be delivered exceeds the delivery capacity of the dispatched delivery personnel, the method further includes: allocating the excess number of orders exceeding the delivery capacity of the dispatched delivery personnel from the predicted remaining number of orders to all other dispatched delivery personnel familiar with the delivery route area.

[0035] Specifically, when the predicted remaining order volume exceeds the delivery capacity of the identified dispatchers, meaning the dispatchers can only handle a portion of the predicted remaining order volume and cannot fully handle it, the excess order volume exceeding the dispatchers' capacity is allocated to all other scheduled delivery personnel familiar with the delivery routes within the station. This allocation can be either equal or based on the delivery capacity of these scheduled delivery personnel.

[0036] According to another embodiment of the present invention, the scheduling result includes the scheduled delivery personnel and / or dispatched delivery personnel corresponding to the interest areas included in the delivery route area. The method further includes: in response to receiving a scheduling result query request, querying the interest areas responsible for the requesting party from the scheduling result, and classifying the interest areas responsible for the requesting party into original responsible interest areas and / or newly added responsible interest areas according to the scheduled delivery personnel and / or dispatched delivery personnel corresponding to the interest areas responsible for the requesting party in the scheduling result; and displaying the original responsible interest areas and / or the newly added responsible interest areas in a visual map page according to preset display rules.

[0037] Specifically, based on the above-mentioned method of finding dispatched delivery personnel from nearby road areas to share the predicted remaining order volume, and the predicted order volume corresponding to the AOI to be processed, it can be seen that the final dispatch result includes the scheduled delivery personnel and / or dispatched delivery personnel corresponding to each interest area within the road area. In this embodiment of the invention, the dispatch result identifies a specific delivery personnel by their ID, and the same delivery personnel are distinguished as scheduled delivery personnel and dispatched delivery personnel. Delivery personnel send a dispatch result query request to the system as needed, and the system queries the AOIs that the delivery personnel are responsible for from the dispatch results based on the delivery personnel's ID. It can be understood that there are three possible types of AOIs that a delivery personnel is responsible for: their original primary responsibility AOI, a newly added responsibility AOI, or an AOI that they are responsible for collaboratively with other scheduled delivery personnel as a dispatched delivery personnel. To more clearly represent the specific types of AOIs that delivery personnel are responsible for, based on the scheduled delivery personnel ID and / or dispatched delivery personnel ID corresponding to the AOIs they are responsible for in the dispatch results, the AOIs they are responsible for are classified as original responsibility interest areas and / or newly added responsibility interest areas. Finally, based on the preset display rules for the original responsibility interest areas, the display rules for newly added responsibility interest areas, and the display rules for AOIs that are jointly managed by other shift delivery personnel, the AOIs managed by the delivery personnel are visualized on the map page according to their categories, so that the delivery personnel can know the details of the AOIs they are responsible for.

[0038] Based on the above-described delivery dispatching method, the present invention also provides a real-time delivery dispatching method, comprising: monitoring the on-duty status of delivery personnel in a delivery area and the actual total number of orders to be delivered in the delivery area; when the delivery capacity of the on-duty delivery personnel does not meet the actual total number of orders to be delivered, replacing the scheduled delivery personnel with the on-duty delivery personnel, replacing the predicted total number of orders to be delivered with the actual total number of orders to be delivered, searching for a dispatching delivery personnel from the on-duty delivery personnel in neighboring areas of the delivery area according to any of the above-described delivery dispatching methods, and allocating the remaining number of orders to be delivered in the actual total number of orders to be delivered that exceeds the delivery capacity of the on-duty delivery personnel to the dispatching delivery personnel.

[0039] Specifically, considering that scheduled delivery personnel may inevitably take temporary leave, the actual total number of orders to be delivered in a delivery area may differ from the predicted total number of orders to be delivered. Therefore, during the order dispatching process, the dispatch system monitors the on-duty status of delivery personnel and the actual total number of orders to be delivered in the delivery area. On-duty status can be obtained by monitoring the online status of the delivery personnel's handheld terminal account or by receiving temporary leave information uploaded by the station manager. The system continuously assesses whether the delivery capacity of on-duty delivery personnel meets the actual total number of orders to be delivered in the area. When the delivery capacity of on-duty delivery personnel does not meet the actual total number of orders to be delivered, a dispatched delivery personnel is selected according to the aforementioned dispatching method. The only difference is that the base data for calculation is changed from scheduled delivery personnel to on-duty delivery personnel, and from predicted total number of orders to actual total number of orders to be delivered; other specific methods remain unchanged. Finally, the remaining order volume exceeding the delivery capacity of on-duty delivery personnel is allocated to dispatched delivery personnel.

[0040] By using the above-mentioned method of real-time dispatching of delivery personnel, not only is the work of station managers in manual dispatching eliminated, but the order status of each route can also be automatically monitored in real time. If the total number of orders to be delivered in a route exceeds the delivery capacity of the on-duty delivery personnel, resulting in an order surge, the dispatching system can automatically dispatch delivery personnel from other routes to provide support, ensuring the timeliness of delivery services.

[0041] Figure 2 This is a schematic diagram of the overall process of the delivery dispatching method according to an embodiment of the present invention. The dispatching system determines the delivery personnel's familiarity with each delivery area within the delivery station based on historical delivery data; receives the operational upper limit representing the delivery personnel's delivery capacity maintained by the station manager; determines the neighboring road areas or neighboring AOIs of each AOI within the delivery station based on road area information from the station manager's workbench or AOI information from the GIS system; calculates the predicted / actual number of orders to be delivered for each road area within the station based on the daily order details, obtaining the predicted / actual total number of orders to be delivered for each delivery area; if the delivery capacity of the scheduled / on-duty delivery personnel does not meet the predicted / actual total number of orders to be delivered, the system searches for dispatched delivery personnel familiar with the delivery area and with spare delivery capacity from the delivery personnel in the neighboring road areas; allocates the predicted / remaining number of orders to be delivered to the determined dispatched delivery personnel, completing the order allocation calculation; finally, the dispatching result is obtained.

[0042] By using the above-mentioned dispatching methods for delivery personnel triggered by dispatch requests and real-time dispatching methods, the station manager of the delivery station only needs to maintain the delivery capacity of each delivery person to achieve automatic and intelligent dispatching of delivery personnel, ensuring the rationality of dispatching, thereby ensuring the timeliness of delivery services and improving user satisfaction.

[0043] Figure 3 This is a schematic diagram of the main modules of a deliveryman dispatching device according to an embodiment of the present invention. Figure 3 As shown, the delivery dispatching device 300 mainly includes a delivery information acquisition module 301 and a delivery dispatching module 302.

[0044] The delivery information acquisition module 301 is used to, in response to receiving a delivery dispatch request, acquire the scheduled delivery personnel for the delivery route area and the predicted total number of orders to be delivered for the delivery route area; The delivery dispatch module 302 is used to, when the delivery capacity of the scheduled delivery personnel does not meet the predicted total number of orders to be delivered, find a dispatch delivery personnel from the delivery personnel in the adjacent areas of the delivery area who are familiar with the delivery area and have spare delivery capacity, and allocate the predicted remaining number of orders to be delivered that exceeds the delivery capacity of the scheduled delivery personnel to the dispatch delivery personnel, so as to obtain a dispatch result corresponding to the delivery personnel dispatch request.

[0045] According to one embodiment of the present invention, the predicted total number of orders to be delivered in the delivery route area is composed of the predicted number of orders to be delivered in each interest area included in the delivery route area; the deliveryman scheduling module 302 is further configured to: determine the pending interest area to which the predicted remaining number of orders to be delivered belongs when the predicted total number of orders to be delivered exceeds the delivery capacity of the scheduled deliveryman; recursively search for the target interest area closest to the pending interest area from each interest area included in the neighboring routes of the delivery route area, or from the neighboring interest areas of the pending interest area; and determine the scheduling deliveryman who is familiar with the pending interest area and has spare delivery capacity from the deliverymen corresponding to the route area to which the target interest area belongs.

[0046] According to another embodiment of the present invention, the dispatching device 300 for the delivery personnel further includes a neighboring road area / interest surface determination module (not shown in the figure), which is used to: obtain a road area set of the delivery station from each interest surface included in the neighboring road areas of the delivery road area, or from the neighboring interest surfaces of the interest surface to be processed, before recursively searching for the target interest surface closest to the interest surface to be processed, and determine the adjacent road areas of each road area and the adjacent road areas of the adjacent road areas according to the fence information of each road area in the road area set, thereby obtaining the neighboring road areas of each road area in the road area set; or, obtain the interest surface set of the delivery station, determine the adjacent interest surfaces of each interest surface and the adjacent interest surfaces of the adjacent interest surfaces according to the fence information of each interest surface in the interest surface set, thereby obtaining the neighboring interest surfaces of each interest surface in the interest surface set.

[0047] According to another embodiment of the present invention, the dispatching device 300 for delivery personnel further includes a familiarity determination module (not shown in the figure), which is used to: query the historical delivery data of the delivery personnel of the delivery station before determining the dispatching delivery personnel who are familiar with the target interest area and have spare delivery capacity from the delivery personnel corresponding to the adjacent road areas to which the target interest area belongs; determine the familiarity of the delivery personnel of the delivery station with each delivery road area in the delivery station according to the historical delivery data and a preset threshold; and then determine the familiarity of the delivery personnel of the delivery station with the interest areas contained in each delivery road area.

[0048] According to another embodiment of the present invention, when the predicted remaining number of orders to be delivered exceeds the delivery capacity of the dispatched delivery personnel, the dispatching device 300 of the delivery personnel further includes a fallback allocation module (not shown in the figure), which is used to: allocate the excess number of orders to be delivered that exceeds the delivery capacity of the dispatched delivery personnel from the predicted remaining number of orders to all other scheduled delivery personnel who are familiar with the delivery route area.

[0049] According to another embodiment of the present invention, the scheduling result includes the scheduled delivery personnel and / or dispatched delivery personnel corresponding to the interest areas included in the delivery route area. The dispatching device 300 of the delivery personnel further includes a scheduling result display module (not shown in the figure), which is used to: in response to receiving a scheduling result query request, query the interest areas responsible for the requesting party from the scheduling result, and classify the interest areas responsible for the requesting party into original responsible interest areas and / or newly added responsible interest areas according to the scheduled delivery personnel and / or dispatched delivery personnel corresponding to the interest areas responsible for the requesting party in the scheduling result; and display the original responsible interest areas and / or the newly added responsible interest areas in the visualization map page according to the preset display rules.

[0050] Figure 4 This is an exemplary system architecture diagram in which embodiments of the present invention can be applied.

[0051] like Figure 4 As shown, system architecture 400 may include terminal devices 401, 402, and 403, a network 404, and a server 405. Network 404 serves as the medium for providing communication links between terminal devices 401, 402, and 403 and server 405. Network 404 may include various connection types, such as wired or wireless communication links, or fiber optic cables, etc.

[0052] Users can use terminal devices 401, 402, and 403 to interact with server 405 via network 404 to receive or send messages, etc. Various communication client applications can be installed on terminal devices 401, 402, and 403, such as delivery dispatch applications, etc. (for example only).

[0053] Terminal devices 401, 402, and 403 can be various electronic devices with displays that support web browsing, including but not limited to smartphones, tablets, laptops, and desktop computers.

[0054] Server 405 can be a server providing various services, such as a back-end management server (for example only) that supports delivery personnel provided by users using terminal devices 401, 402, and 403. Upon receiving a delivery personnel dispatch request, the back-end management server can obtain the scheduled delivery personnel for the delivery area and the predicted total number of orders to be delivered for that delivery area. If the delivery capacity of the scheduled delivery personnel does not meet the predicted total number of orders to be delivered, the server can search for dispatchable delivery personnel familiar with the delivery area and with spare delivery capacity from delivery personnel in neighboring areas of the delivery area. The server can then allocate the predicted remaining number of orders to be delivered beyond the capacity of the scheduled delivery personnel to the dispatchable delivery personnel, obtaining a dispatch result corresponding to the delivery personnel dispatch request, and so on. The server can then feed back the processing result (e.g., dispatch result – for example only) to the terminal device.

[0055] It should be noted that the deliveryman scheduling method provided in this embodiment of the invention is generally executed by server 405, and correspondingly, the deliveryman scheduling device is generally set in server 405.

[0056] It should be understood that Figure 4 The number of terminal devices, networks, and servers shown is merely illustrative. Depending on implementation needs, any number of terminal devices, networks, and servers can be included.

[0057] The following is for reference. Figure 5 It shows a schematic diagram of the structure of a computer system suitable for implementing terminal devices or servers of the present invention. Figure 5 The terminal device or server shown is merely an example and should not impose any limitation on the functionality and scope of use of the embodiments of the present invention.

[0058] like Figure 5 As shown, the computer system 500 includes a central processing unit (CPU) 501, which can perform various appropriate actions and processes based on programs stored in read-only memory (ROM) 502 or programs loaded from storage section 508 into random access memory (RAM) 503. The RAM 503 also stores various programs and data required for the operation of the system 500. The CPU 501, ROM 502, and RAM 503 are interconnected via a bus 504. An input / output (I / O) interface 505 is also connected to the bus 504.

[0059] The following components are connected to I / O interface 505: an input section 506 including a keyboard, mouse, etc.; an output section 507 including a cathode ray tube (CRT), liquid crystal display (LCD), etc., and speakers, etc.; a storage section 508 including a hard disk, etc.; and a communication section 509 including a network interface card such as a LAN card, modem, etc. The communication section 509 performs communication processing via a network such as the Internet. A drive 510 is also connected to I / O interface 505 as needed. A removable medium 511, such as a disk, optical disk, magneto-optical disk, semiconductor memory, etc., is installed on drive 510 as needed so that computer programs read from it can be installed into storage section 508 as needed.

[0060] In particular, according to the embodiments disclosed in this invention, the processes described above with reference to the flowcharts can be implemented as computer software programs. For example, embodiments disclosed in this invention include a computer program product comprising a computer program carried on a computer-readable medium, the computer program containing program code for performing the methods shown in the flowcharts. In such embodiments, the computer program can be downloaded and installed from a network via communication section 509, and / or installed from removable medium 511. When the computer program is executed by central processing unit (CPU) 501, it performs the functions defined above in the system of this invention.

[0061] It should be noted that the computer-readable medium shown in this invention can be a computer-readable signal medium or a computer-readable storage medium, or any combination of the two. A computer-readable storage medium can be, for example,—but not limited to—an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination thereof. More specific examples of a computer-readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer disk, a hard disk, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fiber, portable compact disk read-only memory (CD-ROM), optical storage device, magnetic storage device, or any suitable combination thereof. In this invention, a computer-readable storage medium can be any tangible medium containing or storing a program that can be used by or in conjunction with an instruction execution system, apparatus, or device. In this invention, a computer-readable signal medium can include a data signal propagated in baseband or as part of a carrier wave, carrying computer-readable program code. Such propagated data signals can take various forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination thereof. Computer-readable signal media can also be any computer-readable medium other than computer-readable storage media, which can send, propagate, or transmit a program for use by or in connection with an instruction execution system, apparatus, or device. The program code contained on the computer-readable medium can be transmitted using any suitable medium, including but not limited to: wireless, wire, optical fiber, RF, etc., or any suitable combination thereof.

[0062] 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 the present invention. In this regard, each block in a flowchart or block diagram may represent a module, segment, or portion of code containing one or more executable instructions for implementing a specified logical function. It should also be noted that 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 consecutively indicated 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 a block diagram or flowchart, and combinations of blocks in a block diagram or flowchart, may be implemented using a dedicated hardware-based system that performs the specified function or operation, or using a combination of dedicated hardware and computer instructions.

[0063] The units described in the embodiments of the present invention can be implemented in software or hardware. The described units can also be housed in a processor; for example, a processor can be described as including a delivery information acquisition module and a delivery personnel scheduling module.

[0064] In some cases, the names of these modules do not constitute a limitation on the module itself. For example, the delivery information acquisition module can also be described as "a module for acquiring the scheduled delivery personnel in the delivery area and the predicted total number of orders to be delivered in the delivery area in response to receiving a delivery personnel dispatch request".

[0065] On the other hand, the present invention also provides a computer-readable medium, which may be included in the device described in the embodiments or may exist independently without being assembled into the device. The computer-readable medium carries one or more programs that, when executed by the device, cause the device to: in response to receiving a delivery dispatch request, obtain the scheduled delivery personnel for a delivery route area and the predicted total number of orders to be delivered for the delivery route area; if the delivery capacity of the scheduled delivery personnel does not meet the predicted total number of orders to be delivered, find a dispatch delivery personnel familiar with the delivery route area and with spare delivery capacity from delivery personnel in neighboring routes of the delivery route area, and allocate the predicted remaining number of orders to be delivered beyond the delivery capacity of the scheduled delivery personnel to the dispatch delivery personnel, thereby obtaining a dispatch result corresponding to the delivery dispatch request.

[0066] The technical solution of the present invention has the following advantages or beneficial effects: by responding to a delivery dispatch request, obtaining the scheduled delivery personnel and the predicted total number of orders to be delivered in the delivery area; when the delivery capacity of the scheduled delivery personnel does not meet the predicted total number of orders to be delivered, finding a dispatched delivery personnel familiar with the delivery area and with spare delivery capacity from the delivery personnel in the adjacent areas of the delivery area, and allocating the predicted remaining number of orders to be delivered that exceeds the delivery capacity of the scheduled delivery personnel to the dispatched delivery personnel, thus obtaining the dispatch result corresponding to the delivery dispatch request, the technical solution realizes an automatic and intelligent delivery dispatch method, which not only saves manual dispatch but also ensures the rationality of dispatch, so as to provide timely and efficient delivery services.

[0067] The specific embodiments described herein do not constitute a limitation on the scope of protection of this invention. Those skilled in the art should understand that various modifications, combinations, sub-combinations, and substitutions can occur depending on design requirements and other factors. Any modifications, equivalent substitutions, and improvements made within the spirit and principles of this invention should be included within the scope of protection of this invention.

Claims

1. A method for dispatching delivery personnel, characterized in that, include: In response to receiving a delivery dispatch request, the system obtains the scheduled delivery personnel for the delivery route area and the predicted total number of orders to be delivered for the delivery route area. If the delivery capacity of the scheduled delivery personnel does not meet the predicted total number of orders to be delivered, a dispatched delivery personnel who are familiar with the delivery area and have spare delivery capacity are selected from the delivery personnel in the neighboring areas of the delivery area. The predicted remaining number of orders to be delivered that exceeds the delivery capacity of the scheduled delivery personnel is allocated to the dispatched delivery personnel to obtain the dispatch result corresponding to the dispatch request of the delivery personnel.

2. The method according to claim 1, characterized in that, The predicted total number of orders to be delivered in the delivery route area is composed of the predicted number of orders to be delivered for each interest area included in the delivery route area. From the delivery personnel in neighboring areas of the delivery route, select dispatch delivery personnel who are familiar with the delivery route and have spare delivery capacity, including: Determine the pending interest surface to which the predicted remaining pending orders belong when the predicted total number of orders to be delivered exceeds the delivery capacity of the scheduled delivery personnel. From the interest surfaces included in the neighboring areas of the delivery route area, or from the neighboring interest surfaces of the interest surface to be processed, the target interest surface that is closest to the interest surface to be processed is recursively searched. From the delivery personnel corresponding to the road area to which the target interest area belongs, determine the dispatch delivery personnel who are familiar with the interest area to be processed and have spare delivery capacity.

3. The method according to claim 2, characterized in that, Before recursively searching for the target interest surface closest to the object of interest from among the interest surfaces included in the neighboring areas of the delivery route area, or from among the neighboring interest surfaces of the object of interest to be processed, the method further includes: Obtain the road zone set of the delivery station, and determine the adjacent road zones of each road zone and the adjacent road zones of the adjacent road zones based on the fence information of each road zone in the road zone set, thereby obtaining the neighboring road zones of each road zone in the road zone set. Alternatively, obtain the interest face set of the delivery station, determine the adjacent interest face of each interest face and the adjacent interest face of the adjacent interest face based on the fence information of each interest face in the interest face set, and then obtain the neighboring interest face of each interest face in the interest face set.

4. The method according to claim 2, characterized in that, Before determining the dispatchable delivery personnel familiar with the target interest area and with sufficient delivery capacity from among the delivery personnel corresponding to the adjacent road areas to which the target interest area belongs, the method further includes: The system queries the historical delivery data of delivery personnel at a delivery station. Based on the historical delivery data and a preset threshold, it determines the delivery personnel's familiarity with each delivery route within the delivery station, and further determines the delivery personnel's familiarity with the areas of interest included in each delivery route.

5. The method according to claim 1, characterized in that, When the predicted remaining number of orders to be delivered exceeds the delivery capacity of the dispatched delivery personnel, the method further includes: The excess number of orders beyond the delivery capacity of the scheduled delivery personnel, which is part of the predicted remaining number of orders to be delivered, will be allocated to all other scheduled delivery personnel who are familiar with the delivery route area.

6. The method according to claim 2, characterized in that, The scheduling results include the scheduled delivery personnel and / or dispatched delivery personnel corresponding to the interest areas included in the delivery route area; the method further includes: In response to receiving a scheduling result query request, the system queries the scheduling result to find the interest area that the requester is responsible for, and classifies the interest area that the requester is responsible for into original responsibility interest areas and / or newly added responsibility interest areas based on the scheduled delivery personnel and / or dispatched delivery personnel corresponding to the interest area that the requester is responsible for in the scheduling result. According to preset display rules, the original responsibility interest surface and / or the newly added responsibility interest surface are displayed separately on the visualization map page.

7. A method for dispatching delivery personnel, characterized in that, include: Monitor the on-duty status of delivery personnel in the delivery route area and the actual total number of orders to be delivered in the delivery route area; If the delivery capacity of the on-duty delivery personnel does not meet the actual total number of orders to be delivered, the on-duty delivery personnel are used to replace the scheduled delivery personnel, and the actual total number of orders to be delivered is used to replace the predicted total number of orders to be delivered. The dispatched delivery personnel are then searched from the on-duty delivery personnel in the adjacent areas of the delivery area according to any of the methods described in claims 1 to 6, and the remaining number of orders to be delivered that exceeds the delivery capacity of the on-duty delivery personnel in the actual total number of orders to be delivered is allocated to the dispatched delivery personnel.

8. A dispatching device for delivery personnel, characterized in that, include: The delivery information acquisition module is used to respond to receiving a delivery dispatch request and acquire the scheduled delivery personnel for the delivery route area and the predicted total number of orders to be delivered for the delivery route area. The delivery dispatch module is used to, when the delivery capacity of the scheduled delivery personnel does not meet the predicted total number of orders to be delivered, find a dispatchable delivery personnel from the delivery personnel in the neighboring areas of the delivery area who are familiar with the delivery area and have spare delivery capacity, and allocate the predicted remaining number of orders to be delivered that exceeds the delivery capacity of the scheduled delivery personnel to the dispatchable delivery personnel, thereby obtaining a dispatch result corresponding to the delivery personnel dispatch request.

9. A mobile electronic device terminal, characterized in that, include: One or more processors; Storage device for storing one or more programs. When the one or more programs are executed by the one or more processors, the one or more processors implement the method as described in any one of claims 1-6.

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

Images