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

Abstract

The invention provides a route 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: acquiring an initial distribution network point and a target distribution network point; determining a starting sorting center corresponding to the starting distribution network point and a target sorting center corresponding to the target distribution network point; dynamically planning one or more first routes from the starting distribution network point to the starting sorting center in real time; dynamically planning one or more second routes from the target sorting center to the target distribution network point in real time; obtaining one or more third lines from the starting sorting center to the target sorting center; and according to the one or more first lines, the one or more second lines and the one or more third lines, determining a corresponding routing line with the lowest distribution cost from the originating distribution network point to the destination distribution network point. According to the embodiment of the invention, the corresponding routing line with the lowest cost from the originating distribution network point to the destination distribution network point can be quickly and accurately determined.

Description

Technical Field

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

[0002] This section is intended to provide a background or context to the embodiments of the application that are recited in the claims. No description herein is admitted to be prior art by inclusion in this section.

[0003] The efficient flow of tens of millions of packages every day is carried out according to the logistics network built by network planners. In logistics production scenarios, the routing information of a package needs to be provided to merchants, workstations, or couriers in real time. In actual logistics production scenarios, the calculation of routing information has very high real-time performance requirements, usually within tens of milliseconds.

[0004] The current logistics network contains multiple dimensions such as nodes, edges, shifts, time, network types, etc. Therefore, the computing space for real-time computing in a logistics network is very large, the real-time computing time is long, and it is impossible 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 the present application is to provide a routing planning method, device, electronic device and computer-readable storage medium, which can improve the calculation speed of routing information.

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

[0008] An embodiment of the present application provides a route planning method, comprising: obtaining a route query request, the route query request including an originating distribution network point and a destination distribution network point; determining an originating sorting center corresponding to the originating distribution network point and a destination sorting center corresponding to the destination distribution network point; dynamically planning one or more first routes from the originating distribution network point to the originating sorting center in real time; dynamically planning one or more second routes from the destination sorting center to the destination distribution network 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, based on the one or more first routes, the one or more second routes and the one or more third routes, a route with the lowest distribution cost corresponding to the originating distribution network point to the destination distribution network point.

[0009] In some embodiments, determining the originating sorting center corresponding to the originating distribution network point includes: obtaining a distribution network topology map, the distribution network topology map including a sorting center node; if it is determined according to the distribution network topology map that the node corresponding to the originating distribution network point is a sorting center node, then determining the originating distribution network point as the originating sorting center; if it is determined according to the distribution network topology map that the node corresponding to the originating distribution network point is not a sorting center node, then determining one or more first parent nodes corresponding to the originating distribution network point in the distribution network topology map; and using one or more sorting centers corresponding to the one or more first parent nodes 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 distribution outlet to the originating sorting center comprises: obtaining first dynamic distribution information from the originating distribution outlet to each originating sorting center; planning one or more routes from the originating distribution outlet to each originating sorting center in real time according to the first dynamic distribution information; and using one or more routes from the originating distribution outlet to each originating sorting center as the one or more first routes, wherein each first route corresponds to a ferry time period.

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

[0012] In some embodiments, there are one or more destination sorting centers; wherein, real-time dynamic planning of one or more second routes from the destination sorting center to the destination delivery outlet comprises: obtaining second dynamic delivery information from each destination sorting center to the destination delivery outlet; planning one or more routes from each destination sorting center to the destination delivery outlet in real time according to the second dynamic delivery information; and using one or more routes from each destination sorting center to the destination delivery outlet as the one or more second routes, wherein each second route corresponds to a ferry time period.

[0013] In some embodiments, determining the routing 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 from the one or more first routes, determining a second target route from the one or more second routes, and determining a third target route from the one or more third routes through a traversal search operation; wherein the delivery costs generated by the first target route, the second target route and the third target route are 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 distribution network topology map according to a period, the distribution network topology map including sorting center nodes, each node including one or more routes, each route corresponding to a ferry time period, the sorting center nodes in the distribution network topology map including an originating sorting center node corresponding to the originating sorting center and a destination sorting center node corresponding to the destination sorting center; determining routing routes between each of the sorting center nodes according to the distribution network topology map; pre-storing the routing routes between each of the sorting center nodes, so as to determine the one or more third routes according to the pre-stored routing routes between each of the sorting center nodes.

[0015] In some embodiments, the node corresponding to the originating sorting center in the distribution network topology diagram is the originating sorting center node, and the node corresponding to the destination sorting center in the distribution network topology diagram 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 routes between the sorting center nodes; screening out all routes between the originating sorting center node and the destination sorting center node from the routing routes between the 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] The embodiment of the present application provides a route planning device, including: a route query request module, an originating sorting center determination module, a first line determination module, a second line determination module, a third line determination module and a route line planning module.

[0017] Among them, the routing query request module is used to obtain a routing query request, and the routing query request includes an originating distribution network point and a destination distribution network point; the originating sorting center determination module can be used to determine the originating sorting center corresponding to the originating distribution network point and the destination sorting center corresponding to the destination distribution network point; the first line determination module can be used to dynamically plan one or more first lines from the originating distribution network point to the originating sorting center in real time; the second line determination module can be used to dynamically plan one or more second lines from the destination sorting center to the destination distribution network point in real time; the third line determination module can be used to obtain one or more third lines from the originating sorting center to the destination sorting center, and the one or more third lines are predetermined; the routing line planning module can be used to determine the routing line with the lowest distribution cost from the originating distribution network point to the destination distribution network point according to the one or more first lines, the one or more second lines and the one or more third lines.

[0018] An embodiment of the present application proposes an electronic device, which includes: a memory and a processor; the memory is used to store computer program instructions; the processor calls the computer program instructions stored in the memory to implement any of the above-mentioned routing planning methods.

[0019] An embodiment of the present application provides a computer-readable storage medium on which computer program instructions are stored to implement a routing planning method as described in any one of the above items.

[0020] The embodiment of the present application provides a computer program product or a computer program, which includes 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 above-mentioned route planning method.

[0021] The route planning method, device, electronic device and computer-readable storage medium provided in the embodiment of the present application first perform real-time dynamic planning of the route information between the originating distribution network point to the originating sorting center, the destination sorting center and the destination distribution network point, and obtain the route center that has been calculated from the originating sorting center to the destination sorting center; then determine the route information with the lowest cost corresponding to the originating distribution network point to the destination distribution network point based on the route information from the originating distribution network point to the originating sorting center, the destination sorting center and the destination distribution network point, and the originating sorting center to the destination sorting center. In this process, since the route information from the originating sorting center to the destination sorting center, which has the largest amount of data calculation, has been calculated in advance, the amount of calculation of the entire route calculation process is greatly reduced, thereby improving the calculation speed of the route information.

[0022] It should be understood that the foregoing general description and the following detailed description are exemplary only and are not restrictive of the present application. BRIEF DESCRIPTION OF THE DRAWINGS

[0023] The drawings herein are incorporated into the specification and constitute a part of the specification, illustrate embodiments consistent with the present application, and together with the specification are used to explain the principles of the present application. Obviously, the drawings described below are only some embodiments of the present application, and for ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work.

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

[0025] Figure 2 The figure is a schematic diagram showing routing information according to an exemplary embodiment.

[0026] Figure 3 A scenario schematic diagram of a routing planning method or a routing planning device that can be applied to an embodiment of the present application is shown.

[0027] Figure 4 The present invention is a flowchart of a route planning method according to an exemplary embodiment.

[0028] Figure 5 The figure is a schematic diagram of site entry and exit according to an exemplary embodiment.

[0029] Figure 6 The figure is a schematic diagram of route splitting according to an exemplary embodiment.

[0030] Figure 7 The figure is a schematic diagram of route splitting according to an exemplary embodiment.

[0031] Figure 8 It is a structural schematic diagram corresponding to a routing method according to an exemplary embodiment.

[0032] Fig. 9 The present invention is a flowchart of a route planning method according to an exemplary embodiment.

[0033] Fig.10 The diagram is a schematic diagram of a distribution network topology diagram according to an exemplary embodiment.

[0034] Fig.11 The figure is a flow chart of a method for dynamic routing planning according to an exemplary embodiment.

[0035] Fig.12 The present invention is a flowchart of a route planning method according to an exemplary embodiment.

[0036] Fig.13 is a schematic diagram of a reverse edge according to an exemplary embodiment.

[0037] Fig.14 The present invention is a flowchart of a route planning method according to an exemplary embodiment.

[0038] Fig.15 The figure is a flowchart of a third line pre-calculation method according to an exemplary embodiment.

[0039] Fig.16 The figure is a flowchart of a third line query method according to an exemplary embodiment.

[0040] Fig.17 The figure is a block diagram of a route planning device according to an exemplary embodiment.

[0041] Fig.18 A schematic diagram of the structure of an electronic device suitable for implementing the embodiments of the present application is shown. DETAILED DESCRIPTION

[0042] Example embodiments will now be described more fully with reference to the accompanying drawings. However, example embodiments can be implemented in many forms and should not be construed as limited to the embodiments set forth herein; rather, these embodiments are provided so that this application will be comprehensive and complete and will fully convey the concepts of the example embodiments to those skilled in the art. The same reference numerals in the figures represent the same or similar parts, and thus their repeated description will be omitted.

[0043] Those skilled in the art know that the implementation of the present application can be a system, device, equipment, method or computer program product. Therefore, the present application can be specifically implemented in the following forms, namely: complete hardware, complete software (including firmware, resident software, microcode, etc.), or a combination of hardware and software.

[0044] Features, structures or characteristics described in the present application may be combined in one or more embodiments in any suitable manner. In the following description, many specific details are provided to provide a full understanding of the embodiments of the present application. However, those skilled in the art will appreciate that the technical solution of the present application may be put into practice and one or more of the specific details may be omitted, or other methods, components, devices, steps, etc. may be adopted. In other cases, known methods, devices, implementations or operations are not shown or described in detail to avoid blurring the various aspects of the present application.

[0045] The accompanying drawings are only schematic diagrams of the present application. The same reference numerals in the drawings represent the same or similar parts, and thus their repeated description will be omitted. Some block diagrams shown in the accompanying drawings do not necessarily correspond to physically or logically independent entities. These functional entities can be implemented in software form, or in one or more hardware modules or integrated circuits, or in different networks and / or processor devices and / or microcontroller devices.

[0046] The flowcharts shown in the accompanying drawings are only exemplary and do not necessarily include all the contents and steps, nor must they be executed in the order described. For example, some steps can be decomposed, and some steps can be combined or partially combined, so the actual execution order may change according to actual conditions.

[0047] In the description of this application, unless otherwise specified, " / " means "or", for example, A / B can mean A or B. "And / or" in this article is only a kind of association relationship that describes the associated objects, indicating that there can be three relationships. For example, A and / or B can mean: A exists alone, A and B exist at the same time, and B exists alone. In addition, "one or more" means one or more, and "multiple" means two or more. The words "first", "second", etc. do not limit the quantity and execution order, and the words "first", "second", etc. do not limit them to be different; the terms "comprising", "including" and "having" are used to express the meaning of open inclusion and mean that in addition to the listed elements / components / etc., there may be other elements / components / etc.

[0048] In order to more clearly understand the above-mentioned objects, features and advantages of the present invention, the present invention is further described in detail below in conjunction with the accompanying drawings and specific implementation methods. It should be noted that the embodiments of the present application and the features in the embodiments can be combined with each other without conflict.

[0049] It should be noted that the collection, collection, updating, analysis, processing, use, transmission, storage and other aspects of user personal information involved in the technical solution of this application are in compliance 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 for user personal information to prevent illegal access to user personal information data and maintain the security of user personal information and network security.

[0050] The efficient flow of tens of millions of packages every day is carried out according to the logistics network built by network planners. The flow goals can be a variety of personalized options such as the fastest timeliness, economic timeliness, and optimal timeliness. Figure 1 shown.

[0051] Usually, a corresponding network topology diagram is established to address this problem. The BFS (Breadth First Search) or DFS (Depth First Search) search algorithm is used to perform global real-time calculation of the optimal package route, and finally obtain the route information of a package or express, which may include key information such as nodes, time, and shifts.

[0052] In the logistics production scenario, the routing information (such as Figure 2 As shown in the figure, the data is provided to merchants, workstations, courier apps, etc. in real time. The real-time performance requirements are very high, and the performance SLA (service-level agreement) is within 50ms.

[0053] The current logistics network includes multiple dimensions such as nodes, edges, shifts, time, and network types. The number of nodes is 100,000, the number of edges is 1 million (including the time dimension), the network type is 10, and the time dimension is 7-14 days. Therefore, the computing space is very large, the real-time computing time is long, and it is impossible to provide fast online services at the millisecond level.

[0054] In response to the above technical problems, the solution provided by this application finds the super nodes in the network by analyzing the network structure, and then pre-calculates and caches the optimal path between the super nodes through pre-calculation; the principle of dynamic programming is adopted to reduce the computing space of the real-time calculation by decomposing the original real-time calculation into three-stage calculation and adding them together, so as to improve the real-time calculation performance.

[0055] The exemplary implementation scheme of the present application is described in detail below with reference to the accompanying drawings.

[0056] Figure 3 A scenario schematic diagram of a routing planning method or a routing planning device that can be applied to an embodiment of the present application is shown.

[0057] Please refer to Figure 3 , which shows a schematic diagram of an implementation environment provided by an exemplary embodiment of the present application.

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

[0059] Users can use terminal devices 101, 102, 103 to interact with server 105 through network 104 to receive or send messages, etc. Terminal devices 101, 102, 103 can be various electronic devices with display screens and supporting web browsing, including but not limited to smart phones, tablet computers, laptop computers, desktop computers, wearable devices, virtual reality devices, smart homes, etc.

[0060] The server 105 may be a server that provides various services, such as a background management server that provides support for devices operated by users using the terminal devices 101, 102, and 103. The background management server may analyze and process the received request data, and feed back the processing results to the terminal device.

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

[0062] The server 105 may, for example, obtain a routing query request, which includes an originating distribution network point and a destination distribution network point; the server 105 may, for example, determine an originating sorting center corresponding to the originating distribution network point and a destination sorting center corresponding to the destination distribution network point; the server 105 may, for example, dynamically plan one or more first routes from the originating distribution network point to the originating sorting center in real time; the server 105 may, for example, dynamically plan one or more second routes from the destination sorting center to the destination distribution network point in real time; the server 105 may, for example, obtain one or more third routes from the originating sorting center to the destination sorting center, and the one or more third routes are predetermined; the server 105 may, for example, determine the routing route with the lowest distribution cost from the originating distribution network point to the destination distribution network 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 in the figure is only for illustration. The server 105 may be a physical server or may be composed of multiple servers. According to actual needs, it may have any number of terminal devices, networks and servers.

[0064] Under the above system architecture, a routing planning method is provided in an embodiment of the present application, and the method can be executed by any electronic device with computing and processing capabilities.

[0065] The method provided in the embodiment of the present application can be executed by any electronic device with computing and processing capabilities. For example, the method can be executed by the above Figure 3 The server or terminal device in the embodiment may be executed, or the server and the terminal device may be executed together. In the following embodiments, the server is used as the execution subject for illustration, but the present application is not limited to this.

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

[0067] Step S402: Obtain a routing query request, where the routing query request includes an originating distribution point and a destination distribution point.

[0068] The above-mentioned originating distribution network point may refer to the originating station of the express or package, and the destination distribution network point may refer to the destination station of the express or package.

[0069] The site may refer to a location that can receive, send or sort express deliveries (or parcels).

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

[0071] The real-time routing information may refer to routing information dynamically determined in combination with real-time package delivery information in the logistics network.

[0072] Step S404, determining the originating sorting center corresponding to the originating distribution network point and the destination sorting center corresponding to the destination distribution network point.

[0073] The sites in the logistics network can be divided into sorting centers and distribution outlets according to their functions, where the sorting centers are used to sort and transport express deliveries or parcels, and the distribution outlets are used to collect and deliver express deliveries or parcels.

[0074] In some embodiments, the distribution outlet may also be a sorting center, which is not limited in this application.

[0075] In some embodiments, the sorting center can be directly distributed in the logistics network based on experience, or a super node can be determined as the sorting center through the following method.

[0076] In some embodiments, the logistics network system (such as Figure 5 As shown in the figure, the in-out edges of each station are statistically analyzed, and then the stations with in-out edges exceeding the preset threshold are regarded as super stations, and the stations with in-out edges not exceeding the preset threshold are regarded as ordinary stations. The super stations with more in-out edges can be used as sorting centers.

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

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

[0079] In some embodiments, the real-time calculation of the original routing information can be simplified. Figure 6 As shown, the real-time calculation can be divided into three stages: the calculation from the originating distribution outlet (such as outlet 1 or outlet 2) to the originating sorting center (such as sorting 1), the calculation from the originating sorting center to the destination sorting center (such as sorting 4), and the calculation from the destination sorting center (such as sorting 4) to the destination distribution outlet (such as outlet 5 or outlet 6).

[0080] The 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] Wherein, O represents the originating distribution network, D represents the destination distribution network, Next(O) represents the originating sorting center corresponding to the originating distribution network O, Pre(D) represents the destination sorting center corresponding to the destination distribution network D, P represents other sorting centers between the originating sorting center and the destination sorting center, and i is an integer greater than or equal to 1. link1(O,Next(O)) represents the route from the originating distribution network 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 distribution network. P i.departTime >P i.neigb.arrvieTime Represents the courier leaving the i-th sorting center P i Time P i.departTime Later than P iThe express delivery of the adjacent station arrives at station P i Time P i.neigb.arrvieTime .

[0085] Link1 and link3 are small network real-time calculations, and link2 is pre-calculated for real-time query.

[0086] Step S406: Real-time dynamic planning of one or more first routes from the originating distribution outlet to the originating sorting center.

[0087] In some embodiments, in response to a route query request, one or more first routes from an originating distribution outlet to an originating sorting center may be dynamically planned in real time based on site information in a logistics network.

[0088] Each site in the logistics network may have real-time express quantity, departure time, sorting time, etc. The real-time information of each site may be dynamically planned to determine one or more first routes from the originating distribution outlet to the originating sorting center.

[0089] Step S408: dynamically plan one or more second routes from the destination sorting center to the destination distribution outlet in real time.

[0090] In some embodiments, in response to a route query request, one or more first routes from a destination sorting center to a destination distribution point may be dynamically planned in real time according to site information in a logistics network.

[0091] Each site in the logistics network may have real-time express quantity, departure time, sorting time, etc. The real-time information of each site may be dynamically planned to determine one or more first routes from the destination distribution point to the destination sorting center.

[0092] Step S410, obtaining one or more third routes from the originating sorting center to the destination sorting center, where the one or more third routes are predetermined.

[0093] In some embodiments, there are a large number of sorting centers in the logistics network. If the routes between the sorting centers are calculated in real time, this places strong demands on real-time computing capabilities and reduces real-time computing efficiency.

[0094] Therefore, you can consider calculating all the routes between sorting centers in advance, and then query them directly when needed.

[0095] Step S412: determining a routing route with the lowest delivery cost from the originating delivery network point to the destination delivery network point according to the one or more first routes, the one or more second routes and the one or more third routes.

[0096] In some embodiments, a first target route can be determined from one or more first routes, a second target route can be determined from one or more second routes, and a third target route can be determined from one or more third routes through a traversal search operation, so that the delivery costs generated by the first target route, the second target route, and the third target route are the lowest delivery costs among all routes from the originating delivery outlet to the destination delivery outlet. The lowest delivery cost can refer to the lowest time cost, the lowest route length cost, the highest revenue, or other, which is not limited in this application.

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

[0098] refer to Figure 8 When the user submits a route query request through the webpage module, one or more third routes from the predetermined originating sorting center to the destination sorting center can be obtained from the preprocessing module; then one or more first routes from the originating distribution outlet to the originating sorting center are dynamically planned in real time through the full configuration data, and one or more second routes from the destination sorting center to the destination distribution outlet are dynamically planned in real time; finally, in the question-and-answer module, the route with the lowest distribution cost corresponding to the originating distribution outlet to the destination distribution outlet is determined according to one or more first routes, one or more second routes and one or more third routes.

[0099] In the above embodiment, the routing information between the originating distribution network point and the originating sorting center, the destination sorting center and the destination distribution network point can be firstly dynamically planned in real time, and the routing center that has been calculated from the originating sorting center to the destination sorting center can be obtained; then, the routing information with the lowest cost corresponding to the originating distribution network point to the destination distribution network point can be determined according to the routing information from the originating distribution network point to the originating sorting center, the destination sorting center and the destination distribution network point, and the originating sorting center to the destination sorting center. In this process, since the routing information from the originating sorting center to the destination sorting center, which has the largest amount of data calculation, has been calculated in advance, the amount of calculation of the entire routing calculation process is greatly reduced, thereby improving the calculation speed of the routing information.

[0100] In the embodiment of the present 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] Among them, in dynamic logistics networks, pre-computation can be used to reduce the scale of real-time computing and improve computing performance.

[0102] Fig. 9 The present invention is a flowchart of a route planning method according to an exemplary embodiment.

[0103] refer to Fig. 9 , the above-mentioned routing planning method may include the following steps.

[0104] Step S902, obtaining a distribution network topology map, the distribution network topology map includes a sorting center node.

[0105] The above distribution network topology diagram can be a topology diagram determined by the logistics network diagram. Fig.10 As shown, the distribution network topology diagram may include multiple nodes, each node represents a sorting center or a distribution outlet, each sorting center may include one or more sorting time periods, and the two nodes in the network topology diagram may also include one or more distribution routes, and each distribution route may include a ferrying time period and a ferrying direction.

[0106] In summary, the distribution network topology diagram may be a topology structure diagram configured manually, and the topology structure diagram may include multiple nodes, and the ferry routes and ferry times may be included between two nodes.

[0107] Step S904: if it is determined according to the distribution network topology that the node corresponding to the originating distribution network point is a sorting center node, the originating distribution network point is determined to be the originating sorting center.

[0108] In some embodiments, if it is determined according to the distribution network topology diagram that the node corresponding to the originating distribution network point is a sorting center node, then the originating distribution network point is determined to be the originating sorting center.

[0109] Step S906: If it is determined according to the distribution network topology graph that the node corresponding to the originating distribution network point is not a sorting center node, one or more first parent nodes corresponding to the originating distribution network point are determined in the distribution network topology graph.

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

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

[0112] Fig.11 The figure is a flow chart of a method for dynamic routing planning according to an exemplary embodiment.

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

[0114] refer to Fig.11 , the above dynamic programming method may include the following steps.

[0115] Step S1102, obtaining first dynamic delivery information from the originating delivery outlet to each originating sorting center.

[0116] The above-mentioned dynamic distribution information may include the logistics configuration information corresponding to the originating distribution outlets and each originating sorting center, which has dynamic changes (such as the number of express deliveries at a site) or static changes (such as logistics ferry time), etc. This application does not impose any restrictions on this.

[0117] Step S1104: planning one or more routes from the originating distribution outlets to each originating sorting center in real time according to the first dynamic distribution information.

[0118] Step S1106: one or more routes from the originating distribution outlet to each originating sorting center are used as one or more first routes, wherein each first route corresponds to a ferry time period.

[0119] Fig.12 The present invention is a flowchart of a route planning method according to an exemplary embodiment.

[0120] refer to Fig.12 , the above-mentioned routing planning method may include the following steps.

[0121] Step S1202, obtaining a distribution network topology map, the distribution network topology map includes a sorting center node.

[0122] In some embodiments, the following may be obtained: Fig.10 The distribution network topology diagram shown may include a sorting center node.

[0123] Step S1204: if it is determined according to the distribution network topology that the node corresponding to the destination distribution network point is a sorting center node, then the destination distribution network point is determined to be the destination sorting center.

[0124] Step S1206: If it is determined according to the distribution network topology that the node corresponding to the destination distribution network point is not a sorting center node, a reverse distribution network topology of the distribution network topology is determined.

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

[0126] In some embodiments, the edges of the distribution network topology graph may be processed in reverse order to obtain a reverse distribution network topology graph. Fig.13 As shown, the distribution network topology graph edges (such as Fig.13 The solid edges in Fig.13The dotted edge in the figure) is used to obtain the above reverse distribution network topology diagram.

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

[0128] In the reverse distribution network topology diagram, we only need to find the next node of the destination distribution network, which can be the second parent node mentioned above.

[0129] In the distribution network topology diagram, the parent node of the destination distribution point can refer to the previous node of the destination distribution 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. Fig.10 As shown, the node corresponding to sorting 4 (ie, sorting center 4) can be the parent node of the node corresponding to network point 2.

[0130] Step S1210: taking one or more second parent class nodes as destination sorting centers.

[0131] Fig.14 The present invention is a flowchart of a route planning method according to an exemplary embodiment.

[0132] In some embodiments, the number of destination sorting centers is one, two, or more.

[0133] refer to Fig.14 , the above-mentioned routing planning method may include the following steps.

[0134] Step S1402, obtaining second dynamic delivery information from each destination sorting center to the destination delivery outlet.

[0135] Step S1404: planning one or more routes from each destination sorting center to a destination delivery point in real time according to the second dynamic delivery information.

[0136] Step S1406: one or more routes from each destination sorting center to the destination distribution outlet are used as one or more second routes, wherein each second route corresponds to a ferry time period.

[0137] Fig.15 The figure is a flowchart of a third line pre-calculation method according to an exemplary embodiment.

[0138] refer to Fig.15 , the above-mentioned third line pre-calculation method may include the following steps.

[0139] Step S1502, obtaining a distribution network topology map according to a period, the distribution network topology map includes sorting center nodes, each node includes one or more routes, each route corresponds to a ferry time period, and the sorting center nodes in the distribution network topology map include an originating sorting center node corresponding to the originating sorting center and a destination sorting center node corresponding to the destination sorting center.

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

[0141] Step S1504, determining the routing lines between each sorting center node according to the distribution network topology diagram.

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

[0143] Step S1506: pre-store the routing routes between the sorting center nodes, so as to determine one or more third routes according to the pre-stored routing routes between the sorting center nodes.

[0144] In some embodiments, routing routes between two sorting center nodes may be pre-stored, so that one or more third routes are determined based on the pre-stored routing routes between two sorting center nodes.

[0145] In some embodiments, the node corresponding to the originating sorting center in the distribution network topology diagram is the originating sorting center node, and the node corresponding to the destination sorting center in the distribution network topology diagram is the destination sorting center node. Then, obtaining one or more third routes from the originating sorting center to the destination sorting center can refer to Fig.16 The embodiment shown.

[0146] Fig.16 The figure is a flowchart of a third line query method according to an exemplary embodiment.

[0147] refer to Fig.16 , the above-mentioned third line query method may include the following steps.

[0148] Step S1602, obtaining pre-stored routing lines between two sorting center nodes.

[0149] Step S1604, among the routing lines between the sorting center nodes, all lines between the originating sorting center node and the destination sorting center node are screened out.

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

[0151] The present application also provides a routing planning method. In this embodiment, the real-time calculation of the original routing information can be simplified. Figure 6 As shown, the real-time calculation can be divided into three stages: the calculation from the originating distribution outlet (such as outlet 1 or outlet 2) to the originating sorting center (such as sorting 1), the calculation from the originating sorting center to the destination sorting center (such as sorting 4), and the calculation from the destination sorting center (such as sorting 4) to the destination distribution outlet (such as outlet 5 or outlet 6).

[0152] Then the routing planning is divided into two stages, one is the pre-calculation stage and the other is the query stage.

[0153] In the pre-calculation stage, the network configuration of the planner can be queried from the database through a scheduled task, and the sorting center nodes, routes, time shifts, etc. can be used to generate a network topology diagram. Fig.10 As shown, the nodes: outlets, sorting include working shifts in multiple time periods, and the lines between nodes include working shifts in time periods.

[0154] In the pre-calculation phase, the path and time cost from the sorting center to all other sorting centers can be pre-calculated and stored in the cache in the form of KV. That is, all the shifts of the sorting center are traversed and used as search input to calculate the route and shift information to all other sorting centers.

[0155] The query phase may include the following contents.

[0156] In response to the route query request, the following steps may be performed in sequence.

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

[0158] Among them, the originating sorting center set: the set of sorting centers whose parent class is the network point that can be found by taking the originating network point as the source point; the destination sorting center set: the set of sorting centers whose parent class is the network point that can be found by searching for reverse edges with the destination network point as the source point; reverse edge: the edge generated by exchanging the starting point and the destination point of the forward edge; reverse topology network: the network composed of reverse edges.

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

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

[0161] According to the principle of dynamic programming, the optimal solution to a problem contains the optimal solution to the subproblem. It only needs to ensure that the set of subproblems is not missed, and the first set of sorting centers is the boundary of the subproblem.

[0162] It should be particularly noted that the various steps in the various embodiments of the above-mentioned routing planning method can be mutually crossed, replaced, added, or deleted. 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, the present application also provides a route planning device in the following embodiments. Since the principle of solving the problem in the device embodiment is similar to that in the above method embodiment, the implementation of the device embodiment can refer to the implementation of the above method embodiment, and the repeated parts will not be repeated.

[0164] Fig.17 is a block diagram of a route planning device according to an exemplary embodiment. Fig.17 The route planning device 1700 provided in the embodiment of the present application may include: a route query request module 1701, an originating sorting center determination module 1702, a first line determination module 1703, a second line determination module 1704, a third line determination module 1705 and a route line planning module 1706.

[0165] Among them, the routing query request module 1701 can be used to obtain a routing query request, which includes an originating distribution outlet and a destination distribution outlet; the originating sorting center determination module 1702 can be used to determine the originating sorting center corresponding to the originating distribution outlet and the destination sorting center corresponding to the destination distribution outlet; the first line determination module 1703 can be used to dynamically plan one or more first lines from the originating distribution outlet to the originating sorting center in real time; the second line determination module 1704 can be used to dynamically plan one or more second lines from the destination sorting center to the destination distribution outlet in real time; the third line determination module 1705 can be used to obtain one or more third lines from the originating sorting center to the destination sorting center, and one or more third lines are predetermined; the routing line planning module 1706 can be used to determine the routing line with the lowest distribution cost corresponding to the originating distribution outlet to the destination distribution outlet based on one or more first lines, one or more second lines and one or more third lines.

[0166] It should be noted that the above-mentioned route query request module 1701, the originating sorting center determination module 1702, the first line determination module 1703, the second line determination module 1704, the third line determination module 1705, and the route line planning module 1706 correspond to S402 to S412 in the method embodiment, and the above-mentioned modules and the corresponding steps are implemented in the same examples and application scenarios, but are not limited to the content applied for in the above-mentioned method embodiment. It should be noted that the above-mentioned modules as part of the device can be executed in a computer system such as a set of computer executable instructions.

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

[0168] Among them, the distribution network topology map acquisition submodule can be used to obtain the distribution network topology map, and the distribution network topology map includes sorting center nodes; the originating sorting center first determination submodule can be used to determine the originating distribution network point as the originating sorting center if the node corresponding to the originating distribution network point is determined to be the sorting center node according to the distribution network topology map; the first parent class node determination submodule can be used to determine one or more first parent class nodes corresponding to the originating distribution network point in the distribution network topology map if the node corresponding to the originating distribution network point is determined to be not the sorting center node according to the distribution network topology map; the originating sorting center second determination submodule can be used to use one or more sorting centers corresponding to one or more first parent class nodes as the originating sorting center.

[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] Among them, the first dynamic distribution information acquisition submodule can be used to obtain the first dynamic distribution information from the originating distribution outlet to each originating sorting center; the first planning submodule can be used to plan one or more routes from the originating distribution outlet to each originating sorting center in real time according to the first dynamic distribution information; the first route determination submodule can be used to use one or more routes from the originating distribution outlet to each originating sorting center as one or more first routes, wherein each first route corresponds to a ferry time period.

[0171] In some embodiments, the originating sorting center determination module 1702 may include: a distribution network topology map second acquisition submodule, a sorting center node second determination submodule, a reverse distribution network topology map determination submodule, a second parent node determination submodule, and a destination sorting center determination submodule.

[0172] Among them, the second acquisition submodule of the distribution network topology map can be used to obtain the distribution network topology map, and the distribution network topology map includes a sorting center node; the second determination submodule of the sorting center node can be used to determine the destination distribution network point as the destination sorting center if the node corresponding to the destination distribution network point is determined to be a sorting center node according to the distribution network topology map; the reverse distribution network topology map determination submodule can be used to determine the reverse distribution network topology map of the distribution network topology map if the node corresponding to the destination distribution network point is determined to be not a sorting center node according to the distribution network topology map; the second parent node determination submodule can be used to determine one or more second parent nodes corresponding to the destination distribution network point in the reverse distribution network topology map; the destination sorting center determination submodule can be used to use one or more second parent nodes as the destination sorting center.

[0173] In some embodiments, the destination sorting center is one or more; 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] Among them, the second dynamic delivery information acquisition submodule can be used to obtain the second dynamic delivery information from each destination sorting center to the destination delivery outlet; the second real-time planning submodule can be used to plan one or more routes from each destination sorting center to the destination delivery outlet in real time according to the second dynamic delivery information; the second route determination submodule can be used to use one or more routes from each destination sorting center to the destination delivery outlet as one or more second routes, wherein each second route corresponds to a ferry time period.

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

[0176] Among them, the traversal submodule is used to determine a first target route among one or more first routes, determine a second target route among one or more second routes, and determine a third target route among one or more third routes through a traversal search operation; wherein the distribution costs generated by the first target route, the second target route and the third target route are the lowest distribution costs among all routes from the originating distribution point to the destination distribution point.

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

[0178] Among them, the cycle acquisition module is used to obtain the distribution network topology map according to the cycle, the distribution network topology map includes sorting center nodes, each node includes one or more routes, each route corresponds to a ferry time period, and the sorting center nodes in the distribution network topology map include an originating sorting center node corresponding to the originating sorting center and a destination sorting center node corresponding to the destination sorting center; the routing line planning module is used to determine the routing lines between each sorting center node according to the distribution network topology map; the storage module is used to pre-store the routing lines between the sorting center nodes, so as to determine one or more third lines according to the pre-stored routing lines between the sorting center nodes.

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

[0180] The routing line acquisition submodule is used to acquire the pre-stored routing lines between the sorting center nodes; the screening submodule is used to screen out all the lines between the originating sorting center node and the destination sorting center node among the routing lines between the sorting center nodes; the third line determination submodule is used to use 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 the corresponding method embodiments, this application will not repeat them here.

[0182] The modules and / or submodules involved in the embodiments described in the present application may be implemented by software or hardware. The modules and / or submodules described may also be arranged in a processor. The names of these modules and / or submodules do not, in certain cases, constitute limitations on the modules and / or submodules themselves.

[0183] The flowchart and block diagram in the accompanying drawings illustrate the possible architecture, functions and operations of the system, method and computer program product according to various embodiments of the present application. In this regard, each box in the flowchart or block diagram can represent a part of a module or program segment, and a part of the above-mentioned module or program segment contains one or more executable instructions for realizing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the box can also occur in a different order from the order marked in the accompanying drawings. For example, two boxes represented in succession can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each box in the block diagram or flowchart, and the combination of the boxes in the block diagram or flowchart can be implemented with a dedicated hardware-based system that performs a specified function or operation, or can be implemented with a combination of dedicated hardware and computer program instructions.

[0184] In addition, the above-mentioned figures are only schematic illustrations of the processes included in the method according to the exemplary embodiments of the present application, and are not intended to be limiting. It is easy to understand that the processes shown in the above-mentioned figures do not indicate or limit the time sequence of these processes. In addition, it is also easy to understand that these processes can be performed synchronously or asynchronously, for example, in multiple modules.

[0185] Fig.18 The structure diagram of the electronic device suitable for implementing the embodiment of the present application is shown. It should be noted that: Fig.18 The electronic device 1800 shown is only an example and should not bring any limitation to the functions and scope of use of the embodiments of the present application.

[0186] like Fig.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 part 1808 into a random access memory (RAM) 1803. In the RAM 1803, various programs and data required for the operation of the electronic device 1800 are also stored. The CPU 1801, the ROM 1802, and the RAM 1803 are connected to each other 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 the I / O interface 1805: an input section 1806 including a keyboard, a mouse, etc.; an output section 1807 including a cathode ray tube (CRT), a liquid crystal display (LCD), etc., and a speaker, 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, a modem, etc. The communication section 1809 performs communication processing via a network such as the Internet. A drive 1810 is also connected to the I / O interface 1805 as needed. A removable medium 1811, such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, etc., is installed on the drive 1810 as needed, so that a computer program read therefrom is installed into the storage section 1808 as needed.

[0188] In particular, according to an embodiment of the present application, the process described above with reference to the flowchart can be implemented as a computer software program. For example, an embodiment of the present application includes a computer program product, which includes a computer program carried on a computer-readable storage medium, and the computer program includes computer program instructions for executing the method shown in the flowchart. In such an embodiment, the computer program can be downloaded and installed from the network through the communication part 1809, and / or installed from the removable medium 1811. When the computer program is executed by the central processing unit (CPU) 1801, the above-mentioned functions defined in the system of the present application are executed.

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

[0190] As another aspect, the present application also provides a computer-readable storage medium, which may be included in the device described in the above embodiment; or it may exist independently and not be assembled into the device. The above computer-readable storage medium carries one or more programs, and when the above one or more programs are executed by a device, the device can realize functions including: obtaining a routing query request, the routing query request includes an originating distribution network point and a destination distribution network point; determining an originating sorting center corresponding to the originating distribution network point and a destination sorting center corresponding to the destination distribution network point; real-time dynamic planning of one or more first routes from the originating distribution network 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 network point; obtaining one or more third routes from the originating sorting center to the destination sorting center, one or more third routes are predetermined; according to one or more first routes, one or more second routes and one or more third routes, determining the routing route with the lowest distribution cost corresponding to the originating distribution network point to the destination distribution network point.

[0191] According to one aspect of the present application, a computer program product or a computer program is provided, the computer program product or the computer program comprising computer program instructions, the computer program instructions being 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 description of the above implementation methods, it is easy for those skilled in the art to understand that the example implementation methods described here can be implemented by software, or by software combined with necessary hardware. Therefore, the technical solution of the embodiment of the present application can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (which can be a CD-ROM, a USB flash drive, a mobile hard disk, etc.), including a number of computer program instructions for enabling an electronic device (which can be a server or a terminal device, etc.) to execute the method according to the embodiment of the present application.

[0193] Those skilled in the art will readily appreciate other embodiments of the present application after considering the specification and practicing the application applied for herein. The present application is intended to cover any variations, uses or adaptations of the present application, which follow the general principles of the present application and include common knowledge or customary technical means in the art that are not applied for in the present application. The specification and embodiments are to be regarded as exemplary only, and the true scope and spirit of the present application are indicated by the claims.

[0194] It should be understood that the present application is not limited to the detailed structures, drawings or implementations shown herein, but rather, the present application is intended to cover various modifications and equivalent arrangements included within the spirit and scope of the appended claims.

Claims

1. A routing planning method, characterized in that: include: Obtaining a route query request, wherein the route query request includes an originating distribution outlet and a destination distribution outlet; Determine an originating sorting center corresponding to the originating distribution network point and a destination sorting center corresponding to the destination distribution network point; Dynamically planning one or more first routes from the originating distribution outlet to the originating sorting center in real time; Dynamically planning one or more second routes from the destination sorting center to the destination distribution outlet in real time; Acquire one or more third routes from the originating sorting center to the destination sorting center, wherein the one or more third routes are predetermined; According to the one or more first routes, the one or more second routes and the one or more third routes, a routing route with the lowest delivery cost from the originating delivery network point to the destination delivery network point is determined.

2. The method according to claim 1, characterized in that: Determining the originating sorting center corresponding to the originating distribution outlet includes: Acquire a distribution network topology map, wherein the distribution network topology map includes a sorting center node; If it is determined according to the distribution network topology that the node corresponding to the originating distribution network point is a sorting center node, then the originating distribution network point is determined to be the originating sorting center; If it is determined according to the distribution network topology graph that the node corresponding to the originating distribution network point is not a sorting center node, then determining one or more first parent nodes corresponding to the originating distribution network point in the distribution network topology graph; One or more sorting centers corresponding to the one or more first parent nodes are used as the originating sorting centers.

3. The method according to claim 1, characterized in that: The originating sorting center is one or more; wherein the real-time dynamic planning of one or more first routes from the originating distribution outlet to the originating sorting center includes: Acquire first dynamic delivery information from the originating delivery outlet to each originating sorting center; According to the first dynamic delivery information, one or more routes from the originating delivery outlet to each originating sorting center are planned in real time; One or more routes from the originating distribution outlet to each originating sorting center are used as the one or more first routes, wherein each first route corresponds to a ferry time period.

4. The method according to claim 1, characterized in that: Determining the destination sorting center corresponding to the destination distribution outlet includes: Acquire a distribution network topology map, wherein the distribution network topology map includes a sorting center node; If it is determined according to the distribution network topology that the node corresponding to the destination distribution network point is a sorting center node, then the destination distribution network point is determined to be the destination sorting center; If it is determined according to the distribution network topology that the node corresponding to the destination distribution network point is not a sorting center node, a reverse distribution network topology of the distribution network topology is determined; Determine one or more second parent nodes corresponding to the destination delivery network point in the reverse delivery network topology diagram; 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 is one or more; wherein the real-time dynamic planning of one or more second routes from the destination sorting center to the destination distribution outlet includes: Acquire second dynamic delivery information from each destination sorting center to the destination delivery outlet; According to the second dynamic delivery information, one or more routes from each destination sorting center to the destination delivery outlet are planned in real time; One or more routes from each destination sorting center to the destination distribution outlet are used as the one or more second routes, wherein each second route corresponds to a ferry time period.

6. The method according to claim 1, characterized in that: Determining, according to the one or more first routes, the one or more second routes, and the one or more third routes, a routing route with the lowest delivery cost from the originating delivery network point to the destination delivery network point, comprising: Determine a first target route among the one or more first routes, determine a second target route among the one or more second routes, and determine a third target route among the one or more third routes by traversing the search operation; The delivery costs generated by the first target route, the second target route, and the third target route are the lowest among all routes from the originating delivery outlet to the destination delivery outlet.

7. The method according to claim 1, characterized in that: The method further comprises: Acquire a distribution network topology map according to a period, wherein the distribution network topology map includes sorting center nodes, each of which includes one or more routes, each of which corresponds to a ferry time period, and the sorting center nodes in the distribution network topology map include an originating sorting center node corresponding to the originating sorting center and a destination sorting center node corresponding to the destination sorting center; Determine the routing lines between each sorting center node according to the distribution network topology diagram; The routing routes between the sorting center nodes are pre-stored, so as to determine the one or more third routes according to the pre-stored routing routes between the sorting center nodes.

8. A route planning device, characterized in that: include: A route query request module, used to obtain a route query request, wherein the route query request includes an originating distribution outlet and a destination distribution outlet; An originating sorting center determination module is used to determine an originating sorting center corresponding to the originating distribution network point and a destination sorting center corresponding to the destination distribution network point; A first route determination module, used for real-time dynamic planning of one or more first routes from the originating distribution outlet to the originating sorting center; A second route determination module, used for dynamically planning one or more second routes from the destination sorting center to the destination distribution outlet in real time; A third route determination module, 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 line planning module is used to determine the routing line with the lowest delivery cost from the originating delivery network point to the destination delivery network point according to the one or more first lines, the one or more second lines and the one or more third lines.

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 according to any one of claims 1 to 7.

10. A computer-readable storage medium having computer program instructions stored thereon, characterized in that: When the computer program instructions are executed by a processor, the routing planning method according to any one of claims 1 to 7 is implemented.

Images