Method, device, computer equipment and storage medium for determining transportation route

Abstract

The present application relates to a method, apparatus, computer equipment, and storage medium for determining a transportation path. The method comprises: obtaining the transport attributes of an object to be transported; determining available transfer nodes from a plurality of logistics nodes based on the transport attributes; determining at least one candidate transportation path based on the available transfer nodes and the inter-node transport capacity connectivity of the transport start node and the transport end node; and selecting a transportation path for transporting the object to be transported from the at least one candidate transportation path. By adopting this method, it is possible to find multiple available transfer nodes based on the transport attributes, and then form candidate transportation paths using the inter-node transport capacity connectivity, and then determine the final transportation path for the object to be transported from them. This can avoid the need to manually design transfer nodes, thereby reducing decision-making time and improving the efficiency of determining the transportation path.

Description

Technical Field

[0001] The present application relates to the field of logistics technology, and in particular to a method, apparatus, computer equipment, and storage medium for determining a transportation route. Background Art

[0002] With the development of logistics technology, a composite transportation method has emerged that uses two or more means of transportation. For example, for the transportation of a piece of goods sent from node A to node B, a node C between nodes A and B can be selected as a transfer node for the means of transportation, so that the transportation between node A and node C is carried out by means of transportation A, and the transportation between node C and node B can be carried out by means of transportation B. Compared with the transportation method of directly sending goods from node A to node B by the same means of transportation, this composite transportation method has many advantages such as reducing transportation costs and improving transportation efficiency, and has become the main mode of logistics transportation.

[0003] Currently, for this type of transportation method that uses a combination of multiple modes of transportation, the transportation route is usually manually designed by decision-makers based on their personal experience. The transfer nodes of the transportation route are then selected based on the determined transfer nodes. However, this method of determining the transportation route relies too much on manual decision-making ability, and the decision-making time is long, so the efficiency of determining the transportation route is low. Summary of the Invention

[0004] Based on this, it is necessary to provide a method, device, computer equipment and storage medium for determining a transportation path to address the above technical problems.

[0005] A method for determining a transport path, the method comprising:

[0006] Get the transport object attributes of the object to be transported;

[0007] Determining available transfer nodes among a plurality of logistics nodes according to the properties of the transported object;

[0008] Determine at least one candidate transport route based on the available transfer nodes and the inter-node transport capacity connectivity of the transport start node and the transport end node;

[0009] A transport path for transporting the object to be transported is selected from the at least one candidate transport path.

[0010] In one embodiment, before determining at least one candidate transport path based on the available transit nodes and the inter-node transport capacity connectivity of the transport start node and the transport end node, it also includes: obtaining the transport start point and the transport end point of the object to be transported; based on the transport start point and the transport end point, determining the transport start node that matches the transport start point and the transport end point from the logistics nodes according to the properties of the transported object.

[0011] In one embodiment, the determining of at least one candidate transport path based on the available transit nodes and the inter-node capacity connectivity of the transport start node and the transport end node includes: obtaining a first capacity connectivity corresponding to the transport start node and a second capacity connectivity corresponding to the transport end node; determining at least one first logistics node from the multiple available transit nodes based on the first capacity connectivity, and determining at least one second logistics node from the multiple available transit nodes based on the second capacity connectivity; if the at least one first logistics node and the at least one second logistics node are the same logistics nodes, determining the candidate transport path based on the transport start node, the transport end node, and the same logistics nodes.

[0012] In one embodiment, after determining at least one first logistics node from the multiple available transit nodes based on the first transport connectivity, and determining at least one second logistics node from the multiple available transit nodes based on the second transport connectivity, it also includes: if there is no identical logistics node between the at least one first logistics node and the at least one second logistics node, each first logistics node is used as a new transport starting node, and each second logistics node is used as a new transport ending node, and the step of returning to obtain the first transport connectivity corresponding to the transport starting node and the second transport connectivity corresponding to the transport ending node is performed.

[0013] In one embodiment, selecting a transport path for transporting the object to be transported from the at least one candidate transport path includes: obtaining resource consumption of each candidate transport path; and selecting the candidate transport path with the minimum resource consumption as the transport path for the object to be transported.

[0014] In one embodiment, obtaining the resource consumption of each candidate transportation path includes: obtaining the transportation time consumption and / or transportation cost consumption of each candidate transportation path based on preset transportation constraints; and obtaining the resource consumption of each candidate transportation path according to the transportation time consumption and / or the transportation cost consumption.

[0015] In one embodiment, obtaining the transportation time consumption and / or transportation cost consumption of each candidate transportation path includes: determining the current candidate transportation path, and multiple current logistics nodes corresponding to the current candidate transportation path; the current logistics node is a logistics node on the current candidate transportation path; obtaining the transportation time consumption and transportation cost consumption between each current logistics node, and obtaining the switching time consumption and switching cost consumption corresponding to each current logistics node; determining the transportation time consumption of the current candidate transportation path based on the transportation time consumption between each current logistics node and the switching time consumption, and determining the transportation cost loss of the current candidate transportation path based on the transportation cost consumption between each current logistics node and the switching cost consumption.

[0016] In one embodiment, after selecting the transport path for transporting the object to be transported from the at least one candidate transport path, the method further includes: displaying the transport path of the object to be transported; and updating the transport path of the object to be transported in response to an update operation on the displayed transport path of the object to be transported.

[0017] A device for determining a transport path, the device comprising:

[0018] The transport object attribute acquisition module is used to obtain the transport object attributes of the object to be transported;

[0019] A transfer node determination module, configured to determine an available transfer node among a plurality of logistics nodes according to the properties of the transported object;

[0020] a candidate path determination module, configured to determine at least one candidate transport path based on the available transit nodes and the inter-node transport capacity connectivity of the transport start node and the transport end node;

[0021] The transport path determination module is configured to select a transport path for transporting the object to be transported from the at least one candidate transport path.

[0022] A computer device includes a memory and a processor, wherein the memory stores a computer program, and the processor implements the steps of the above method when executing the computer program.

[0023] A computer-readable storage medium stores a computer program, which implements the steps of the above method when executed by a processor.

[0024] The above-mentioned method, apparatus, computer equipment and storage medium for determining a transport path obtain the transport object attributes of the object to be transported; determine the available transfer nodes among multiple logistics nodes based on the transport object attributes; determine at least one candidate transport path based on the available transfer nodes and the inter-node transport capacity connectivity of the transport start node and the transport end node; and select a transport path for transporting the object to be transported from the at least one candidate transport path. The present application finds multiple available transfer nodes through the transport object attributes, and then uses the inter-node transport capacity connectivity to form candidate transport paths, and then determines the final transport path for the object to be transported therefrom. This can avoid the need to manually design transfer nodes, thereby reducing decision-making time and improving the efficiency of determining the transport path. BRIEF DESCRIPTION OF THE DRAWINGS

[0025] Figure 1 1 is a flow chart of a method for determining a transportation route in one embodiment;

[0026] Figure 2 A schematic diagram of a process for determining a transport start node and a transport end node in one embodiment;

[0027] Figure 3 FIG1 is a schematic diagram of a process for determining a candidate transport route in one embodiment;

[0028] Figure 4 A schematic diagram of determining candidate transportation routes in one embodiment;

[0029] Figure 5 A schematic diagram of a process for obtaining transportation time consumption and transportation fee consumption in one embodiment;

[0030] Figure 6 A flowchart of a method for automatically planning a multimodal transport solution in an application example;

[0031] Figure 7 is a structural block diagram of an apparatus for determining a transport path in one embodiment;

[0032] Figure 8 FIG. 1 is a diagram showing the internal structure of a computer device in one embodiment. DETAILED DESCRIPTION

[0033] In order to make the purpose, technical solutions and advantages of this application more clear, the following further describes this application in detail with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain this application and are not intended to limit this application.

[0034] In one embodiment, Figure 1As shown, a method for determining a transport path is provided. This embodiment uses the method applied to a server as an example for illustration. It is understood that the method can also be applied to a terminal, or to a system including a terminal and a server, and implemented through interaction between the terminal and the server. In this embodiment, the method includes the following steps:

[0035] Step S101: The server obtains the properties of the object to be transported;

[0036] In step S102, the server determines available transfer nodes among multiple logistics nodes based on the attributes of the transported goods.

[0037] The "object to be transported" refers to items that require logistics transportation, and the "object attributes" refer to attributes of the object that may affect the available transportation nodes or transportation methods for the object. These may include whether the object is fragile, corrosive, or fresh, among other factors. Because different objects have different transportation requirements, the server needs to find appropriate logistics nodes as available transit nodes based on the object's attributes. For example, a logistics node may include Node A, Node B, and Node C, where only Node B and Node C can transport fragile items. If an object is fragile, the server may use Node B and Node C as available transit nodes that match the object's attributes. Alternatively, if only Node A and Node B can transport corrosive items, the server may use Node A and Node B as matching transit nodes.

[0038] In step S103 , the server determines at least one candidate transport path based on the available transfer nodes and the inter-node transport capacity connectivity between the transport start node and the transport end node.

[0039] Transport connectivity refers to whether nodes can be connected through transport capacity. The transport start and end nodes refer to the starting and ending logistics nodes for the transported items. These start and end nodes are generally determined based on the transport origin and destination of the items, i.e., the shipping and receiving locations of the items. For example, the logistics nodes closest to the transport origin and destination can be used as the transport start and end nodes. After the server determines the transport start and end nodes, it can also find at least one candidate transport route based on the transport connectivity between the nodes.

[0040] For example, the capacity connectivity can be obtained by pre-storing a node capacity table that stores the transportation modes between each logistics node. For example, the table can pre-record the capacity connectivity from node A to node B with rail capacity, and the capacity connectivity from node B to node C with road capacity. Then, when the transportation starting node and the transportation ending node are node A and node C respectively, the server can determine the candidate transportation path from node A to node B by rail and then from node B to node C by road based on the capacity connectivity recorded in the above node capacity table.

[0041] In step S104 , the server selects a transport path for transporting the object to be transported from at least one candidate transport path.

[0042] Finally, the server may select one of the determined candidate transport routes as the final transport route for transporting the object to be transported. For example, the server may select the candidate transport route with the shortest transport time as the final transport route for the object to be transported.

[0043] In the above-mentioned method for determining a transport path, the server obtains the transport attributes of the object to be transported; based on the transport attributes, the server determines available transfer nodes from multiple logistics nodes; based on the available transfer nodes and the inter-node transport capacity connectivity of the transport start node and the transport end node, the server determines at least one candidate transport path; and the server selects a transport path for transporting the object to be transported from the at least one candidate transport path. The server of the present application finds multiple available transfer nodes through the transport attributes, and then uses the inter-node transport capacity connectivity to form candidate transport paths, and then determines the final transport path for the object to be transported from them. This can avoid the need to manually design transfer nodes, thereby reducing decision-making time and improving the efficiency of determining the transport path.

[0044] In one embodiment, Figure 2 As shown, before step S103, the following steps may also be included:

[0045] In step S201, the server obtains the transportation starting point and the transportation destination of the object to be transported.

[0046] The transport origin and destination refer to the shipping location and delivery location of the transported item. The shipping location and delivery location may be specified by the user on the logistics transport order corresponding to the transported item. Specifically, the server may read the logistics transport order corresponding to the transported item and obtain the shipping location and delivery location corresponding to the transported item as the transport origin and destination of the transported item.

[0047] In step S202, the server determines a transport start node that matches the transport start point and a transport end node that matches the transport end point from the logistics nodes according to the transport start point and the transport end point and the attributes of the transported object.

[0048] After determining the transport origin and destination of the item to be transported, the server can further identify the transport start node and transport end node, respectively. The transport start node and transport end node can be one or more. For example, the logistics node closest to the transport origin and transport end node can be used as a candidate transport start node and candidate transport end node, or any logistics node whose distance from the transport origin and transport end node is less than a certain distance threshold can be used as a candidate transport start node and candidate transport end node. In addition, since not all logistics nodes can transport a certain item to be transported, the candidate transport start nodes and candidate transport end nodes need to be further screened based on the transport attributes of the item to be transported.

[0049] For example, although node A can be a candidate transport starting node for a fragile item, if node A cannot transport the fragile item, the server needs to select another logistics node as the transport starting node. Similar to step S102, the server can select a candidate transport starting node that matches the attributes of the transported item as the transport starting node, and can select a candidate transport starting node that matches the attributes of the transported item as the transport ending node.

[0050] Further, if Figure 3 As shown, step S103 may further include:

[0051] Step S301: The server obtains the first transport capacity connectivity corresponding to the transport start node and the second transport capacity connectivity corresponding to the transport end node.

[0052] The first transport capacity connectivity corresponding to the transport start node refers to the transport capacity connectivity from the transport start node to other logistics nodes, while the second transport capacity connectivity corresponding to the transport end node refers to the transport capacity connectivity from other logistics nodes to the transport end node. Specifically, after the server determines the transport start node and the transport end node, it can find the first transport capacity connectivity corresponding to the transport start node and the second transport capacity connectivity corresponding to the transport end node from the node capacity table that pre-records the transport capacity information of each logistics node.

[0053] For example: the node capacity table can record the capacity connectivity from node A to node B, the capacity connectivity from node A to node C, the capacity connectivity from node B to node D, and the capacity connectivity from node C to node D. Then, when the starting node of the transportation is node A and the ending node of the transportation is node D, the first capacity connectivity refers to the capacity connectivity from node A to node B, or the capacity connectivity from node A to node C, and the second capacity connectivity refers to the capacity connectivity from node B to node D, or the capacity connectivity from node C to node D.

[0054] In step S302 , the server determines at least one first logistics node from a plurality of available transit nodes based on the first transport connectivity, and determines at least one second logistics node from a plurality of available transit nodes based on the second transport connectivity.

[0055] Among them, the first logistics node refers to the logistics node among the available transit nodes that matches the first transport capacity connectivity, and the second logistics node refers to the logistics node among the available transit nodes that matches the second transport capacity connectivity. For example, among the above-mentioned nodes A, B, C and D, only A, B and D are available transit nodes. Then, when node A is the starting node of transportation, node B can be used as the first logistics node. Similarly, node B can also be used as the second logistics node.

[0056] Step S303: If at least one first logistics node and at least one second logistics node have the same logistics node, the server determines a candidate transportation path based on the transportation start node, the transportation end node, and the same logistics node.

[0057] Finally, if there is a same logistics node between the first logistics node and the second logistics node, the server can determine a candidate transportation route based on the transportation start node, the transportation end node, and the same logistics node.

[0058] like Figure 4 As shown, the transportation starting nodes of the objects to be transported may include node 1, node 2, node 3 and node 4, and the first logistics nodes obtained according to the first transport capacity connectivity may include node 1', node 2', node 3', and node J, and the transportation ending nodes of the objects to be transported may include node A, node B, node C and node D, and the second logistics nodes obtained according to the second transport capacity connectivity may include node A', node B', node C', and node J. Since the same node J exists in the first logistics node and the second logistics node, a transportation path can be obtained from node 4 as the transportation starting node, flowing through node J, and finally reaching node D as the transportation ending node.

[0059] In addition, after step S302, it may also include: if there is no identical logistics node between at least one first logistics node and at least one second logistics node, then each first logistics node is used as a new transportation starting node, and each second logistics node is used as a new transportation ending node, and returns to step S301.

[0060] If the first logistics node and the second logistics node obtained in step S302 do not have the same logistics node, the server can also use each first logistics node obtained as a new transportation start node and each second logistics node obtained as a new transportation end node, and obtain the first transportation capacity connectivity and the second transportation capacity connectivity corresponding to the new transportation start node and the new transportation end node again, and determine the new first logistics node and the second logistics node until the same logistics node exists in the first logistics node and the second logistics node, thereby forming the corresponding candidate transportation path.

[0061] For example: in the logistics transportation process with node A as the transportation starting node and node E as the transportation ending node, if the first logistics node corresponding to node A includes node B and node C, and the second logistics node corresponding to node E includes node D, there is no identical first logistics node and second logistics node at this time, so node B and node C can be used as new transportation starting nodes again, and node D can be used as the new transportation ending node. If there is a node F, which belongs to the new first logistics node corresponding to node B and also belongs to the second logistics node corresponding to node D, then a candidate transportation path can be generated starting from node A, passing through node B, node F, and node D, and finally reaching node E.

[0062] In the above embodiment, the server can find the corresponding transport start node and transport end node based on the transport starting point and transport end point of the object to be transported and according to the attributes of the transported object, thereby improving the efficiency of obtaining the transport start node and the transport end node. At the same time, the present application also finds the corresponding first logistics node and second logistics node through the first transport capacity connectivity and second transport capacity connectivity corresponding to the transport start node and the transport end node respectively, and constructs a candidate transport path. If there is no candidate transport path established directly through a transit node, the found first logistics node and second logistics node can be used again as the new transport start node and transport end node, and the first logistics node and the second logistics node can be searched again until a candidate transport path can be constructed, thereby improving the efficiency and feasibility of constructing the candidate transport path.

[0063] In one embodiment, step S104 may further include: the server obtaining resource consumption of each candidate transportation route; and selecting the candidate transportation route with the minimum resource consumption as the transportation route for the object to be transported.

[0064] Resource consumption refers to the resources consumed during the transportation process, which can be expressed as transportation costs. The server can obtain the resource consumption incurred during the transportation of each candidate transportation route and select the candidate transportation route with the lowest resource consumption as the final transportation route for the transported items.

[0065] Furthermore, the server obtains the resource consumption of each candidate transportation path, which may further include: the server obtains the transportation time consumption and / or transportation cost consumption of each candidate transportation path based on preset transportation constraints; and obtains the resource consumption of each candidate transportation path according to the transportation time consumption and / or transportation cost consumption.

[0066] The transportation constraints refer to pre-set constraints that must be met during the transportation process. For example, these may include: only one mode of transportation is used between any two logistics nodes; only one mode of transit is used within a logistics node; and so on. Based on the pre-designed transportation constraints, this embodiment can utilize a pre-set mathematical model, such as a dual-objective function, to determine a candidate transportation path with the lowest transportation time and transportation cost. Specifically, based on the pre-designed constraints, this embodiment can calculate the transportation time and transportation cost for each candidate transportation path, and then determine the resource consumption of each candidate transportation path based on the transportation time and transportation cost.

[0067] Furthermore, if Figure 5 As shown, the server obtaining the transportation time consumption and / or transportation cost consumption of each candidate transportation route may further include:

[0068] In step S501, the server determines a current candidate transport path and a plurality of current logistics nodes corresponding to the current candidate transport path; the current logistics node is a logistics node on the current candidate transport path.

[0069] The current candidate transport path refers to any of the at least one candidate transport path, and the current logistics node refers to the logistics node on the current candidate transport path. When the server needs the resource consumption of each candidate transport path, it can select a candidate transport path as the current candidate transport path and obtain the logistics node on the current candidate transport path as the current logistics node.

[0070] In step S502, the server obtains the transportation time consumption and transportation cost consumption between each current logistics node, and obtains the switching time consumption and switching cost consumption corresponding to each current logistics node.

[0071] Among them, transportation time consumption refers to the time consumed by transporting goods between two adjacent logistics nodes on the current candidate transportation route, transportation cost consumption refers to the cost loss caused by transporting goods between two adjacent logistics nodes, switching time consumption refers to the time consumed by changing the transportation method at a certain logistics node, and switching cost consumption refers to the cost loss caused by changing the transportation method. All of these consumptions can be collected by the user in advance and input into the server. Once the server determines the current transportation node on the current candidate transportation route, it can read the above data.

[0072] In step S503, the server determines the transportation time consumption of the current candidate transportation path based on the transportation time consumption and switching time consumption between each current logistics node, and determines the transportation cost loss of the current candidate transportation path based on the transportation cost consumption and switching cost consumption between each current logistics node.

[0073] Finally, the server can sum up the transportation time consumption and switching time consumption between each current logistics node to obtain the transportation time consumption of the current candidate transportation path, and sum up the transportation cost consumption and switching cost consumption between each current logistics node to obtain the transportation cost loss of the current candidate transportation path.

[0074] In the above embodiment, the server can reduce the transportation cost of the goods by selecting the candidate transportation path with the minimum resource consumption as the transportation path for the goods to be transported. In addition, the transportation time consumption and transportation cost consumption of each candidate transportation path are calculated to obtain the final resource consumption of each candidate transportation path, wherein the transportation time consumption is obtained by the transportation time consumption between logistics nodes and the switching time consumption of each node, and the transportation cost loss is obtained by the transportation cost consumption between logistics nodes and the switching cost consumption of each node, thereby further improving the accuracy of the obtained resource loss.

[0075] In addition, in one embodiment, after step S104, the process may further include: the server displays the transportation path of the object to be transported; and in response to an update operation on the displayed transportation path of the object to be transported, updating the transportation path of the object to be transported.

[0076] After the server obtains the transportation path of the object to be transported, it can also display the obtained transportation path of the object to be transported. If certain special circumstances arise, such as when the original transportation path may be suspended or delayed for some reason, in order to reduce the impact of the above circumstances, in this embodiment, the user can also update the displayed transportation path of the object to be transported. The above update operation can be triggered to the server through the user terminal, and the server can respond to the update operation, thereby realizing the update processing of the transportation path of the object to be transported.

[0077] In this embodiment, the user can also update the transport path of the transported goods by triggering an update operation on the transport path, thereby reducing the impact of logistics transportation caused by certain special circumstances and improving the reliability of logistics transportation.

[0078] In an application example, a method, tool and system for automatic planning of multimodal transport schemes are also provided. The system workflow can be as follows: Figure 6 Specifically, the method can be implemented based on the following parts:

[0079] (1) Data Base: This application pre-establishes logistics data for implementing logistics route planning, including:

[0080] Station data: Comprehensive station data is generated, including railway stations, water ports, airports, and land transport stations. This includes data such as the operational capacity and location latitude and longitude of each node. This provides distance constraint data for optimal calculations.

[0081] Transport capacity data: This includes transport capacity resources for various modes of transport, including transport mode, transport time, transit time, cost, and other dimensions. It provides data input for the objective function and transport capacity constraints for optimal calculations.

[0082] Cargo name configuration table: includes the name configuration of iron, water, road, and air transport. It provides cargo category constraint data for the optimal calculation mathematical model.

[0083] (2) A container calculator is provided. By inputting the information and quantity of the goods, the container or truck container configured in the system is matched, and the bubble sort algorithm is used to quickly calculate the loading status of each container and the required number of containers.

[0084] (3) Provide a mathematical model for optimal linear programming of multimodal logistics solutions. The optimal solution is calculated through the mathematical model logic of the dual objective function (time efficiency + cost). The function model is as follows:

[0085]

[0086]

[0087]

[0088]

[0089]

[0090]

[0091] is the transportation cost from node i to node i+1 using transportation mode k;

[0092] is the transit fee when the transportation mode of node i is changed from k to l;

[0093] is the transportation time from node i to node i+1 using transportation mode k;

[0094] is the transit time when the transportation mode of node i is converted from k to l.

[0095] From node i to node i+1, transportation method k is used. Otherwise, 0;

[0096] At node i, if the mode of transport changes from k to l, Otherwise, 0;

[0097] The objective function z1 of this model is the sum of two separate linear cost functions. The first part on the right represents the total transportation cost of transporting a given amount of goods from the starting point to the destination, and the second part on the right represents the sum of the transit costs when changing the mode of transportation at the transit point.

[0098] The objective function z2 is the sum of two separate linear cost functions. The first part on the right represents the total transportation time when a given amount of goods is transported from the starting point to the destination, and the second part on the right represents the sum of the transit time when the mode of transportation is changed at the transit point.

[0099] Among the constraints, Indicates that only one mode of transportation can be used for transportation between two nodes;

[0100] Indicates that only one transfer method is used at a node;

[0101] It is used to ensure internal consistency, that is, if the transportation mode at node i is converted from k to l, then from node i-1 to node i, the transportation mode is k, and from node i to node i+1, the transportation mode is l;

[0102] represents a 0-1 constraint on the decision variable.

[0103] (4) Provide a depth-first search algorithm model for recommending logistics solution combinations

[0104] 1. Available nodes:

[0105] Use map search technology to quickly identify available nodes based on screening conditions (goods name, loading container, specified transportation method, etc.).

[0106] 2. Available capacity

[0107] The next step is to enumerate the next potential available node using the available transport capacity. Repeat this step until the set of potential available nodes at the departure station intersects with the set of potential available nodes at the arrival station.

[0108] (5) Provide a manual adjustment function for logistics solutions. After the solution recommendation is completed, the operator will manually adjust the solution according to the actual situation and monitor the implementation of the solution in real time.

[0109] The above application examples can quickly screen available nodes and transportation resources, and automatically generate models through multimodal logistics solutions to quickly generate the timeliness and cost of logistics solutions. The production time of multimodal logistics solutions is greatly reduced, greatly improving the efficiency of producing logistics solutions. It is also highly scalable and can be expanded to logistics sectors such as express delivery, express delivery, and instant logistics.

[0110] It should be understood that, although the various steps in the flowchart of the present application are shown in sequence as indicated by the arrows, these steps are not necessarily performed in the order indicated by the arrows. Unless otherwise specified herein, there is no strict order restriction on the execution of these steps, and these steps can be performed in other orders. Moreover, at least a portion of the steps in the figure may include multiple steps or multiple stages, and these steps or stages are not necessarily performed at the same time, but can be performed at different times. The execution order of these steps or stages is not necessarily to be performed in sequence, but can be performed in turn or alternately with other steps or at least a portion of steps or stages in other steps.

[0111] In one embodiment, Figure 7 As shown, a device for determining a transport path is provided, comprising: a transport object attribute acquisition module 701, a transfer node determination module 702, a candidate path determination module 703, and a transport path determination module 704, wherein:

[0112] The transport object attribute acquisition module 701 is used to acquire the transport object attributes of the object to be transported;

[0113] The transfer node determination module 702 is used to determine an available transfer node among multiple logistics nodes according to the properties of the transported object;

[0114] A candidate path determination module 703 is configured to determine at least one candidate transport path based on available transit nodes and inter-node transport capacity connectivity between the transport start node and the transport end node;

[0115] The transportation path determination module 704 is configured to select a transportation path for transporting the object to be transported from at least one candidate transportation path.

[0116] In one embodiment, the device for determining the transport path also includes: a start and end determination module for obtaining the transport starting point and transport end point of the object to be transported; based on the transport starting point and transport end point, a transport starting node that matches the transport starting point and a transport end node that matches the transport end point are determined from the logistics nodes according to the properties of the transported object.

[0117] In one embodiment, the candidate path determination module 703 is further used to obtain a first transport capacity connectivity corresponding to the transport start node and a second transport capacity connectivity corresponding to the transport end node; based on the first transport capacity connectivity, at least one first logistics node is determined from multiple available transit nodes, and based on the second transport capacity connectivity, at least one second logistics node is determined from multiple available transit nodes; if at least one first logistics node and at least one second logistics node have the same logistics node, the candidate transport path is determined based on the transport start node, the transport end node, and the same logistics node.

[0118] In one embodiment, the candidate path determination module 703 is also used to use each first logistics node as a new transport start node and each second logistics node as a new transport end node if there is no identical logistics node between at least one first logistics node and at least one second logistics node, and return to the step of obtaining the first transport capacity connectivity corresponding to the transport start node and the second transport capacity connectivity corresponding to the transport end node.

[0119] In one embodiment, the transport path determination module 704 is further configured to obtain resource consumption of each candidate transport path; and select the candidate transport path with the minimum resource consumption as the transport path for the object to be transported.

[0120] In one embodiment, the transportation path determination module 704 is further configured to obtain the transportation time consumption and / or transportation cost consumption of each candidate transportation path based on preset transportation constraints; and obtain the resource consumption of each candidate transportation path based on the transportation time consumption and / or transportation cost consumption.

[0121] In one embodiment, the transport path determination module 704 is further used to determine the current candidate transport path and multiple current logistics nodes corresponding to the current candidate transport path; the current logistics node is a logistics node on the current candidate transport path; the transport time consumption and transport cost consumption between each current logistics node are obtained, and the switching time consumption and switching cost consumption corresponding to each current logistics node are obtained; the transport time consumption of the current candidate transport path is determined based on the transport time consumption and switching time consumption between each current logistics node, and the transport cost loss of the current candidate transport path is determined based on the transport cost consumption and switching cost consumption between each current logistics node.

[0122] In one embodiment, the apparatus for determining a transport path further includes: a transport path updating module for displaying the transport path of the object to be transported; and updating the transport path of the object to be transported in response to an update operation on the displayed transport path of the object to be transported.

[0123] The specific definition of the apparatus for determining a transport path can be found in the definition of the method for determining a transport path described above and will not be further elaborated here. Each module in the apparatus for determining a transport path may be implemented in whole or in part via software, hardware, or a combination thereof. Each of the modules may be embedded in or independent of a processor in a computer device in hardware form, or may be stored in a memory in the computer device in software form, so that the processor can call and execute the corresponding operations of each module.

[0124] In one embodiment, a computer device is provided. The computer device may be a server, and its internal structure diagram may be as follows: Figure 8 As shown. The computer device includes a processor, memory, and a network interface connected via a system bus. The processor of the computer device is used to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program, and a database. The internal memory provides an environment for the operation of the operating system and computer program in the non-volatile storage medium. The database of the computer device is used to store logistics node data. The network interface of the computer device is used to communicate with an external terminal via a network connection. When executed by the processor, the computer program implements a method for determining a transportation route.

[0125] Those skilled in the art will understand that Figure 8 The structure shown in the figure is only a block diagram of a part of the structure related to the solution of the present application, and does not constitute a limitation on the computer device to which the solution of the present application is applied. The specific computer device may include more or fewer components than shown in the figure, or combine certain components, or have a different component arrangement.

[0126] In one embodiment, a computer device is further provided, including a memory and a processor. The memory stores a computer program, and the processor implements the steps in the above method embodiments when executing the computer program.

[0127] In one embodiment, a computer-readable storage medium is provided, on which a computer program is stored. When the computer program is executed by a processor, the steps in the above-mentioned method embodiments are implemented.

[0128] Those skilled in the art will appreciate that all or part of the processes in the above-mentioned embodiment methods can be implemented by instructing the relevant hardware through a computer program, and the computer program can be stored in a non-volatile computer-readable storage medium. When the computer program is executed, it can include the processes of the embodiments of the above-mentioned methods. Among them, any reference to memory, storage, database or other media used in the embodiments provided in this application may include at least one of non-volatile and volatile memory. Non-volatile memory may include read-only memory (ROM), magnetic tape, floppy disk, flash memory or optical memory, etc. Volatile memory may include random access memory (RAM) or external cache memory. As an illustration and not limitation, RAM can be in various forms, such as static random access memory (SRAM) or dynamic random access memory (DRAM).

[0129] The technical features of the above embodiments can be combined arbitrarily. To make the description concise, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.

[0130] The above-described embodiments merely represent several implementation methods of the present application. While the descriptions are relatively specific and detailed, they should not be construed as limiting the scope of the present invention. It should be noted that a person skilled in the art could make various modifications and improvements without departing from the spirit of the present application, all of which fall within the scope of protection of the present application. Therefore, the scope of protection of the present patent application shall be determined by the appended claims.

Claims

1. A method for determining a transport route, characterized in that: The method comprises: Acquire a transport object attribute of the object to be transported; the transport object attribute is an attribute of the object to be transported that may affect a transport node that can be used for the object to be transported; Determining, based on the properties of the transported object, an available transfer node among a plurality of logistics nodes; the available transfer node is a logistics node that is compatible with the properties of the transported object; Determine at least one candidate transport path based on the available transfer nodes and the inter-node capacity connectivity of the transport start node and the transport end node; including: obtaining a first capacity connectivity corresponding to the transport start node and a second capacity connectivity corresponding to the transport end node; determining at least one first logistics node from the multiple available transfer nodes based on the first capacity connectivity, and determining at least one second logistics node from the multiple available transfer nodes based on the second capacity connectivity; if the at least one first logistics node and the at least one second logistics node are the same logistics nodes, determine the candidate transport path based on the transport start node, the transport end node, and the same logistics nodes; Selecting a transport path for transporting the object to be transported from the at least one candidate transport path; comprising: obtaining a plurality of current logistics nodes corresponding to the current candidate transport path; the current candidate transport path is any one of the at least one candidate transport path, and the current logistics node is a logistics node on the current candidate transport path; based on preset transport constraints, determining the transport time consumption of the current candidate transport path according to the transport time consumption between the current logistics nodes and the switching time consumption corresponding to the current logistics nodes, and determining the transport cost loss of the current candidate transport path according to the transport cost consumption between the current logistics nodes and the switching cost consumption corresponding to the current logistics nodes; obtaining the resource consumption of each candidate transport path according to the transport time consumption and transport cost consumption of each current candidate transport path, and selecting the candidate transport path with the minimum resource consumption as the transport path for the object to be transported; Among them, the transportation constraints include: only one mode of transportation can be used for transportation between each current logistics node, each current logistics node only uses one transit mode, and when the transit mode of the current logistics node represents the switch from the first mode of transportation to the second mode of transportation, the transportation mode from the previous logistics node of the current logistics node to the current logistics node is the first mode of transportation, and the transportation mode from the current logistics node to the next logistics node of the current logistics node is the second mode of transportation.

2. The method according to claim 1, characterized in that Before determining at least one candidate transport path based on the available transfer nodes and the inter-node transport capacity connectivity of the transport start node and the transport end node, the method further includes: Obtain the transport starting point and transport destination of the object to be transported; According to the transport starting point and the transport end point, and according to the transport object attributes, the transport start node that matches the transport starting point and the transport end node that matches the transport end point are determined from the logistics nodes.

3. The method according to claim 2, characterized in that After determining at least one first logistics node from the plurality of available transfer nodes according to the first transport connectivity, and determining at least one second logistics node from the plurality of available transfer nodes according to the second transport connectivity, the method further includes: If there is no identical logistics node between the at least one first logistics node and the at least one second logistics node, each first logistics node is used as a new transport starting node, and each second logistics node is used as a new transport ending node, and the step of obtaining the first transport capacity connectivity corresponding to the transport starting node and the second transport capacity connectivity corresponding to the transport ending node is returned.

4. The method according to any one of claims 1 to 3, characterized in that After selecting a transport path for transporting the object to be transported from the at least one candidate transport path, the method further includes: Displaying the transport path of the object to be transported; In response to an update operation on the displayed transport route of the object to be transported, an update process is performed on the transport route of the object to be transported.

5. A device for determining a transport route, characterized in that: The device comprises: A transport object attribute acquisition module, configured to acquire transport object attributes of the object to be transported; the transport object attributes are attributes of the object to be transported that may affect the transport nodes that can be used for the object to be transported; A transfer node determination module, configured to determine an available transfer node from a plurality of logistics nodes according to the properties of the transported object; the available transfer node is a logistics node that is compatible with the properties of the transported object; A candidate path determination module is configured to determine at least one candidate transport path based on the available transfer nodes and the inter-node capacity connectivity of the transport start node and the transport end node; further configured to obtain a first capacity connectivity corresponding to the transport start node and a second capacity connectivity corresponding to the transport end node; determine at least one first logistics node from the multiple available transfer nodes based on the first capacity connectivity, and determine at least one second logistics node from the multiple available transfer nodes based on the second capacity connectivity; if the at least one first logistics node and the at least one second logistics node are the same logistics node, determine the candidate transport path based on the transport start node, the transport end node, and the same logistics node; a transport path determination module for selecting a transport path for transporting the object to be transported from the at least one candidate transport path; and further for obtaining a plurality of current logistics nodes corresponding to the current candidate transport path; the current candidate transport path is any one of the at least one candidate transport path, and the current logistics node is a logistics node on the current candidate transport path; based on preset transport constraints, the transport time consumption of the current candidate transport path is determined according to the transport time consumption between the current logistics nodes and the switching time consumption corresponding to the current logistics nodes, and the transport cost loss of the current candidate transport path is determined according to the transport cost consumption between the current logistics nodes and the switching cost consumption corresponding to the current logistics nodes; the resource consumption of each candidate transport path is obtained according to the transport time consumption and transport cost consumption of each current candidate transport path, and the candidate transport path with the minimum resource consumption is used as the transport path for the object to be transported; Among them, the transportation constraints include: only one mode of transportation can be used for transportation between each current logistics node, each current logistics node only uses one transit mode, and when the transit mode of the current logistics node represents the switch from the first mode of transportation to the second mode of transportation, the transportation mode from the previous logistics node of the current logistics node to the current logistics node is the first mode of transportation, and the transportation mode from the current logistics node to the next logistics node of the current logistics node is the second mode of transportation.

6. The device according to claim 5, characterized in that Also includes: A start and end determination module is used to obtain the transportation start point and transportation end point of the object to be transported; According to the transport starting point and the transport end point, and according to the transport object attributes, the transport start node that matches the transport starting point and the transport end node that matches the transport end point are determined from the logistics nodes.

7. The device according to claim 6, characterized in that The candidate path determination module is also used to use each first logistics node as a new transport starting node and each second logistics node as a new transport ending node if there is no identical logistics node between the at least one first logistics node and the at least one second logistics node, and return to the step of obtaining the first transport capacity connectivity corresponding to the transport starting node and the second transport capacity connectivity corresponding to the transport ending node.

8. The device according to any one of claims 5 to 7, characterized in that Also includes: A transport path updating module, configured to display the transport path of the object to be transported; In response to an update operation on the displayed transport route of the object to be transported, an update process is performed on the transport route of the object to be transported.

9. A computer device comprising a memory and a processor, wherein the memory stores a computer program, wherein: When the processor executes the computer program, the steps of the method according to any one of claims 1 to 4 are implemented.

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

Images