Route planning method and device, electronic equipment and computer readable storage medium

Abstract

The application provides a routing planning method and device, electronic equipment and a computer readable storage medium, and relates to the technical field of computers and Internet. The method comprises the following steps: obtaining an originating distribution point and a destination distribution point; determining an originating sorting center corresponding to the originating distribution point and a destination sorting center corresponding to the destination distribution point; dynamically planning one or more first lines from the originating distribution point to the originating sorting center in real time; dynamically planning one or more second lines from the destination sorting center to the destination distribution point in real time; obtaining one or more third lines from the originating sorting center to the destination sorting center; and determining a routing line with the lowest distribution cost from the originating distribution point to the destination distribution point according to the one or more first lines, the one or more second lines and the one or more third lines. The embodiment of the application can quickly and accurately determine a routing line with the lowest cost from the originating distribution point to the destination distribution point.

Description

Technical Field

[0001] This application relates to the field of computer and Internet technology, and in particular to a routing planning method and apparatus, electronic device and computer-readable storage medium. Background Technology

[0002] This section is intended to provide background or context for the embodiments of this application as set forth in the claims. The description herein is not intended to be a prior art simply because it is included in this section.

[0003] The efficient flow of tens of millions of parcels daily relies on a logistics network built by network planners. In logistics production scenarios, the routing information of a parcel needs to be provided to merchants, workstations, or delivery personnel in real time. In actual logistics production, the calculation of routing information places extremely high demands on real-time performance, typically within tens of milliseconds.

[0004] Current logistics networks encompass multiple dimensions, including nodes, edges, shifts, time, and network types. Therefore, the computational space for real-time calculations within a logistics network is enormous, resulting in long real-time calculation times and an inability to provide fast online services at the millisecond level.

[0005] Therefore, in order to solve the above problems, this application proposes a solution. Summary of the Invention

[0006] The purpose of this application is to provide a routing planning method, apparatus, electronic device, and computer-readable storage medium that can improve the calculation speed of routing information.

[0007] Other features and advantages of this application will become apparent from the following detailed description, or may be learned in part from practice of this application.

[0008] This application provides a routing planning method, comprising: obtaining a routing query request, the routing query request including an originating delivery point and a destination delivery point; determining an originating sorting center corresponding to the originating delivery point and a destination sorting center corresponding to the destination delivery point; dynamically planning one or more first routes from the originating delivery point to the originating sorting center in real time; dynamically planning one or more second routes from the destination sorting center to the destination delivery point in real time; obtaining one or more third routes from the originating sorting center to the destination sorting center, the one or more third routes being predetermined; and determining the route with the lowest delivery cost from the originating delivery point to the destination delivery point based on the one or more first routes, the one or more second routes, and the one or more third routes.

[0009] In some embodiments, determining the originating sorting center corresponding to the originating delivery point includes: obtaining a delivery network topology map, the delivery network topology map including sorting center nodes; if the node corresponding to the originating delivery point is determined to be a sorting center node according to the delivery network topology map, then the originating delivery point is determined to be the originating sorting center; if the node corresponding to the originating delivery point is not a sorting center node according to the delivery network topology map, then one or more first parent nodes corresponding to the originating delivery point are determined in the delivery network topology map; and one or more sorting centers corresponding to the one or more first parent nodes are designated as the originating sorting center.

[0010] In some embodiments, there are one or more originating sorting centers; wherein, real-time dynamic planning of one or more first routes from the originating delivery point to the originating sorting center includes: obtaining first dynamic delivery information from the originating delivery point to each originating sorting center; planning one or more routes from the originating delivery point to each originating sorting center in real time based on the first dynamic delivery information; and using one or more routes from the originating delivery point to each originating sorting center as the one or more first routes, wherein each first route corresponds to a shuttle time period.

[0011] In some embodiments, determining the destination sorting center corresponding to the destination delivery point includes: obtaining a delivery network topology map, the delivery network topology map including sorting center nodes; if the node corresponding to the destination delivery point is determined to be a sorting center node according to the delivery network topology map, then the destination delivery point is determined to be the destination sorting center; if the node corresponding to the destination delivery point is not a sorting center node according to the delivery network topology map, a reverse delivery network topology map of the delivery network topology map is determined; one or more second parent nodes corresponding to the destination delivery point are determined in the reverse delivery network topology map; and the one or more second parent nodes are used as the destination sorting center.

[0012] In some embodiments, the destination sorting center is one or more; wherein, real-time dynamic planning of one or more second routes from the destination sorting center to the destination distribution point includes: obtaining second dynamic delivery information from each destination sorting center to the destination distribution point; planning one or more routes from each destination sorting center to the destination distribution point in real time based on the second dynamic delivery information; and using one or more routes from each destination sorting center to the destination distribution point as the one or more second routes, wherein each second route corresponds to a shuttle time period.

[0013] In some embodiments, determining the route with the lowest delivery cost from the originating delivery point to the destination delivery point based on the one or more first routes, the one or more second routes, and the one or more third routes includes: determining a first target route among the one or more first routes, a second target route among the one or more second routes, and a third target route among the one or more third routes through a traversal search operation; wherein the delivery cost generated by the first target route, the second target route, and the third target route is the lowest among all routes from the originating delivery point to the destination delivery point.

[0014] In some embodiments, the method further includes: acquiring a delivery network topology map periodically, the delivery network topology map including sorting center nodes, each node including one or more routes, each route corresponding to a transfer time period, the sorting center nodes in the delivery network topology map including the originating sorting center node corresponding to the originating sorting center and the destination sorting center node corresponding to the destination sorting center; determining the routing lines between each pair of sorting center nodes according to the delivery network topology map; and pre-storing the routing lines between each pair of sorting center nodes so as to determine the one or more third routes according to the pre-stored routing lines between each pair of sorting center nodes.

[0015] In some embodiments, the node corresponding to the originating sorting center in the distribution network topology is the originating sorting center node, and the node corresponding to the destination sorting center in the distribution network topology is the destination sorting center node; wherein, obtaining one or more third routes from the originating sorting center to the destination sorting center includes: obtaining pre-stored routing lines between each pair of sorting center nodes; filtering out all routes between the originating sorting center node and the destination sorting center node from the routing lines between each pair of sorting center nodes; and using all routes between the originating sorting center node and the destination sorting center node as one or more third routes from the originating sorting center to the destination sorting center.

[0016] This application provides a route planning device, including: a route query request module, an origin sorting center determination module, a first route determination module, a second route determination module, a third route determination module, and a route planning module.

[0017] The routing query request module is used to obtain a routing query request, which includes an originating delivery point and a destination delivery point. The originating sorting center determination module can be used to determine the originating sorting center corresponding to the originating delivery point and the destination sorting center corresponding to the destination delivery point. The first route determination module can be used to dynamically plan one or more first routes from the originating delivery point to the originating sorting center in real time. The second route determination module can be used to dynamically plan one or more second routes from the destination sorting center to the destination delivery point in real time. The third route determination module can be used to obtain one or more third routes from the originating sorting center to the destination sorting center, wherein the one or more third routes are predetermined. The routing route planning module can be used to determine the route with the lowest delivery cost from the originating delivery point to the destination delivery point based on the one or more first routes, the one or more second routes, and the one or more third routes.

[0018] This application provides an electronic device comprising: a memory and a processor; the memory is used to store computer program instructions; the processor invokes the computer program instructions stored in the memory to implement the routing planning method described above.

[0019] This application provides a computer-readable storage medium storing computer program instructions to implement the routing planning method described in any of the above claims.

[0020] This application provides a computer program product or computer program that includes computer program instructions stored in a computer-readable storage medium. The computer program instructions are read from the computer-readable storage medium, and the processor executes the computer program instructions to implement the aforementioned routing planning method.

[0021] The routing planning method, apparatus, electronic device, and computer-readable storage medium provided in this application first perform real-time dynamic planning on the routing information between the originating delivery point and the originating sorting center, the destination sorting center, and the destination delivery point, and obtain the pre-calculated route center from the originating sorting center to the destination sorting center; then, based on the routing information from the originating delivery point to the originating sorting center, the destination sorting center, and the destination delivery point, as well as from the originating sorting center to the destination sorting center, the lowest-cost route information corresponding to the originating delivery point to the destination delivery point is determined. In this process, since the route information from the originating sorting center to the destination sorting center, which involves the largest amount of data computation, has already been pre-calculated, the computational load of the entire routing calculation process is greatly reduced, thereby improving the calculation speed of the routing information.

[0022] It should be understood that the above general description and the following detailed description are merely exemplary and do not limit this application. Attached Figure Description

[0023] The accompanying drawings, which are incorporated in and form part of this specification, illustrate embodiments consistent with this application and, together with the description, serve to explain the principles of this application. It is obvious that the drawings described below are merely some embodiments of this application, and those skilled in the art can obtain other drawings based on these drawings without any inventive effort.

[0024] Figure 1 This is a schematic diagram illustrating a logistics network according to an exemplary embodiment.

[0025] Figure 2 This is a schematic diagram illustrating routing information according to an exemplary embodiment.

[0026] Figure 3 A schematic diagram of a scenario that can be applied to the routing planning method or routing planning apparatus in the embodiments of this application is shown.

[0027] Figure 4 This is a flowchart illustrating a route planning method according to an exemplary embodiment.

[0028] Figure 5 This is a schematic diagram of a station entrance / exit according to an exemplary embodiment.

[0029] Figure 6 This is a schematic diagram illustrating a route splitting method according to an exemplary embodiment.

[0030] Figure 7 This is a schematic diagram illustrating a route splitting method according to an exemplary embodiment.

[0031] Figure 8 This is a schematic diagram of the structure corresponding to a routing method according to an exemplary embodiment.

[0032] Figure 9 This is a flowchart illustrating a route planning method according to an exemplary embodiment.

[0033] Figure 10 This is a schematic diagram illustrating a delivery network topology according to an exemplary embodiment.

[0034] Figure 11 This is a flowchart illustrating a dynamic routing method according to an exemplary embodiment.

[0035] Figure 12 This is a flowchart illustrating a route planning method according to an exemplary embodiment.

[0036] Figure 13 This is a schematic diagram illustrating a reverse edge according to an exemplary embodiment.

[0037] Figure 14 This is a flowchart illustrating a route planning method according to an exemplary embodiment.

[0038] Figure 15 This is a flowchart illustrating a third line pre-calculation method according to an exemplary embodiment.

[0039] Figure 16 This is a flowchart illustrating a third route query method according to an exemplary embodiment.

[0040] Figure 17 This is a block diagram illustrating a routing planning apparatus according to an exemplary embodiment.

[0041] Figure 18 A schematic diagram of the structure of an electronic device suitable for implementing embodiments of this application is shown. Detailed Implementation

[0042] Exemplary embodiments will now be described more fully with reference to the accompanying drawings. However, these exemplary embodiments can be implemented in many forms and should not be construed as limited to the embodiments set forth herein; rather, they are provided so that this application will be thorough and complete, and will fully convey the concept of the exemplary embodiments to those skilled in the art. The same reference numerals in the drawings denote the same or similar parts, and therefore repeated descriptions of them will be omitted.

[0043] Those skilled in the art will understand that embodiments of this application can be a system, apparatus, device, method, or computer program product. Therefore, this application can be specifically implemented in the following forms: entirely hardware, entirely software (including firmware, resident software, microcode, etc.), or a combination of hardware and software.

[0044] The features, structures, or characteristics described in this application can be combined in any suitable manner in one or more embodiments. Numerous specific details are provided in the following description to give a full understanding of the embodiments of this application. However, those skilled in the art will recognize that the technical solutions of this application can be practiced with one or more specific details omitted, or other methods, components, apparatuses, steps, etc., can be employed. In other instances, well-known methods, apparatuses, implementations, or operations are not shown or described in detail to avoid obscuring various aspects of this application.

[0045] The accompanying drawings are merely illustrative of this application; the same reference numerals denote the same or similar parts, and therefore repeated descriptions of them will be omitted. Some block diagrams shown in the drawings do not necessarily correspond to physically or logically independent entities. These functional entities may be implemented in software, in one or more hardware modules or integrated circuits, or in different network and / or processor devices and / or microcontroller devices.

[0046] The flowchart shown in the accompanying drawings is merely illustrative and does not necessarily include all content and steps, nor does it require execution in the described order. For example, some steps may be broken down, while others may be combined or partially combined; therefore, the actual execution order may change depending on the specific circumstances.

[0047] In the description of this application, unless otherwise stated, " / " means "or," for example, A / B can mean A or B. "And / or" in this document is merely a description of the relationship between related objects, indicating that three relationships can exist. For example, A and / or B can represent: A alone, A and B simultaneously, and B alone. Furthermore, "one or more" refers to one or more items, and "multiple" refers to two or more items. The terms "first," "second," etc., do not limit the quantity or order of execution, and "first," "second," etc., do not necessarily imply differences. The terms "contains," "includes," and "has" are used to indicate an open-ended meaning of inclusion and refer to the existence of additional elements / components / etc. besides the listed elements / components / etc.

[0048] To better understand the above-mentioned objectives, features and advantages of the present invention, the present invention will be further described in detail below with reference to the accompanying drawings and specific embodiments. It should be noted that, unless otherwise specified, the embodiments and features in the embodiments of this application can be combined with each other.

[0049] It should be noted that the collection, gathering, updating, analysis, processing, use, transmission, and storage of user personal information involved in the technical solution of this application all comply with the provisions of relevant laws and regulations, are used for legitimate purposes, and do not violate public order and good morals. Necessary measures are taken to prevent unauthorized access to user personal information data and to safeguard user personal information security and network security.

[0050] The efficient flow of tens of millions of parcels daily is achieved through a logistics network built by network planners. The flow can be customized with various options, such as fastest delivery time, most economical delivery time, and optimal delivery time. Specific details can be as follows: Figure 1 As shown.

[0051] To address this problem, a corresponding network topology map is typically constructed, and a search algorithm such as BFS (Breadth First Search) or DFS (Depth First Search) is used to perform global real-time calculations of the optimal package route, ultimately obtaining the routing information for a package or express delivery. This routing information may include key information such as nodes, time, and delivery schedule.

[0052] In logistics production scenarios, this routing information (such as...) needs to be... Figure 2 As shown, this is provided in real time to merchants, workstations, deliveryman apps, etc., and has very high real-time performance requirements, with a performance SLA (service-level agreement) within 50ms.

[0053] Current logistics networks encompass multiple dimensions, including nodes, edges, shifts, time, and network types. With 100,000 nodes, 1 million edges (including the time dimension), 10 network types, and a time dimension of 7-14 days, the computational space is enormous, resulting in long real-time computation times and an inability to provide fast online services within milliseconds.

[0054] To address the aforementioned technical issues, the solution provided in this application identifies super nodes in the network through network structure analysis, then pre-computes and caches the optimal paths between super nodes; and employs the principle of dynamic programming to reduce the computational space of real-time computation by breaking down the original real-time computation into three-stage computations that are then added together, thereby improving real-time computation performance.

[0055] The exemplary embodiments of this application will now be described in detail with reference to the accompanying drawings.

[0056] Figure 3 A schematic diagram of a scenario that can be applied to the routing planning method or routing planning apparatus in the embodiments of this application is shown.

[0057] Please refer to Figure 3 The diagram illustrates an implementation environment provided by an exemplary embodiment of this application.

[0058] like Figure 3 As shown, system architecture 100 may include terminal devices 101, 102, and 103, a network 104, and a server 105. Network 104 serves as the medium for providing communication links between terminal devices 101, 102, and 103 and server 105. Network 104 may include various connection types, such as wired or wireless communication links, or fiber optic cables, etc.

[0059] Users can use terminal devices 101, 102, and 103 to interact with server 105 via network 104 to receive or send messages, etc. Terminal devices 101, 102, and 103 can be various electronic devices with displays and web browsing capabilities, including but not limited to smartphones, tablets, laptops, desktop computers, wearable devices, virtual reality devices, smart home devices, etc.

[0060] Server 105 can be a server that provides various services, such as a backend management server that supports the devices operated by users using terminal devices 101, 102, and 103. The backend management server can analyze and process received requests and other data, and feed the processing results back to the terminal devices.

[0061] The server can be a standalone physical server, a server cluster or distributed system composed of multiple physical servers, or a cloud server that provides basic cloud computing services such as cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communication, middleware services, domain name services, security services, CDN (Content Delivery Network), and big data and artificial intelligence platforms. This application does not impose any restrictions on this.

[0062] Server 105 may, for example, obtain a routing query request, which includes an originating delivery point and a destination delivery point; server 105 may, for example, determine the originating sorting center corresponding to the originating delivery point and the destination sorting center corresponding to the destination delivery point; server 105 may, for example, dynamically plan one or more first routes from the originating delivery point to the originating sorting center in real time; server 105 may, for example, dynamically plan one or more second routes from the destination sorting center to the destination delivery point in real time; server 105 may, for example, obtain one or more third routes from the originating sorting center to the destination sorting center, where one or more third routes are predetermined; server 105 may, for example, determine the route with the lowest delivery cost from the originating delivery point to the destination delivery point based on one or more first routes, one or more second routes, and one or more third routes.

[0063] It should be understood that Figure 3 The number of terminal devices, networks, and servers shown is merely illustrative. Server 105 can be a single physical server or a combination of multiple servers. Depending on actual needs, it can have any number of terminal devices, networks, and servers.

[0064] Under the above system architecture, this application provides a routing planning method that can be executed by any electronic device with computing power.

[0065] The method provided in the embodiments of this application can be executed by any electronic device with computing power. For example, the method can be executed by the above-described... Figure 3 The execution can be performed by a server or terminal device in the embodiments, or it can be performed by both a server and a terminal device. In the following embodiments, the server is used as the execution subject for illustration, but this application is not limited to this.

[0066] Reference Figure 4 The routing planning method provided in this application embodiment may include the following steps.

[0067] Step S402: Obtain a route query request, which includes the originating delivery point and the destination delivery point.

[0068] The aforementioned originating delivery point can refer to the originating station of the express delivery or parcel, while the destination delivery point can refer to the destination station of the express delivery or parcel.

[0069] A station can refer to a network point that can receive, send, or sort express delivery (or parcels).

[0070] The above routing request can be used to request real-time routing information from the originating delivery point to the destination delivery point.

[0071] Real-time routing information can refer to routing information that is dynamically determined by combining real-time parcel delivery information in the logistics network.

[0072] Step S404: Determine the origin sorting center corresponding to the origin delivery point and the destination sorting center corresponding to the destination delivery point.

[0073] The stations in the logistics network can be divided into sorting centers and distribution points according to their functions. Sorting centers are used to sort and transport express packages or parcels, while distribution points are used to collect and deliver express packages or parcels.

[0074] In some embodiments, the distribution point may also be a sorting center, and this application does not limit this.

[0075] In some embodiments, sorting centers may be directly distributed within the logistics network based on experience, or supernodes may be identified as sorting centers through the following methods.

[0076] In some embodiments, it can be in a logistics network system (such as Figure 5 As shown, statistical analysis is performed on the inbound and outbound edges of each station. Stations with inbound and outbound edges exceeding a preset threshold are designated as super stations, while stations with no inbound and outbound edges exceeding the preset threshold are designated as ordinary stations. Super stations with a large number of inbound and outbound edges can serve as sorting centers.

[0077] In some embodiments, the next level sorting center of the originating delivery point on the route can be used as the originating sorting center, and the previous level sorting center of the destination delivery point on the route can be used as the destination sorting center.

[0078] In some embodiments, an originating delivery point may have different originating sorting centers on different routes, and a destination delivery point may also have different originating sorting centers on different routes. Therefore, the originating sorting center determined for an originating delivery point may be one or more (i.e., a delivery point may be covered by multiple sorting centers), and similarly, the destination sorting center determined for a destination delivery point may be one or more, and this application does not impose any restrictions on this.

[0079] In some embodiments, the real-time calculation of the original routing information can be simplified. For example... Figure 6 As shown, real-time calculation can be broken down into three segments: from the originating delivery point (e.g., point 1 or point 2) to the originating sorting center (e.g., sorting 1), from the originating sorting center to the destination sorting center (e.g., sorting 4), and from the destination sorting center (e.g., sorting 4) to the destination delivery point (e.g., point 5 or point 6), and then added together.

[0080] Its calculation model is as follows:

[0081] min(link(O,D))=min(link1(O,Next(O))+link2(Next(O),Pre(D))+link3(Pre(D),D)) (1)

[0082] Constraints

[0083] P i.departTime >P i.neigb.arrvieTime (2)

[0084] Where O represents the originating delivery point, D represents the destination delivery point, Next(O) represents the originating sorting center corresponding to the originating delivery point O, Pre(D) represents the destination sorting center corresponding to the destination delivery point D, P represents other sorting centers between the originating and destination sorting centers, and i is an integer greater than or equal to 1. link1(O,Next(O)) represents the route from the originating delivery point to the originating sorting center, link2(Next(O),Pre(D)) represents the route from the originating sorting center to the destination sorting center, and link3(Pre(D),D)) represents the route from the destination sorting center to the destination delivery point. P i.departTime >P i.neigb.arrvieTime This represents the package leaving the i-th sorting center P. i Time P i.departTime Later than P iThe delivery station P is adjacent to the station. i Time P i.neigb.arrvieTime .

[0085] Link1 and Link3 are for real-time computation of small networks, while Link2 is pre-computed for real-time querying.

[0086] Step S406: Real-time dynamic planning of one or more primary routes from the originating delivery point to the originating sorting center.

[0087] In some embodiments, in response to a routing query request, one or more first routes from the originating delivery point to the originating sorting center can be dynamically planned in real time based on site information in the logistics network.

[0088] Each station in the logistics network can have real-time information such as the number of express deliveries, departure time, and sorting time. By dynamically planning based on the real-time information of each station, one or more primary routes from the originating delivery point to the originating sorting center can be determined.

[0089] Step S408: Real-time dynamic planning of one or more second routes from the destination sorting center to the destination delivery point.

[0090] In some embodiments, in response to a routing query request, one or more first routes from the destination sorting center to the destination delivery point can be dynamically planned in real time based on site information in the logistics network.

[0091] Each station in the logistics network can have real-time information such as the number of express deliveries, departure time, and sorting time. By dynamically planning based on the real-time information of each station, one or more primary routes can be determined from the destination delivery point to the destination sorting center.

[0092] Step S410: Obtain one or more third routes from the originating sorting center to the destination sorting center. The one or more third routes are predetermined.

[0093] In some embodiments, the number of sorting centers in a logistics network is extremely large. If the routes between sorting centers are calculated in real time, it would place high demands on real-time computing capabilities and reduce real-time computing efficiency.

[0094] Therefore, it is advisable to calculate all the routes between sorting centers in advance, and then simply query them when needed.

[0095] Step S412: Based on one or more first routes, one or more second routes, and one or more third routes, determine the route with the lowest delivery cost from the originating delivery point to the destination delivery point.

[0096] In some embodiments, a first target route can be determined from one or more first routes, a second target route from one or more second routes, and a third target route from one or more third routes through a traversal search operation, so that the delivery cost generated by the first target route, the second target route, and the third target route is the lowest among all routes from the originating delivery point to the destination delivery point. Here, lowest delivery cost can refer to lowest time cost, lowest route length cost, highest revenue, or other factors; this application does not impose any limitations on this.

[0097] Figure 8 This is a routing planning structure diagram corresponding to a routing planning method according to an exemplary embodiment.

[0098] refer to Figure 8 When a user submits a routing query request through the webpage module, one or more pre-determined third routes from the originating sorting center to the destination sorting center can be obtained from the preprocessing module. Then, one or more first routes from the originating delivery point to the originating sorting center are dynamically planned in real time using full configuration data, and one or more second routes from the destination sorting center to the destination delivery point are also dynamically planned in real time. Finally, in the question-and-answer module, based on one or more first routes, one or more second routes, and one or more third routes, the route with the lowest delivery cost from the originating delivery point to the destination delivery point is determined.

[0099] The above embodiment first performs real-time dynamic planning on the routing information between the originating delivery point and the originating sorting center, the destination sorting center, and the destination delivery point, and obtains the pre-calculated route center from the originating sorting center to the destination sorting center. Then, based on the routing information from the originating delivery point to the originating sorting center, the destination sorting center, and the destination delivery point, as well as from the originating sorting center to the destination sorting center, the lowest-cost route information from the originating delivery point to the destination delivery point is determined. In this process, since the route information from the originating sorting center to the destination sorting center, which involves the largest amount of data calculation, has already been pre-calculated, the computational load of the entire route calculation process is greatly reduced, thereby improving the calculation speed of the routing information.

[0100] In this embodiment of the application, the above-mentioned routing planning method can be divided into two parts: a pre-calculation stage and a real-time calculation query stage.

[0101] In dynamic logistics networks, pre-computation can reduce the scale of real-time computation and improve computational performance.

[0102] Figure 9 This is a flowchart illustrating a route planning method according to an exemplary embodiment.

[0103] refer to Figure 9 The above-mentioned route planning method may include the following steps.

[0104] Step S902: Obtain the delivery network topology map, which includes the sorting center node.

[0105] The above-mentioned distribution network topology can be a topology determined by the logistics network diagram. For example... Figure 10 As shown, the delivery network topology diagram may include multiple nodes, each node representing a sorting center or a delivery point. Each sorting center may include one or more sorting time periods. Two nodes in the network topology diagram may also include one or more delivery routes, and each delivery route may include a shuttle time period and a shuttle direction.

[0106] In summary, a delivery network topology can be a manually configured topology that can include multiple nodes, with shuttle routes and shuttle times between two nodes.

[0107] Step S904: If the node corresponding to the originating delivery point is determined to be a sorting center node based on the delivery network topology diagram, then the originating delivery point is determined to be the originating sorting center.

[0108] In some embodiments, if the node corresponding to the originating delivery point is determined to be a sorting center node based on the delivery network topology, then the originating delivery point is determined to be the originating sorting center.

[0109] Step S906: If it is determined from the delivery network topology diagram that the node corresponding to the originating delivery point is not a sorting center node, then determine one or more first parent nodes corresponding to the originating delivery point in the delivery network topology diagram.

[0110] In some embodiments, if it is determined from the delivery network topology that the node corresponding to the originating delivery point is not a sorting center node, then one or more first parent nodes corresponding to the originating delivery point are determined in the delivery network topology.

[0111] Step S908: Select one or more sorting centers corresponding to one or more first parent nodes as the originating sorting centers.

[0112] Figure 11 This is a flowchart illustrating a dynamic routing method according to an exemplary embodiment.

[0113] In some embodiments, there are one, two, or more originating sorting centers.

[0114] refer to Figure 11 The dynamic programming method described above may include the following steps.

[0115] Step S1102: Obtain the first dynamic delivery information from the originating delivery point to each originating sorting center.

[0116] The aforementioned dynamic delivery information may include dynamic changes (such as the number of express deliveries at a station) or static logistics configuration information (such as logistics transfer time) corresponding to the originating delivery outlets and each originating sorting center, and this application does not impose any restrictions on this.

[0117] Step S1104: Based on the first dynamic delivery information, plan one or more routes from the originating delivery point to each originating sorting center in real time.

[0118] Step S1106: One or more routes from the originating delivery point to each originating sorting center are designated as one or more first routes, each of which has a corresponding shuttle time period.

[0119] Figure 12 This is a flowchart illustrating a route planning method according to an exemplary embodiment.

[0120] refer to Figure 12 The above-mentioned route planning method may include the following steps.

[0121] Step S1202: Obtain the delivery network topology map, which includes the sorting center node.

[0122] In some embodiments, it is possible to obtain, such as Figure 10 The distribution network topology shown may include sorting center nodes.

[0123] Step S1204: If the node corresponding to the destination delivery point is determined to be a sorting center node according to the delivery network topology diagram, then the destination delivery point is determined to be the destination sorting center.

[0124] Step S1206: If it is determined from the delivery network topology map that the node corresponding to the destination delivery point is not a sorting center node, the reverse delivery network topology map of the delivery network topology map will be determined.

[0125] In some embodiments, if it is determined from the delivery network topology map that the node corresponding to the destination delivery point is not a sorting center node, a reverse delivery network topology map of the delivery network topology map will be determined.

[0126] In some embodiments, the edges of the delivery network topology graph can be reversed to obtain a reverse delivery network topology graph. For example... Figure 13 As shown, the edges of the delivery network topology graph (such as...) can be... Figure 13 Reverse the solid edges in the middle (e.g.) Figure 13(using the dashed edges in the diagram) to obtain the above reverse delivery network topology.

[0127] Step S1208: Determine one or more second parent nodes corresponding to the destination delivery point in the reverse delivery network topology diagram.

[0128] In the reverse delivery network topology diagram, it is only necessary to find the next node of the destination delivery network, which is the second parent node mentioned above.

[0129] In the delivery network topology diagram, the parent node of the destination delivery point can refer to the node preceding the destination delivery point. For example, if there is a path starting from node C and pointing to node D, then node C can be the parent node of node D. Figure 10 As shown, the node corresponding to sorting 4 (i.e., sorting center 4) can be the parent node of the node corresponding to point 2.

[0130] Step S1210: Use one or more second parent nodes as the destination sorting center.

[0131] Figure 14 This is a flowchart illustrating a route planning method according to an exemplary embodiment.

[0132] In some embodiments, there may be one, two, or more destination sorting centers.

[0133] refer to Figure 14 The above-mentioned route planning method may include the following steps.

[0134] Step S1402: Obtain the second dynamic delivery information from each destination sorting center to the destination delivery point.

[0135] Step S1404: Based on the second dynamic delivery information, plan one or more routes from each destination sorting center to the destination delivery point in real time.

[0136] Step S1406: One or more routes from each destination sorting center to the destination distribution point are taken as one or more second routes, and each second route has a corresponding shuttle time period.

[0137] Figure 15 This is a flowchart illustrating a third line pre-calculation method according to an exemplary embodiment.

[0138] refer to Figure 15 The aforementioned method for pre-calculating the third line may include the following steps.

[0139] Step S1502: Obtain the delivery network topology map according to the cycle. The delivery network topology map includes sorting center nodes. Each node includes one or more routes. Each route corresponds to a transfer time period. The sorting center nodes in the delivery network topology map include the originating sorting center node corresponding to the originating sorting center and the destination sorting center node corresponding to the destination sorting center.

[0140] In some embodiments, a delivery network topology map and real-time information of each node in the delivery network topology map can be acquired periodically.

[0141] Step S1504: Determine the routing lines between each pair of sorting center nodes based on the delivery network topology map.

[0142] In some embodiments, the routing lines between each sorting center node can be determined periodically based on the obtained delivery network topology map and the real-time delivery information of each node in the delivery network topology map.

[0143] Step S1506: Pre-store the routing lines between each pair of sorting center nodes so as to determine one or more third lines based on the pre-stored routing lines between each pair of sorting center nodes.

[0144] In some embodiments, routing lines between each pair of sorting center nodes can be pre-stored so that one or more third lines can be determined based on the pre-stored routing lines between each pair of sorting center nodes.

[0145] In some embodiments, the node corresponding to the originating sorting center in the delivery network topology is the originating sorting center node, and the node corresponding to the destination sorting center in the delivery network topology is the destination sorting center node. Therefore, obtaining one or more third routes from the originating sorting center to the destination sorting center can refer to... Figure 16 The illustrated embodiment.

[0146] Figure 16 This is a flowchart illustrating a third route query method according to an exemplary embodiment.

[0147] refer to Figure 16 The above-mentioned third route query method may include the following steps.

[0148] Step S1602: Obtain the pre-stored routing lines between each pair of sorting center nodes.

[0149] Step S1604: Among the routing lines between each pair of sorting center nodes, select all the routes between the originating sorting center node and the destination sorting center node.

[0150] Step S1606: All routes between the originating sorting center node and the destination sorting center node are treated as one or more third routes from the originating sorting center to the destination sorting center.

[0151] This application also provides a route planning method. In this embodiment, the real-time calculation of the original route information can be simplified. For example... Figure 6 As shown, real-time calculation can be broken down into three segments: from the originating delivery point (e.g., point 1 or point 2) to the originating sorting center (e.g., sorting 1), from the originating sorting center to the destination sorting center (e.g., sorting 4), and from the destination sorting center (e.g., sorting 4) to the destination delivery point (e.g., point 5 or point 6), and then added together.

[0152] Then, the routing plan is divided into two stages: a pre-calculation stage and a query stage.

[0153] In the pre-calculation phase, a scheduled task can query the network configuration of the planners from the database and generate a network topology map by combining the sorting center nodes, routes, and shift schedules. For example... Figure 10 As shown, the nodes (network points, sorting) include multiple time period shifts, and the routes between nodes include time period shifts.

[0154] The pre-calculation stage can pre-calculate the path and time cost from the sorting center to all other sorting centers and store it in a cache using a key-value (KV) method. This involves iterating through all shifts at the sorting center and using them as search parameters to calculate the routes and shift information to all other sorting centers.

[0155] The query phase may include the following:

[0156] In response to a routing query request, the following steps can be executed sequentially.

[0157] (1) Calculate the nodes and paths from the originating point to all first sorting nodes in the originating sorting center set in real time using the network topology diagram, i.e., link1(O,Next(O)) in formula (1). Calculate the paths from the destination point to all destination sorting centers in real time using the reverse topology diagram of the network topology diagram, i.e., link3(Pre(D),D) in formula (1).

[0158] Among them, the originating sorting center set is the set of sorting centers whose parent class is a point that can be found with the originating point as the source point; the destination sorting center set is the set of sorting centers whose parent class is a point that can be found by searching the reverse edge with the destination point as the source point; the reverse edge is the edge generated by swapping the start point and the destination point of the forward edge; the reverse topology network is the network formed by the reverse edges.

[0159] (2) Traverse the cache to query the path and time cost corresponding to all link2(Next(O),Pre(D)).

[0160] (3) By calculating the formula link=link1+link2+link3 (as in formula (1)) and the constraints (as in formula (2)), the optimal route is the one with the minimum time cost.

[0161] According to the principles of dynamic programming, the optimal solution to a problem includes the optimal solutions to its subproblems. We only need to ensure that the set of subproblems is complete; in this case, the set of sorting centers represents the boundary of the subproblems.

[0162] It should be particularly noted that the steps in the various embodiments of the above-described routing planning method can be overlapped, substituted, added, or deleted from each other. Therefore, these reasonable permutations and combinations of the routing planning method should also fall within the protection scope of this application, and the protection scope of this application should not be limited to the embodiments.

[0163] Based on the same inventive concept, this application also provides a routing planning device, as shown in the following embodiment. Since the principle by which this device solves the problem is similar to that of the method embodiment described above, the implementation of this device embodiment can refer to the implementation of the method embodiment described above, and repeated details will not be elaborated further.

[0164] Figure 17 This is a block diagram illustrating a route planning apparatus according to an exemplary embodiment. (Refer to...) Figure 17 The routing planning device 1700 provided in this application embodiment may include: a routing query request module 1701, an origin sorting center determination module 1702, a first route determination module 1703, a second route determination module 1704, a third route determination module 1705, and a routing planning module 1706.

[0165] The system includes a route query request module 1701 for obtaining a route query request, which includes an originating delivery point and a destination delivery point; an originating sorting center determination module 1702 for determining the originating sorting center corresponding to the originating delivery point and the destination sorting center corresponding to the destination delivery point; a first route determination module 1703 for real-time dynamic planning of one or more first routes from the originating delivery point to the originating sorting center; a second route determination module 1704 for real-time dynamic planning of one or more second routes from the destination sorting center to the destination delivery point; a third route determination module 1705 for obtaining one or more third routes from the originating sorting center to the destination sorting center, wherein the one or more third routes are predetermined; and a route planning module 1706 for determining the route with the lowest delivery cost from the originating delivery point to the destination delivery point based on one or more first routes, one or more second routes, and one or more third routes.

[0166] It should be noted that the aforementioned route query request module 1701, origin sorting center determination module 1702, first route determination module 1703, second route determination module 1704, third route determination module 1705, and route planning module 1706 correspond to S402 to S412 in the method embodiment. The examples and application scenarios implemented by these modules and their corresponding steps are the same, but they are not limited to the content claimed in the above method embodiment. It should also be noted that these modules, as part of the apparatus, can be executed in a computer system such as a set of computer-executable instructions.

[0167] In some embodiments, the origin sorting center determination module 1702 may include: a delivery network topology map acquisition submodule, an origin sorting center first determination submodule, a first parent node determination submodule, and an origin sorting center second determination submodule.

[0168] The delivery network topology acquisition submodule can be used to acquire a delivery network topology map, which includes sorting center nodes; the originating sorting center first determination submodule can be used to determine the originating delivery point as an originating sorting center if the node corresponding to the originating delivery point is determined to be a sorting center node according to the delivery network topology map; the first parent node determination submodule can be used to determine one or more first parent nodes corresponding to the originating delivery point in the delivery network topology map if the node corresponding to the originating delivery point is not a sorting center node according to the delivery network topology map; the originating sorting center second determination submodule can be used to take one or more sorting centers corresponding to one or more first parent nodes as originating sorting centers.

[0169] In some embodiments, there are one or more originating sorting centers; wherein, the first route determination module 1703 includes: a first dynamic delivery information acquisition submodule, a first planning submodule and a first route determination submodule.

[0170] The first dynamic delivery information acquisition submodule can be used to acquire the first dynamic delivery information from the originating delivery point to each originating sorting center; the first planning submodule can be used to plan one or more routes from the originating delivery point to each originating sorting center in real time based on the first dynamic delivery information; the first route determination submodule can be used to take one or more routes from the originating delivery point to each originating sorting center as one or more first routes, where each first route corresponds to a shuttle time period.

[0171] In some embodiments, the origin sorting center determination module 1702 may include: a second submodule for obtaining the delivery network topology, a second submodule for determining sorting center nodes, a submodule for determining the reverse delivery network topology, a submodule for determining the second parent node, and a submodule for determining the destination sorting center.

[0172] The second submodule for obtaining the delivery network topology can be used to obtain the delivery network topology, which includes sorting center nodes. The second submodule for determining the sorting center nodes can be used to determine the destination delivery point as the destination sorting center if the node corresponding to the destination delivery point is determined to be a sorting center node according to the delivery network topology. The reverse delivery network topology determination submodule can be used to determine the reverse delivery network topology if the node corresponding to the destination delivery point is not a sorting center node according to the delivery network topology. The second parent node determination submodule can be used to determine one or more second parent nodes corresponding to the destination delivery point in the reverse delivery network topology. The destination sorting center determination submodule can be used to select one or more second parent nodes as the destination sorting center.

[0173] In some embodiments, there are one or more destination sorting centers; wherein, the second route determination module 1704 may include: a second dynamic delivery information acquisition submodule, a second real-time planning submodule and a second route determination submodule.

[0174] The second dynamic delivery information acquisition submodule can be used to acquire the second dynamic delivery information from each destination sorting center to the destination delivery point; the second real-time planning submodule can be used to plan one or more routes from each destination sorting center to the destination delivery point in real time based on the second dynamic delivery information; the second route determination submodule can be used to take one or more routes from each destination sorting center to the destination delivery point as one or more second routes, where each second route corresponds to a shuttle time period.

[0175] In some embodiments, the routing planning module 1706 may include a traversal submodule.

[0176] The traversal submodule is used to determine the first target route among one or more first routes, the second target route among one or more second routes, and the third target route among one or more third routes through traversal search operations; wherein the delivery cost generated by the first target route, the second target route, and the third target route is the lowest among all routes from the originating delivery point to the destination delivery point.

[0177] In some embodiments, the routing planning device 1700 may further include: a periodic acquisition module, a routing line planning module, and a storage module.

[0178] The system includes a cycle acquisition module for acquiring the delivery network topology map according to a cycle. The delivery network topology map includes sorting center nodes, and there are one or more routes between each node. Each route corresponds to a transfer time period. The sorting center nodes in the delivery network topology map include the originating sorting center node corresponding to the originating sorting center and the destination sorting center node corresponding to the destination sorting center. The routing planning module is used to determine the routing routes between each pair of sorting center nodes according to the delivery network topology map. The storage module is used to pre-store the routing routes between each pair of sorting center nodes so that one or more third routes can be determined according to the pre-stored routing routes between each pair of sorting center nodes.

[0179] In some embodiments, the node corresponding to the originating sorting center in the delivery network topology is the originating sorting center node, and the node corresponding to the destination sorting center in the delivery network topology is the destination sorting center node; wherein, the third route determination module 1705 may include: a route acquisition submodule, a filtering submodule, and a third route determination submodule.

[0180] The routing acquisition submodule is used to acquire the pre-stored routing lines between each pair of sorting center nodes; the filtering submodule is used to filter out all lines between the originating sorting center node and the destination sorting center node from the routing lines between each pair of sorting center nodes; the third line determination submodule is used to take all the lines between the originating sorting center node and the destination sorting center node as one or more third lines from the originating sorting center to the destination sorting center.

[0181] Since the functions of the device 1700 have been described in detail in their corresponding method embodiments, they will not be repeated here.

[0182] The modules and / or sub-modules described in the embodiments of this application can be implemented in software or hardware. The described modules and / or sub-modules can also be located in a processor. The names of these modules and / or sub-modules do not, in some cases, constitute a limitation on the module and / or sub-module itself.

[0183] The flowcharts and block diagrams in the accompanying drawings illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer program products according to various embodiments of this application. In this regard, each block in a flowchart or block diagram may represent a portion of a module or program segment 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 program instructions.

[0184] Furthermore, the above figures are merely illustrative of the processes included in the method according to exemplary embodiments of this application, and are not intended to be limiting. It is readily understood that the processes shown in the above figures do not indicate or limit the temporal order of these processes. Additionally, it is readily understood that these processes may be executed synchronously or asynchronously, for example, in multiple modules.

[0185] Figure 18 A schematic diagram of an electronic device suitable for implementing embodiments of this application is shown. It should be noted that... Figure 18 The electronic device 1800 shown is merely an example and should not impose any limitation on the functionality and scope of use of the embodiments of this application.

[0186] like Figure 18 As shown, the electronic device 1800 includes a central processing unit (CPU) 1801, which can perform various appropriate actions and processes according to a program stored in a read-only memory (ROM) 1802 or a program loaded from a storage section 1808 into a random access memory (RAM) 1803. The RAM 1803 also stores various programs and data required for the operation of the electronic device 1800. The CPU 1801, ROM 1802, and RAM 1803 are interconnected via a bus 1804. An input / output (I / O) interface 1805 is also connected to the bus 1804.

[0187] The following components are connected to I / O interface 1805: an input section 1806 including a keyboard, mouse, etc.; an output section 1807 including a cathode ray tube (CRT), liquid crystal display (LCD), etc., and speakers, etc.; a storage section 1808 including a hard disk, etc.; and a communication section 1809 including a network interface card such as a LAN card, modem, etc. The communication section 1809 performs communication processing via a network such as the Internet. A drive 1810 is also connected to I / O interface 1805 as needed. Removable media 1811, such as a disk, optical disk, magneto-optical disk, semiconductor memory, etc., are installed on drive 1810 as needed so that computer programs read from them can be installed into storage section 1808 as needed.

[0188] Specifically, according to embodiments of this application, the processes described above with reference to the flowcharts can be implemented as computer software programs. For example, embodiments of this application include a computer program product comprising a computer program carried on a computer-readable storage medium, the computer program containing computer program instructions 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 1809, and / or installed from removable medium 1811. When the computer program is executed by central processing unit (CPU) 1801, it performs the functions defined above in the system of this application.

[0189] It should be noted that the computer-readable storage medium shown in this application 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 application, 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 application, a computer-readable signal medium can include a data signal propagated in baseband or as part of a carrier wave, carrying computer-readable computer program instructions. 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 storage medium other than a computer-readable storage medium, which can send, propagate, or transmit a program for use by or in connection with an instruction execution system, apparatus, or device. Computer program instructions contained on a computer-readable storage medium can be transmitted using any suitable medium, including but not limited to: wireless, wire, optical fiber, RF, etc., or any suitable combination thereof.

[0190] In another aspect, this application also provides a computer-readable storage medium, which may be included in the device described in the above embodiments; or it may exist independently and not assembled into the device. The computer-readable storage medium carries one or more programs that, when executed by the device, enable the device to perform the following functions: obtaining a routing query request, the routing query request including an originating delivery point and a destination delivery point; determining the originating sorting center corresponding to the originating delivery point and the destination sorting center corresponding to the destination delivery point; dynamically planning one or more first routes from the originating delivery point to the originating sorting center in real time; dynamically planning one or more second routes from the destination sorting center to the destination delivery point in real time; obtaining one or more third routes from the originating sorting center to the destination sorting center, the one or more third routes being predetermined; and determining the route with the lowest delivery cost from the originating delivery point to the destination delivery point based on the one or more first routes, the one or more second routes, and the one or more third routes.

[0191] According to one aspect of this application, a computer program product or computer program is provided, comprising computer program instructions stored in a computer-readable storage medium. The computer program instructions are read from the computer-readable storage medium, and a processor executes the computer program instructions to implement the methods provided in various optional implementations of the above embodiments.

[0192] Through the above description of the embodiments, those skilled in the art will readily understand that the exemplary embodiments described herein can be implemented by software or by combining software with necessary hardware. Therefore, the technical solutions of the embodiments of this application can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (such as a CD-ROM, USB flash drive, or portable hard drive) and includes several computer program instructions to cause an electronic device (such as a server or terminal device) to execute the method according to the embodiments of this application.

[0193] Other embodiments of this application will readily occur to those skilled in the art upon consideration of the specification and practice of the application filed herein. This application is intended to cover any variations, uses, or adaptations of this application that follow the general principles of this application and include common knowledge or customary techniques in the art not claimed herein. The specification and embodiments are to be considered exemplary only, and the true scope and spirit of this application are indicated by the claims.

[0194] It should be understood that this application is not limited to the detailed structure, drawing style or implementation method shown herein; on the contrary, this application is intended to cover various modifications and equivalent arrangements contained within the spirit and scope of the appended claims.

Claims

1. A route planning method, characterized in that, include: Obtain a route query request, which includes the originating delivery point and the destination delivery point; Determine the origin sorting center corresponding to the origin delivery point and the destination sorting center corresponding to the destination delivery point; Real-time dynamic planning of one or more first routes from the originating delivery point to the originating sorting center; Real-time dynamic planning of one or more second routes from the destination sorting center to the destination distribution point; Obtain one or more third routes from the originating sorting center to the destination sorting center, wherein the one or more third routes are predetermined; Based on the one or more first routes, the one or more second routes, and the one or more third routes, determine the route with the lowest delivery cost from the originating delivery point to the destination delivery point.

2. The method according to claim 1, characterized in that, Determining the originating sorting center corresponding to the originating delivery point includes: Obtain a delivery network topology map, which includes sorting center nodes; If the node corresponding to the originating delivery point is determined to be a sorting center node based on the delivery network topology diagram, then the originating delivery point is determined to be the originating sorting center. If it is determined from the delivery network topology diagram that the node corresponding to the originating delivery point is not a sorting center node, then one or more first parent nodes corresponding to the originating delivery point are determined in the delivery network topology diagram. The sorting center corresponding to one or more of the first parent nodes is used as the originating sorting center.

3. The method according to claim 1, characterized in that, The originating sorting center can be one or more; wherein, the real-time dynamic planning of one or more first routes from the originating delivery point to the originating sorting center includes: Obtain the first dynamic delivery information from the originating delivery point to each originating sorting center; Based on the first dynamic delivery information, one or more routes from the originating delivery point to each originating sorting center are planned in real time. One or more routes from the originating delivery point to each originating sorting center are referred to as one or more first routes, and each first route corresponds to a shuttle time period.

4. The method according to claim 1, characterized in that, Determining the destination sorting center corresponding to the destination delivery point includes: Obtain a delivery network topology map, which includes sorting center nodes; If the node corresponding to the destination delivery point is determined to be a sorting center node based on the delivery network topology diagram, then the destination delivery point is determined to be the destination sorting center. If it is determined from the delivery network topology diagram that the node corresponding to the destination delivery point is not a sorting center node, the reverse delivery network topology diagram of the delivery network topology diagram will be determined. In the reverse delivery network topology diagram, determine one or more second parent nodes corresponding to the destination delivery point; The one or more second parent nodes are used as the destination sorting center.

5. The method according to claim 1, characterized in that, The destination sorting center can be one or more; wherein, the real-time dynamic planning of one or more second routes from the destination sorting center to the destination distribution point includes: Obtain second dynamic delivery information from each destination sorting center to the destination delivery point; Based on the second dynamic delivery information, one or more routes from each destination sorting center to the destination delivery point are planned in real time; One or more routes from each destination sorting center to the destination distribution point are referred to as one or more second routes, wherein each second route corresponds to a shuttle time period.

6. The method according to claim 1, characterized in that, Based on the one or more first routes, the one or more second routes, and the one or more third routes, determine the route with the lowest delivery cost from the originating delivery point to the destination delivery point, including: The first target route is determined from one or more first routes, the second target route is determined from one or more second routes, and the third target route is determined from one or more third routes through a traversal search operation. Among all routes from the originating delivery point to the destination delivery point, the delivery costs generated by the first target route, the second target route, and the third target route are the lowest.

7. The method according to claim 1, characterized in that, The method further includes: The delivery network topology map is obtained according to the cycle. The delivery network topology map includes sorting center nodes. Each node includes one or more routes. Each route corresponds to a transfer time period. The sorting center nodes in the delivery network topology map include the originating sorting center node corresponding to the originating sorting center and the destination sorting center node corresponding to the destination sorting center. Determine the routing lines between each pair of sorting center nodes based on the aforementioned delivery network topology diagram; The routing lines between each pair of sorting center nodes are pre-stored so that one or more third lines can be determined based on the pre-stored routing lines between each pair of sorting center nodes.

8. A route planning device, characterized in that, include: The routing query request module is used to obtain a routing query request, which includes the originating delivery point and the destination delivery point; The origin sorting center determination module is used to determine the origin sorting center corresponding to the origin delivery point and the destination sorting center corresponding to the destination delivery point; The first route determination module is used to dynamically plan one or more first routes from the originating delivery point to the originating sorting center in real time. The second route determination module is used to dynamically plan one or more second routes from the destination sorting center to the destination distribution point in real time. The third route determination module is used to obtain one or more third routes from the originating sorting center to the destination sorting center, wherein the one or more third routes are predetermined. The routing planning module is used to determine the route with the lowest delivery cost from the originating delivery point to the destination delivery point based on one or more first routes, one or more second routes, and one or more third routes.

9. An electronic device, characterized in that, include: Memory and processor; The memory is used to store computer program instructions; the processor calls the computer program instructions stored in the memory to implement the routing planning method as described in any one of claims 1-7.

10. A computer-readable storage medium storing computer program instructions thereon, characterized in that, When the computer program instructions are executed by the processor, they implement the routing planning method as described in any one of claims 1-7.

Images