Work task route planning method and logistics management system
By splitting the task area on the electronic map and using the route planning function, couriers provide standardized task route planning, the problem of inefficiency in the existing technology is solved, and efficient task completion and logistics timeliness for couriers are achieved.
Patent Information
- Application Number
- CN202410940144.9
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-07-15
- Publication Date
- 2024-11-08
AI Technical Summary
The existing technology cannot effectively plan the courier's work task route, resulting in wasted time, inefficiency and delivery errors, and lack of standardized workflows, affecting logistics timeliness.
By displaying the pending order address on the electronic map in the form of a landing point, splitting the task area into a small area, selecting the starting point and end point, using the route planning function of the electronic map to plan the optimal route, and can be based on the courier's Real-time position and task priorities are adjusted.
A standardized and standardized work task route planning process is provided, which improves the work efficiency of couriers, reduces waste of time and energy, and ensures the planning of the optimal route and the accurate completion of tasks.
Smart Images

Figure CN118917756A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the technical field of logistics, and in particular to a work task route planning method and a logistics management system. Background Art
[0002] When delivering express parcels, couriers generally have two ways to deal with the work task routes: one is to determine the task order completely according to personal experience and subjective human judgment. This method will cause the work route to be circuitous, resulting in a waste of time and energy for couriers, and undoubtedly low work efficiency. The second is to use an external APP to plan the task route. South African couriers will use a local route planning APP to plan their work routes. However, since this is a third-party APP, it is impossible to automatically import order addresses in batches, so the courier needs to manually enter the address of each order into the APP, and the APP will then plan the task address. This way of working adds extra workload to the couriers. A single input address requires a lot of time and energy for the courier. There is also a deviation in the address input, which will cause the courier's work route to deviate or even deliver to the wrong place.
[0003] In addition to the above shortcomings, the above two processing methods have a common drawback: the courier's work route planning process cannot be standardized. Without a standardized and standardized work process, the courier's work efficiency cannot be guaranteed from a management perspective, which will affect the company's overall logistics timeliness.
[0004] Therefore, how to plan the best work task route for couriers is a concern for managers in this field. Summary of the invention
[0005] The purpose of the present invention is to propose a work task route planning method and a logistics management system, which can plan the optimal work task route for couriers.
[0006] In order to achieve the above-mentioned object, the present invention provides a method for planning a work task route, comprising: displaying the address of an order to be processed in the form of a drop point on an electronic map;
[0007] On the electronic map, divide the area covered by the day's mission into multiple small areas;
[0008] For the first small area, select the starting point and the end point; for the next small area, select the end point and use the end point of the previous small area as the starting point of this small area; then use the route planning function of the electronic map to plan the work route for the day's task;
[0009] The courier delivers / picks up parcels according to the planned work route.
[0010] In an optional solution, the method of dividing the area covered by the day's tasks into multiple small areas includes: drawing multiple non-overlapping closed areas on an electronic map, each closed area being a small area, and the number of orders in each small area is not greater than a set value.
[0011] In the optional scheme, for the first small area, the method of selecting the starting point and the end point includes: the electronic map automatically calculates the point geographically closest to the courier according to the courier's real-time location as the starting point of the route for the first small area, and the end point is selected and confirmed by the courier.
[0012] In the optional scheme, multiple small areas are sorted by default in the order of creation. According to the sorted order, the end point of each small area is selected in turn, and the work route for the day's task is planned.
[0013] In the optional plan, the courier adjusts the default order, selects the end points of each small area in turn according to the new order, and plans the work route for the day's tasks.
[0014] In an optional solution, for a temporarily added pickup task, the newly added pickup task is inserted into the existing work route; or, the work route is replanned.
[0015] In an optional solution, the method of displaying the address of the order to be processed in the form of a drop point on an electronic map includes: through a Google map interface, transmitting the order address information to the Google map background to capture the location, so as to display the order address on the Google map in a preset style.
[0016] The present invention also provides a logistics management system, comprising:
[0017] A display module, the display module is used to display the address of the order to be processed on the electronic map in the form of a landing point;
[0018] A partitioning module, which is used to divide the area covered by the task of the day into multiple small areas on the electronic map according to the operation of the courier;
[0019] The sorting module is used to select the starting point and the end point for the first small area; select the end point for the next small area, and use the end point of the previous small area as the starting point of this small area; and then use the route planning function of the electronic map to plan the work route for the day's task.
[0020] The beneficial effects of the present invention are:
[0021] The present invention provides a set of standardized and normalized work task route planning processes for couriers. The task route provided is the optimal route for couriers. Couriers can freely plan the task route, and the task route planning process is easy to operate for couriers, saving time and effort. BRIEF DESCRIPTION OF THE DRAWINGS
[0022] The above and other objects, features and advantages of the present invention will become more apparent through a more detailed description of exemplary embodiments of the present invention in conjunction with the accompanying drawings, in which like reference numerals generally represent like components.
[0023] Figure 1 The figure is a flow chart of a method for planning a work task route in one embodiment of the present invention.
[0024] Figure 2 Draw a functional interface for a logistics management system in one embodiment of the present invention.
[0025] Figure 3 This is an interface diagram after a small area is drawn in a logistics management system in one embodiment of the present invention. DETAILED DESCRIPTION
[0026] The present invention is further described in detail below in conjunction with the accompanying drawings and specific embodiments. According to the following description and drawings, the advantages and features of the present invention will become clearer. However, it should be noted that the concept of the technical solution of the present invention can be implemented in a variety of different forms and is not limited to the specific embodiments described herein. The drawings are all in a very simplified form and are not in precise proportions, and are only used to conveniently and clearly assist in explaining the purpose of the embodiments of the present invention.
[0027] It should be understood that when an element or layer is referred to as being "on, adjacent to, connected to or coupled to other elements or layers, it may be directly on, adjacent to, connected to or coupled to other elements or layers, or there may be intervening elements or layers. In contrast, when an element is referred to as being "directly on, directly adjacent to, directly connected to or directly coupled to other elements or layers, there may be no intervening elements or layers. It should be understood that, although the terms first, second, third, etc. may be used to describe various elements, components, regions, layers and / or parts, these elements, components, regions, layers and / or parts should not be limited by these terms. These terms are only used to distinguish one element, component, region, layer or part from another element, component, region, layer or part. Therefore, without departing from the teachings of the present invention, the first element, component, region, layer or part discussed below may be represented as a second element, component, region, layer or part.
[0028] Spatially relative terms such as "under," "below," "below," "under," "above," "above," etc., may be used herein for ease of description to describe the relationship of an element or feature shown in the figures to other elements or features. It should be understood that in addition to the orientations shown in the figures, the spatially relative terms are intended to include different orientations of the device in use and operation. For example, if the device in the accompanying drawings is flipped, then the elements or features described as "under other elements" or "under" or "under" will be oriented as "on" the other elements or features. Therefore, the exemplary terms "under" and "under" may include both upper and lower orientations. The device may be oriented otherwise (rotated 90 degrees or other orientations) and the spatial descriptors used herein are interpreted accordingly.
[0029] The purpose of the terms used herein is only to describe specific embodiments and is not intended to be limiting of the present invention. When used herein, the singular forms "one", "an" and "said / the" are also intended to include plural forms, unless the context clearly indicates otherwise. It should also be understood that the terms "consisting of" and / or "comprising", when used in this specification, determine the presence of the features, integers, steps, operations, elements and / or parts, but do not exclude the presence or addition of one or more other features, integers, steps, operations, elements, parts and / or groups. When used herein, the term "and / or" includes any and all combinations of the relevant listed items.
[0030] Example 1
[0031] Reference Figure 1 , this embodiment provides a method for planning a work task route, including:
[0032] Before delivery / pickup, the address of the order to be processed is displayed on the electronic map in the form of a drop point;
[0033] The courier divides the area covered by the day's mission into multiple small areas on the electronic map;
[0034] For the first small area, select the starting point and the end point; for the next small area, select the end point and use the end point of the previous small area as the starting point of this small area; then use the route planning function of the electronic map to plan the work route for the day's task;
[0035] The courier delivers / picks up parcels according to the planned work route.
[0036] Specifically, this embodiment realizes the transmission of order address information through the interface between Google Maps and the logistics management system, and displays the address in the form of a drop point on Google Maps. With the help of the route planning function of Google Maps, it provides suggestions for the courier's daily work route planning. The work route refers to the order of processing orders, not the courier's path.
[0037] Google Maps' route planning function can only plan the best route between 25 addresses at a time, while couriers have about 70 tasks per day, so a certain method is needed to split the total number of tasks to meet the quantity requirements of Google Maps' route planning function. According to technicians' tests and probability calculations, the fewer the addresses, the more reasonable the routes that Google Maps can provide.
[0038] The route planning provided by Google Maps serves the work needs of couriers, but the routes designed by Google Maps only stay at the data analysis level and cannot solve the specific needs of couriers in actual work scenarios. For example, some delivery or pickup tasks are more urgent and need to be prioritized. For example, high-risk incidents have occurred in certain areas and they need to be prioritized like the back row, etc. The handling of these situations is beyond the reach of Google Maps' route planning. Therefore, this embodiment introduces a method of manually pre-dividing work task areas to adjust the priority between small areas according to changes in actual work scenarios. If the number of orders is 70, the processing order of 70 orders is planned.
[0039] The premise for Google Maps to plan task routes for a certain number of addresses is to determine the starting point and the end point. Once the starting point and the end point are determined, Google Maps can plan the order of task execution for the intermediate addresses.
[0040] For the first small area of the daily task, Graph 1, the starting point is the point in Graph 1 that is closest to the courier's real-time location, and the end point is a point in Graph 1 that the courier selects and confirms as the end point.
[0041] For other Graph n+1 (n>=1), the starting point is the end point of Graph n, and the end point is selected by the courier to confirm a point in Graph n+1 as the end point. Graph n and Graph n+1 are also connected by setting the end point of Graph n as the starting point of Graph n+1.
[0042] In this embodiment, the multiple small areas are sorted by default in the order of creation, and the end points of each small area are selected in turn according to the sorted order to plan the work route for the day's task. In another embodiment, the courier adjusts the default sorting order of the small areas, and selects the end points of each small area in turn according to the new order to plan the work route for the day's task.
[0043] By default, the order between small areas (graphs) is arranged in the order of graph creation, but the order between graphs can be adjusted by moving them. The change of the order between graphs will inevitably affect the overall route planning. Because as mentioned before, the starting point of graph n+1 is determined by the end point of graph n, so the route planning within the graph will change with the adjustment of the order between graphs.
[0044] In this embodiment, the method for displaying the address of the order to be processed in the form of a drop point on the electronic map includes: through the Google Map interface, the order address information is transmitted to the Google Map background to capture the location, so as to display the order address on the Google Map in a preset style.
[0045] In this embodiment, the method of dividing the area covered by the daily task into multiple small areas includes: drawing multiple non-overlapping closed areas on Google Maps, each closed area is a small area, and the number of orders in each small area is not greater than a set value (such as 24). Google Maps is a more authoritative and more complete map, so Google Maps is selected. Since Google Maps can only analyze the optimal route between 25 addresses at a time, the number of orders in each small area is not greater than 24.
[0046] The courier's tasks are divided into two types: pickup and delivery. The courier's daily delivery task is fixed when he leaves the warehouse every morning, and no new delivery tasks will be added during the work process. However, it is common to add temporary pickup tasks. Temporary pickup tasks are specified on the Task page, and [New] is marked in the upper left to indicate that the task is a new task that has not yet been planned. If the courier does not handle this new pickup task, this task will always be in the top reminder position. If the courier wants to arrange the priority of this order, he can do the following: 1. Drag the task directly on the Task page to adjust the task order. 2. Re-enter the Task Map page to draw and sort all tasks.
[0047] In this embodiment, for the first small area, the method for selecting the starting point and the end point includes: Google Maps automatically calculates the point geographically closest to the courier based on the courier's real-time location as the starting point of the route for the first small area, and the end point is selected and confirmed by the courier.
[0048] The present invention provides a set of standardized and normalized work task route planning processes for couriers. The task route provided is the optimal route for couriers. Couriers can freely plan the task route, and the task route planning process is easy to operate for couriers, saving time and effort.
[0049] Example 2
[0050] This embodiment provides a logistics management system, including:
[0051] A display module, the display module is used to display the address of the order to be processed on the electronic map in the form of a landing point;
[0052] A partitioning module, which is used to divide the area covered by the task of the day into multiple small areas (named as Graph n) on the electronic map according to the operation of the courier;
[0053] The sorting module is used to select the starting point and the end point for the first small area; select the end point for the next small area, and use the end point of the previous small area as the starting point of this small area; and then use the route planning function of the electronic map to plan the work route for the day's task.
[0054] Specifically, the partitioning module implements the drawing function on Google Maps. By drawing a closed area, the points inside the area are divided into multiple different small areas (Graph), thereby realizing the pre-splitting of large-scale tasks.
[0055] The small area to be drawn must meet the following three logics at the same time to be drawn successfully: the number of landing points in the small area should be greater than 0 and less than or equal to 24; there is a certain landing point in the small area as the end point; the small area cannot overlap with other small areas.
[0056] Different graphs are connected by using the end point of the previous graph as the starting point of the next graph, so that route planning for large quantities of tasks can be achieved.
[0057] The courier can see his daily work tasks on the [Task] page. Before starting work every day, the courier gets the initial [Task] task page, and the task order is arranged according to the order of the system dispatch time. Therefore, this arrangement order does not take into account any rationality of task planning. In this embodiment, the [Task Map] function in the upper right corner of the [Task] page plans the courier's daily task to complete the courier task route.
[0058]
Task
[0059] Use the drawing function to split the order into multiple small areas and name the small areas with Graph n.
[0060] Through Figure 2 The page guides you to enter the drawing function. After entering the drawing function, the map freezes and you can no longer zoom in or out.
[0061] After drawing, the area is Figure 3 As shown, the color of the small area changes. You need to determine a point in the graph as the end point and then confirm this operation. This confirmation is to confirm the selection of the end point.
[0062] We use the route planning function provided by Google Maps to plan the optimal task route, but Google Maps Figure 1 The route planning can only process 25 addresses at most, so we set the maximum number of addresses to be drawn to 24. To plan the optimal route on Google Maps, we need to provide the starting point and end point of the route. The following are the logical rules for confirming the starting point and end point in different situations.
[0063] a. Task planning within a single Graph
[0064] For the drop points in Graph 1, Google Maps automatically calculates the point closest to the courier based on the courier's real-time location as the starting point of the route in Graph 1. The end point is selected and confirmed by the courier. With the starting point and the end point, the optimal route between the intermediate task points is provided by the Google function.
[0065] For the drop points in Graph n+1 (n>=1), the starting point is the end point of the previous Graph n. The courier selects a confirmed point in Graph n+1 as the end point of this graph. Now that the end point and the starting point are known, the optimal route between the intermediate task points is provided by the Google function.
[0066] b. Task planning between two or more graphs
[0067] The initial order of graphs is determined by the order in which the graphs are created. By default, they are sorted in the order of 1, 2, 3, etc.
[0068] The courier can also adjust the order of the graphs by dragging them up and down. The movement of the graph order will inevitably affect the order of the entire task list, because as mentioned earlier, the starting point of Graph n+1 is determined by the end point of Graph n, so the route planning within the graph will change with the adjustment of the order of the graphs.
[0069] The order of the delivery tasks will be updated synchronously on the map page and the task list page after the courier presses the confirmation button. On the map page, the order of the delivery tasks is indicated by the numbers on the drop points; on the task list page, the delivery tasks are arranged in order.
[0070] Once you press the Confirm button according to the above process, the route planning is completed and the Graph information will not be retained. If you need to re-plan, you need to create a new Graph and plan again.
[0071] The above description is only a description of the preferred embodiments of the present invention, and is not intended to limit the scope of the present invention. Any changes or modifications made by a person skilled in the art in the field of the present invention based on the above disclosure shall fall within the scope of protection of the claims.
Claims
1. A method for planning a work task route, It is characterized in that include: Display the address of pending orders on an electronic map in the form of drop points; On the electronic map, divide the area covered by the day's mission into multiple small areas; For the first small area, select the starting point and the end point; For the next small area, select the end point and use the end point of the previous small area as the starting point of this small area; Then use the route planning function of the electronic map to plan the work route for the day's tasks; The courier delivers / picks up parcels according to the planned work route.
2. The method for batch assigning orders to couriers as claimed in claim 1, It is characterized in that The method of dividing the area covered by the day's tasks into multiple small areas includes: drawing multiple non-overlapping closed areas on an electronic map, each closed area is regarded as a small area, and the number of orders in each small area is not greater than a set value.
3. The method for batch assigning orders to couriers as claimed in claim 1, It is characterized in that For the first small area, the methods for selecting the starting point and the end point include: Based on the courier’s real-time location, the electronic map automatically calculates the point geographically closest to the courier as the starting point of the route for the first small area, and the end point is selected and confirmed by the courier.
4. The method for batch assigning orders to couriers as claimed in claim 1, It is characterized in that By default, multiple small areas are sorted in the order of creation. According to the sorted order, the end point of each small area is selected in turn, and the work route for the day's tasks is planned.
5. The method for batch assigning orders to couriers as claimed in claim 4, It is characterized in that The method further includes: the courier adjusts the default sequence, selects the end points of each small area in turn according to the new sequence, and plans the work route for the day's task.
6. The method for batch assigning orders to couriers as claimed in claim 1, It is characterized in that For a temporarily added pickup task, the newly added pickup task is inserted into the existing work route; or, the work route is replanned.
7. The method for batch assigning orders to couriers as claimed in claim 1, It is characterized in that The method of displaying the address of the order to be processed on the electronic map in the form of a drop point includes: Through the Google Map interface, the order address information is transmitted to the Google Map backend for location capture, so that the order address can be displayed on the Google Map in a preset style.
8. A logistics management system, It is characterized in that include: A display module, the display module is used to display the address of the order to be processed on the electronic map in the form of a landing point; A partitioning module, which is used to divide the area covered by the task of the day into multiple small areas on the electronic map according to the operation of the courier; The sorting module is used to select the starting point and the end point for the first small area; select the end point for the next small area, and use the end point of the previous small area as the starting point of this small area; and then use the route planning function of the electronic map to plan the work route for the day's task.
