Postal route determination method, apparatus, device, and medium

Abstract

The application discloses a mail route determination method and device, equipment and medium, wherein the method comprises: obtaining original mail route transportation data corresponding to a target area; updating the original mail route transportation data according to a pre-set time limit optimization target and a cost optimization target to obtain a preliminary mail route scheme; determining a mail route adjustment mode corresponding to the preliminary mail route scheme according to the number of passing points in each group of mail route data in the preliminary mail route scheme, and updating the corresponding mail route data based on the mail route adjustment mode to obtain target mail route data corresponding to the target area. The technical scheme of the embodiment of the application realizes the effect of dynamically adjusting the original distribution path with the lowest transportation cost as the target while ensuring the stability of the time limit, so that the target mail route data obtained after the adjustment can achieve the effect of improving the transportation efficiency under the premise of reducing the transportation cost.

Description

Technical Field

[0001] This invention relates to the field of data processing technology, and in particular to a method, apparatus, electronic device, and storage medium for determining mail routes. Background Technology

[0002] With the rise of new technologies and the increasing demands for high-quality services from users, the logistics industry faces increasingly complex logistics and transportation scenarios, including daily operations, e-commerce promotions, and natural disasters. Maximizing transportation efficiency and ensuring timely service has always been a key focus for the industry.

[0003] Existing techniques generally treat postal route planning problems as single-start, single-endpoint path planning problems, using the straight-line distances between transport nodes to establish constraints and optimization objectives. Traditional path planning models are used to solve these problems, such as breadth-first search and Dijkstra's algorithm.

[0004] In reality, delivery tasks are typically route planning problems involving a single origin and multiple destinations or multiple origins and a single destination, and the transportation routes are usually not linear. Furthermore, current technologies cannot solve postal route planning problems with large data volumes and complex constraints. Summary of the Invention

[0005] This invention provides a method, apparatus, electronic device, and storage medium for determining postal routes, so as to achieve the effect of dynamically adjusting the original delivery route while ensuring stable delivery time and minimizing transportation costs, so that the adjusted target postal route data can improve transportation efficiency while reducing transportation costs.

[0006] According to one aspect of the present invention, a method for determining a postal route is provided, the method comprising: acquiring original postal route transportation data corresponding to a target area; wherein the original postal route transportation data includes an original delivery route, each waypoint located on the original delivery route, and a corresponding delivery time threshold;

[0007] The original postal route transportation data is updated according to the pre-set time limit optimization target and cost optimization target to obtain a preliminary postal route plan; wherein, the preliminary postal route plan includes at least one set of updated postal route data and corresponding transportation costs;

[0008] Based on the number of transit points in each group of postal route data in the preliminary postal route plan, a postal route adjustment method corresponding to the preliminary postal route plan is determined. The corresponding postal route data is then updated based on the postal route adjustment method to obtain target postal route data corresponding to the target area.

[0009] According to another aspect of the present invention, a postal route determination device is provided, the device comprising:

[0010] The original postal route transportation data acquisition module is used to acquire the original postal route transportation data corresponding to the target area; wherein, the original postal route transportation data includes the original delivery route, each waypoint located on the original delivery route, and the corresponding delivery time threshold;

[0011] The original postal route transportation data update module is used to update the original postal route transportation data according to the preset time limit optimization target and cost optimization target to obtain a preliminary postal route plan; wherein, the preliminary postal route plan includes at least one set of updated postal route data and corresponding transportation costs;

[0012] The postal route adjustment method determination module is used to determine the postal route adjustment method corresponding to the preliminary postal route plan based on the number of transit points in each group of postal route data, so as to update the corresponding postal route data based on the postal route adjustment method and obtain the target postal route data corresponding to the target area.

[0013] According to another aspect of the present invention, an electronic device is provided, the electronic device comprising:

[0014] At least one processor; and

[0015] A memory communicatively connected to the at least one processor; wherein,

[0016] The memory stores a computer program that can be executed by the at least one processor, the computer program being executed by the at least one processor to enable the at least one processor to perform the route determination method according to any embodiment of the present invention.

[0017] According to another aspect of the present invention, a computer-readable storage medium is provided, the computer-readable storage medium storing computer instructions for causing a processor to execute and implement the route determination method according to any embodiment of the present invention.

[0018] The technical solution of this invention obtains the original postal route transportation data corresponding to the target area, then updates the original postal route transportation data according to the preset time limit optimization target and cost optimization target to obtain a preliminary postal route plan. Finally, based on the number of transit points in each group of postal route data in the preliminary postal route plan, the corresponding postal route adjustment method is determined, and the corresponding postal route data is updated based on the postal route adjustment method to obtain the target postal route data corresponding to the target area. This solves the problem of postal route planning with large data volume and complex constraints that cannot be handled in the prior art. It achieves the effect of dynamically adjusting the original delivery route with the goal of minimizing transportation costs while ensuring stable time limits, so that the target postal route data obtained after adjustment can achieve the effect of improving transportation efficiency while reducing transportation costs.

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

[0020] To more clearly illustrate the technical solutions in the embodiments of the present invention, the accompanying drawings used in the description of the embodiments will be briefly introduced below. Obviously, the accompanying drawings described below are only some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0021] Figure 1 This is a flowchart of a method for determining a mail route according to Embodiment 1 of the present invention;

[0022] Figure 2 This is a schematic diagram of a postal route determination device according to Embodiment 2 of the present invention;

[0023] Figure 3 This is a schematic diagram of the structure of an electronic device that implements the route determination method of this invention. Detailed Implementation

[0024] To enable those skilled in the art to better understand the present invention, the technical solutions of the present invention will be clearly and completely described below with reference to the accompanying drawings of the embodiments of the present invention. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort should fall within the scope of protection of the present invention.

[0025] It should be noted that the terms "first," "second," etc., in the specification, claims, and accompanying drawings of this invention are used to distinguish similar objects and are not necessarily used to describe a specific order or sequence. It should be understood that such data can be interchanged where appropriate so that the embodiments of the invention described herein can be implemented in orders other than those illustrated or described herein. Furthermore, the terms "comprising" and "having," and any variations thereof, are intended to cover a non-exclusive inclusion; for example, a process, method, system, product, or apparatus that comprises a series of steps or units is not necessarily limited to those steps or units explicitly listed, but may include other steps or units not explicitly listed or inherent to such processes, methods, products, or apparatus.

[0026] Example 1

[0027] Figure 1 This is a flowchart of a route determination method provided in Embodiment 1 of the present invention. This embodiment is applicable to the rational planning of delivery routes with a single starting point and multiple ending points or multiple starting points and a single ending point. The method can be executed by a route determination device, which can be implemented in hardware and / or software, and can be configured in a terminal and / or server. Figure 1 As shown, the method includes:

[0028] S110. Obtain the original postal route transportation data corresponding to the target area.

[0029] In this embodiment, the target area can be any area requiring postal route planning. For example, the target area can be a province, city, or county. The original postal route transportation data can be data stored in the postal route transportation system of the target area. Optionally, the original postal route transportation data includes the original delivery route, each waypoint along the original delivery route, and corresponding delivery time thresholds. The original delivery route can be an existing postal route transportation network stored in the postal route transportation system. Waypoints can be other nodes on the original delivery route besides the origin and delivery points. The delivery time thresholds can be the maximum and minimum values ​​of the origin and arrival times. The maximum value can be the latest possible origin or arrival time; the minimum value can be the earliest possible origin or arrival time. It should be noted that the original postal route transportation data may also include geographical location information of each node in the postal route transportation network of the target area and loading information during the delivery process.

[0030] In practical applications, before replanning and updating the postal route transportation network of the target area, the original postal route transportation data corresponding to the target area can be obtained first. This allows for the analysis of the original postal route transportation data and subsequent updates to the existing postal route network.

[0031] S120. Update the original postal route transportation data according to the preset time limit optimization target and cost optimization target to obtain a preliminary postal route plan.

[0032] In this embodiment, the time-limit optimization objective can be a desired outcome regarding transportation time. For example, the time-limit optimization objective could be to minimize transportation time. The cost optimization objective can be a desired outcome regarding transportation cost. For example, the cost optimization objective could be to minimize transportation cost. The preliminary postal route plan can be a preliminarily determined postal route transportation plan. The preliminary postal route plan includes at least one set of updated postal route data and corresponding transportation costs. The updated postal route data can be updated delivery routes and transportation time information associated with each delivery route. The transportation cost can be the sum of all expenses incurred in completing passenger and freight transportation.

[0033] In practical applications, logistics transportation involves different types and specifications of transport objects, such as time-sensitive goods, e-commerce goods, and cold chain transportation. When replanning the original delivery route, it is necessary to consider issues such as postal route connection, time limit requirements, and vehicle-cargo matching. Therefore, multi-objective optimization algorithms can be used to process the original postal route transportation data to obtain a preliminary postal route plan.

[0034] Optionally, the original postal route transportation data is updated according to pre-set time limit optimization objectives and cost optimization objectives to obtain a preliminary postal route plan, including: processing at least one piece of postal route transportation data sequentially based on at least one local search algorithm to obtain at least one delivery route to be planned, and the postal route transportation attributes corresponding to each delivery route to be planned; processing at least one delivery route to be planned and the corresponding postal route transportation attributes based on a global search algorithm, time limit optimization objectives, and cost optimization objectives to obtain a preliminary postal route plan.

[0035] In this embodiment, the local search algorithm is a heuristic algorithm for solving optimization problems. Its basic principle is to iterate through nearby solutions, gradually optimizing the objective function until it can no longer be optimized. Optionally, the local search algorithm may include, but is not limited to, the 3-OPT algorithm, simulated annealing algorithm, MJ insertion method, and hill climbing algorithm. The delivery route to be planned can be a route that has been initially replanned based on the original delivery route. The postal route transportation attributes can be information used to characterize various transportation parameters associated with postal route transportation. Postal route transportation attributes may include transportation time, transportation cost, departure time, and arrival time. The global search algorithm can be an algorithm that searches the entire feasible set to find the minimum point. Optionally, the global search algorithm may include, but is not limited to, particle swarm optimization, ant colony optimization, and genetic algorithm.

[0036] In practice, after obtaining the original postal route transportation data, the original postal route transportation data can be processed according to at least one local search algorithm, and at least one delivery route to be planned and the corresponding postal route transportation attributes can be output. Furthermore, according to the global search algorithm, on the basis of simultaneously satisfying the time limit optimization objective and the cost optimization objective, at least one delivery route to be planned and the corresponding postal route transportation attributes can be processed, thereby obtaining a preliminary postal route plan.

[0037] In practical applications, when processing the original postal route transportation data based on at least one local search algorithm, different data in the original postal route transportation data can be processed sequentially according to the different local search areas corresponding to each local search algorithm, so as to obtain at least one delivery route to be planned, and the postal route transportation attributes corresponding to each delivery route to be planned.

[0038] Optionally, the original postal route transportation data is processed sequentially based on at least one local search algorithm to obtain at least one delivery route to be planned, and postal route transportation attributes corresponding to each of the delivery routes to be planned, including: processing the original postal route transportation data based on a first local search algorithm to obtain a start time stamp threshold corresponding to the original delivery route; processing the start time stamp threshold corresponding to the original delivery route based on a second local search algorithm to obtain at least one delivery route to be planned; and processing the at least one delivery route to be planned based on a third local algorithm to obtain the transportation cost corresponding to the at least one delivery route to be planned.

[0039] In this embodiment, the first local search algorithm can be the 3-OPT algorithm, which can internally optimize each original delivery route through three types of arc exchanges. The start time stamp threshold can be the maximum and minimum values ​​of the start time, i.e., the earliest start time and the latest start time. The second local search algorithm can be the simulated annealing algorithm. The third local search algorithm can be the MJ insertion method, which is a cost-saving method that minimizes the cost with each insertion.

[0040] In practical implementation, the original postal route transportation data is first processed using a first local search algorithm. Under the conditions of postal route connectivity, time limit requirements, and vehicle-cargo matching, each original delivery route is internally optimized to determine the maximum and minimum values ​​of the start timestamp corresponding to each original delivery route. Then, the maximum and minimum values ​​of the start timestamp corresponding to each original delivery route are processed using a second local search algorithm to determine the optimal solution from these data, and to determine the maximum or minimum value of the delivery timestamp corresponding to each original delivery route. Based on the determined maximum or minimum values, the corresponding original delivery routes are adjusted to obtain at least one delivery route to be planned. Finally, the at least one delivery route to be planned is processed using a third local search algorithm to obtain the transportation cost corresponding to each delivery route to be planned.

[0041] Furthermore, based on the global search algorithm, at least one delivery route to be planned and its corresponding postal route transportation attributes are processed. After encoding, decoding, fitness calculation, selection operation, crossover operation and mutation operation, a preliminary postal route plan is finally output.

[0042] S130. Based on the number of transit points in each group of postal route data in the preliminary postal route plan, determine the postal route adjustment method corresponding to the preliminary postal route plan, and update the corresponding postal route data based on the postal route adjustment method to obtain the target postal route data corresponding to the target area.

[0043] In this embodiment, the number of routes passing through a point refers to the number of postal routes required to pass through that point. For example, if there is one point, the corresponding number of routes can be two; if there are two points, the corresponding number of routes can be three. Postal route adjustment methods can include a first postal route adjustment method and a second postal route adjustment method. Target postal route data can be the postal route planning results corresponding to the target area. The target postal route data can include the replanned delivery route, delivery time, delivery cost, and the number and specific geographical locations of points along the replanned delivery route.

[0044] In practical applications, after obtaining the initial postal route plan, different postal route adjustment methods can be adopted for different numbers of transit points in each set of postal route data, and the postal route data can be processed based on the corresponding postal route adjustment methods to obtain the target postal route data.

[0045] Optionally, based on the number of transit points in each group of transit points in the preliminary transit plan, a transit adjustment method corresponding to the preliminary transit plan is determined, including: if the number of transit points in each group of transit points is less than a preset threshold, the transit adjustment method is determined as the first transit adjustment method; if the number of transit points in each group of transit points is equal to the preset threshold, the transit adjustment method is determined as the second transit adjustment method.

[0046] In this embodiment, the preset threshold can be a pre-set value used to limit the number of waypoints on each path. The preset threshold can be any value; optionally, it can be 3. When the number of waypoints is 3, it means that there are 2 waypoints on this path. The first route adjustment method can be a route adjustment method implemented based on a global search algorithm. The second route adjustment method can be a route adjustment method implemented based on a heuristic search algorithm.

[0047] In practice, after obtaining the preliminary postal route plan, for each set of postal route data in the preliminary postal route plan, the number of paths through the current postal route data can be determined. Based on this number of paths, the corresponding postal route adjustment method can be determined. If the number of paths is less than a preset threshold, the postal route adjustment method can be determined as the first postal route adjustment method based on a global search algorithm. If the number of paths is equal to the preset threshold, the postal route adjustment method can be determined as the second postal route adjustment method based on a heuristic search algorithm.

[0048] In practical applications, different postal route adjustment methods correspond to different postal route data processing methods. The following will provide a detailed explanation of these two postal route adjustment methods.

[0049] Optionally, when the postal route adjustment method is the first postal route adjustment method, the corresponding postal route data is updated based on the postal route adjustment method to obtain target postal route data corresponding to the target area, including: for each delivery route to be planned, determining a first waypoint display list and a second waypoint display list corresponding to the current delivery route to be planned; traversing each waypoint in each first waypoint display list, or traversing each waypoint in each second waypoint display list, to determine at least one delivery route to be processed; and processing each delivery route to be processed based on the initialization constraints to determine the target postal route data.

[0050] In this embodiment, the first waypoint display list can be a list determined based on the origin and a corresponding preset radius, including at least one waypoint. The second waypoint display list can be a list determined based on the delivery destination and a corresponding preset radius, including at least one waypoint. It should be noted that for each delivery route to be planned, a corresponding first waypoint display list and second waypoint display list can be matched. The initialization constraints can be pre-set restrictions during the route adjustment process. For example, the initialization constraints may include the actual distance of the adjusted delivery route increasing by no more than a set value relative to the original delivery route, the maximum number of routes on the return trip not exceeding a set value, the maximum empty-run rate during the round trip not exceeding a set value, and the maximum difference in the vehicle's rated load when traversing two routes not exceeding a set value, etc.

[0051] In practical applications, when the postal route adjustment method is the first method, a global search algorithm can be used to process each set of postal route data. Specifically, since the number of waypoints in each set of postal route data is less than a preset threshold, it can be determined that the number of corresponding waypoints is also less than the corresponding preset threshold. In this case, waypoints can be directly searched within the preset range corresponding to the origin and the preset range corresponding to the delivery destination to ensure that the final delivery route is the optimal solution. The determination methods for the first and second waypoint display lists are explained in detail below.

[0052] Optionally, for each delivery route to be planned, a first waypoint display list and a second route point display list corresponding to the current delivery route to be planned are determined, including: determining the location information of the starting point and the location information of the delivery point of the delivery route to be planned; determining a first search area with the starting point as the center and a first preset distance as the radius, and determining a first waypoint display list based on at least one first route point to be selected contained in the first search area; determining a second search area with the delivery point as the center and a second preset distance as the radius, and determining a second route point display list based on at least one second route point to be selected contained in the second search area.

[0053] In this embodiment, the originating point can be the starting point of the planned delivery route. The delivery point can be the ending point of the planned delivery route. The first preset distance can be any value, optionally 100 kilometers. The first search area can be the search area of ​​waypoints adjacent to the originating point. The second preset distance can be any value, optionally 100 kilometers. The second search area can be the search area of ​​waypoints adjacent to the delivery point.

[0054] In practical implementation, for each delivery route to be planned, the geographical location information of the origin and delivery points associated with the current delivery route can be determined first. Then, a search area is constructed with the origin as the center and a first preset distance as the radius. This search area can be used as the first search area. Mail processing nodes are searched within this search area, and at least one candidate route point is determined from each mail processing node. Based on each candidate route point, a first route point display list is determined. Simultaneously, a search area is constructed with the delivery point as the center and a second preset distance as the radius. This search area can be used as the second search area. Mail processing nodes are searched within this search area, and at least one candidate route point is determined from each mail processing node. Based on each candidate route point, a second route point display list is determined.

[0055] It should be noted that there are at least two situations where the number of paths at a point of interest is less than the preset threshold. These two situations will be explained in detail below.

[0056] One scenario is that after delivering the goods from the origin to the delivery point, it is necessary to return to the origin to perform the next delivery task. During the return trip, the delivery vehicle may be in an empty state. In this case, if it is not possible to return directly to the origin, it is necessary to search for a suitable waypoint in the area around the delivery point so that after driving empty from the delivery point to the waypoint, it can return to the origin from the waypoint.

[0057] In specific implementation, when the second waypoint display list is obtained, each waypoint in the second waypoint display list can be traversed to obtain at least one delivery route to be processed. Furthermore, when it is detected that the delivery route to be processed meets the initialization constraint conditions, the delivery route to be processed is output and used as the target postal route data.

[0058] For example, if the originating point is city A, the delivery point is city B, and the transit point adjacent to city B is city C, the corresponding delivery route to be processed can be: transport the delivery object from city A to city B, then drive empty from city B to city C, and then drive empty from city C to city A.

[0059] Another scenario is that if it is not possible to return directly to the origin point, a route point that meets the conditions can be searched in the area around the origin point. This allows the delivery point to travel empty from the delivery point to a route point adjacent to the origin point, and then travel empty from that route point back to the origin point, thus completing the delivery task.

[0060] In specific implementation, after obtaining the first waypoint display list and the second waypoint display list, each waypoint in the first waypoint display list and each waypoint in the second waypoint display list can be traversed to determine at least one delivery route to be processed. Furthermore, when it is detected that the delivery route to be processed meets the initialization constraint conditions, the delivery route to be processed is output and used as the target postal route data.

[0061] For example, if the origin is city A, the delivery point is city B, and the transit point adjacent to city A is city D, the corresponding delivery route to be processed can be: transport the delivery object from city A to city B, then drive empty from city B to city D, and finally drive empty from city D to city A.

[0062] Optionally, when the postal route adjustment method is the second postal route adjustment method, the corresponding postal route data is updated based on the postal route adjustment method to obtain target postal route data corresponding to the target area, including: performing population initialization processing on at least one set of postal route data to obtain at least one delivery route to be applied; determining the transportation attributes corresponding to each delivery route to be applied, and performing cross-comparison on the corresponding delivery routes to be applied based on each transportation attribute, and determining the target postal route data based on the cross-comparison results.

[0063] In this embodiment, population initialization can be a process of splitting based on the original postal route data. In practical applications, if the number of paths to points in the postal route data exceeds a preset threshold, population initialization can be performed on this postal route data to obtain at least one delivery path to be used. Specifically, the geographical location of the delivery point in the postal route data can be determined first. Then, a search area can be constructed with the delivery point as the center and a preset distance as the radius. At least one path point can be determined within this search area. Then, for each path point, a search area can be constructed again with the current path point as the center and a preset distance as the radius, and at least one path point can be determined within this search area. Thus, a delivery path to be used that includes at least two path points can be finally obtained. For example, if the origin is city A, the delivery point is city B, and the transit point adjacent to city B is city C, and the transit point adjacent to city C is city D, the corresponding delivery route to be applied can be to transport the delivery object from city A to city B, then drive empty from city B to city C, then drive empty from city C to city D, and finally drive empty from city D to city A.

[0064] Furthermore, while determining at least one delivery route to be applied, the transportation attributes of each delivery route to be applied can be calculated based on a pre-set transportation attribute calculation algorithm. Then, based on the transportation attributes, the corresponding delivery routes to be applied are cross-compared to select the optimal delivery route from each delivery route to be applied, so that these optimal delivery routes can be used as target postal route data.

[0065] The technical solution of this invention obtains the original postal route transportation data corresponding to the target area, then updates the original postal route transportation data according to the preset time limit optimization target and cost optimization target to obtain a preliminary postal route plan. Finally, based on the number of transit points in each group of postal route data in the preliminary postal route plan, the corresponding postal route adjustment method is determined, and the corresponding postal route data is updated based on the postal route adjustment method to obtain the target postal route data corresponding to the target area. This solves the problem of postal route planning with large data volume and complex constraints that cannot be handled in the prior art. It achieves the effect of dynamically adjusting the original delivery route with the goal of minimizing transportation costs while ensuring stable time limits, so that the target postal route data obtained after adjustment can achieve the effect of improving transportation efficiency while reducing transportation costs.

[0066] Example 2

[0067] Figure 2 This is a schematic diagram of a postal route determination device provided in Embodiment 2 of the present invention. Figure 2 As shown, the device includes: a raw postal route transportation data acquisition module 210, a raw postal route transportation data update module 220, and a postal route adjustment method determination module 230.

[0068] The original postal route transportation data acquisition module 210 is used to acquire the original postal route transportation data corresponding to the target area; wherein, the original postal route transportation data includes the original delivery route, each waypoint located on the original delivery route, and the corresponding delivery time threshold;

[0069] The original postal route transportation data update module 220 is used to update the original postal route transportation data according to the preset time limit optimization target and cost optimization target to obtain a preliminary postal route plan; wherein, the preliminary postal route plan includes at least one set of updated postal route data and corresponding transportation costs;

[0070] The postal route adjustment method determination module 230 is used to determine the postal route adjustment method corresponding to the preliminary postal route plan based on the number of transit points in each group of postal route data in the preliminary postal route plan, so as to update the corresponding postal route data based on the postal route adjustment method to obtain target postal route data corresponding to the target area.

[0071] The technical solution of this invention obtains the original postal route transportation data corresponding to the target area, then updates the original postal route transportation data according to the preset time limit optimization target and cost optimization target to obtain a preliminary postal route plan. Finally, based on the number of transit points in each group of postal route data in the preliminary postal route plan, the corresponding postal route adjustment method is determined, and the corresponding postal route data is updated based on the postal route adjustment method to obtain the target postal route data corresponding to the target area. This solves the problem of postal route planning with large data volume and complex constraints that cannot be handled in the prior art. It achieves the effect of dynamically adjusting the original delivery route with the goal of minimizing transportation costs while ensuring stable time limits, so that the target postal route data obtained after adjustment can achieve the effect of improving transportation efficiency while reducing transportation costs.

[0072] Optionally, the original postal route transportation data update module 220 includes: a sub-module for determining the delivery route to be planned and a sub-module for determining the preliminary postal route plan.

[0073] The delivery route determination submodule is used to process the original postal route transportation data sequentially based on at least one local search algorithm to obtain at least one delivery route to be planned, and the postal route transportation attributes corresponding to each delivery route to be planned.

[0074] The preliminary postal route plan determination submodule is used to process the at least one delivery route to be planned and the corresponding postal route transportation attributes based on the global search algorithm, the time limit optimization objective, and the cost optimization objective to obtain the preliminary postal route plan.

[0075] Optionally, the delivery route determination submodule includes: a start time threshold determination unit, a delivery route determination unit, and a transportation cost determination unit.

[0076] The departure time threshold determination unit is used to process the original postal route transportation data based on the first local search algorithm to obtain the departure time threshold corresponding to the original delivery route.

[0077] The delivery route determination unit is used to process the start time threshold corresponding to the original delivery route based on the second local search algorithm to obtain the at least one delivery route to be planned.

[0078] The transportation cost determination unit is used to process the at least one delivery route to be planned based on a third local algorithm to obtain the transportation cost corresponding to the at least one delivery route to be planned.

[0079] Optionally, the postal route adjustment method determination module 230 includes: a first postal route adjustment method determination unit and a second postal route adjustment method determination unit.

[0080] The first postal route adjustment method determination unit is used to determine the postal route adjustment method as the first postal route adjustment method if the number of paths of the waypoints in each group of postal route data is less than a preset threshold.

[0081] The second postal route adjustment method determination unit is used to determine the postal route adjustment method as the second postal route adjustment method if the number of transit points in each group of postal route data is equal to a preset threshold.

[0082] The first postal route adjustment method is implemented based on a global search algorithm, while the second postal route adjustment method is implemented based on a heuristic search algorithm.

[0083] Optionally, the adjustment method is a first postal route adjustment method, and the postal route adjustment method determination module 230 further includes: a display list determination unit, a pending delivery route determination unit, and a target postal route data first determination unit.

[0084] The display list determination unit is used to determine the first waypoint display list and the second waypoint display list corresponding to each delivery route to be planned.

[0085] The pending delivery route determination unit is used to traverse each of the first path points in the display list, or traverse each of the second path points in the display list, to determine at least one pending delivery route.

[0086] The first target postal route data determining unit is used to process each of the delivery routes to be processed based on initialization constraints to determine the target postal route data.

[0087] Optionally, the display list determination unit includes: a starting point determination subunit, a first path point display list determination unit, and a second path point display list determination unit.

[0088] The origin and delivery point determination subunit is used to determine the origin and delivery points associated with the delivery route to be planned;

[0089] The first waypoint display list determination unit is used to determine a first search area with the originating point as the center and a first preset distance as the radius, and to determine the first waypoint display list based on at least one first selectable waypoint contained in the first search area.

[0090] The second waypoint display list determination unit is used to determine a second search area with the delivery point as the center and a second preset distance as the radius, and to determine the second waypoint display list based on at least one second selectable waypoint contained in the second search area.

[0091] Optionally, the adjustment method is a second postal route adjustment method, and the postal route adjustment method determination module 230 further includes: a postal route data processing unit and a target postal route data second determination unit.

[0092] The postal route data processing unit is used to perform population initialization processing on the at least one set of postal route data to obtain at least one delivery route to be applied.

[0093] The second target postal route data determining unit is used to determine the transportation attributes corresponding to each of the delivery routes to be applied, and to perform cross-comparison of the corresponding delivery routes to be applied based on each of the transportation attributes, and to determine the target postal route data based on the cross-comparison results.

[0094] The postal route determination device provided in the embodiments of the present invention can execute the postal route determination method provided in any embodiment of the present invention, and has the corresponding functional modules and beneficial effects of executing the method.

[0095] Example 3

[0096] Figure 3 A schematic diagram of an electronic device 10 that can be used to implement embodiments of the present invention is shown. The electronic device is intended to represent various forms of digital computers, such as laptop computers, desktop computers, workstations, personal digital assistants, servers, blade servers, mainframe computers, and other suitable computers. The electronic device can also represent various forms of mobile devices, such as personal digital processors, cellular phones, smartphones, wearable devices (e.g., helmets, glasses, watches, etc.), and other similar computing devices. The components shown herein, their connections and relationships, and their functions are merely illustrative and are not intended to limit the implementation of the invention described and / or claimed herein.

[0097] like Figure 3As shown, the electronic device 10 includes at least one processor 11 and a memory, such as a read-only memory (ROM) 12 or a random access memory (RAM) 13, communicatively connected to the at least one processor 11. The memory stores computer programs executable by the at least one processor. The processor 11 can perform various appropriate actions and processes based on the computer program stored in the ROM 12 or loaded from storage unit 18 into the RAM 13. The RAM 13 may also store various programs and data required for the operation of the electronic device 10. The processor 11, ROM 12, and RAM 13 are interconnected via a bus 14. An input / output (I / O) interface 15 is also connected to the bus 14.

[0098] Multiple components in electronic device 10 are connected to I / O interface 15, including: input unit 16, such as keyboard, mouse, etc.; output unit 17, such as various types of displays, speakers, etc.; storage unit 18, such as disk, optical disk, etc.; and communication unit 19, such as network card, modem, wireless transceiver, etc. Communication unit 19 allows electronic device 10 to exchange information / data with other devices through computer networks such as the Internet and / or various telecommunications networks.

[0099] Processor 11 can be a variety of general-purpose and / or special-purpose processing components with processing and computing capabilities. Some examples of processor 11 include, but are not limited to, a central processing unit (CPU), a graphics processing unit (GPU), various special-purpose artificial intelligence (AI) computing chips, various processors running machine learning model algorithms, a digital signal processor (DSP), and any suitable processor, controller, microcontroller, etc. Processor 11 performs the various methods and processes described above, such as the route determination method.

[0100] In some embodiments, the route determination method may be implemented as a computer program tangibly contained in a computer-readable storage medium, such as storage unit 18. In some embodiments, part or all of the computer program may be loaded and / or mounted on electronic device 10 via ROM 12 and / or communication unit 19. When the computer program is loaded into RAM 13 and executed by processor 11, one or more steps of the route determination method described above may be performed. Alternatively, in other embodiments, processor 11 may be configured to perform the route determination method by any other suitable means (e.g., by means of firmware).

[0101] Various embodiments of the systems and techniques described above herein can be implemented in digital electronic circuit systems, integrated circuit systems, field-programmable gate arrays (FPGAs), application-specific integrated circuits (ASICs), application-specific standard products (ASSPs), systems-on-a-chip (SoCs), payload-programmable logic devices (CPLDs), computer hardware, firmware, software, and / or combinations thereof. These various embodiments may include implementations in one or more computer programs that can be executed and / or interpreted on a programmable system including at least one programmable processor, which may be a dedicated or general-purpose programmable processor, capable of receiving data and instructions from a storage system, at least one input device, and at least one output device, and transmitting data and instructions to the storage system, the at least one input device, and the at least one output device.

[0102] Computer programs used to implement the methods of the present invention may be written in any combination of one or more programming languages. These computer programs may be provided to a processor of a general-purpose computer, a special-purpose computer, or other programmable data processing device, such that when executed by the processor, the computer programs cause the functions / operations specified in the flowcharts and / or block diagrams to be performed. The computer programs may be executed entirely on a machine, partially on a machine, or as a standalone software package, partially on a machine and partially on a remote machine, or entirely on a remote machine or server.

[0103] In the context of this invention, a computer-readable storage medium can be a tangible medium that may contain or store a computer program for use by or in conjunction with an instruction execution system, apparatus, or device. A computer-readable storage medium may include, but is not limited to, electronic, magnetic, optical, electromagnetic, infrared, or semiconductor systems, apparatus, or devices, or any suitable combination thereof. Alternatively, a computer-readable storage medium may be a machine-readable signal medium. More specific examples of machine-readable storage media include electrical connections based on one or more wires, portable computer disks, hard disks, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fibers, portable compact disk read-only memory (CD-ROM), optical storage devices, magnetic storage devices, or any suitable combination thereof.

[0104] To provide interaction with a user, the systems and techniques described herein can be implemented on an electronic device having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to the user; and a keyboard and pointing device (e.g., a mouse or trackball) through which the user provides input to the electronic device. Other types of devices can also be used to provide interaction with the user; for example, feedback provided to the user can be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user can be received in any form (including sound input, voice input, or tactile input).

[0105] The systems and technologies described herein can be implemented in computing systems that include backend components (e.g., as data servers), or computing systems that include middleware components (e.g., application servers), or computing systems that include frontend components (e.g., user computers with graphical user interfaces or web browsers through which users can interact with implementations of the systems and technologies described herein), or any combination of such backend, middleware, or frontend components. The components of the system can be interconnected via digital data communication of any form or medium (e.g., communication networks). Examples of communication networks include local area networks (LANs), wide area networks (WANs), blockchain networks, and the Internet.

[0106] A computing system can include clients and servers. Clients and servers are generally located far apart and typically interact through communication networks. The client-server relationship is created by computer programs running on the respective computers and having a client-server relationship with each other. The server can be a cloud server, also known as a cloud computing server or cloud host, which is a hosting product within the cloud computing service system to address the shortcomings of traditional physical hosts and VPS services, such as high management difficulty and weak business scalability.

[0107] It should be understood that the various forms of processes shown above can be used, with steps reordered, added, or deleted. For example, the steps described in this invention can be executed in parallel, sequentially, or in different orders, as long as the desired result of the technical solution of this invention can be achieved, and this is not limited herein.

[0108] The specific embodiments described above 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 be made according to 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 determining a postal route, characterized in that, include: Obtain the original postal route transportation data corresponding to the target area; wherein, the original postal route transportation data includes the original delivery route, each point along the original delivery route, the corresponding delivery time threshold, the geographical location information of each node in the postal route transportation network of the target area, and the loading amount information during the delivery process; The original postal route transportation data is processed sequentially based on at least one local search algorithm to obtain at least one delivery route to be planned, and the postal route transportation attributes corresponding to each delivery route to be planned. Based on a global search algorithm, time limit optimization objective, and cost optimization objective, the at least one delivery route to be planned and its corresponding postal route transportation attributes are processed to obtain a preliminary postal route plan; wherein, the preliminary postal route plan includes at least one set of updated postal route data and corresponding transportation costs; Based on the number of transit points in each group of transit points in the preliminary transit plan, a transit adjustment method corresponding to the preliminary transit plan is determined, and the corresponding transit data is updated based on the transit adjustment method to obtain target transit data corresponding to the target area. The number of transit points is the number of transit points required to pass through the transit points. The step of determining the postal route adjustment method corresponding to the preliminary postal route plan based on the number of transit points in each group of postal route data includes: If the number of points passed through in each group of postal route data is less than the preset threshold, then the postal route adjustment method will be determined as the first postal route adjustment method. At this time, updating the corresponding postal route data based on the postal route adjustment method to obtain target postal route data corresponding to the target area includes: For each delivery route to be planned, determine the first waypoint display list and the second waypoint display list corresponding to the current delivery route to be planned; Traverse each of the first waypoints in the display list, or traverse each of the second waypoints in the display list, to determine at least one delivery route to be processed. The delivery routes to be processed are processed based on the initialization constraints to determine the target postal route data; If the number of transit points in each group of postal route data is equal to a preset threshold, then the postal route adjustment method is determined as the second postal route adjustment method. At this time, updating the corresponding postal route data based on the postal route adjustment method to obtain target postal route data corresponding to the target area includes: Perform population initialization processing on at least one set of postal route data to obtain at least one delivery route to be applied; Determine the transportation attributes corresponding to each of the delivery routes to be applied, and perform cross-comparison on the corresponding delivery routes to be applied based on each of the transportation attributes, and determine the target postal route data based on the cross-comparison results; The first postal route adjustment method is implemented based on the global search algorithm, and the second postal route adjustment method is implemented based on the heuristic search algorithm.

2. The method according to claim 1, characterized in that, The original postal route transportation data is processed sequentially based on at least one local search algorithm to obtain at least one delivery route to be planned, and postal route transportation attributes corresponding to each of the delivery routes to be planned, including: The original postal route transportation data is processed based on the first local search algorithm to obtain the start time threshold corresponding to the original delivery route; The starting time threshold corresponding to the original delivery route is processed based on the second local search algorithm to obtain the at least one delivery route to be planned; The at least one delivery route to be planned is processed based on the third local algorithm to obtain the transportation cost corresponding to the at least one delivery route to be planned.

3. The method according to claim 1, characterized in that, The determination of the first waypoint display list and the second waypoint display list corresponding to the current delivery route to be planned includes: Determine the origin and delivery points associated with the planned delivery route; With the originating point as the center and a first preset distance as the radius, a first search area is determined, and based on at least one first selectable route point contained in the first search area, a first route point display list is determined; A second search area is determined with the delivery point as the center and a second preset distance as the radius, and a second route point display list is determined based on at least one second route point to be selected contained in the second search area.

4. A postal route determination device, characterized in that, include: The original postal route transportation data acquisition module is used to acquire original postal route transportation data corresponding to the target area; wherein, the original postal route transportation data includes the original delivery route, each point along the original delivery route, the corresponding delivery time threshold, the geographical location information of each node in the postal route transportation network of the target area, and the loading amount information during the delivery process; The original postal route transportation data update module is used to update the original postal route transportation data according to the preset time limit optimization target and cost optimization target to obtain a preliminary postal route plan; wherein, the preliminary postal route plan includes at least one set of updated postal route data and corresponding transportation costs; The postal route adjustment method determination module is used to determine the postal route adjustment method corresponding to the preliminary postal route plan based on the number of transit points in each group of postal route data in the preliminary postal route plan, so as to update the corresponding postal route data based on the postal route adjustment method to obtain target postal route data corresponding to the target area, wherein the number of transit points is the number of postal routes required to pass through the transit points; The original postal route transportation data update module includes: a sub-module for determining the delivery route to be planned and a sub-module for determining the preliminary postal route plan; The delivery route determination submodule is used to process the original postal route transportation data sequentially based on at least one local search algorithm to obtain at least one delivery route to be planned, and postal route transportation attributes corresponding to each delivery route to be planned. The preliminary postal route plan determination submodule is used to process the at least one delivery route to be planned and the corresponding postal route transportation attributes based on the global search algorithm, the time limit optimization target and the cost optimization target to obtain the preliminary postal route plan. The postal route adjustment method determination module includes: a first postal route adjustment method determination unit and a second postal route adjustment method determination unit; The first postal route adjustment method determination unit is used to determine the postal route adjustment method as the first postal route adjustment method if the number of transit points in each group of postal route data is less than a preset threshold. At this time, the postal route adjustment method determination module also includes: a display list determination unit, a pending delivery route determination unit, and a target postal route data first determination unit; The display list determination unit is used to determine, for each delivery route to be planned, a first waypoint display list and a second waypoint display list corresponding to the current delivery route to be planned; The pending delivery route determination unit is used to traverse each of the first path points in the display list, or traverse each of the second path points in the display list, to determine at least one pending delivery route. The first target postal route data determining unit is used to process each of the delivery routes to be processed based on initialization constraints to determine the target postal route data; The second postal route adjustment method determination unit is used to determine the postal route adjustment method as the second postal route adjustment method if the number of transit points in each group of postal route data is equal to a preset threshold. At this time, the postal route adjustment method determination module further includes: a postal route data processing unit and a target postal route data second determination unit; The postal route data processing unit is used to perform population initialization processing on at least one set of postal route data to obtain at least one delivery route to be applied. The second target postal route data determining unit is used to determine the transportation attributes corresponding to each of the delivery routes to be applied, and to perform cross-comparison of the corresponding delivery routes to be applied based on each of the transportation attributes, and to determine the target postal route data based on the cross-comparison results. The first postal route adjustment method is implemented based on a global search algorithm, while the second postal route adjustment method is implemented based on a heuristic search algorithm.

5. An electronic device, characterized in that, The electronic device includes: At least one processor; and A memory communicatively connected to the at least one processor; wherein, The memory stores a computer program that can be executed by the at least one processor to enable the at least one processor to perform the route determination method according to any one of claims 1-3.

6. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores computer instructions that cause a processor to execute the route determination method according to any one of claims 1-3.

Images