CN115081666A - Method, device, computer equipment and storage medium for determining transportation path - Google Patents
Method, device, computer equipment and storage medium for determining transportation path Download PDFInfo
- Publication number
- CN115081666A CN115081666A CN202110278849.5A CN202110278849A CN115081666A CN 115081666 A CN115081666 A CN 115081666A CN 202110278849 A CN202110278849 A CN 202110278849A CN 115081666 A CN115081666 A CN 115081666A
- Authority
- CN
- China
- Prior art keywords
- transportation
- node
- logistics
- candidate
- path
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
- G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/083—Shipping
- G06Q10/0835—Relationships between shipper or supplier and carriers
- G06Q10/08355—Routing methods
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Human Resources & Organizations (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Quality & Reliability (AREA)
- Marketing (AREA)
- Operations Research (AREA)
- Entrepreneurship & Innovation (AREA)
- Development Economics (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Game Theory and Decision Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The application relates to a method, a device, a computer device and a storage medium for determining a transportation path. The method comprises the following steps: acquiring the attribute of a transported object; determining an available transfer node in the plurality of logistics nodes according to the attribute of the transport object; determining at least one candidate transportation path based on the available transit nodes and the inter-node transportation connectivity of the transportation starting node and the transportation ending node; and selecting a transportation path for transporting the object to be transported from the at least one candidate transportation path. By adopting the method, a plurality of available transfer nodes can be found through the attributes of the transported objects, and the final transport path of the transported objects is determined after the candidate transport path is formed by utilizing the transport connectivity among the nodes, so that the need of manually designing the transfer nodes can be avoided, the decision-making time is shortened, and the determination efficiency of the transport path is improved.
Description
Technical Field
The present application relates to the field of logistics technology, and in particular, to a method, an apparatus, a computer device, and a storage medium for determining a transportation path.
Background
With the development of logistics technology, a composite transportation mode for transportation by using two or more transportation means appears, for example, in the transportation of a piece of goods sent from a node a to a node B, a certain node C between the node a and the node B can be selected to be set as a transit node of the transportation means, so that the transportation between the node a and the node C is performed by the transportation means a, and the transportation between the node C and the node B is performed by the transportation means B.
At present, for the transportation route of the transportation mode of carrying out combined transportation by adopting multiple vehicles, decision-making personnel usually design transfer nodes of the transportation route manually according to personal experience, and select the transportation mode between the two nodes according to the determined transfer nodes, however, the mode of determining the transportation route too depends on the manual decision-making capability, the decision-making duration is long, and therefore the determination efficiency of the transportation route is low.
Disclosure of Invention
In view of the above, it is necessary to provide a method, an apparatus, a computer device and a storage medium for determining a transportation path.
A method of determining a transport path, the method comprising:
acquiring the attribute of a transported object;
determining an available transfer node in a plurality of logistics nodes according to the attributes of the transported objects;
determining at least one candidate transportation path based on the available transit nodes and the inter-node transportation capacity connectivity of the transportation starting node and the transportation ending node;
and selecting a transportation path for transporting the object to be transported from the at least one candidate transportation path.
In one embodiment, before determining at least one candidate transportation route based on the available transit nodes and the inter-node transportation connectivity of the transportation start node and the transportation end node, the method further includes: acquiring a transportation starting point and a transportation terminal point of the object to be transported; and according to the transportation starting point and the transportation end point, determining the transportation starting point matched with the transportation starting point and the transportation end point matched with the transportation end point from the logistics nodes according to the attributes of the transported objects.
In one embodiment, the determining at least one candidate transportation path based on the available transit nodes and the inter-node transportation connectivity of the transportation start node and the transportation end node includes: acquiring a first transport capacity connectivity corresponding to the transport starting node and a second transport capacity connectivity corresponding to the transport terminating node; determining at least one first logistics node from the plurality of available transfer nodes according to the first transportation connectivity, and determining at least one second logistics node from the plurality of available transfer nodes according to the second transportation connectivity; if the same logistics node exists in the at least one first logistics node and the at least one second logistics node, determining the candidate transportation path based on the transportation starting node, the transportation ending node and the same logistics node.
In one embodiment, after determining at least one first logistics node from the plurality of available transit nodes according to the first transportation connectivity and determining at least one second logistics node from the plurality of available transit nodes according to the second transportation connectivity, the method further includes: and if the same logistics node does not exist in the at least one first logistics node and the at least one second logistics node, taking each first logistics node as a new transportation starting node and each second logistics node as a new transportation ending node, and returning to the step of obtaining the first transportation connectivity corresponding to the transportation starting node and the second transportation connectivity corresponding to the transportation ending node.
In one embodiment, selecting a transportation path for transporting the object to be transported from the at least one candidate transportation path includes: acquiring resource consumption of each candidate transportation path; and taking the candidate transportation path with the minimum resource consumption as the transportation path of the object to be transported.
In one embodiment, the obtaining the resource consumption of each candidate transportation path includes: acquiring transportation time consumption and/or transportation cost consumption of each candidate transportation path based on preset transportation constraint conditions; and obtaining the resource consumption of each candidate transportation path according to the transportation time consumption and/or the transportation cost consumption.
In one embodiment, the obtaining of the transportation time consumption and/or the transportation cost consumption of each candidate transportation route includes: determining a current candidate transportation path and a plurality of current logistics nodes corresponding to the current candidate transportation path; the current logistics node is a logistics node on the current candidate transportation path; acquiring transportation time consumption and transportation cost consumption among current logistics nodes, and acquiring switching time consumption and switching cost consumption corresponding to the current logistics nodes; determining the transportation time consumption of the current candidate transportation path according to the transportation time consumption between the current logistics nodes and the switching time consumption, and determining the transportation cost consumption of the current candidate transportation path according to the transportation cost consumption between the current logistics nodes and the switching cost consumption.
In one embodiment, after the selecting a transportation path for transporting the object to be transported from the at least one candidate transportation path, the method further includes: displaying the transportation path of the object to be transported; and responding to the displayed updating operation of the transportation path of the object to be transported, and updating the transportation path of the object to be transported.
An apparatus for determining a transport path, the apparatus comprising:
the transport object attribute acquisition module is used for acquiring the transport object attribute of the object to be transported;
the transit node determining module is used for determining available transit nodes in the plurality of logistics nodes according to the attributes of the transported objects;
a candidate route determination module, configured to determine at least one candidate transportation route based on the available transit nodes and inter-node transportation connectivity of the transportation start node and the transportation end node;
and the transportation path determining module is used for selecting a transportation path for transporting the object to be transported from the at least one candidate transportation path.
A computer device comprising a memory storing a computer program and a processor implementing the steps of the above method when executing the computer program.
A computer-readable storage medium, on which a computer program is stored which, when being executed by a processor, carries out the steps of the above-mentioned method.
The method, the device, the computer equipment and the storage medium for determining the transport route acquire the transport attribute of the object to be transported; determining an available transfer node in the plurality of logistics nodes according to the attribute of the transport object; determining at least one candidate transportation path based on the available transit nodes and the inter-node transportation capacity connectivity of the transportation starting node and the transportation ending node; and selecting a transportation path for transporting the object to be transported from the at least one candidate transportation path. According to the method and the device, a plurality of available transfer nodes are found through attributes of the transported objects, after the candidate transport paths are formed by recycling the transport capacity connectivity among the nodes, the final transport paths of the transported objects are determined, the transfer nodes can be prevented from being manually designed, so that the decision is shortened in time, and the determination efficiency of the transport paths is improved.
Drawings
FIG. 1 is a schematic flow chart diagram of a method of determining a transport path in one embodiment;
FIG. 2 is a flow diagram illustrating the determination of a transport start node and a transport end node in one embodiment;
FIG. 3 is a flow diagram illustrating the determination of candidate transportation routes in one embodiment;
FIG. 4 is a schematic illustration of determining candidate transportation paths in one embodiment;
FIG. 5 is a flow diagram illustrating the process of acquiring transportation time consumption and transportation cost consumption according to one embodiment;
FIG. 6 is a flow chart illustrating a method for automatically planning a multimodal transportation scheme in an exemplary application;
FIG. 7 is a block diagram of an apparatus for determining a transport path in one embodiment;
FIG. 8 is a diagram of an internal structure of a computer device in one embodiment.
Detailed Description
In order to make the objects, technical solutions and advantages of the present application more apparent, the present application is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the present application and are not intended to limit the present application.
In one embodiment, as shown in fig. 1, a method for determining a transportation path is provided, and this embodiment is illustrated by applying the method to a server, and it is to be understood that the method may also be applied to a terminal, and may also be applied to a system including a terminal and a server, and is implemented by interaction between the terminal and the server. In this embodiment, the method includes the steps of:
s101, a server acquires the attribute of a transported object of the object to be transported;
and S102, the server determines an available transfer node in the plurality of logistics nodes according to the attribute of the transport object.
The object to be transported refers to a transport object that needs to be transported in logistics, and the attribute of the transport object refers to an attribute of the object to be transported that may affect a transport node or a transport mode that is available for the object to be transported, and may include whether the object to be transported is a fragile object, whether the object to be transported is a corrosive object, whether the object to be transported is a fresh object, or the like. Because different objects to be transported have different transportation requirements, the server needs to find a suitable logistics node as an available transfer node according to the attributes of the objects to be transported. For example, the logistics node may include a node a, a node B, and a node C, where only the node B and the node C can transport fragile articles, so that when a certain object to be transported belongs to the fragile articles, the server may use the node B and the node C as available transit nodes matched with the attributes of the transported articles, or only the node a and the node B can transport corrosive articles, and when a certain object to be transported belongs to the corrosive articles, the server may use the node a and the node B as available transit nodes matched with the attributes of the corrosive articles.
Step S103, the server determines at least one candidate transportation route based on the available transit nodes and the connectivity of the transportation capacity between the transportation starting node and the transportation ending node.
The transportation capability connectivity refers to whether the nodes can be communicated through transportation capability, the transportation starting node and the transportation ending node refer to a starting logistics node and a corresponding ending logistics node for logistics transportation of the object to be transported, and the transportation starting node and the transportation ending node can be generally determined according to a transportation starting point and a transportation ending point of the object to be transported, namely a delivery location and a receiving location of the object to be transported, for example, the logistics node closest to the transportation starting point and the transportation ending point of the object to be transported can be used as the transportation starting node and the transportation ending node. After the server determines the transportation starting node and the transportation ending node, at least one candidate transportation path can be found according to the transportation connectivity between the nodes.
For example, the capacity connectivity may be obtained by a node capacity table in which transportation modes existing between the logistics nodes are stored in advance, for example, the table may be pre-recorded with capacity connectivity of railway capacity existing from the node a to the node B, and capacity connectivity of road capacity existing from the node B to the node C, so that when the transportation start node and the transportation end node are the node a and the node C, respectively, the server may determine a candidate transportation path for railway transportation from the node a to the node B, and road transportation from the node B to the node C according to the capacity connectivity recorded by the node capacity table.
And step S104, the server selects a transportation path for transporting the object to be transported from at least one candidate transportation path.
Finally, the server may select one of the determined candidate transportation routes as a final transportation route for transporting the object to be transported, for example, the candidate transportation route with the shortest transportation time may be selected as the final transportation route for the object to be transported.
In the method for determining the transportation path, the server acquires the transportation object attribute of the object to be transported; determining an available transfer node in the plurality of logistics nodes according to the attribute of the transport object; determining at least one candidate transportation path based on the available transit nodes and the inter-node transportation connectivity of the transportation starting node and the transportation ending node; and selecting a transportation path for transporting the object to be transported from the at least one candidate transportation path. According to the method and the system, the server finds the plurality of available transfer nodes through the attributes of the transported objects, and determines the final transport path of the transported objects from the candidate transport paths after the candidate transport paths are formed by utilizing the transport connectivity among the nodes, so that the transfer nodes can be prevented from being manually designed, the decision is shortened, and the determination efficiency of the transport paths is improved.
In one embodiment, as shown in fig. 2, before step S103, the method may further include:
in step S201, the server obtains a transportation start point and a transportation end point of the object to be transported.
The transportation starting point and the transportation ending point refer to a delivery location and a receiving location of the object to be transported, and the delivery location and the receiving location can be filled in a logistics transportation order corresponding to the object to be transported by a user. Specifically, the server may read a logistics transportation order corresponding to the to-be-transported object, and obtain a delivery location and a receiving location corresponding to the to-be-transported object from the logistics transportation order as a transportation starting point and a transportation ending point of the to-be-transported object.
And S202, the server determines a transportation starting node matched with the transportation starting point and a transportation ending node matched with the transportation ending point from the logistics nodes according to the transportation starting point and the transportation ending point and the transportation property.
After determining the transportation start point and the transportation end point of the object to be transported, the server may further find the transportation start node and the transportation end node, where the transportation start node and the transportation end node may be one or multiple, for example, the logistics node closest to the transportation start point and the transportation end point may be used as the candidate transportation start node and the candidate transportation end node, or the logistics node whose distance from the transportation start point and the transportation end point is smaller than a certain distance threshold may be used as the candidate transportation start node and the candidate transportation end node. In addition, since not all the logistics nodes can transport a certain object to be transported, the candidate transportation start node and the candidate transportation end node need to be further screened according to the transportation object attribute of the object to be transported.
For example, although the node a may be a candidate transportation start node for a fragile object, in the case that the node a cannot transport the fragile object, the server needs to select another logistics node as the transportation start node. Similar to step S102, the server may take the candidate transportation start node matching the property of the transportation object as the transportation start node, and may take the candidate transportation start node matching the property of the transportation object as the transportation end node.
Further, as shown in fig. 3, step S103 may further include:
step S301, the server obtains a first transportation connectivity corresponding to the transportation starting node and a second transportation connectivity corresponding to the transportation ending node.
The first transport connectivity corresponding to the transportation starting node refers to the transport connectivity from the transportation starting node to other logistics nodes, and the second transport connectivity corresponding to the transportation ending node refers to the transport connectivity from other logistics nodes to the transportation ending node. Specifically, after the server determines the transportation starting node and the transportation ending node, the first transportation connectivity corresponding to the transportation starting node and the second transportation connectivity corresponding to the transportation ending node can be found from the node transportation table in which the transportation information of each logistics node is recorded in advance.
For example: the node capacity table may record capacity connectivity from node a to node B, capacity connectivity from node a to node C, capacity connectivity from node B to node D, and capacity connectivity from node C to node D, so that when the transport start node is node a and the transport end node is node D, the first capacity connectivity refers to capacity connectivity from node a to node B, or capacity connectivity from node a to node C, and the second capacity connectivity refers to capacity connectivity from node B to node D, or capacity connectivity from node C to node D.
Step S302, the server determines at least one first logistics node from the plurality of available transfer nodes according to the first transportation connectivity, and determines at least one second logistics node from the plurality of available transfer nodes according to the second transportation connectivity.
The first logistics node refers to a logistics node matched with the first transportation connectivity in the available transit nodes, and the second logistics node refers to a logistics node matched with the second transportation connectivity in the available transit nodes, for example, only one of the nodes a, B, C, and D belongs to the available transit nodes, so that the node B may serve as the first logistics node and the same node B may serve as the second logistics node when the node a serves as the transportation start node.
Step S303, if the same logistics node exists in the at least one first logistics node and the at least one second logistics node, the server determines a candidate transportation path based on the transportation start node, the transportation end node, and the same logistics node.
Finally, if the same logistics node exists in the first logistics node and the second logistics node, the server can determine a candidate transportation path based on the transportation starting node, the transportation ending node and the same logistics node.
As shown in fig. 4, the transportation start node of the object to be transported may include node 1, node 2, node 3, and node 4, the first logistics node obtained according to the first transportation connectivity may include node 1 ', node 2', node 3 ', and node J, and the transportation end node of the object to be transported may include node a, node B, node C, and node D, the second logistics node obtained according to the second transportation connectivity may include node a', node B ', node C', and node J, and since the same node J exists in the first logistics node and the second logistics node, a transportation path from node 4 as the transportation start node, through node J, and finally to node D as the transportation end node may be obtained.
In addition, after step S302, the method may further include: if there is no same logistics node in the at least one first logistics node and the at least one second logistics node, taking each first logistics node as a new transportation starting node and each second logistics node as a new transportation ending node, and returning to step S301.
If the same logistics node does not exist in the first logistics node and the second logistics node obtained in step S302, the server may also use each obtained first logistics node as a new transportation start node and each obtained second logistics node as a new transportation end node, and obtain the first transportation connectivity and the second transportation connectivity corresponding to the new transportation start node and the new transportation end node again, and determine the new first logistics node and the new second logistics node until the same logistics node exists in the first logistics node and the second logistics node, thereby forming a corresponding candidate transportation path.
For example: in the logistics transportation process with the node a as a transportation starting node and the node E as a transportation terminating node, if the first logistics node corresponding to the node a includes a node B and a node C, and the second logistics node corresponding to the node E includes a node D, and there are no same first logistics node and second logistics node at this time, then the node B and the node C may be taken as a new transportation starting node again, and the node D may be taken as a new transportation terminating node, and if there is a certain node F, which belongs to the new first logistics node corresponding to the node B, and also belongs to the second logistics node corresponding to the node D, then a candidate transportation path starting from the node a, passing through the node B, the node F, and the node D, and finally reaching the node E may be generated.
In the above embodiment, the server may find the corresponding transportation start node and transportation end node according to the attribute of the transportation object based on the transportation start point and the transportation end point of the transportation object, therefore, the acquisition efficiency of the transportation starting node and the transportation terminating node is improved, meanwhile, the corresponding first logistics node and second logistics node are found through the first transportation connectivity and the second transportation connectivity respectively corresponding to the transportation starting node and the transportation terminating node, the candidate transportation path is constructed, and if the candidate transportation path directly established through one transit node does not exist, the found first logistics node and second logistics node can be used as a new transportation starting node and a new transportation ending node again, and the first logistics node and the second logistics node can be searched again until the candidate transportation path can be established, so that the efficiency and the realizability of establishing the candidate transportation path are improved.
In one embodiment, step S104 may further include: the server acquires the resource consumption of each candidate transportation path; and taking the candidate transportation path with the minimum resource consumption as the transportation path of the object to be transported.
Resource consumption refers to the consumption of resources generated during transportation and can be expressed by transportation cost. The server can acquire the resource consumption of each candidate transportation path in the transportation process, and takes the candidate transportation path with the minimum resource consumption as the final transportation path of the object to be transported.
Further, the obtaining, by the server, the resource consumption of each candidate transportation path may further include: the server acquires the transportation time consumption and/or the transportation cost consumption of each candidate transportation path based on a preset transportation constraint condition; and obtaining the resource consumption of each candidate transportation path according to the transportation time consumption and/or the transportation expense consumption.
The transportation constraint condition refers to a preset constraint condition that needs to be satisfied during transportation, and may include, for example: the transportation between any two logistics nodes only uses one transportation mode, the transit mode in one logistics node only uses one mode, and the like. Specifically, the present embodiment may calculate transportation time consumption and transportation cost consumption of each candidate transportation path based on a pre-designed constraint condition, and obtain resource consumption of each candidate transportation path according to the transportation time consumption and the transportation cost consumption.
Further, as shown in fig. 5, the step of acquiring the transportation time consumption and/or the transportation cost consumption of each candidate transportation route by the server may further include:
step S501, a server determines a current candidate transportation path and a plurality of current logistics nodes corresponding to the current candidate transportation path; and the current logistics node is a logistics node on the current candidate transportation path.
The current candidate transportation path refers to any one of the at least one candidate transportation path, and the current logistics node is a logistics node on the current candidate transportation path. When the server needs resource consumption of each candidate transportation path, one candidate transportation path can be selected from the candidate transportation paths as a current candidate transportation path, and a logistics node on the current candidate transportation path is obtained and used as a current logistics node.
Step S502, the server acquires the transportation time consumption and the transportation cost consumption among the current logistics nodes, and acquires the switching time consumption and the switching cost consumption corresponding to the current logistics nodes.
The transportation time consumption refers to time consumption caused by cargo transportation between two adjacent logistics nodes on a current candidate transportation path, the transportation cost consumption refers to cost consumption caused by cargo transportation between the two adjacent logistics nodes, the switching time consumption refers to time consumption caused by a change of a transportation mode on a certain logistics node, and the switching cost consumption refers to cost consumption caused by a change of the transportation mode. The consumption can be acquired by a user in advance and input into the server, and the data can be read after the server determines the current transportation node on the current candidate transportation path.
Step S503, the server determines the transportation time consumption of the current candidate transportation path according to the transportation time consumption and the switching time consumption between the current logistics nodes, and determines the transportation cost consumption of the current candidate transportation path according to the transportation cost consumption and the switching cost consumption between the current logistics nodes.
Finally, the server can sum the transportation time consumption and the switching time consumption among the current logistics nodes, so that the transportation time consumption of the current candidate transportation path is obtained, and the transportation cost consumption and the switching cost consumption among the current logistics nodes are summed, so that the transportation cost consumption of the current candidate transportation path is obtained.
In the above embodiment, the server may select the candidate transportation path with the smallest resource consumption as the transportation path of the object to be transported, so as to reduce the transportation cost of the transportation of the goods, and further, calculate the transportation time consumption and the transportation cost consumption of each candidate transportation path, so as to obtain the final resource consumption of each candidate transportation path, where the transportation time consumption is obtained from the transportation time consumption between the logistics nodes and the switching time consumption of each node, and the transportation cost consumption is obtained from the transportation cost consumption between the logistics nodes and the switching cost consumption of each node, so as to further improve the accuracy of the obtained resource consumption.
In addition, in an embodiment, after the step S104, the method may further include: the server displays the transportation path of the object to be transported; and responding to the updating operation aiming at the displayed transport path of the object to be transported, and updating the transport path of the object to be transported.
After the server obtains the transportation path of the object to be transported, the obtained transportation path of the object to be transported may be displayed, and if some special situations occur, for example, when the original transportation path may be stopped or late for some reason, in order to reduce the influence of the situations, in this embodiment, the user may further perform an update operation on the displayed transportation path of the object to be transported, the update operation may be triggered to the server through the user terminal, and the server may respond to the update operation, thereby implementing an update process on the transportation path of the object to be transported.
In this embodiment, the user can also realize the updating of the transportation route of the object to be transported by triggering the updating operation on the transportation route, so that the influence of the logistics transportation caused by some special situations can be reduced, and the reliability of the logistics transportation is improved.
In an application example, a method, a tool and a system for automatically planning a multimodal transportation scheme are also provided, a workflow of the system can be as shown in fig. 6, and specifically, the method can be implemented based on the following parts:
(1) a data chassis: the application establishes logistics data for realizing logistics path planning in advance, and the logistics data comprises the following steps:
station data: the data of the total stations are established to include railway stations, waterway ports, airports and land transportation stations. The method comprises the data of the operation capability, the position longitude and latitude and the like of each node. Constraint data of distance is provided for optimal calculation.
Capacity data: the transportation capacity resources of various transportation modes comprise the transportation modes, transportation timeliness, transshipment timeliness, cost and other dimensions. And data input and operation energy constraint of an objective function are provided for optimal calculation.
Goods name configuration table: the method comprises the configuration of iron, water, public and empty names. And providing goods class constraint data for the optimal computational mathematical model.
(2) A container calculator is provided, which can be used for rapidly calculating the loading condition of each container and the required quantity of the containers by inputting the information and the cargo quantity of cargos, using containers or vehicle containers configured in a distribution system and using a bubbling sequencing algorithm.
(3) Providing a mathematical model for linear programming optimal solution of a multi-type intermodal logistics solution, and logically calculating the optimal solution through the mathematical model of a double objective function (aging + cost), wherein the function model is as follows:
objective function z of the model 1 The right 1 st part represents the total transportation cost for a given quantity of goods to be transported from the origin to the destination, and the right 2 nd part represents the sum of transit costs for a transit mode change at the transit location;
objective function z 2 The right-hand portion 1 represents the total transit time for a given quantity of cargo to be transported from the origin to the destination, and the right-hand portion 2 represents the sum of transit times for a transit mode change at the transit location, as a sum of 2 separate linear cost functions.
In the constraint condition, the number of the optical fiber,
indicating that only one mode of transportation can be used for the transportation between 2 nodes;
(4) Depth-first search algorithm model for recommending logistics solution combination
1. Available nodes:
the available nodes are quickly determined according to screening conditions (goods names, loading containers, designated transportation modes and the like) by the map search technology.
2. Available transport capacity
And carrying out next enumeration of the next potential available node through the available capacity. This step is repeated until the set of potentially available nodes for the originating station intersects the set of potentially available nodes for the destination station.
(5) The logistics solution manual adjustment function is provided, after scheme recommendation is completed, operators manually adjust the scheme according to actual conditions, and the floor condition of the scheme is monitored in real time.
The application example can rapidly screen available nodes and transport capacity resources, automatically generate the model through the multi-type combined transport logistics solution, rapidly generate the timeliness and the cost of the logistics solution, greatly shorten the manufacturing time of the multi-type combined transport logistics solution and greatly improve the efficiency of manufacturing the logistics solution; and the system has high expansibility, and can be expanded to logistics plates such as express delivery, instant logistics and the like.
It should be understood that, although the steps in the flowcharts of the present application are shown in order as indicated by the arrows, the steps are not necessarily performed in order as indicated by the arrows. The steps are not performed in the exact order shown and described, and may be performed in other orders, unless explicitly stated otherwise. Moreover, at least some of the steps in the figures may include multiple steps or multiple stages, which are not necessarily performed at the same time, but may be performed at different times, and the order of performing the steps or stages is not necessarily sequential, but may be performed alternately or alternatively with other steps or at least some of the steps or stages in other steps.
In one embodiment, as shown in fig. 7, there is provided an apparatus for determining a transport path, including: a transport attribute obtaining module 701, a transit node determining module 702, a candidate route determining module 703 and a transport route determining module 704, wherein:
a transport property obtaining module 701, configured to obtain a transport property of an object to be transported;
a transit node determining module 702, configured to determine an available transit node in the multiple logistics nodes according to the attribute of the transport;
a candidate route determining module 703, configured to determine at least one candidate transportation route based on the available transit node and the connectivity of the transportation capability between the transportation start node and the transportation end node;
a transportation path determining module 704, configured to select a transportation path for transporting the object to be transported from the at least one candidate transportation path.
In one embodiment, the apparatus for determining a transport path further comprises: the starting and ending determining module is used for acquiring a transportation starting point and a transportation ending point of the object to be transported; and determining a transportation starting node matched with the transportation starting point and a transportation ending node matched with the transportation ending point from the logistics nodes according to the transportation starting point and the transportation ending point and the transportation property.
In one embodiment, the candidate path determining module 703 is further configured to obtain a first transportation connectivity corresponding to the transportation starting node and a second transportation connectivity corresponding to the transportation ending node; determining at least one first logistics node from the plurality of available transfer nodes according to the first transportation connectivity, and determining at least one second logistics node from the plurality of available transfer nodes according to the second transportation connectivity; and if the same logistics node exists in the at least one first logistics node and the at least one second logistics node, determining a candidate transportation path based on the transportation starting node, the transportation ending node and the same logistics node.
In an embodiment, the candidate path determining module 703 is further configured to, if there is no same logistics node in the at least one first logistics node and the at least one second logistics node, regard each first logistics node as a new transportation starting node, regard each second logistics node as a new transportation ending node, and return to the step of obtaining the first transportation connectivity corresponding to the transportation starting node and the second transportation connectivity corresponding to the transportation ending node.
In one embodiment, the transportation path determining module 704 is further configured to obtain resource consumption of each candidate transportation path; and taking the candidate transportation path with the minimum resource consumption as the transportation path of the object to be transported.
In an embodiment, the transportation path determining module 704 is further configured to obtain transportation time consumption and/or transportation cost consumption of each candidate transportation path based on a preset transportation constraint condition; and obtaining the resource consumption of each candidate transportation path according to the transportation time consumption and/or the transportation expense consumption.
In an embodiment, the transportation path determining module 704 is further configured to determine a current candidate transportation path and a plurality of current logistics nodes corresponding to the current candidate transportation path; the current logistics node is a logistics node on the current candidate transportation path; acquiring transportation time consumption and transportation cost consumption among current logistics nodes, and acquiring switching time consumption and switching cost consumption corresponding to the current logistics nodes; and determining the transportation time consumption of the current candidate transportation path according to the transportation time consumption and the switching time consumption between the current logistics nodes, and determining the transportation cost consumption of the current candidate transportation path according to the transportation cost consumption and the switching cost consumption between the current logistics nodes.
In one embodiment, the apparatus for determining a transport path further comprises: the transportation path updating module is used for displaying the transportation path of the object to be transported; and responding to the updating operation aiming at the displayed transport path of the object to be transported, and updating the transport path of the object to be transported.
For specific definition of the means for determining the transportation path, reference may be made to the above definition of the method for determining the transportation path, which is not described herein again. The various modules in the above-described means for determining a transport path may be implemented in whole or in part by software, hardware, and combinations thereof. The modules can be embedded in a hardware form or independent from a processor in the computer device, and can also be stored in a memory in the computer device in a software form, so that the processor can call and execute operations corresponding to the modules.
In one embodiment, a computer device is provided, which may be a server, and its internal structure diagram may be as shown in fig. 8. The computer device includes a processor, a memory, and a network interface connected by a system bus. Wherein the processor of the computer device is configured to provide computing and control capabilities. The memory of the computer device comprises a nonvolatile 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 an operating system and computer programs in the non-volatile storage medium. The database of the computer device is used for storing the logistics node data. The network interface of the computer device is used for communicating with an external terminal through a network connection. The computer program is executed by a processor to implement a method of determining a transport path.
Those skilled in the art will appreciate that the architecture shown in fig. 8 is merely a block diagram of some of the structures associated with the disclosed aspects and is not intended to limit the computing devices to which the disclosed aspects apply, as particular computing devices may include more or less components than those shown, or may combine certain components, or have a different arrangement of components.
In one embodiment, a computer device is further provided, which includes a memory and a processor, the memory stores a computer program, and the processor implements the steps of the above method embodiments when executing the computer program.
In an embodiment, a computer-readable storage medium is provided, on which a computer program is stored which, when being executed by a processor, carries out the steps of the above-mentioned method embodiments.
It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by hardware instructions of a computer program, which can be stored in a non-volatile computer-readable storage medium, and when executed, can include the processes of the embodiments of the methods described above. Any reference to memory, storage, database or other medium used in the embodiments provided herein can 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, optical storage, or the like. Volatile Memory can include Random Access Memory (RAM) or external cache Memory. By way of illustration and not limitation, RAM can take many forms, such as Static Random Access Memory (SRAM) or Dynamic Random Access Memory (DRAM), among others.
The technical features of the above embodiments can be arbitrarily combined, and for the sake of brevity, all possible combinations of the technical features in the above embodiments are not described, but should be considered as the scope of the present specification as long as there is no contradiction between the combinations of the technical features.
The above-mentioned embodiments only express several embodiments of the present application, and the description thereof is more specific and detailed, but not construed as limiting the scope of the invention. It should be noted that, for a person skilled in the art, several variations and modifications can be made without departing from the concept of the present application, which falls within the scope of protection of the present application. Therefore, the protection scope of the present patent shall be subject to the appended claims.
Claims (11)
1. A method of determining a transport path, the method comprising:
acquiring the attribute of a transported object;
determining an available transfer node in a plurality of logistics nodes according to the attributes of the transported objects;
determining at least one candidate transportation path based on the available transit nodes and the inter-node transportation capacity connectivity of the transportation starting node and the transportation ending node;
and selecting a transportation path for transporting the object to be transported from the at least one candidate transportation path.
2. The method of claim 1, wherein before determining at least one candidate transportation path based on the inter-node capacity connectivity of the available transit nodes and the transportation start node and the transportation end node, further comprising:
acquiring a transportation starting point and a transportation terminal point of the object to be transported;
and according to the transportation starting point and the transportation end point, determining the transportation starting point matched with the transportation starting point and the transportation end point matched with the transportation end point from the logistics nodes according to the attributes of the transported objects.
3. The method of claim 2, wherein determining at least one candidate transportation path based on the available transit nodes and inter-node capacity connectivity of a transportation start node and a transportation end node comprises:
acquiring a first transport capacity connectivity corresponding to the transport starting node and a second transport capacity connectivity corresponding to the transport terminating node;
determining at least one first logistics node from the plurality of available transfer nodes according to the first transportation connectivity, and determining at least one second logistics node from the plurality of available transfer nodes according to the second transportation connectivity;
if the same logistics node exists in the at least one first logistics node and the at least one second logistics node, determining the candidate transportation path based on the transportation starting node, the transportation ending node and the same logistics node.
4. The method of claim 3, wherein after determining at least one first logistics node from the plurality of available transit nodes based on the first vehicular connectivity and at least one second logistics node from the plurality of available transit nodes based on the second vehicular connectivity, further comprising:
and if the same logistics node does not exist in the at least one first logistics node and the at least one second logistics node, taking each first logistics node as a new transportation starting node and each second logistics node as a new transportation ending node, and returning to the step of obtaining the first transportation connectivity corresponding to the transportation starting node and the second transportation connectivity corresponding to the transportation ending node.
5. The method of claim 1, wherein selecting a transportation path for transporting the item to be transported from the at least one candidate transportation path comprises:
acquiring resource consumption of each candidate transportation path;
and taking the candidate transportation path with the minimum resource consumption as the transportation path of the object to be transported.
6. The method of claim 5, wherein the obtaining resource consumption for each candidate transportation path comprises:
acquiring the transportation time consumption and/or the transportation cost consumption of each candidate transportation path based on a preset transportation constraint condition;
and obtaining the resource consumption of each candidate transportation path according to the transportation time consumption and/or the transportation cost consumption.
7. The method of claim 6, wherein the obtaining of the transportation time consumption and/or the transportation cost consumption of each candidate transportation route comprises:
determining a current candidate transportation path and a plurality of current logistics nodes corresponding to the current candidate transportation path; the current logistics node is a logistics node on the current candidate transportation path;
acquiring transportation time consumption and transportation cost consumption among current logistics nodes, and acquiring switching time consumption and switching cost consumption corresponding to the current logistics nodes;
determining the transportation time consumption of the current candidate transportation path according to the transportation time consumption among the current logistics nodes and the switching time consumption, and determining the transportation cost consumption of the current candidate transportation path according to the transportation cost consumption among the current logistics nodes and the switching cost consumption.
8. The method according to any one of claims 1 to 7, wherein after the selecting the transportation route for transporting the object to be transported from the at least one candidate transportation route, the method further comprises:
displaying the transportation path of the object to be transported;
and responding to the displayed updating operation of the transportation path of the object to be transported, and updating the transportation path of the object to be transported.
9. An apparatus for determining a transport path, the apparatus comprising:
the transport object attribute acquisition module is used for acquiring the transport object attribute of the object to be transported;
the transit node determining module is used for determining available transit nodes in the plurality of logistics nodes according to the attributes of the transported objects;
a candidate route determination module, configured to determine at least one candidate transportation route based on the available transit nodes and inter-node transportation connectivity of the transportation start node and the transportation end node;
and the transportation path determining module is used for selecting a transportation path for transporting the object to be transported from the at least one candidate transportation path.
10. A computer device comprising a memory and a processor, the memory storing a computer program, wherein the processor implements the steps of the method of any one of claims 1 to 8 when executing the computer program.
11. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the steps of the method of any one of claims 1 to 8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110278849.5A CN115081666A (en) | 2021-03-16 | 2021-03-16 | Method, device, computer equipment and storage medium for determining transportation path |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110278849.5A CN115081666A (en) | 2021-03-16 | 2021-03-16 | Method, device, computer equipment and storage medium for determining transportation path |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115081666A true CN115081666A (en) | 2022-09-20 |
Family
ID=83245877
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110278849.5A Pending CN115081666A (en) | 2021-03-16 | 2021-03-16 | Method, device, computer equipment and storage medium for determining transportation path |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115081666A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117808383A (en) * | 2024-02-29 | 2024-04-02 | 天津小铁马科技有限公司 | Method, device, equipment and medium for monitoring transportation of freight vehicle |
-
2021
- 2021-03-16 CN CN202110278849.5A patent/CN115081666A/en active Pending
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117808383A (en) * | 2024-02-29 | 2024-04-02 | 天津小铁马科技有限公司 | Method, device, equipment and medium for monitoring transportation of freight vehicle |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109034481B (en) | Constraint programming-based vehicle path problem modeling and optimizing method with time window | |
| Lin et al. | System reliability for a multistate intermodal logistics network with time windows | |
| Lai et al. | An heuristic search for the routing of heterogeneous trucks with single and double container loads | |
| Moccia et al. | Modeling and solving a multimodal transportation problem with flexible‐time and scheduled services | |
| CN102542395B (en) | A kind of emergency materials dispatching system and computing method | |
| CN111553626A (en) | Path planning method and device, electronic equipment and storage medium thereof | |
| Moadab et al. | Drone routing problem model for last-mile delivery using the public transportation capacity as moving charging stations | |
| US20200327497A1 (en) | System and method for linehaul optimization | |
| CN115112136A (en) | Travel path planning method and travel path recommendation method | |
| Demeyer et al. | Dynamic and stochastic routing for multimodal transportation systems | |
| Reed et al. | Does parking matter? The impact of search time for parking on last-mile delivery optimization | |
| KR102624451B1 (en) | Server, method and computer program for providing route information for logistics | |
| Kim et al. | Optimizing the transportation of international container cargoes in Korea | |
| CN115081666A (en) | Method, device, computer equipment and storage medium for determining transportation path | |
| Yeh et al. | Rail transport network reliability with train arrival delay: A reference indicator for a travel agency in tour planning | |
| CN115705593A (en) | Logistics transportation method and device, computer equipment and storage medium | |
| Bayram et al. | Hub network design problem with capacity, congestion, and stochastic demand considerations | |
| Berhan | Stochastic vehicle routing problems with simultaneous pickup and delivery services | |
| CN114331568B (en) | Commercial vehicle market segment identification method, equipment and medium based on Internet of vehicles | |
| CN114580741A (en) | Path planning method, device and equipment based on multi-traffic network | |
| Zhu et al. | Electric vehicle traveling salesman problem with drone with partial recharge policy | |
| CN115115318A (en) | Dangerous goods transportation network planning method and system considering user path selection behavior | |
| CN115409222A (en) | Graph database-based transportation route planning method, device, equipment and medium | |
| Zhu et al. | Multimodal transport cost model bases on dynamic alliances | |
| KR20210016605A (en) | Transporter route prediction based on dynamic input data |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |