CN115796400B - Load optimization method, system, equipment and medium based on single-layer load algorithm - Google Patents
Load optimization method, system, equipment and medium based on single-layer load algorithm Download PDFInfo
- Publication number
- CN115796400B CN115796400B CN202310070032.8A CN202310070032A CN115796400B CN 115796400 B CN115796400 B CN 115796400B CN 202310070032 A CN202310070032 A CN 202310070032A CN 115796400 B CN115796400 B CN 115796400B
- Authority
- CN
- China
- Prior art keywords
- pulp
- loading
- representing
- layer
- result
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02P—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
- Y02P90/00—Enabling technologies with a potential contribution to greenhouse gas [GHG] emissions mitigation
- Y02P90/30—Computing systems specially adapted for manufacturing
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- Ship Loading And Unloading (AREA)
Abstract
The invention provides a load optimization method, a system, equipment and a medium based on a single-layer load algorithm, wherein the method comprises the following steps: selecting a matching layer and pulp specifications corresponding to the matching layer; determining operation times according to the size of the loading layer and the pulp; a single-layer loading algorithm is adopted to determine the pulp loading result of the loading layer, and all the pulp loading results are output; storing all pulp loading results to a database as preferred results, and repeatedly calling; and determining a load optimization target according to the preferred result, establishing a pulp ship load optimization model, and determining a pulp ship load optimization scheme through the pulp ship load optimization model. The invention is used for solving the problem of pulp loading of various different specifications in automatic loading of ship cargoes, improving loading and unloading efficiency of wharfs, reducing cargo loss and improving safety and economy of pulp marine transportation.
Description
Technical Field
The invention relates to the technical field of pulp ship loading, in particular to a loading optimization method, a system, equipment and a medium based on a single-layer loading algorithm.
Background
With the improvement of national living standard, the pulp traffic is rapidly increased in recent years, and the rapidly increased traffic promotes more and more loading demands.
The pulp loading is a key link in the transportation process of the pulp ship, the quality of the loading scheme directly influences the safety and economy of the pulp marine transportation, and the reasonable loading scheme can improve the loading and unloading efficiency of the wharf, reduce the cargo loss and shorten the adjustment time of ballast water.
At present, less research is conducted on the pulp ship loading, the research on automatic loading of ship cargoes is focused on the roll-on-roll ship and the container ship, and the method has certain reference significance on the pulp ship loading. However, because the constraints to be considered in the pulp ship are not the same as those of the roll-on-roll ship and the container ship, a reasonable pulp loading method is required for the pulp loading of various specifications.
Disclosure of Invention
The invention aims to provide a load optimization method, a system, equipment and a medium based on a single-layer load algorithm, which are used for solving the problem of pulp load of various different specifications in automatic load of ship goods, improving loading and unloading efficiency of a wharf, reducing cargo loss and improving safety and economy of pulp marine transportation.
The aim of the invention can be achieved by the following technical scheme:
a load optimization method based on a single-layer load algorithm comprises the following steps:
s1: selecting a matching layer and pulp specifications corresponding to the matching layer;
s2: determining operation times according to the size of the loading layer and the pulp;
s3: a single-layer loading algorithm is adopted to determine the pulp loading result of the loading layer, and all the pulp loading results are output;
s4: storing all pulp loading results to a database as preferred results, and repeatedly calling;
s5: and determining a load optimization target according to the preferred result, establishing a pulp ship load optimization model, and determining a pulp ship load optimization scheme through the pulp ship load optimization model.
In one embodiment, the single layer load algorithm includes the steps of:
s31: generating a pulp package library initialization horizontal line set;
s32: determining the lowest horizontal line, and calculating the weights of all pulp packages;
s33: determining loadable pulp packages according to the lowest horizontal line and different weights, and updating the horizontal line set;
s34: judging whether a horizontal line exists, if so, returning to the step S32 to continue iterative operation, and if not, outputting a pulp loading result;
s35: judging whether all the operations are completed, if not, returning to the step S32 to continue the operations, and if so, terminating the operations.
In one embodiment, the optimization model in step S5 is:
wherein, the liquid crystal display device comprises a liquid crystal display device,
representing different weights, C representing the number of hanger wires of the preferred result, N representing the total number of pulp bales, W representing the number of hanger wires, numScore for the number of pulp bales, minNum representing the minimum number of pulp bales in the preferred result, maxNum representing the maximum number of pulp bales in the preferred result, wireScore representing the number of hanger wires, minwireNum representing the minimum number of hanger wire contacts in each preferred resultMaxWireNum represents the maximum number of hanger wire contacts in each preferred result, craneScore represents the number of hanger points in the preferred result, minWireNum represents the minimum number of hanger points in the preferred result, maxCraneNum represents the maximum number of hanger points in the preferred result, overlay score represents the composite score of the optimization scheme, and the optimization scheme is determined by the composite score.
In one embodiment, the constraints of the pulp vessel load optimization model include:
the pulp package quantity constraint is used for ensuring that the quantity of pulp packages loaded on the same plane of single-layer pulp reaches the maximum under the preferable loading result.
In one embodiment, the constraints of the pulp vessel load optimization model include:
the number of pulp hangers is constrained to ensure that the total number of pulp hangers is minimized during loading and unloading with a preferred loading result.
In one embodiment, the constraints of the pulp vessel load optimization model include:
and the number of the hanging iron wires is restricted, so that the number of the hanging iron wires contacted with the ship body is ensured to be minimum under the preferable loading result.
A load optimization system based on a single layer load algorithm, comprising:
the automatic configuration module is used for selecting a pulp specification corresponding to the loading layer;
the operation module is used for determining operation times according to the specification of the loading layer and the pulp, determining the pulp loading result of the loading layer by adopting a single-layer loading algorithm, and outputting all the pulp loading results;
the data storage module is used for storing all pulp loading results into the database as preferred results and repeatedly calling;
and the decision module is used for determining a load optimization target according to the preferred result, establishing a pulp ship load optimization model, and determining a pulp ship load optimization scheme through the pulp ship load optimization model.
In one embodiment, the operation module includes a decision operation module and a single-layer loading operation module, which are respectively used for determining operation times and outputting all pulp loading results.
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 the above embodiments when the computer program is executed.
A computer readable storage medium having stored thereon a computer program which, when executed by a processor, implements the steps of the method of any of the embodiments described above.
Compared with the prior art, the single-layer loading algorithm-based loading optimization method, system, equipment and medium are used for determining the pulp loading result according to the loading layer and the pulp specification, designing an optimization model for pulp loading, and obtaining an optimization scheme of pulp ship loading through constraint conditions, so that the problem of loading of various different specifications of pulp in automatic loading of ship goods is solved, loading and unloading efficiency of a wharf is improved, cargo loss is reduced, and safety and economy of pulp marine transportation are improved.
Drawings
In order to more clearly illustrate the embodiments of the invention or the technical solutions of the prior art, the drawings which are used in the description of the embodiments or the prior art will be briefly described, it being obvious that the drawings in the description below are only some embodiments of the invention, and that other drawings can be obtained according to these drawings without inventive faculty for a person skilled in the art.
FIG. 1 is a flow chart of a load optimization method based on a single-layer load algorithm of the present invention;
FIG. 2 is a flow chart of a single-layer load algorithm according to the present invention;
FIG. 3 is a schematic diagram of a load optimization system based on a single layer load algorithm according to the present invention.
Detailed Description
In order that the above-recited objects, features and advantages of embodiments of the present disclosure may be more clearly understood, a more particular description of embodiments of the present disclosure will be rendered by reference to the appended drawings and appended drawings. It should be noted that, in the case of no conflict, the embodiments of the present application and the features in the embodiments may be combined with each other.
In the following description, numerous specific details are set forth in order to provide a thorough understanding of the disclosed embodiments, however, the disclosed embodiments may be practiced in other than the described manner, and therefore the scope of the disclosed embodiments is not limited to the specific embodiments disclosed below.
Example 1
As shown in fig. 1 and fig. 2, the embodiment of the invention provides a load optimization method based on a single-layer load algorithm, which comprises the following steps:
s1: selecting a matching layer and pulp specifications corresponding to the matching layer;
s2: determining operation times according to the size of the loading layer and the pulp;
s3: a single-layer loading algorithm is adopted to determine the pulp loading result of the loading layer, and all the pulp loading results are output;
s4: storing all pulp loading results to a database as preferred results, and repeatedly calling;
s5: and determining a load optimization target according to the preferred result, establishing a pulp ship load optimization model, and determining a pulp ship load optimization scheme through the pulp ship load optimization model.
In this embodiment, the single-layer load algorithm in step S3 includes the following steps:
s31: generating a pulp package library initialization horizontal line set;
s32: determining the lowest horizontal line, and calculating the weights of all pulp packages;
s33: determining loadable pulp packages according to the lowest horizontal line and different weights, and updating the horizontal line set;
s34: judging whether a horizontal line exists, if so, returning to the step S32 to continue iterative operation, and if not, outputting a pulp loading result;
s35: judging whether all the operations are completed, if not, returning to the step S32 to continue the operations, and if so, terminating the operations.
Wherein, the pulp package which can be loaded on the lowest horizontal line is searched, different pulp packages are given corresponding weights, and the finally loaded pulp package is selected by probability. Wherein the probability of occurrence of the largest number of pulp packets is a (a < 1), the probability of occurrence of the largest number of pulp packets is (1-a)/2, and so on. By adopting the method to select the pulp package, the method can ensure that the overall pulp package number is more and the hanging number is less, and simultaneously ensure that the solving result of the load distribution algorithm has diversity, thereby facilitating the follow-up optimization of different results.
Specifically, as shown in the following experimental results, pulp of two specifications was loaded in a 27.03m×27.26m cabin, and the specific specifications of the pulp are as follows:
the manual loading is carried out, the result is that the paper pulp package of the model A is totally packaged in 621 packages, the paper pulp package of the model B is totally packaged in 542 packages, the single-layer loading algorithm is adopted for loading, the paper pulp package of the model A is totally packaged in 630 packages, the single-layer multi-package paper pulp is loaded in 9 packages, and the optimization rate is 1.45%; the pulp package of model B was loaded with 548 packages together, and 6 packages of pulp were loaded in a single layer, with an optimization of 1.11%.
In step S5 of this embodiment, the optimization model in step S5 is:
wherein, the liquid crystal display device comprises a liquid crystal display device,
representing different weights, C representing the number of hanger wires of the preferred result, N representing the total number of pulp bales, W representing the number of hanger wires, numScore for the number of pulp bales, minNum representing the minimum number of pulp bales in the preferred result, maxNum representing the maximum number of pulp bales in the preferred result, wireScore for the number of hanger wires, minwireNum representing the minimum number of hanger wire contacts in each preferred result,MaxWireNum represents the maximum number of hanger wire contacts in each preferred result, craneScore represents the number of hanger points in the preferred result, minWireNum represents the minimum number of hanger points in the preferred result, maxCraneNum represents the maximum number of hanger points in the preferred result, overlay score represents the composite score of the optimization scheme, and the optimization scheme is determined by the composite score.
In this embodiment, the constraints of the pulp vessel load optimization model include:
the pulp package quantity constraint is used for ensuring that the quantity of pulp packages loaded on the same plane of single-layer pulp reaches the maximum under the preferable loading result. The pulp loaded by the ship is stacked by single-layer pulp layers, and the more the pulp bags in the single-layer pulp on the same plane are, the more the total transportation quantity of the pulp of the ship is, so that the transportation economy of the pulp ship is improved.
In this embodiment, the constraints of the pulp vessel load optimization model include:
the number of pulp hangers is constrained to ensure that the total number of pulp hangers is minimized during loading and unloading with a preferred loading result. Pulp is hung by the pulp that iron wire ligature constitutes and is hung the piece, and the quantity that pulp hung the piece influences loading and unloading efficiency, and less hanging the piece can improve loading and unloading efficiency in the assembly scheme.
In this embodiment, the constraints of the pulp vessel load optimization model include:
the hanging iron wire quantity constraint is used for guaranteeing that under the preferential loading result, the hanging iron wire quantity contacted with the ship body reaches the minimum, the hanging iron wire quantity is the iron wire quantity used for hanging paper pulp hanging pieces, part of the iron wires can contact the side bulkhead, the ship can roll periodically under the influence of wind and waves in the transportation process, the iron wires can be broken with the iron wires of the ship body due to repeated friction, the cargo damage is caused, and the risk of the cargo damage can be reduced due to the fact that the iron wires are less contacted with the ship body.
According to the single-layer loading algorithm-based loading optimization method, a single-layer loading algorithm is adopted to determine a pulp loading result according to the loading layer and the pulp specification, an optimization model is designed for pulp loading, and an optimization scheme of pulp ship loading is obtained through constraint conditions, so that the problem of pulp loading of various different specifications in automatic loading of ship goods is solved, loading and unloading efficiency of a wharf is improved, cargo loss is reduced, and safety and economy of pulp marine transportation are improved.
Example 2
As shown in fig. 3, an embodiment of the present invention provides a load optimization system based on a single-layer load algorithm, including:
the automatic configuration module is used for selecting a pulp specification corresponding to the loading layer;
the operation module is used for determining operation times according to the specification of the loading layer and the pulp, determining the pulp loading result of the loading layer by adopting a single-layer loading algorithm, and outputting all the pulp loading results;
the data storage module is used for storing all pulp loading results into the database as preferred results and repeatedly calling;
and the decision module is used for determining a load optimization target according to the preferred result, establishing a pulp ship load optimization model, and determining a pulp ship load optimization scheme through the pulp ship load optimization model.
In this embodiment, the operation module includes a decision operation module and a single-layer loading operation module, which are respectively used for determining the operation times and outputting all the pulp loading results.
The load optimization system based on the single-layer load algorithm of the embodiment can execute the load optimization method based on the single-layer load algorithm disclosed in the embodiment 1, and the pulp ship load optimization scheme obtained by the method meets the configuration requirements of the pulp ship, solves the problem of pulp load of various different specifications in automatic load of ship goods, improves loading and unloading efficiency of a wharf, reduces cargo loss, and improves safety and economy of pulp marine transportation.
Example 3
An embodiment of the present invention provides a computer device, including a memory and a processor, where the memory stores a computer program, and the processor executes the computer program to implement the steps of the method described in the foregoing embodiment 1.
Example 4
An embodiment of the present invention provides a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, implements the steps of the method described in embodiment 1 above.
Those skilled in the art will appreciate that implementing all or part of the above described methods may be accomplished by way of a computer program stored on a non-transitory computer readable storage medium, which when executed, may comprise the steps of the embodiments of the methods described above. Any reference to memory, storage, database, or other medium used in the various embodiments provided herein may include non-volatile and/or volatile memory. The nonvolatile memory can include Read Only Memory (ROM), programmable ROM (PROM), electrically Programmable ROM (EPROM), electrically Erasable Programmable ROM (EEPROM), or flash memory. Volatile memory can include Random Access Memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in a variety of forms such as Static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double Data Rate SDRAM (DDRSDRAM), enhanced SDRAM (ESDRAM), synchronous Link DRAM (SLDRAM), memory bus direct RAM (RDRAM), direct memory bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM), among others.
The technical features of the above embodiments may be arbitrarily combined, and all possible combinations of the technical features in the above embodiments are not described for brevity of description, however, as long as there is no contradiction between the combinations of the technical features, they should be considered as the scope of the description.
The above examples merely represent a few embodiments of the present application, which are described in more detail and are not to be construed as limiting the scope of the invention. It should be noted that it would be apparent to those skilled in the art that various modifications and improvements could be made without departing from the spirit of the present application, which would be within the scope of the present application. Accordingly, the scope of protection of the present application is to be determined by the claims appended hereto.
Claims (6)
1. A pulp ship load optimization method based on a single-layer load algorithm is characterized by comprising the following steps:
s1: selecting a matching layer and pulp specifications corresponding to the matching layer;
s2: determining operation times according to the size of the loading layer and the pulp;
s3: a single-layer loading algorithm is adopted to determine the pulp loading result of the loading layer, and all the pulp loading results are output;
s4: storing all pulp loading results to a database as preferred results, and repeatedly calling;
s5: according to the optimized result, a load optimization target is determined, a pulp ship load optimization model is established, and a pulp ship load optimization scheme is determined through the pulp ship load optimization model;
the optimization model is as follows:
wherein x is 1 ,x 2 ,x 3 Representing different weights, C representing the number of hanger wires of the preferred result, N representing the total number of pulp bales, W representing the number of hanger wires, numScore representing the minimum number of pulp bales in the preferred result, maxNum representing the maximum number of pulp bales in the preferred result, wireScore representing the number of hanger wires, minWireNum representing the minimum number of hanger wire contacts in each preferred result, maxWireNum representing the maximum number of hanger wire contacts in each preferred result, cransere representing the number of hanger wires of the preferred result, minCraneNum representing the minimum number of hanger wires in the preferred result, maxCraneNum representing the maximum number of hanger wires in the preferred result, overalScore representing the overall score of the optimization scheme, and determining the optimization scheme by the overall score;
the constraint conditions of the pulp ship load optimization model comprise:
the number constraint of the pulp hanging pieces is used for ensuring that the total number of the pulp hanging pieces is minimum during loading and unloading under the preferential loading result;
the pulp package quantity constraint is used for ensuring that the quantity of pulp packages loaded on the same plane of single-layer pulp reaches the maximum under the optimal loading result;
and the number of the hanging iron wires is restricted, so that the number of the hanging iron wires contacted with the ship body is ensured to be minimum under the preferable loading result.
2. The pulp vessel load optimization method based on the single-layer load algorithm according to claim 1, wherein in step S3, the single-layer load algorithm comprises the steps of:
s31: generating a pulp package library initialization horizontal line set;
s32: determining the lowest horizontal line, and calculating the weights of all pulp packages;
s33: determining loadable pulp packages according to the lowest horizontal line and different weights, and updating the horizontal line set;
s34: judging whether a horizontal line exists, if so, returning to the step S32 to continue iterative operation, and if not, outputting a pulp loading result;
and S35, judging whether all the operations are completed, if not, returning to the step S32 to continue the operations, and if so, ending the operations.
3. A pulp vessel load optimization system based on a single layer load algorithm, comprising:
the automatic configuration module is used for selecting a pulp specification corresponding to the loading layer;
the operation module is used for determining operation times according to the specification of the loading layer and the pulp, determining the pulp loading result of the loading layer by adopting a single-layer loading algorithm, and outputting all the pulp loading results;
the data storage module is used for storing all pulp loading results into the database as preferred results and repeatedly calling;
the decision module is used for determining a load optimization target according to the preferred result, establishing a pulp ship load optimization model, and determining a pulp ship load optimization scheme through the pulp ship load optimization model;
the optimization model is as follows:
wherein x is 1 ,x 2 ,x 3 Representing different weights, C representing the number of hanger wires of the preferred result, N representing the total number of pulp bales, W representing the number of hanger wires, numScore representing the minimum number of pulp bales in the preferred result, maxNum representing the maximum number of pulp bales in the preferred result, wireScore representing the number of hanger wires, minWireNum representing the minimum number of hanger wire contacts in each preferred result, maxWireNum representing the maximum number of hanger wire contacts in each preferred result, cransere representing the number of hanger wires of the preferred result, minCraneNum representing the minimum number of hanger wires in the preferred result, maxCraneNum representing the maximum number of hanger wires in the preferred result, overalScore representing the overall score of the optimization scheme, and determining the optimization scheme by the overall score;
the constraint conditions of the pulp ship load optimization model comprise:
the number constraint of the pulp hanging pieces is used for ensuring that the total number of the pulp hanging pieces is minimum during loading and unloading under the preferential loading result;
the pulp package quantity constraint is used for ensuring that the quantity of pulp packages loaded on the same plane of single-layer pulp reaches the maximum under the optimal loading result;
and the number of the hanging iron wires is restricted, so that the number of the hanging iron wires contacted with the ship body is ensured to be minimum under the preferable loading result.
4. A pulp vessel load optimization system based on a single-layer load algorithm according to claim 3, wherein the operation module comprises a decision operation module and a single-layer load operation module, which are respectively used for determining the operation times and outputting all pulp load results.
5. 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-2 when the computer program is executed.
6. 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-2.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310070032.8A CN115796400B (en) | 2023-02-07 | 2023-02-07 | Load optimization method, system, equipment and medium based on single-layer load algorithm |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310070032.8A CN115796400B (en) | 2023-02-07 | 2023-02-07 | Load optimization method, system, equipment and medium based on single-layer load algorithm |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115796400A CN115796400A (en) | 2023-03-14 |
| CN115796400B true CN115796400B (en) | 2023-06-02 |
Family
ID=85430137
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310070032.8A Active CN115796400B (en) | 2023-02-07 | 2023-02-07 | Load optimization method, system, equipment and medium based on single-layer load algorithm |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115796400B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115964376A (en) * | 2023-03-16 | 2023-04-14 | 中远海运特种运输股份有限公司 | Pulp data calling method, system, equipment and medium based on automatic loading |
| CN115965165A (en) * | 2023-03-16 | 2023-04-14 | 中远海运特种运输股份有限公司 | Automatic loading optimization method, equipment and medium for pulp ship |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2019101742A1 (en) * | 2017-11-21 | 2019-05-31 | Kilia Aps | A method of containership allocation-based stowage planning |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| FI129806B (en) * | 2019-12-02 | 2022-08-31 | Macgregor Finland Oy | Stowage planning for a vessel |
| CN114970983B (en) * | 2022-05-10 | 2023-05-09 | 武汉理工大学 | Passenger rolling ship load optimization method based on improved LHL algorithm |
| CN115271140A (en) * | 2022-08-02 | 2022-11-01 | 上海交通大学 | Dynamic programming based container ship stowage box position reservation method |
-
2023
- 2023-02-07 CN CN202310070032.8A patent/CN115796400B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2019101742A1 (en) * | 2017-11-21 | 2019-05-31 | Kilia Aps | A method of containership allocation-based stowage planning |
Non-Patent Citations (2)
| Title |
|---|
| 成捆纸浆扩大装卸单元工艺研究;梅小冬;;港口科技(04);16-18 * |
| 铁路阔大货物装载加固方案的比选;王花兰,顾守淮;兰州铁道学院学报(01);125-130 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115796400A (en) | 2023-03-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN115796400B (en) | Load optimization method, system, equipment and medium based on single-layer load algorithm | |
| Kurpel et al. | The exact solutions of several types of container loading problems | |
| Wang et al. | A feasibility-based heuristic for the container pre-marshalling problem | |
| CN110675102A (en) | Order binding method and device, computer equipment and storage medium | |
| EP3862939A1 (en) | System and method for autonomous multi-bin parcel loading system | |
| CN116502866B (en) | Intelligent bulk cargo ship planning and automatic classification method | |
| CN109941779A (en) | Bagged cement loading method and system | |
| CN115809746B (en) | Pulp ship loading method, system, equipment and medium based on full-ship automatic loading | |
| Cruz-Reyes et al. | Constructive algorithm for a benchmark in ship stowage planning | |
| CN111695966B (en) | Intelligent packing material recommending and boxing method and system | |
| CN115965165A (en) | Automatic loading optimization method, equipment and medium for pulp ship | |
| CN113537851A (en) | Goods warehouse-in and warehouse-out scheduling method and device and storage medium | |
| CN110667779A (en) | Novel ore carrier for transporting light ore sand | |
| CN116739132A (en) | Automatic load optimization system, equipment and medium for pulp ship | |
| CN113962548A (en) | Cargo loading scheme optimization method, program product, readable medium, and electronic device | |
| KR101135464B1 (en) | Method for opimized arranging container and computer readable recording medium | |
| CN115964376A (en) | Pulp data calling method, system, equipment and medium based on automatic loading | |
| CN114581020A (en) | Intelligent logistics management method and system | |
| CN113928770A (en) | Method, device and equipment for determining box changing strategy of goods | |
| CN114229135A (en) | Method and device for determining goods packaging mode, storage medium and electronic equipment | |
| CN116703285B (en) | Goods generation information processing method and system | |
| CN113570176A (en) | Cargo packing scheme output method and device, computer equipment and storage medium | |
| Yurtseven et al. | Optimization of container stowage using simulated annealing and genetic algorithms | |
| CN118095985A (en) | Pulp ship assembly method, system, equipment and medium based on backlog algorithm | |
| CN114240165A (en) | Freight order reminding method, device, equipment and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |