CN-121981625-A - Transport channel optimization method, apparatus, device, storage medium, and program product

CN121981625ACN 121981625 ACN121981625 ACN 121981625ACN-121981625-A

Abstract

The present application relates to a transportation channel optimization method, apparatus, device, storage medium and program product. The method comprises the steps of obtaining transportation information of a transportation network topology, solving an objective function according to node information and arc information of transportation arcs to obtain minimum total cost and decision results under the condition that the objective constraint conditions are met, wherein the transportation information at least comprises node information of all transportation nodes in the transportation network topology, arc information of all transportation arcs, time requirements of transportation tasks and transportation volume requirements of the transportation tasks, the transportation arcs comprise usable internal transportation arcs and external transportation arcs to be decided to choose or not, objective functions and constraint conditions which aim at minimizing total cost are constructed according to the time requirements and the transportation volume requirements, and the decision results comprise whether all external transportation arcs are chosen or not. The method can flexibly determine the selection decision of the external transportation channel under the condition of meeting the transportation requirement.

Inventors

WANG HANZHONG
SHI WENQIANG
Hao Zhengbo
WANG JIA
XIAO BAOLING
Duan Zhenqing
DENG CHENG

Assignees

国家能源集团新能源技术研究院有限公司

Dates

Publication Date: 20260505
Application Date: 20251202

Claims (10)

1. A method of optimizing a transportation pathway, the method comprising: The method comprises the steps of obtaining transportation information of a transportation network topology, wherein the transportation information at least comprises node information of each transportation node, arc information of each transportation arc, time requirement of a transportation task and transportation volume requirement of the transportation task in the transportation network topology, and the transportation arcs comprise usable internal transportation arcs and external transportation arcs to be decided whether to be selected or not; constructing an objective function and constraint conditions targeting a minimization of total cost based on the time demand and the traffic demand; and solving the objective function according to the node information and the arc information of the transportation arcs under the condition that the target constraint condition is met, so as to obtain the minimum total cost and a decision result, wherein the decision result comprises whether each external transportation arc is selected or not.
2. The method of claim 1, wherein constructing an objective function and constraint that target minimizing total cost based on the time demand and the traffic demand comprises: Constructing the objective function according to the total time required for completing the transportation task in the time requirement and the transportation quantity requirement; The objective function is the minimum value of the sum of the using cost of the external transportation arc and the variable transportation cost and the time cost generated in the transportation process of all the used transportation arcs, wherein the using cost of the external transportation arc comprises the using cost of all the selected external transportation arcs, the variable transportation cost comprises the product of the unit transportation cost and the transportation volume of all the used transportation arcs, and the time cost comprises the product of the total time length and the unit time cost required for completing the transportation task.
3. The method according to claim 1 or 2, wherein said constructing an objective function and constraint targeting minimizing total cost based on said time demand and said traffic demand comprises: constructing the target constraint condition according to the time requirement and the traffic requirement; The target constraint includes at least one of: The node flow conservation constraint is used for constraining the conservation of the cargo receiving quantity and the cargo output quantity of each transportation node; the time constraint is used for constraining the time for transferring goods by each transportation node; a transport capacity upper limit constraint for constraining a transport capacity of each of the transport arcs from exceeding a target transport capacity upper limit; The time window constraint is used for constraining the total time length for completing the transportation task; Selecting decision constraints; for constraining the selection of the outer transport arc; and the transportation quantity used for restraining the transportation arc is a non-negative number.
4. The method of claim 3, wherein each transport node comprises a transport origin, a transport destination, and a transport intermediate node, and wherein the node traffic conservation constraint comprises at least one of: The sum of the amounts of goods delivered from all the transportation starting points is equal to the total amount of goods supplied; the sum of the cargo amounts received at all transport destination points is equal to the total cargo demand; For each of the shipping nodes, the shipping node delivers an amount of cargo equal to the amount of cargo received by the shipping node.
5. A method according to claim 3, wherein the time constraint comprises at least one of: for each transport arc, if the transport arc has transport capacity, the earliest reaching time of the goods on the transport arc to reach the destination node of the transport arc cannot be earlier than the sum of the earliest reaching time of the goods to reach the starting node of the transport arc and the arc transport time length, wherein the arc transport time length is the time length required by the goods to be transported on the transport arc; for each transport arc, if there is traffic on the transport arc, the latest departure time of the goods on the transport arc from the destination node of the transport arc cannot be earlier than the sum of the latest departure time of the goods from the starting node of the transport arc and the arc transport duration.
6. A method according to claim 3, wherein the capacity upper limit constraint comprises: The transport capacity of each transport arc is smaller than the upper limit of the target transport capacity, the product of the transport capacity of the unit of upper limit of the target transport capacity and a target time window is defined as a window between the time when goods arrive at the starting node of the transport arc earliest and the time when the goods leave the starting node of the transport arc latest.
7. A transportation pathway optimization apparatus, the apparatus comprising: The information acquisition module is used for acquiring transportation information of a transportation network topology, wherein the transportation information at least comprises node information of each transportation node, arc information of each transportation arc, time requirement of a transportation task and transportation volume requirement of the transportation task in the transportation network topology, and the transportation arcs comprise usable internal transportation arcs and external transportation arcs to be decided whether to select or not; A function construction module for constructing an objective function and constraint conditions targeting a minimization of total cost according to the time requirement and the traffic requirement; and the result calculation module is used for solving the objective function according to the node information and the arc information of the transport arcs under the condition that the objective constraint condition is met to obtain the minimum total cost and a decision result, wherein the decision result comprises whether each external transport arc is selected or not.
8. A computer device comprising a memory and a processor, the memory storing a computer program, characterized in that the processor implements the steps of the method of any of claims 1 to 6 when the computer program is executed.
9. A computer readable storage medium, on which a computer program is stored, characterized in that the computer program, when being executed by a processor, implements the steps of the method of any of claims 1 to 6.
10. A computer program product comprising a computer program, characterized in that the computer program, when being executed by a processor, implements the steps of the method of any of claims 1 to 6.

Description

Transport channel optimization method, apparatus, device, storage medium, and program product Technical Field The present application relates to the field of transport path optimization, and in particular, to a transport path optimization method, apparatus, device, storage medium, and program product. Background With the continuous development of the transportation industry, the cargo resources required to be transported are more and more abundant. Aiming at the condition that large amount of goods are rich in resources and the railway transportation capacity of the transportation party is insufficient, the transportation party needs to rent an external transportation channel to meet the transportation requirement. Based on this, the problem of how to determine the selection decision of an external transportation channel in case of satisfying the transportation demand is in need of solving. Disclosure of Invention In view of the foregoing, it is desirable to provide a transportation channel optimization method, apparatus, device, storage medium, and program product that are capable of flexibly determining a selection decision for an external transportation channel while satisfying transportation demands. In a first aspect, the present application provides a transportation path optimization method. The method comprises the following steps: the method comprises the steps of obtaining transportation information of a transportation network topology, wherein the transportation information at least comprises node information of each transportation node, arc information of each transportation arc, time requirement of a transportation task and transportation volume requirement of the transportation task in the transportation network topology, and the transportation arcs comprise usable internal transportation arcs and external transportation arcs to be decided whether to be selected or not; constructing an objective function and constraint conditions aiming at minimizing total cost according to the time requirement and the traffic requirement; According to the node information and the arc information, under the condition that the target constraint condition is met, solving an objective function to obtain the minimum total cost and a decision result, wherein the decision result comprises whether each external transportation arc is selected or not. In one embodiment, constructing an objective function and constraint that target minimizing total cost based on time demand and traffic demand, includes: constructing an objective function according to the total time required for completing the transportation task in the time requirement and the transportation quantity requirement; the objective function is the minimum value of the sum of the external transportation arc use cost and the variable transportation cost and the time cost generated by all the used transportation arcs in the transportation process, wherein the external transportation arc use cost comprises the use cost of all the selected external transportation arcs, the variable transportation cost comprises the product of the unit transportation cost and the transportation volume of all the used transportation arcs, and the time cost comprises the product of the total time length and the unit time cost required for completing the transportation task. In one embodiment, constructing an objective function and constraint that target minimizing total cost based on time demand and traffic demand, includes: Constructing target constraint conditions according to time requirements and traffic requirements; the target constraints include at least one of: The node flow conservation constraint is used for constraining the conservation of the cargo receiving quantity and the cargo output quantity of each transportation node; Time constraint, which is used for constraining the time for each transportation node to transfer goods; the upper limit of the transport capacity is restricted, and the transport capacity of each transport arc is restricted not to exceed the upper limit of the target transport capacity; The time window constraint is used for constraining the total time length for completing the transportation task; Selecting decision constraints; for constraining the selection of the outer transport arc; and the transportation quantity used for restraining the transportation arc is a non-negative number. In one embodiment, each transport node comprises a transport origin, a transport destination and a transport intermediate node, and the node traffic conservation constraint comprises at least one of: The sum of the amounts of goods delivered from all the transportation starting points is equal to the total amount of goods supplied; the sum of the cargo amounts received at all transport destination points is equal to the total cargo demand; For each transport node, the amount of cargo transported by the transport node is equal to the amount of cargo received by the tr