A method for coordinated configuration of wagons, ships, and cargo holds in non-metallic mineral iron-water intermodal transport
By constructing a multi-dimensional resource coupling model and using a mixed integer programming algorithm to optimize the rail-water intermodal transport system, the problem of unreasonable resource allocation in the transportation of non-metallic minerals was solved, and the global collaborative optimization and cost minimization of the system were achieved.
Patent Information
- Application Number
- CN202611285238.2
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2026-08-24
- Publication Date
- 2026-11-10
AI Technical Summary
In existing non-metallic mineral rail-water intermodal transport systems, the lack of global coordination among railway, port, and warehousing subsystems leads to irrational resource allocation and difficulty in optimizing overall system costs.
A multi-dimensional resource coupling constraint model is constructed, with the number of bottom-door car train formations as the coordination anchor point. A mixed integer programming algorithm is used to optimize the configuration of the number of locomotives, train formations, and silos, and to generate railway transportation scheduling, port berth allocation, and silo inventory management plans.
It achieves integrated and collaborative optimization of railway, port and warehousing systems, reduces the total life cycle cost of the system, avoids resource waste and bottleneck problems, and the output plan has theoretical optimization and engineering applicability.
Smart Images

Figure CN123070883A_ABST
Abstract
Description
Technical Field
[0001] This invention relates to the field of transportation technology, and in particular to a method for the coordinated configuration of vehicles, ships, and cargo holds in the intermodal transport of non-metallic minerals via rail and water. Background Technology
[0002] Non-metallic minerals (such as limestone, dolomite, and phosphate rock) are important industrial raw materials in my country, and their transportation typically employs a combined rail and waterway transport model. In this model, non-metallic minerals are first transported by rail from the mining area to the port, unloaded into silos for temporary storage, and then loaded onto ships for transport to downstream users. This process involves three closely coupled subsystems: the railway transport subsystem (locomotives and rolling stock), the port storage subsystem (silos), and the waterway transport subsystem (ships).
[0003] However, the existing technology has the following problems:
[0004] First, resource allocation lacks global coordination. There is a complex nonlinear coupling relationship between the number of locomotives, the number of train sets, and the silo capacity. For example, increasing the number of train sets simultaneously leads to increased traction power and silo volume requirements. However, in traditional methods, railways, ports, and warehousing are typically decided independently by different departments, failing to establish a quantitative correlation model among the three, resulting in resource waste or frequent system bottlenecks.
[0005] Second, optimizing the overall system cost is difficult. The total life-cycle cost of a rail-water intermodal transport system includes multiple components, such as infrastructure construction investment and operational delay losses, and there are trade-offs between these components. Traditional methods lack effective global optimization tools, making it difficult to minimize the overall system cost while meeting transport capacity demands.
[0006] Therefore, there is an urgent need for a method that can achieve coordinated configuration of the three major elements of "vehicle, ship, and warehouse" in order to solve the above-mentioned technical problems. Summary of the Invention
[0007] In view of the technical defects and drawbacks existing in the prior art, the embodiments of the present invention provide a method for the coordinated configuration of vehicles, ships and warehouses in non-metallic mineral iron-water intermodal transport to overcome the above problems or at least partially solve the above problems. The specific solution is as follows;
[0008] A method for coordinated configuration of vehicle, ship, and cargo hold in non-metallic mineral iron-water intermodal transport includes the following steps:
[0009] Step S1: Obtain multiple initial configuration parameters related to the rail-water intermodal transport system of the target port. The multiple initial configuration parameters include at least: the number of locomotives, the number of cars in a train with bottom doors, and the number of silos for storing non-metallic minerals.
[0010] Step S2: Using the number of bottom-opening car train formations as the coordination anchor point, construct a multi-dimensional resource coupling constraint model to describe the nonlinear linkage relationship between the number of main locomotives, the number of bottom-opening car train formations, and the number of silos.
[0011] Step S3: Based on the preset annual total transport volume target and the ship arrival distribution pattern, the multi-dimensional resource coupling constraint model is solved using a mixed integer programming algorithm to obtain a set of target configuration schemes that meet transport capacity requirements and minimize the overall system cost. The set of target configuration schemes includes the optimized number of main locomotives, the number of bottom-door car formations, and the number of silos.
[0012] Step S4: Based on the target configuration scheme set, generate and output the corresponding railway transportation scheduling plan, port berth allocation plan, and silo inventory management plan to guide the actual operation of the rail-water intermodal transport system of the target port.
[0013] In some embodiments, step S2 involves constructing a multi-dimensional resource coupling constraint model, using the number of bottom-door car formations as the coordination anchor point, to describe the nonlinear linkage relationship between the number of locomotives, the number of bottom-door car formations, and the number of silos. This specifically includes the following sub-steps:
[0014] Step S21, define the number of train rows T of the bottom-opening vehicle as a decision variable, where T∈[T min ,T max ], and T min and T max The values are determined by the lower and upper quantiles of the statistical distribution of train formation numbers in historical operating data, respectively.
[0015] Step S22, construct a first constraint function to associate the number of locomotives L with the number of bottom-door car formations T. The first constraint function is expressed as:
[0016]
[0017] Among them, W train R represents the standard full load weight of a single-row, bottom-opening vehicle. grade R represents the resistance coefficient per unit slope of the limiting ramp. curve R represents the additional drag coefficient per unit curve in the limiting ramp section. start F represents the unit starting resistance coefficient. loco The symbol ⌈ indicates the rated tractive force of a single locomotive. ⌉ indicates rounding up to the nearest integer to ensure sufficient traction.
[0018] Step S23: Construct a second constraint function to control the total effective volume V of the silo.total The second constraint function, associated with the number of train groups T of vehicles with bottom-opening doors, is expressed as follows:
[0019] V total ≥ g(T)=T V car (t unload / t cycle +β)
[0020] Among them, V car This indicates the rated cargo volume (t) of a single-row, bottom-opening vehicle. unload t represents the average unloading time for single-row bottom-opening vehicles. cycle β represents the average time for a single silo to complete a full turnaround cycle of unloading, storage, and loading, and β represents the safety buffer coefficient used to cope with the volatility of ship arrivals, with β>0.
[0021] In some embodiments, in step S23, a second constraint function is constructed to control the total effective volume V of the silo. total Associated with the number of train rows T of the bottom-opening vehicle group, the following sub-steps are included:
[0022] Step S231: Obtain the total number N of non-metallic mineral types to be stored, and set a preset threshold M for the types of goods;
[0023] Step S232: Based on the comparison result of the total number of non-metallic mineral types N and the commodity type threshold M, a commodity type switching penalty factor α is defined. The calculation rule of the commodity type switching penalty factor α is as follows:
[0024]
[0025] Where α1 is the first coefficient greater than 1, and α2 is the second coefficient equal to 1;
[0026] Step S233: Based on the cargo type switching penalty factor α, the second constraint function is modified into a buffer volume constraint that considers the impact of cargo type switching. The modified second constraint function is expressed as follows:
[0027] V total ≥ α g(T) = α T V car (t unload / t cycle +β)
[0028] The modified second constraint function is used to increase the required lower limit of the total effective volume of the silo by introducing the first coefficient α1 when the total number of non-metallic mineral types N exceeds the cargo type threshold M, thereby providing additional buffer volume reserves for the risk of unloading operation interruption caused by frequent cargo type switching.
[0029] In some embodiments, step S3 involves solving the multi-dimensional resource coupling constraint model using a mixed-integer programming algorithm based on a preset annual total transport volume target and ship arrival distribution patterns, to obtain a set of target configuration schemes that meet transport capacity requirements and minimize the overall system cost. This includes the following sub-steps:
[0030] Step S31: Establish an objective function, which is used to minimize the system's total lifecycle cost C. total The total lifecycle cost C of the system total It is obtained by weighted summation of the following four cost components:
[0031] C total =C silo (Q)+C loco (L)+C car (T)+C delay (W)
[0032] Where: Q represents the number of silos, C silo (Q) is a piecewise linearly increasing function of the number of silos Q, used to characterize the investment cost of silo construction; L represents the number of locomotives, C loco (L) is a linear function of the number of locomotives L, used to characterize the cost of locomotive acquisition and maintenance; T represents the number of cars in a formation with bottom doors, C car (T) is a linear function of the number of bottom-door vehicle trains T, used to characterize vehicle acquisition and maintenance costs; W represents the average waiting time of ships, C delay (W) is an exponential function of the average waiting time W of ships, used to characterize the cost of delays caused by system congestion;
[0033] Step S32: Establish the coupling relationship between the average waiting time W of the ship, the number of bottom-door vehicle formations T, and the number of silos Q. The coupling relationship is expressed as follows:
[0034] W=h(T,Q)=λ / (μ(T,Q) (μ(T,Q)-λ))
[0035] Wherein, λ represents the ship arrival rate, which is determined by the ship arrival distribution pattern; μ(T,Q) represents the system service rate, which is a function of the unloading-loading throughput rate determined by the number of bottom-door vehicle trains T and the number of silos Q, and satisfies the system stability condition μ(T,Q)>λ.
[0036] Step S33, using the objective function C total Minimizing the value of the target configuration is the objective. Using the first constraint function and the modified second constraint function as constraints, a mixed integer programming algorithm is used to solve the problem and obtain the set of target configuration schemes that minimize the total life cycle cost of the system.
[0037] In some embodiments, in step S33, the objective function C is used. total Minimizing is the optimization objective, and the solution is obtained using a mixed integer programming algorithm, which includes the following sub-steps:
[0038] Step S331: In each iteration of the solution process, a current candidate configuration scheme is generated. The current candidate configuration scheme includes a set of decision variable values, including the number of locomotives L, the number of bottom-door car trains T, and the number of silos Q.
[0039] Step S332: Based on the current candidate configuration scheme, calculate the corresponding system lifecycle cost C. total The system's annual operating capacity P is compared with the current candidate configuration scheme, and the scheme is mapped onto a two-dimensional coordinate system with total investment as the horizontal axis and system annual operating capacity as the vertical axis, forming a coordinate point (C). total ,P);
[0040] Step S333: Obtain the pre-constructed investment-capacity trade-off curve. The investment-capacity trade-off curve is a boundary curve composed of multiple Pareto optimal solutions. The Pareto optimal solution refers to the solution in the two-dimensional coordinate system in which no other feasible solution can achieve a higher annual system capacity with the same or lower total investment, or can achieve a lower total investment with the same annual system capacity.
[0041] Step S334: Determine the coordinates (C) corresponding to the current candidate configuration scheme. total Whether P) is governed by any known solution on the investment-capacity tradeoff curve: if there exists a known solution (C' total P') satisfies C' total ≤ C total If P' ≥ P and at least one inequality holds, then the current candidate configuration scheme is determined to be a dominated solution and is excluded; otherwise, it is determined to be a non-dominated solution, included in the target configuration scheme set, and the investment-capacity trade-off curve is updated.
[0042] In some embodiments, step S4, which generates and outputs a corresponding railway transportation scheduling plan based on the target configuration scheme set, includes the following sub-steps:
[0043] Step S41: Extract the optimized number of bottom-opening door vehicle train formations T from the target configuration scheme set. opt And the optimized number of service locomotives L opt ;
[0044] Step S42, based on the optimized number of bottom-opening door vehicle train formations T opt Combined with the preset standard load capacity W of a single-row bottom-opening vehicle car Calculate the total number N of heavy-haul trains that need to be dispatched from the mining area to the port each day. train The total number of heavy-haul trains N train The calculation formula is:
[0045]
[0046] Among them, G annual D represents the preset annual total transport volume target. operating Indicates the number of planned operating days per year, symbolized by ⌈ ⌉ indicates rounding up to the nearest integer to ensure that transport capacity is not lower than the total annual transport volume target;
[0047] Step S43, based on the optimized number of locomotives L opt and the total number of heavy-load trains N per day train A locomotive routing plan is formulated, which is used to allocate a specified number of locomotives for traction or pushing of each heavy-haul train departing from the mining area, and satisfies the following constraints:
[0048]
[0049] Among them, l i k represents the number of locomotives assigned to the i-th heavy-haul train. shift This indicates the number of locomotive shifts that can be put into operation each day, and l i Not less than the first constraint function f(T) opt The minimum number of locomotives required is determined to ensure that each heavy-haul train has sufficient traction power.
[0050] In some embodiments, step S4, which generates and outputs a corresponding port berth allocation plan based on the target configuration scheme set, includes the following sub-steps:
[0051] Extract the optimized silo quantity Q from the set of target configuration schemes. optThe system acquires real-time inventory level data for each type of commodity in the silo, wherein the real-time inventory level data includes at least the current inventory quantity S corresponding to each type of commodity. j and its corresponding maximum silo capacity C j , where j=1,2,…,N, and N represents the total number of non-metallic mineral types;
[0052] Real-time collection of arriving vessel information, including at least the estimated arrival time A for each vessel. k Load capacity D k and the required non-metallic mineral cargo type identification G k , where k=1,2,…,K, and K represents the total number of ships arriving in the current planning period;
[0053] Based on the real-time inventory level data and the arriving vessel information, the berth allocation priority P for each vessel is calculated. k The berth allocation priority P k The calculation formula is:
[0054]
[0055] Among them, S Gk Indicates type G k The current inventory level, C Gk Indicates type G k The corresponding maximum silo capacity, A now Indicates the current moment, where ε is a very small positive number to prevent the denominator from being zero, and A k >A now ;
[0056] According to the berth allocation priority P k Berths are assigned to vessels in descending order of priority, and corresponding loading operation plans are generated simultaneously. Priority P is given to each berth. k Higher berth allocations are used to reduce the time ships spend in port.
[0057] In some embodiments, step S4, which generates and outputs a corresponding silo inventory management plan based on the target configuration scheme set, includes the following sub-steps:
[0058] Extract the optimized number of bottom-opening door vehicle formations T from the target configuration scheme set. opt And the optimized number of silos Q opt And obtain the real-time inventory level data of the silos corresponding to each type of commodity, wherein the real-time inventory level data includes at least the current inventory quantity S of each type of commodity. j (t), where j=1,2,…,N, N represents the total number of non-metallic mineral types, and t represents the current time;
[0059] Establish a dynamic early warning mechanism for silo inventory, the dynamic early warning mechanism being based on the optimized number of bottom-opening vehicle formations T. opt The corresponding unloading rate R unload With berth loading rate R ship The real-time difference is used to calculate the net inflow rate Δ of each type of cargo in the silos. j (t), the net inflow rate Δ j The formula for calculating (t) is:
[0060] Δ j (t)=α j (t) R unload - β j (t) R ship
[0061] Where, α j (t) represents the unloading ratio coefficient of cargo type j at the current time, β j (t) represents the loading percentage coefficient of cargo type j at the current moment, and satisfies and ;
[0062] Based on the net inflow rate Δ j (t) and the real-time inventory S j (t), set the first inventory threshold L for each type of silo. low,j Second inventory threshold H high,j L low,j <H high,j L low,j and H high,j Based on the optimized number of silos Q opt The allocation ratio of silos for each type of cargo is determined;
[0063] According to the real-time inventory S j (t) and the first inventory threshold L low,j and the second inventory threshold H high,j Based on the comparison results, execute the corresponding inventory control instructions:
[0064] When S j (t) <L low,j When the replenishment command is triggered, the loading operation corresponding to cargo type j is suspended, and the unloading operation corresponding to cargo type j is accelerated until S j (t)≥L low,j +δ safe , where δ safe Indicates the safety rebound margin;
[0065] When Sj (t)>H high,j When the time is right, a clearing command is triggered, suspending the unloading operation for cargo type j and accelerating the loading operation for cargo type j until S. j (t)≤H high,j- δ safe .
[0066] In some embodiments;
[0067] In step S1, multiple initial configuration parameters related to the rail-water intermodal transport system of the target port are obtained, including the following sub-steps:
[0068] Identify multiple ports located in the same waterway but at different geographical locations, and label these ports as P1, P2, ..., P M , where M represents the total number of ports participating in the collaborative configuration, and M≥2;
[0069] Obtain each port P separately i Each port has its own initial configuration parameter set, which includes at least the initial range L of the number of locomotives in service for that port. i ∈[L i,min ,L i,max Initial range T for the number of bottom-opening car formations i ∈[T i,min ,T i,max ] and the initial range Q of the number of silos i ∈[Q i,min Q i,max ], where i = 1, 2, ..., M;
[0070] The initial configuration parameter sets of the multiple ports are aggregated to form a joint initial configuration parameter space Θ across the ports, which is represented as:
[0071] Θ=\ ([L i,min ,L i,max ]×[T i,min ,T i,max ]×[Q i,min Q i,max ])
[0072] Wherein, the symbol \bigtimes represents the Cartesian product operation, and the dimension of the joint initial configuration parameter space Θ is 3M;
[0073] In step S2, using the number of bottom-door car formations as the coordination anchor point, a multi-dimensional resource coupling constraint model is constructed to describe the nonlinear linkage relationship between the number of locomotives, the number of bottom-door car formations, and the number of silos, including:
[0074] Based on the joint initial configuration parameter space Θ, a cross-port joint resource coupling constraint model is established. This model shares local locomotive resources and bottom-door rolling stock resources among the multiple ports and coordinates them uniformly through a central dispatch center. The joint resource coupling constraint model includes the following global constraints:
[0075]
[0076]
[0077] Among them, L global T represents the upper limit of the total number of service locomotives that can be deployed across ports. global This indicates the upper limit of the total number of bottom-opening vehicle resources that can be allocated across ports.
[0078] In some embodiments, step S3 involves solving the multi-dimensional resource coupling constraint model using a mixed integer programming algorithm based on a preset annual total transport volume target and ship arrival distribution patterns. This includes the following sub-steps:
[0079] Step S101: Decompose the cross-port joint resource coupling constraint model into a main problem and one or more sub-problems, wherein:
[0080] The main problem is responsible for the optimal allocation of global resources, which at least include the total amount L of local locomotive resources that can be deployed across ports. global The total number of bottom-opening vehicle resources T that can be deployed across ports global ;
[0081] Each of the sub-problems corresponds to a single port P. i Local resource allocation optimization, wherein the local resources include at least the number L of locomotives corresponding to the port. i Number of bottom-opening car formations (T) i and the number of silos Q i ;
[0082] Step S102: The Benders decomposition algorithm is used to iteratively solve the main problem and the multiple subproblems. The iterative solution process includes the following loop operations:
[0083] Step S102a: Solve the main problem to obtain the global resource L. global and T global The initial allocation scheme in the current iteration round is then passed to each of the sub-problems;
[0084] Step S102b: Based on the received preliminary allocation scheme, each of the sub-problems solves its corresponding local resource allocation optimization problem for a single port, and generates a corresponding local optimal solution and feasibility feedback information. The feasibility feedback information includes: if a sub-problem is infeasible under the current allocation scheme, a Benders feasibility cut plane is generated; if all sub-problems are feasible, a Benders optimality cut plane is generated.
[0085] Step S102c: The feasibility feedback information generated by each of the sub-problems is returned to the main problem, and the main problem updates its own constraints accordingly and enters the next round of iterative solution;
[0086] Step S103: Repeat steps S102a to S102c until a preset convergence condition is met, wherein the convergence condition includes at least one of the following:
[0087] The difference between the objective function value of the main problem and the sum of the objective function values of each of the subproblems is less than a preset tolerance error ϵ. tol ;
[0088] The number of iterations reaches the preset maximum number of iterations K. max ;
[0089] Step S104: When the convergence condition is met, the iteration is terminated, and the global resource allocation scheme of the main problem obtained in the last iteration is combined with the local resource allocation scheme of each sub-problem to form a global collaborative configuration scheme applicable to the multiple ports.
[0090] The present invention has the following beneficial effects:
[0091] This invention uses the number of bottom-door vehicle train formations as the coordination anchor point, and for the first time establishes a quantitative coupling model between the number of locomotives, the number of train formations, and the silo capacity. This breaks down the barriers of traditional independent decision-making and achieves integrated collaborative optimization of the three major subsystems: vehicles, ships, and silos. By incorporating silo construction investment, locomotive procurement and maintenance, vehicle procurement and maintenance, and ship delay losses into a unified objective function and solving it using a mixed-integer programming algorithm, it can automatically find the optimal resource allocation scheme that minimizes the overall system cost while meeting the total annual transport volume target. This avoids the resource waste and high costs caused by localized decision-making in traditional methods. Furthermore, the railway transport scheduling plan, port berth allocation plan, and silo inventory management plan output by this invention can be directly used to guide actual operations, combining theoretical optimality with engineering practicality. Attached Figure Description
[0092] Figure 1 This is a flowchart illustrating a method for coordinated configuration of vehicles, ships, and cargo holds in non-metallic mineral iron-water intermodal transport, as provided in an embodiment of the present invention.
[0093] Figure 2 This is a structural block diagram of an electronic device provided in an embodiment of the present invention. Detailed Implementation
[0094] To enable those skilled in the art to better understand the technical solutions of the present invention, exemplary embodiments of the present invention are described below in conjunction with the accompanying drawings, including various details of the embodiments of the present invention to aid understanding. These should be considered merely exemplary. Therefore, those skilled in the art should recognize that various changes and modifications can be made to the embodiments described herein without departing from the scope and spirit of the present invention. Similarly, for clarity and brevity, descriptions of well-known functions and structures are omitted in the following description.
[0095] Where there is no conflict, the various embodiments of the present invention and the features thereof may be combined with each other.
[0096] As used herein, the term “and / or” includes any and all combinations of one or more related enumerated entries.
[0097] The terminology used herein is for the purpose of describing particular embodiments only and is not intended to limit the invention. As used herein, the singular forms “a” and “the” are intended to include the plural forms as well, unless the context clearly indicates otherwise. It will also be understood that when the terms “comprising” and / or “made of” are used in this specification, the presence of the stated feature, integral, step, operation, element, and / or component is specified, but the presence or addition of one or more other features, integrals, steps, operations, elements, components, and / or groups thereof is not excluded. Terms such as “connected” or “linked” are not limited to physical or mechanical connections but can include electrical connections, whether direct or indirect.
[0098] Unless otherwise specified, all terms used herein (including technical and scientific terms) have the same meaning as commonly understood by one of ordinary skill in the art. It will also be understood that terms such as those defined in commonly used dictionaries should be interpreted as having the meaning consistent with their meaning in the context of the relevant art and the invention, and will not be interpreted as having an idealized or overly formal meaning unless expressly so defined herein.
[0099] Example 1:
[0100] See Figure 1 This embodiment provides a method for the coordinated configuration of vehicles, ships, and warehouses in the intermodal transport of non-metallic minerals by rail and water. The method includes steps S1 to S4, specifically including:
[0101] Step S1: Obtain multiple initial configuration parameters related to the rail-water intermodal transport system of the target port. These multiple initial configuration parameters include at least: the number of locomotives, the number of bottom-door car formations, and the number of silos used for storing non-metallic minerals.
[0102] In practical applications, the initial configuration parameters can be obtained by reading the port's existing operational database or by manual input. For example, the number of currently configured locomotives, the number of bottom-door vehicle formations used in daily operations, and the number of completed silos can be directly read from the port scheduling system.
[0103] Step S2 involves constructing a multi-dimensional resource coupling constraint model, using the number of bottom-door car formations as the coordination anchor point, to describe the nonlinear linkage between the number of locomotives, the number of bottom-door car formations, and the number of silos. The core idea of this multi-dimensional resource coupling constraint model is to treat the train formation size as a hub variable, since the number of formations simultaneously affects the required traction power (number of locomotives) and the required storage capacity (silo volume), thereby establishing a quantitative mathematical relationship among the three.
[0104] Step S3: Based on the preset annual total transport volume target and ship arrival distribution pattern, a mixed-integer programming algorithm is used to solve the multi-dimensional resource coupling constraint model to obtain a set of target configuration schemes that meet transport capacity requirements and minimize the overall system cost. The set of target configuration schemes includes the optimized number of locomotives, the number of bottom-door car formations, and the number of silos.
[0105] Step S4: Based on the target configuration scheme set, generate and output the corresponding railway transportation scheduling plan, port berth allocation plan, and silo inventory management plan to guide the actual operation of the rail-water intermodal transport system of the target port.
[0106] This embodiment constructs a multi-dimensional coupling model using the number of train formations as the anchor point, achieving integrated and collaborative optimization of the railway transportation subsystem, port loading and unloading subsystem, and warehousing subsystem. This avoids the mismatch problem caused by the independent optimization of each subsystem in traditional methods and can significantly reduce the system's total lifecycle cost.
[0107] Example 2:
[0108] This embodiment, based on Embodiment 1, further specifies the implementation of step S2, specifically including:
[0109] Step S21, define the number of train rows T of the bottom-opening vehicle as a decision variable, where T∈[T min ,T max ], T min and T maxThe values are determined by the lower and upper quantiles of the statistical distribution of train formation numbers in historical operating data, respectively.
[0110] Preferably, the lower quantile is taken as the 5th percentile of the historical data, and the upper quantile is taken as the 95th percentile of the historical data. For example, if the historical data range of the number of marshalling yards for a port in the past year is 8 to 24, then T min =8,T max =24.
[0111] Step S22, construct a first constraint function to associate the number of locomotives L with the number of bottom-door car formations T:
[0112]
[0113] Among them, W train R represents the standard full load weight of a single-row, bottom-opening vehicle. grade R represents the resistance coefficient per unit slope of the limiting ramp. curve R represents the additional drag coefficient per unit curve in the limiting ramp section. start F represents the unit starting resistance coefficient. loco The symbol represents the rated tractive force of a single locomotive. This indicates a rounding up operation to ensure sufficient traction.
[0114] Preferably, for typical non-metallic mineral railway transportation scenarios, typical values for each parameter are as follows: Standard full-load weight W of a single-train bottom-door car. train The value can be taken as 3000 tons to 5000 tons; the unit slope resistance coefficient R of the limiting ramp. grade It can be calculated based on the actual gradient of the route. For example, for a restricted gradient of 4‰, R... grade =4 N / kN; Unit curve additional drag coefficient R curve It can be calculated based on the curve radius. For example, for a curve with a radius of 300m, R... curve ≈2.5 N / kN; Unit starting resistance coefficient R start The typical value is 3.5 N / kN; the rated tractive force F of a single locomotive. loco The value is determined based on the locomotive model; for example, the HXD series electric locomotives can take a value of 570 kN.
[0115] Step S23: Construct a second constraint function to control the total effective volume V of the silo. total Related to the number of trains T of the bottom-opening vehicle group:
[0116] V total ≥ g(T)=T V car (tunload / t cycle +β)
[0117] Among them, V car This indicates the rated cargo volume (t) of a single-row, bottom-opening vehicle. unload t represents the average unloading time for single-row bottom-opening vehicles. cycle β represents the average time for a single silo to complete a full turnaround cycle of unloading, storage, and loading, and β represents the safety buffer coefficient used to cope with the volatility of ship arrivals, with β>0.
[0118] Furthermore, after obtaining the total effective volume V of the silo... total After determining the lower limit, it needs to be converted into the actual number of silos Q, which is calculated using the following formula:
[0119]
[0120] Among them, V silo Represents the effective volume of a single silo, symbol This indicates an up-rounding operation to ensure that the total effective volume of the silo meets the requirements of the second constraint function.
[0121] Preferably, the effective volume V of a single silo silo The value can be determined based on the actual specifications of the silos constructed at the port, with a typical range of 500 m³ to 2000 m³. For example, if V total = 12000 m³, V silo = 1000 m³, then Q = 12 silos.
[0122] Preferably, the rated cargo volume V of a single-row bottom-opening vehicle car The value can be taken as 200m³ to 400m³; the average unloading time t for single-row bottom-opening vehicles. unload The value can be between 30 minutes and 60 minutes; the average time t for a single silo to complete one full turnover cycle. cycle The value can be between 24 hours and 48 hours; the safety buffer coefficient β is generally between 0.1 and 0.3, and the specific value can be determined by statistical analysis based on the historical volatility of the ship's arrival.
[0123] This embodiment establishes a mechanical relationship between locomotive traction force and the number of trains, as well as a logistics balance relationship between silo volume and the number of trains, accurately quantifying the coupling relationship between the three core resource variables, thus providing a solid mathematical model foundation for subsequent optimization solutions.
[0124] Example 3:
[0125] This embodiment, based on Embodiment 2, further improves the second constraint function in step S23, specifically including:
[0126] Step S231: Obtain the total number N of non-metallic mineral types to be stored, and set a preset threshold M for the types of goods.
[0127] Preferably, the threshold value M for the type of cargo ranges from 3 to 5. For example, if the types of non-metallic minerals handled by the port include limestone, dolomite, and phosphate rock, then N=3; if it also includes quartz sand and fluorite, then N=5.
[0128] Step S232: Based on the comparison result between the total number of non-metallic mineral types N and the commodity type threshold M, define a commodity type switching penalty factor α:
[0129]
[0130] Where α1 is the first coefficient greater than 1, and α2 is the second coefficient equal to 1.
[0131] Preferably, the value of the first coefficient α1 ranges from 1.2 to 1.5. For example, when N=5 and M=4, α=1.3, which means that the silo volume requirement increases by 30% on the original basis to cope with the risk of unloading interruption caused by frequent changes in cargo types.
[0132] Step S233: Based on the cargo type switching penalty factor α, the second constraint function is modified as follows:
[0133] V total ≥ α g(T) = α T V car (t unload / t cycle +β)
[0134] This embodiment addresses the problem of insufficient silo capacity leading to unloading interruptions in scenarios with multiple cargo types by introducing a cargo type switching penalty factor. When there are many cargo types, different cargo types cannot be mixed, and switching cargo types requires cleaning the conveyor belt and silos, which leads to a decrease in unloading efficiency. This embodiment ensures stable system operation even under multi-cargo conditions by increasing the silo volume margin.
[0135] Example 4:
[0136] This embodiment, based on embodiment three, further specifies the implementation of step S3, specifically including:
[0137] Step S31: Establish the objective function to minimize the system's total lifecycle cost C.total :
[0138] C total =C silo (Q)+C loco (L)+C car (T)+C delay (W)
[0139] wherein: Q denotes the number of silos, C silo (Q) is a piecewise linearly increasing function with respect to the number of silos Q, configured to represent the silo construction investment cost, and this function has different marginal cost slopes in different silo number intervals, so as to reflect the influence of the scale effect on the unit silo construction cost; L denotes the number of main locomotives, C loco (L) is a linear function with respect to the number of main locomotives L, configured to represent the locomotive purchase, operation and maintenance cost; T denotes the number of bottom-door car formation trains, C car (T) is a linear function with respect to the number of bottom-door car formation trains T, configured to represent the car purchase, operation and maintenance cost; W denotes the average ship waiting time, C delay (W) is an exponential function with respect to the average ship waiting time W, configured to represent the delay loss cost caused by system congestion.
[0140] For example, when Q≤10, the unit silo cost is 5 million yuan per unit; when 10<Q≤20, the unit silo cost is 4.5 million yuan per unit; when Q>20, the unit silo cost is 4.2 million yuan per unit, so as to embody the scale effect. The locomotive purchase, operation and maintenance cost C loco (L) may be 8 million yuan per locomotive multiplied by L; the car purchase, operation and maintenance cost C car (T) may be 500 thousand yuan per train multiplied by T. The delay loss cost C delay (W) may be 100 thousand yuan per hour multiplied by e 0.1W , that is, as the waiting time increases, the delay loss increases exponentially.
[0141] Step S32: establishing a coupling relationship between the average ship waiting time W, the number of bottom-door car formation trains T, and the number of silos Q:
[0142] W=h(T,Q)=λ / (μ(T,Q) (μ(T,Q)-λ))
[0143] Wherein, λ represents the ship arrival rate, determined by the ship arrival distribution pattern; μ(T,Q) represents the system service rate, a function of the unloading-loading throughput rate jointly determined by the number of bottom-door vehicle formations T and the number of silos Q, and satisfies the system stability condition μ(T,Q)>λ. This formula is derived based on the M / M / 1 queuing theory model, where the ship arrival rate λ can be determined by statistical analysis of historical arrival data, and the system service rate μ(T,Q) is a function of the number of vehicle formations T and the number of silos Q.
[0144] Preferably, the system service rate μ(T,Q) can be specifically expressed as μ(T,Q)=min(γ1T,γ2Q), where γ1 represents the unloading throughput rate corresponding to the number of trains per unit (e.g., 0.2 vessels / hour·train), and γ2 represents the loading throughput rate corresponding to the number of silos per unit (e.g., 0.15 vessels / hour·unit). The system stability condition μ(T,Q)>λ must always be satisfied; otherwise, the system will be infinitely congested.
[0145] Step S33, using the objective function C total The optimization objective is to minimize the value of the first constraint function and the modified second constraint function. The solution is obtained using a mixed integer programming algorithm.
[0146] This embodiment introduces queuing theory into the objective function, directly linking the cost of ship waiting delays with resource allocation decisions. This ensures that the optimization results not only consider construction investment costs but also fully account for congestion losses during the operation phase, achieving a comprehensive optimization of investment and operation.
[0147] Example 5:
[0148] This embodiment further improves the solution process in step S33 based on embodiment four, including the forward and backward steps.
[0149] Step S331: In each iteration of the solution process, a current candidate configuration scheme is generated, which includes a set of decision variable values (L,T,Q).
[0150] Step S332: Based on the current candidate configuration scheme, calculate the corresponding system lifecycle cost C. total The system's annual operating capacity P is compared with the total investment, and the scheme is mapped onto a two-dimensional coordinate system with the total investment as the horizontal axis and the system's annual operating capacity as the vertical axis, forming coordinate point (C). total ,P).
[0151] Step S333: Obtain the pre-constructed investment-capacity trade-off curve, which is a boundary curve composed of multiple Pareto optimal solutions.
[0152] Step S334: Determine the coordinates (C) corresponding to the current candidate configuration scheme. total,Whether P) is dominated by any known solution on the investment-capacity tradeoff curve, the criterion for determining the dominance relationship is: if there exists a known solution (C') total, P') satisfies C' total ≤ C total If P' ≥ P, and at least one inequality holds strictly, then the known solution is said to dominate the current candidate configuration. In this case, the current candidate configuration is a dominated solution and should be excluded from the target configuration set.
[0153] Conversely, if no known solution on the investment-capacity tradeoff curve can dominate the current candidate configuration, then the current candidate configuration is determined to be a non-dominated solution and is included in the target configuration set. Simultaneously, this new solution is re-sorted for non-domination along with the existing Pareto optimal solutions, and old solutions dominated by the new solution are removed, thereby updating the investment-capacity tradeoff curve.
[0154] Preferably, the investment-capacity trade-off curve can be pre-generated and dynamically maintained in the following way: first, enumerate a large number of feasible configuration schemes (L, T, Q), and calculate C for each scheme. total Then, using a fast non-dominated sorting algorithm (such as the sorting method in NSGA-II), all solutions on the Pareto front are extracted. These solutions are then arranged in ascending order of investment cost and fitted with a smooth curve. In subsequent iterative solutions, whenever a new solution is determined to be a non-dominated solution, it is inserted into the curve and the non-dominated sorting is re-executed to maintain the real-time validity of the investment-capacity tradeoff curve.
[0155] This embodiment avoids the problem of traditional single-objective optimization getting trapped in local optima by introducing a Pareto sieving mechanism. The final output is not a single solution, but a set of non-dominated solutions located on the Pareto front, allowing decision-makers to flexibly choose based on actual budget constraints and capacity requirements, greatly improving the method's practicality.
[0156] Example 6:
[0157] This embodiment, based on embodiment two, further specifies the concrete implementation method for generating the railway transportation scheduling plan in step S4, specifically including:
[0158] Step S41: Extract the optimized number of bottom-opening door vehicle train formations T from the target configuration scheme set. opt And the optimized number of service locomotives L opt .
[0159] Step S42, based on T opt Calculate the total number N of heavy-haul trains that need to be dispatched from the mining area to the port each day. train :
[0160]
[0161] Among them, G annual D represents the preset annual total transport volume target. operating Indicates the number of planned operating days per year, symbolized by ⌈ ⌉ indicates rounding up to the nearest integer to ensure that transport capacity is not lower than the total annual transport volume target.
[0162] Preferably, the annual planned number of operating days D operating The standard load capacity (W) is generally taken as 330 to 350 days (excluding maintenance windows and holidays); car The value is 80 tons / vehicle multiplied by the number of vehicles in each column. For example, if T opt =15 columns, each column consists of 30 cars, then W car =80×30=2400 tons.
[0163] Step S43, based on L opt and N train Develop locomotive route plans to meet constraints:
[0164]
[0165] Among them, l i k represents the number of locomotives assigned to the i-th heavy-haul train. shift This indicates the number of locomotive shifts that can be put into operation each day, and l i Not less than the first constraint function f(T) opt The minimum number of locomotives required is determined to ensure that each heavy-haul train has sufficient traction power.
[0166] Preferably, the number of locomotive shifts that can be put into operation per day, k shift The value is usually 2 or 3 (corresponding to two-shift or three-shift operation). For example, if L opt =10 units, k shift If the value is 2, then a maximum of 20 locomotive traction tasks can be used per day. The number of locomotives allocated to each train is l. i It must not be less than f(T) opt The minimum value calculated.
[0167] This embodiment transforms the optimized macro-level resource allocation scheme into a specific daily scheduling plan, achieving a seamless connection from strategic planning to tactical execution and ensuring the feasibility of implementing the optimization results.
[0168] Example 7:
[0169] This embodiment, based on Embodiment 1, further specifies the concrete implementation of generating the port berth allocation plan in step S4, specifically including:
[0170] Extract the optimized silo quantity Q from the set of target configuration schemes. opt It also obtains real-time inventory level data for each type of commodity in the silo, including the current inventory quantity S for each commodity. j and its corresponding maximum silo capacity C j .
[0171] Real-time collection of arriving vessel information, including the estimated arrival time of each vessel. k Load capacity D k and the required non-metallic mineral cargo type identification G k .
[0172] Calculate the berth allocation priority P for each vessel. k :
[0173]
[0174] Among them, S Gk Indicates type G k The current inventory level, C Gk Indicates type G k The corresponding maximum silo capacity, A now Indicates the current moment, where ε is a very small positive number to prevent the denominator from being zero, and A k >A now ;
[0175] Among them, the smallest positive number ε can be 0.001 hours to prevent the denominator from being zero.
[0176] According to P k Berths are assigned to vessels in descending order of priority, and corresponding loading operation plans are generated simultaneously. Priority P is given to each berth. k Higher berth allocations are used to reduce the time ships spend in port.
[0177] The priority calculation formula proposed in this embodiment takes into account two key factors: first, the inventory saturation S. Gk / C Gk The higher this ratio, the greater the inventory pressure for that type of cargo, and the more urgent it is to load it onto ships to release storage capacity; secondly, the urgency of the ship's arrival at port 1 / (A k- A now Vessels that are about to arrive have higher priority. The product of these two factors constitutes a reasonable berth allocation priority index, which can effectively avoid unloading blockages caused by inventory backlog or demurrage fees caused by long vessel waiting times.
[0178] Example 8:
[0179] This embodiment, based on Embodiment 1, further specifies the concrete implementation of generating the silo inventory management plan in step S4, specifically including:
[0180] Extract T from the set of target configuration schemes opt and Q opt And obtain the real-time inventory level data of the silos corresponding to each type of goods. j (t).
[0181] Establish a dynamic early warning mechanism for silo inventory and calculate the net inflow rate of silos for each type of cargo:
[0182] Δ j (t)=α j (t) R unload - β j (t) R ship
[0183] Where, α j (t) represents the unloading ratio coefficient of cargo type j at the current time, β j (t) represents the loading percentage coefficient of cargo type j at the current moment, and satisfies and .
[0184] Preferably, the unloading rate R unload According to T opt And the average unloading time is calculated, for example, R unload =T opt / t unload Loading rate R ship The unloading ratio coefficient α can be calculated based on the number of berths and average loading efficiency. j (t) and the loading ratio coefficient β j (t) needs to be updated in real time to ensure that the sum is 1.
[0185] Based on Δ j (t) and S j (t), set the first inventory threshold L for each type of silo. low,j Second inventory threshold H high,j .
[0186] For example, the first inventory threshold L low,j The second inventory threshold H can be set to 20% of the silo's maximum capacity. high,j It can be set to 85% of the silo's maximum capacity. Safety springback margin δ safe The value can be 5% of the silo's maximum capacity.
[0187] Execute inventory control instructions based on the comparison results: when S - (t) <L low,j The replenishment command is triggered when S... j (t)>H high,j The database clearing command is triggered at that time.
[0188] This embodiment achieves adaptive control of silo inventory by establishing a dynamic early warning mechanism based on dual thresholds. When inventory is too low, replenishment is prioritized to prevent supply disruptions during shipping; when inventory is too high, clearing is prioritized to prevent unloading congestion, thereby maintaining a healthy inventory level in the silo throughout the entire operating cycle.
[0189] Example 9:
[0190] This embodiment, based on Embodiment 1, extends the method from a single port to multiple ports within the same waterway. Specifically:
[0191] In step S1, multiple initial configuration parameters related to the rail-water intermodal transport system of the target port are obtained, including the following sub-steps:
[0192] Identify multiple ports located in the same waterway but in different geographical locations, and label them as P1, P2, ..., P M , where M represents the total number of ports participating in the collaborative configuration, and M≥2.
[0193] Obtain each port P separately i Each port has its own initial configuration parameter set, which includes at least the initial range L of the number of locomotives in service for that port. i ∈[L i,min ,L i,max Initial range T for the number of bottom-opening car formations i ∈[T i,min ,T i,max ] and the initial range Q of the number of silos i ∈[Q i,min Q i,max ], where i=1,2,…,M.
[0194] The initial configuration parameter sets of multiple ports are aggregated to form a joint initial configuration parameter space Θ, which is represented as:
[0195] Θ=\ ([L i,min ,L i,max ]×[T i,min ,T i,max ]×[Q i,min Q i,max ])
[0196] Here, the symbol \bigtimes represents the Cartesian product operation, and the dimension of the joint initial configuration parameter space Θ is 3M.
[0197] In step S2, using the number of bottom-door car formations as the coordination anchor point, a multi-dimensional resource coupling constraint model is constructed to describe the nonlinear linkage relationship between the number of locomotives, the number of bottom-door car formations, and the number of silos, including:
[0198] Based on the joint initial configuration parameter space Θ, a cross-port joint resource coupling constraint model is established. This model shares local locomotive resources and bottom-door rolling stock resources among the multiple ports and coordinates them uniformly through a central dispatch center. The joint resource coupling constraint model includes the following global constraints:
[0199]
[0200]
[0201] Among them, L global T represents the upper limit of the total number of service locomotives that can be deployed across ports. global This indicates the upper limit of the total number of bottom-opening vehicle resources that can be allocated across ports.
[0202] Preferably, the upper limit L of the total number of locomotives available for cross-port deployment is... global The maximum value T is 80% to 120% of the total number of locomotives owned by each port (temporary leasing or requisition of spare locomotives is allowed), and the maximum total number of bottom-opening vehicle resources that can be allocated across ports. global Similarly.
[0203] This embodiment extends the optimization model for a single port to a multi-port collaborative scenario. By centrally dispatching locomotives and rolling stock, resource sharing and load balancing are achieved. For example, when a concentrated influx of ships into port A causes silos to be full, some trains can be diverted to port B for unloading, thereby alleviating the pressure on port A.
[0204] Example 10:
[0205] This embodiment, based on Embodiment Nine, further defines the solution method for the cross-port joint model, specifically including:
[0206] Step S101: Decompose the cross-port joint resource coupling constraint model into a main problem and one or more sub-problems, wherein:
[0207] The main problem is responsible for the optimal allocation of global resources, which at least include the total amount L of local locomotive resources that can be deployed across ports. globalThe total number of bottom-opening vehicle resources T that can be deployed across ports global ;
[0208] Each of the sub-problems corresponds to a single port P. i Local resource allocation optimization, wherein the local resources include at least the number L of locomotives corresponding to the port. i Number of bottom-opening car formations (T) i and the number of silos Q i .
[0209] Step S102: The Benders decomposition algorithm is used to iteratively solve the main problem and the multiple subproblems. The iterative solution process includes the following loop operations:
[0210] Step S102a: Solve the main problem to obtain the global resource L. global and T global The initial allocation scheme in the current iteration round is then passed to each of the sub-problems;
[0211] Step S102b: Based on the received preliminary allocation scheme, each of the sub-problems solves its corresponding local resource allocation optimization problem for a single port, and generates a corresponding local optimal solution and feasibility feedback information. The feasibility feedback information includes: if a sub-problem is infeasible under the current allocation scheme, a Benders feasibility cut plane is generated; if all sub-problems are feasible, a Benders optimality cut plane is generated.
[0212] In step S102c, the feasibility feedback information generated by each of the sub-problems is returned to the main problem, and the main problem updates its own constraints accordingly and enters the next round of iterative solution.
[0213] Step S103: Repeat steps S102a to S102c until a preset convergence condition is met, wherein the convergence condition includes at least one of the following:
[0214] The difference between the objective function value of the main problem and the sum of the objective function values of each of the subproblems is less than a preset tolerance error. ;
[0215] The number of iterations reaches the preset maximum number of iterations K. max .
[0216] Preferably, the preset tolerance error The possible value is 10,000 yuan, and the maximum number of iterations is K. max The possible value is 100. In actual testing, for the collaborative optimization problem involving three ports, convergence is usually achieved within 15-25 iterations.
[0217] Step S104: When the convergence condition is met, the iteration is terminated, and the global resource allocation scheme of the main problem obtained in the last iteration is combined with the local resource allocation scheme of each sub-problem to form a global collaborative configuration scheme applicable to the multiple ports.
[0218] This embodiment uses the Benders decomposition algorithm to solve the cross-port joint model, making full use of the decomposable structure of the problem itself: the main problem only involves the allocation of the total global resources, while the sub-problems can be solved in parallel to optimize the local resources of each port, which greatly improves the computational efficiency. For practical application scenarios involving 3-5 ports, the solution time can be shortened from several hours to several minutes, meeting the actual needs of engineering.
[0219] Based on the same inventive concept, embodiments of the present invention also provide an electronic device. Figure 2 This is a structural block diagram of an electronic device provided in an embodiment of the present invention. Figure 2 As shown, an embodiment of the present invention provides an electronic device including: one or more processors 101, a memory 102, and one or more I / O interfaces 103. The memory 102 stores one or more programs, which, when executed by the one or more processors, enable the one or more processors to implement a vehicle-ship-warehouse collaborative configuration method for non-metallic mineral iron-water intermodal transport as described in any of the above embodiments; the one or more I / O interfaces 103 are connected between the processor and the memory, configured to enable information interaction between the processor and the memory.
[0220] The processor 101 is a device with data processing capabilities, including but not limited to a central processing unit (CPU); the memory 102 is a device with data storage capabilities, including but not limited to random access memory (RAM, more specifically SDRAM, DDR, etc.), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), and flash memory (FLASH); the I / O interface (read / write interface) 103 is connected between the processor 101 and the memory 102, and can realize information interaction between the processor 101 and the memory 102, including but not limited to a data bus (Bus).
[0221] In some embodiments, the processor 101, memory 102, and I / O interface 103 are interconnected via bus 104, and thus connected to other components of the computing device.
[0222] In some embodiments, the one or more processors 101 include a field-programmable gate array.
[0223] This invention also provides a computer-readable medium. The computer-readable medium stores a computer program, which, when executed by a processor, implements a vehicle-ship-bay coordinated configuration method for non-metallic mineral iron-water intermodal transport as described in any of the above embodiments.
[0224] This invention also provides a computer program product, including computer-readable code, or a non-volatile computer-readable storage medium carrying computer-readable code. When the computer-readable code is run in the processor of an electronic device, the processor in the electronic device executes any of the above-described methods for the coordinated configuration of vehicle, ship, and cargo hold in non-metallic mineral-iron-water intermodal transport.
[0225] Those skilled in the art will understand that all or some of the steps, systems, and apparatuses disclosed above, and their functional modules / units, can be implemented as software, firmware, hardware, or suitable combinations thereof. In hardware implementations, the division between functional modules / units mentioned above does not necessarily correspond to the division of physical components; for example, a physical component may have multiple functions, or a function or step may be performed collaboratively by several physical components. Some or all physical components may be implemented as software executed by a processor, such as a central processing unit, digital signal processor, or microprocessor, or as hardware, or as an integrated circuit, such as an application-specific integrated circuit (ASIC). Such software can be distributed on a computer-readable storage medium, which may include computer storage media (or non-transitory media) and communication media (or transient media).
[0226] As is known to those skilled in the art, computer storage media includes volatile and non-volatile, removable and non-removable media implemented in any method or technology for storing information such as computer-readable program instructions, data structures, program modules, or other data. Computer storage media includes, but is not limited to, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM), static random access memory (SRAM), flash memory or other memory technologies, portable compact disc read-only memory (CD-ROM), digital versatile disc (DVD) or other optical disc storage, magnetic cartridges, magnetic tape, disk storage or other magnetic storage devices, or any other medium that can be used to store desired information and is accessible to a computer. Furthermore, it is known to those skilled in the art that communication media typically contain computer-readable program instructions, data structures, program modules, or other data in modulated data signals such as carrier waves or other transmission mechanisms, and may include any information delivery medium.
[0227] The computer-readable program instructions described herein can be downloaded from computer-readable storage media to various computing / processing devices, or downloaded via a network, such as the Internet, local area network, wide area network, and / or wireless network, to an external computer or external storage device. The network may include copper transmission cables, fiber optic transmission, wireless transmission, routers, firewalls, switches, gateway computers, and / or edge servers. A network adapter card or network interface in each computing / processing device receives the computer-readable program instructions from the network and forwards them to the computer-readable storage media in the respective computing / processing device.
[0228] The computer program instructions used to perform the operations of this invention may be assembly instructions, instruction set architecture (ISA) instructions, machine instructions, machine-dependent instructions, microcode, firmware instructions, state setting data, or source code or object code written in any combination of one or more programming languages, including object-oriented programming languages such as Smalltalk, C++, etc., and conventional procedural programming languages such as the "C" language or similar programming languages. The computer-readable program instructions may be executed entirely on the user's computer, partially on the user's computer, as a standalone software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In cases involving a remote computer, the remote computer may be connected to the user's computer via any type of network—including a local area network (LAN) or a wide area network (WAN)—or may be connected to an external computer (e.g., via the Internet using an Internet service provider). In some embodiments, electronic circuitry, such as programmable logic circuitry, field-programmable gate arrays (FPGAs), or programmable logic arrays (PLAs), is personalized by utilizing state information from the computer-readable program instructions. This electronic circuitry can execute the computer-readable program instructions to implement various aspects of the invention.
[0229] The computer program product described herein can be implemented specifically through hardware, software, or a combination thereof. In one alternative embodiment, the computer program product is specifically embodied in a computer storage medium; in another alternative embodiment, the computer program product is specifically embodied in a software product, such as a software development kit (SDK), etc.
[0230] Various aspects of the present invention are described herein with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It should be understood that each block of the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer-readable program instructions.
[0231] These computer-readable program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, or other programmable data processing apparatus to produce a machine such that, when executed by the processor of the computer or other programmable data processing apparatus, they create means for implementing the functions / actions specified in one or more blocks of the flowchart and / or block diagram. These computer-readable program instructions can also be stored in a computer-readable storage medium that causes a computer, programmable data processing apparatus, and / or other device to operate in a particular manner; thus, the computer-readable medium storing the instructions comprises an article of manufacture that includes instructions for implementing aspects of the functions / actions specified in one or more blocks of the flowchart and / or block diagram.
[0232] Computer-readable program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other device to cause a series of operational steps to be performed on the computer, other programmable data processing apparatus, or other device to produce a computer-implemented process, thereby causing the instructions executed on the computer, other programmable data processing apparatus, or other device to perform the functions / actions specified in one or more boxes of a flowchart and / or block diagram.
[0233] The flowcharts and block diagrams in the accompanying drawings illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer program products according to various embodiments of the present invention. In this regard, each block in a flowchart or block diagram may represent a module, segment, or portion of an instruction, which contains one or more executable instructions for implementing a specified logical function. In some alternative implementations, the functions marked in the blocks may occur in a different order than those shown in the drawings. For example, two consecutive blocks may actually be executed substantially in parallel, and they may sometimes be executed in reverse order, depending on the functions involved. It should also be noted that each block in the block diagrams and / or flowcharts, and combinations of blocks in the block diagrams and / or flowcharts, may be implemented using a dedicated hardware-based system that performs the specified function or action, or using a combination of dedicated hardware and computer instructions.
[0234] Example embodiments have been disclosed herein, and while specific terminology has been used, it is for illustrative purposes only and should be construed as such, and is not intended to be limiting. In some instances, it will be apparent to those skilled in the art that features, characteristics, and / or elements described in conjunction with particular embodiments may be used alone, or in combination with features, characteristics, and / or elements described in conjunction with other embodiments, unless otherwise expressly indicated. Therefore, those skilled in the art will understand that various changes in form and detail may be made without departing from the scope of the invention as set forth in the appended claims.
Claims
1. A method for coordinated configuration of vehicles, ships, and cargo holds in non-metallic mineral iron-water intermodal transport, characterized in that, Includes the following steps: Step S1: Obtain multiple initial configuration parameters related to the rail-water intermodal transport system of the target port. The multiple initial configuration parameters include at least: the number of locomotives, the number of cars in a train with bottom doors, and the number of silos for storing non-metallic minerals. Step S2: Using the number of bottom-opening car train formations as the coordination anchor point, construct a multi-dimensional resource coupling constraint model to describe the nonlinear linkage relationship between the number of main locomotives, the number of bottom-opening car train formations, and the number of silos. Step S3: Based on the preset annual total transport volume target and the ship arrival distribution pattern, the multi-dimensional resource coupling constraint model is solved using a mixed integer programming algorithm to obtain a set of target configuration schemes that meet transport capacity requirements and minimize the overall system cost. The set of target configuration schemes includes the optimized number of main locomotives, the number of bottom-door car formations, and the number of silos. Step S4: Based on the target configuration scheme set, generate and output the corresponding railway transportation scheduling plan, port berth allocation plan, and silo inventory management plan to guide the actual operation of the rail-water intermodal transport system of the target port.
2. The method according to claim 1, characterized in that, In step S2, using the number of bottom-opening car formations as the coordination anchor point, a multi-dimensional resource coupling constraint model is constructed to describe the nonlinear linkage relationship between the number of locomotives, the number of bottom-opening car formations, and the number of silos. This specifically includes the following sub-steps: Step S21, define the number of train rows T of the bottom-opening vehicle as a decision variable, where T∈[T min ,T max ], and T min and T max These are determined by the lower and upper quantiles of the statistical distribution of train formation numbers in historical operating data, respectively. Step S22, construct a first constraint function to associate the number of locomotives L with the number of bottom-door car formations T. The first constraint function is expressed as: ; Among them, W train R represents the standard full load weight of a single-row, bottom-opening vehicle. grade R represents the resistance coefficient per unit slope of the limiting ramp. curve R represents the additional drag coefficient per unit curve in the limiting slope section. start F represents the unit starting resistance coefficient. loco The symbol represents the rated tractive force of a single locomotive. This indicates a rounding up operation to ensure sufficient traction. Step S23: Construct a second constraint function to control the total effective volume V of the silo. total The second constraint function, associated with the number of train groups T of vehicles with bottom-opening doors, is expressed as follows: V total ≥ g(T)=T V car (t unload / t cycle +β) Among them, V car This indicates the rated cargo volume (t) of a single-row, bottom-opening vehicle. unload t represents the average unloading time for single-row bottom-opening vehicles. cycle β represents the average time for a single silo to complete a full turnaround cycle of unloading, storage, and loading, and β represents the safety buffer coefficient used to cope with the volatility of ship arrivals, with β>0.
3. The method according to claim 2, characterized in that, In step S23, a second constraint function is constructed to control the total effective volume V of the silo. total Associated with the number of train rows T of the bottom-opening vehicle group, the following sub-steps are included: Step S231: Obtain the total number N of non-metallic mineral types to be stored, and set a preset threshold M for the types of goods; Step S232: Based on the comparison result of the total number of non-metallic mineral types N and the commodity type threshold M, a commodity type switching penalty factor α is defined. The calculation rule of the commodity type switching penalty factor α is as follows: ; Where α1 is the first coefficient greater than 1, and α2 is the second coefficient equal to 1; Step S233: Based on the cargo type switching penalty factor α, the second constraint function is modified into a buffer volume constraint that considers the impact of cargo type switching. The modified second constraint function is expressed as follows: V total ≥ α g(T)=α T V car (t unload / t cycle +β) The modified second constraint function is used to increase the required lower limit of the total effective volume of the silo by introducing the first coefficient α1 when the total number of non-metallic mineral types N exceeds the cargo type threshold M, thereby providing additional buffer volume reserves for the risk of unloading operation interruption caused by frequent cargo type switching.
4. The method according to claim 3, characterized in that, In step S3, based on the preset annual total transport volume target and the ship arrival distribution pattern, a mixed integer programming algorithm is used to solve the multi-dimensional resource coupling constraint model to obtain a set of target configuration schemes that meet transport capacity requirements and minimize the overall system cost. This includes the following sub-steps: Step S31: Establish an objective function, which is used to minimize the system's total lifecycle cost C. total The total lifecycle cost C of the system total It is obtained by weighted summation of the following four cost components: C total =C silo (Q)+C loco (L)+C car (T)+C delay (W) Where: Q represents the number of silos, C silo (Q) is a piecewise linearly increasing function of the number of silos Q, used to characterize the investment cost of silo construction; L represents the number of locomotives, C loco (L) is a linear function of the number of locomotives L, used to characterize the cost of locomotive acquisition and maintenance; T represents the number of cars in a formation with bottom doors, C car (T) is a linear function of the number of bottom-door vehicle trains T, used to characterize vehicle acquisition and maintenance costs; W represents the average waiting time of ships, C delay (W) is an exponential function of the average waiting time W of ships, used to characterize the cost of delays caused by system congestion; Step S32: Establish the coupling relationship between the average waiting time W of the ship, the number of bottom-door vehicle formations T, and the number of silos Q. The coupling relationship is expressed as follows: W=h(T,Q)=λ / (μ(T,Q) (μ(T,Q)-λ)) Wherein, λ represents the ship arrival rate, which is determined by the ship arrival distribution pattern; μ(T,Q) represents the system service rate, which is a function of the unloading-loading throughput rate determined by the number of bottom-door vehicle trains T and the number of silos Q, and satisfies the system stability condition μ(T,Q)>λ. Step S33, using the objective function C total Minimizing the value of the target configuration is the objective. Using the first constraint function and the modified second constraint function as constraints, a mixed integer programming algorithm is used to solve the problem and obtain the set of target configuration schemes that minimize the total life cycle cost of the system.
5. The method according to claim 4, characterized in that, In step S33, the objective function C total Minimizing is the optimization objective, and the solution is obtained using a mixed integer programming algorithm, which includes the following sub-steps: Step S331: In each iteration of the solution process, a current candidate configuration scheme is generated. The current candidate configuration scheme includes a set of decision variable values, including the number of locomotives L, the number of bottom-door car trains T, and the number of silos Q. Step S332: Based on the current candidate configuration scheme, calculate the corresponding system lifecycle cost C. total The system's annual operating capacity P is compared with the current candidate configuration scheme, and the scheme is mapped onto a two-dimensional coordinate system with total investment as the horizontal axis and system annual operating capacity as the vertical axis, forming a coordinate point (C). total ,P); Step S333: Obtain the pre-constructed investment-capacity trade-off curve. The investment-capacity trade-off curve is a boundary curve composed of multiple Pareto optimal solutions. The Pareto optimal solution refers to the solution in the two-dimensional coordinate system in which no other feasible solution can achieve a higher annual system capacity with the same or lower total investment, or can achieve a lower total investment with the same annual system capacity. Step S334: Determine the coordinates (C) corresponding to the current candidate configuration scheme. total Whether P) is governed by any known solution on the investment-capacity tradeoff curve: if there exists a known solution (C' total P') satisfies C' total ≤C total If P' ≥ P and at least one inequality holds, then the current candidate configuration scheme is determined to be a dominated solution and is excluded; otherwise, it is determined to be a non-dominated solution, included in the target configuration scheme set, and the investment-capacity trade-off curve is updated.
6. The method according to claim 2, characterized in that, In step S4, a corresponding railway transportation scheduling plan is generated and output based on the target configuration scheme set, including the following sub-steps: Step S41: Extract the optimized number of bottom-opening door vehicle train formations T from the target configuration scheme set. opt And the optimized number of service locomotives L opt ; Step S42, based on the optimized number of bottom-opening door vehicle train formations T opt Combined with the preset standard load capacity W of a single-row bottom-opening vehicle car Calculate the total number N of heavy-haul trains that need to be dispatched from the mining area to the port each day. train The total number of heavy-haul trains N train The calculation formula is: ; Among them, G annual D represents the preset annual total transport volume target. operating Indicates the number of planned operating days per year, symbol This indicates rounding up to the nearest integer to ensure that transport capacity is not lower than the total annual transport volume target. Step S43, based on the optimized number of locomotives L opt and the total number of heavy-load trains N per day train A locomotive routing plan is formulated, which is used to allocate a specified number of locomotives for traction or pushing of each heavy-haul train departing from the mining area, and satisfies the following constraints: ; Among them, l i k represents the number of locomotives assigned to the i-th heavy-haul train. shift This indicates the number of locomotive shifts that can be put into operation each day, and l i Not less than the first constraint function f(T) opt The minimum number of locomotives required is determined to ensure that each heavy-haul train has sufficient traction power.
7. The method according to claim 1, characterized in that, In step S4, a corresponding port berth allocation plan is generated and output based on the target configuration scheme set, including the following sub-steps: Extract the optimized silo quantity Q from the set of target configuration schemes. opt The system acquires real-time inventory level data for each type of commodity in the silo, wherein the real-time inventory level data includes at least the current inventory quantity S corresponding to each type of commodity. j and its corresponding maximum silo capacity C j , where j=1,2,…,N, and N represents the total number of non-metallic mineral types; Real-time collection of arriving vessel information, including at least the estimated arrival time A for each vessel. k Load capacity D k and the required non-metallic mineral cargo type identification G k , where k=1,2,…,K, and K represents the total number of ships arriving in the current planning period; Based on the real-time inventory level data and the arriving vessel information, the berth allocation priority P for each vessel is calculated. k The berth allocation priority P k The calculation formula is: ; Among them, S Gk Indicates type G k The current inventory level, C Gk Indicates type G k The corresponding maximum silo capacity, A now Indicates the current moment, where ε is a very small positive number to prevent the denominator from being zero, and A k >A now ; According to the berth allocation priority P k Berths are assigned to vessels in descending order of priority, and corresponding loading operation plans are generated simultaneously. Priority P is given to each berth. k Higher berth allocations are used to reduce the time ships spend in port.
8. The method according to claim 1, characterized in that, In step S4, a corresponding silo inventory management plan is generated and output based on the target configuration scheme set, including the following sub-steps: Extract the optimized number of bottom-opening door vehicle formations T from the target configuration scheme set. opt And the optimized number of silos Q opt And obtain the real-time inventory level data of the silos corresponding to each type of commodity, wherein the real-time inventory level data includes at least the current inventory quantity S of each type of commodity. j (t), where j=1,2,…,N, N represents the total number of non-metallic mineral types, and t represents the current time; Establish a dynamic early warning mechanism for silo inventory, the dynamic early warning mechanism being based on the optimized number of bottom-opening vehicle formations T. opt The corresponding unloading rate R unload With berth loading rate R ship The real-time difference is used to calculate the net inflow rate Δ of each type of cargo in the silos. j (t), the net inflow rate Δ j The formula for calculating (t) is: D j (t)=a j (t) R unload b j (t) R ship Where, α j (t) represents the unloading ratio coefficient of cargo type j at the current time, β j (t) represents the loading percentage coefficient of cargo type j at the current moment, and satisfies and ; Based on the net inflow rate Δ j (t) and the real-time inventory S j (t), set the first inventory threshold L for each type of silo. low,j Second inventory threshold H high,j L low,j <H high,j L low,j and H high,j Based on the optimized number of silos Q opt The allocation ratio of silos for each type of cargo is determined; According to the real-time inventory S j (t) and the first inventory threshold L low,j and the second inventory threshold H high,j Based on the comparison results, execute the corresponding inventory control instructions: When S j (t) <L low,j When the replenishment command is triggered, the loading operation corresponding to cargo type j is suspended, and the unloading operation corresponding to cargo type j is accelerated until S j (t)≥L low,j +δ safe , where δ safe Indicates the safety rebound margin; When S j (t)>H high,j When the time is right, a clearing command is triggered, suspending the unloading operation for cargo type j and accelerating the loading operation for cargo type j until S. j (t)≤H high,j δ safe .
9. The method according to claim 1, Its characteristics are: In step S1, multiple initial configuration parameters related to the rail-water intermodal transport system of the target port are obtained, including the following sub-steps: Identify multiple ports located in the same waterway but at different geographical locations, and label these ports as P1, P2, ..., P M , where M represents the total number of ports participating in the collaborative configuration, and M≥2; Obtain P for each port separately i Each port has its own initial configuration parameter set, which includes at least the initial range L of the number of locomotives in service at that port. i ∈[L i,min ,L i,max Initial range T for the number of bottom-opening car formations i ∈[T i,min ,T i,max ] and the initial range Q of the number of silos i ∈[Q i,min Q i,max ], where i = 1, 2, ..., M; The initial configuration parameter sets of the multiple ports are aggregated to form a joint initial configuration parameter space Θ across the ports, which is represented as: Θ=\ ([L i,min ,L i,max ]×[T i,min ,T i,max ]×[Q i,min ,Q i,max ]) Wherein, the symbol \bigtimes represents the Cartesian product operation, and the dimension of the joint initial configuration parameter space Θ is 3M; In step S2, using the number of bottom-door car formations as the coordination anchor point, a multi-dimensional resource coupling constraint model is constructed to describe the nonlinear linkage relationship between the number of locomotives, the number of bottom-door car formations, and the number of silos, including: Based on the joint initial configuration parameter space Θ, a cross-port joint resource coupling constraint model is established. This model shares local locomotive resources and bottom-door rolling stock resources among the multiple ports and coordinates them uniformly through a central dispatch center. The joint resource coupling constraint model includes the following global constraints: ; ; Among them, L global T represents the upper limit of the total number of service locomotives that can be deployed across ports. global This indicates the upper limit of the total number of bottom-opening vehicle resources that can be allocated across ports.
10. The method according to claim 9, characterized in that, In step S3, based on the preset annual total transport volume target and the ship arrival distribution pattern, the multi-dimensional resource coupling constraint model is solved using a mixed integer programming algorithm, including the following sub-steps: Step S101: Decompose the cross-port joint resource coupling constraint model into a main problem and one or more sub-problems, wherein: The main problem is responsible for the optimal allocation of global resources, which at least include the total amount L of local locomotive resources that can be deployed across ports. global The total number of bottom-opening vehicle resources T that can be deployed across ports global ; Each of the sub-problems corresponds to a single port P. i Local resource allocation optimization, wherein the local resources include at least the number L of locomotives corresponding to the port. i Number of bottom-opening car formations (T) i and the number of silos Q i ; Step S102: The Benders decomposition algorithm is used to iteratively solve the main problem and the multiple subproblems. The iterative solution process includes the following loop operations: Step S102a: Solve the main problem to obtain the global resource L. global and T global The initial allocation scheme in the current iteration round is then passed to each of the sub-problems; Step S102b: Based on the received preliminary allocation scheme, each of the sub-problems solves its corresponding local resource allocation optimization problem for a single port, and generates a corresponding local optimal solution and feasibility feedback information. The feasibility feedback information includes: if a sub-problem is infeasible under the current allocation scheme, a Benders feasibility cut plane is generated; if all sub-problems are feasible, a Benders optimality cut plane is generated. Step S102c: The feasibility feedback information generated by each of the sub-problems is returned to the main problem, and the main problem updates its own constraints accordingly and enters the next round of iterative solution; Step S103: Repeat steps S102a to S102c until a preset convergence condition is met, wherein the convergence condition includes at least one of the following: The difference between the objective function value of the main problem and the sum of the objective function values of each of the subproblems is less than a preset tolerance error. ; The number of iterations reaches the preset maximum number of iterations K. max ; Step S104: When the convergence condition is met, the iteration is terminated, and the global resource allocation scheme of the main problem obtained in the last iteration is combined with the local resource allocation scheme of each sub-problem to form a global collaborative configuration scheme applicable to the multiple ports.
