CN110728046A - Multi-stage pipeline and accessory boxing method thereof based on heuristic algorithm - Google Patents
Multi-stage pipeline and accessory boxing method thereof based on heuristic algorithm Download PDFInfo
- Publication number
- CN110728046A CN110728046A CN201910950018.0A CN201910950018A CN110728046A CN 110728046 A CN110728046 A CN 110728046A CN 201910950018 A CN201910950018 A CN 201910950018A CN 110728046 A CN110728046 A CN 110728046A
- Authority
- CN
- China
- Prior art keywords
- boxing
- pipeline
- scheme
- model
- packing
- 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.)
- Granted
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T17/00—Three dimensional [3D] modelling, e.g. data description of 3D objects
-
- 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
- Physics & Mathematics (AREA)
- Engineering & Computer Science (AREA)
- Computer Graphics (AREA)
- Geometry (AREA)
- Software Systems (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Processing Or Creating Images (AREA)
Abstract
The invention relates to a multi-stage pipeline and accessory boxing method based on heuristic algorithm, which comprises the following steps: establishing and solving an optimal casing model, and performing nested filling on pipelines with different specifications; b. packaging: establishing an optimal circular pipeline packing model, and performing cylindrical combination on the nested circular pipelines; c. boxing: solving the three-dimensional packing problem, and solving the packing scheme of the packed pipelines and the fittings thereof so as to pack the packed pipelines into a cubic box. The method decomposes the complicated plastic tube loading or boxing process, automatically and quickly obtains the boxing scheme, saves the time of service personnel, and improves the efficiency and the space utilization rate.
Description
Technical Field
The application belongs to the technical field of pipeline boxing, and particularly relates to a multi-stage pipeline and accessory boxing method thereof based on a heuristic algorithm.
Background
The pipeline has the excellent characteristics of strong corrosion resistance, easy adhesion, low price, hard texture and the like, and is widely applied to the conveying systems of drainage, waste water, chemicals, slurry, gas and the like. Pipeline production and sales enterprises often need to load pipelines and related fittings (elbows, ball valves, plugs, etc.) into vehicle containers or containers in daily operations and then transport the pipelines over long distances. In the process of boxing, due to the lack of an effective boxing algorithm and a boxing flow, the situation that the vehicle is not fully loaded or the goods are not loaded is often caused, so that the efficiency is low, and manpower and material resources are wasted.
In traditional vanning flow, some according to workman's experience of enterprise, pack the vanning by oneself, because the problem is complicated, great deviation and processing time are often appeared in people's experience. Other enterprises purchase software based on a cuboid boxing algorithm to solve the three-dimensional boxing problem, but neglect the characteristics of a cylinder and a pipeline which can be sleeved when non-cubic goods similar to plastic pipelines are processed, so that large space waste is often caused, the result is poor, and the efficiency is not high.
In the scene of packing PVC plastic pipes and fittings thereof, if the characteristics of pipe sleeves and cylinders can be comprehensively considered, the space utilization rate of a vehicle container or a container can be greatly improved under the condition of meeting the requirements of customers, and the cost of a transport ship is reduced. Based on the above thought, the patent provides a multi-stage pipeline and its fitting packing method based on heuristic algorithm.
Disclosure of Invention
The technical problem to be solved by the invention is to provide a multi-stage pipeline and fitting encasement method based on a heuristic algorithm, which can quickly solve an approximately optimal plastic pipe encasement scheme, provide reference for encasement personnel, improve the space utilization rate, reduce the cost and accelerate the efficiency.
In order to solve the problems, the technical scheme adopted by the invention is as follows:
a multi-stage pipeline and accessory boxing method based on heuristic algorithm comprises the following steps:
a. sleeving a sleeve: establishing and solving an optimal casing model, and performing nested filling on pipelines with different specifications;
b. packaging: establishing an optimal circular pipeline packing model, and performing cylindrical combination on the nested circular pipelines;
c. boxing: solving the three-dimensional boxing problem, establishing a three-dimensional boxing problem model, and solving the boxing scheme of the packed pipelines and the fittings thereof so as to pack the packed pipelines into a cubic box.
The technical scheme of the invention is further improved as follows: in a, the optimal casing model is an integer programming model, and the specific solving process is as follows:
the input of the optimal casing model is the pipeline data comprising the number, the inner diameter, the outer diameter and the length of each type of pipeline, the goal of minimizing the total volume of the pipeline to be installed is set, the decision variable is whether the pipeline A is sleeved in the pipeline B or not, the casing conditions are met, the optimal casing model is constructed, and the optimal casing scheme is obtained by solving through an integer programming solver in the integer programming model.
The technical scheme of the invention is further improved as follows: in the step b, the optimal circular pipeline packing model is that a circular packing algorithm is used for packing the sleeved pipelines into a cuboid, so that an optimal rectangular packing circular scheme is obtained.
The technical scheme of the invention is further improved as follows: the circular packing algorithm is a heterogeneous circular packing algorithm.
The technical scheme of the invention is further improved as follows: and c, carrying out scheme initial selection on the three-dimensional boxing problem model by adopting a construction heuristic algorithm and a greedy rule, then carrying out scheme optimization by using a meta-heuristic algorithm, and finally displaying a solution result.
The technical scheme of the invention is further improved as follows: the three-dimensional boxing problem model comprises the specific processes that data of pipelines after being sleeved and packaged are processed into a cuboid, the cuboid and boxed pipeline accessory data are input into the three-dimensional boxing problem model, an initial solution is generated in the model by using a construction heuristic algorithm based on Maximal Space, optimization is carried out according to the scale of the problem, an approximately optimal scheme is obtained before the specified time of the problem is over, and a scheme file and an effect display are output.
The technical scheme of the invention is further improved as follows: and displaying the solution result, namely outputting a two-dimensional picture of a casing scheme, a three-dimensional animation of a packing scheme and a three-dimensional animation of a boxing scheme.
The technical scheme of the invention is further improved as follows: the problem scale refers to the number of the total packing number, and the optimization according to the problem scale refers to that the total packing number is larger than 100 (large-scale problem) by adopting a meta-heuristic algorithm based on GRASP, and the total packing number is smaller than or equal to 100 (small-scale problem) by adopting a neighborhood search meta-heuristic algorithm based on a VNS framework.
Due to the adoption of the technical scheme, the invention has the beneficial effects that: the method decomposes the complex plastic tube loading or boxing process, and based on the method, the boxing scheme is automatically and quickly obtained by using calculation solution, so that the time of service personnel is saved, and the efficiency is improved; the maximum casing model fully utilizes the characteristic that the plastic pipe can be sleeved, and the space utilization rate is improved; the three-dimensional boxing algorithm plays a better boxing effect under the support of an optimal sleeve scheme and a circular packing scheme, and the space utilization rate is improved.
The invention comprises three stages, the first stage is a casing: modeling and solving the pipeline data (type, number, inner diameter, outer diameter and length) by using a rightmost casing model to obtain an optimal casing scheme; the first stage is packing: modeling and solving the optimal sleeve solution obtained in the first stage according to a circular packing model to obtain a cuboid packed by cylindrical pipelines; the first stage is boxing: and outputting a 3D animation display and loading scheme file according to the sorted boxed accessory data based on a Maximum construction heuristic algorithm and a meta-heuristic algorithm based on adjacent search, and the method is visual in image, neat and efficient.
Drawings
FIG. 1 is a frame diagram of the present invention;
FIG. 2 is a schematic view of an optimized bushing model assembly according to the present invention;
FIG. 3 is an assembly schematic of the three-dimensional binning algorithm of the present invention;
FIG. 4 is a flow chart of the present invention.
Detailed Description
The present invention will be described in further detail with reference to the following examples and accompanying drawings.
As shown in fig. 1 to 4, the invention discloses a multi-stage pipeline and its fitting packing method based on heuristic algorithm, comprising the following steps:
a. sleeving a sleeve: establishing and solving an optimal casing model, and performing nested filling on pipelines with different specifications;
b. packaging: establishing an optimal circular pipeline packing model, and performing cylindrical combination on the nested circular pipelines;
c. boxing: solving the three-dimensional boxing problem, establishing a three-dimensional boxing problem model, and solving the boxing scheme of the packed pipelines and the fittings thereof so as to pack the packed pipelines into a cubic box.
In a, the optimal casing model is an integer programming model, and the specific solving process is as follows:
the input of the optimal casing model is the pipeline data comprising the number, the inner diameter, the outer diameter and the length of each type of pipeline, the goal of minimizing the total volume of the pipeline to be installed is set, the decision variable is whether the pipeline A is sleeved in the pipeline B or not, the casing conditions are met, the optimal casing model is constructed, and the optimal casing scheme is obtained by solving through an integer programming solver in the integer programming model.
In the step b, the optimal circular pipeline packing model is that a circular packing algorithm is used for packing the sleeved pipelines into a cuboid, so that an optimal rectangular packing circular scheme is obtained.
The circular packing algorithm is a heterogeneous circular packing algorithm.
In step c, the three-dimensional boxing problem model adopts a construction heuristic algorithm and a greedy rule to perform scheme initial selection, then utilizes a meta heuristic algorithm to perform scheme optimization, and finally displays the solution result.
The three-dimensional boxing problem model comprises the specific processes that data of pipelines after being sleeved and packaged are processed into a cuboid, the cuboid and boxed pipeline accessory data are input into the three-dimensional boxing problem model, an initial solution is generated in the three-dimensional boxing problem model by using a construction heuristic algorithm based on MaximalSpace, optimization is carried out according to the scale of the problem, an approximately optimal scheme is obtained before the specified time of the problem is over, and a scheme file and an effect display are output.
And displaying the solution result, namely outputting a two-dimensional picture of a casing scheme, a three-dimensional animation of a packing scheme and a three-dimensional animation of a boxing scheme.
The problem scale refers to the number of the total packing number, and the optimization according to the problem scale refers to that the total packing number is larger than 100 (large-scale problem) by adopting a meta-heuristic algorithm based on GRASP, and the total packing number is smaller than or equal to 100 (small-scale problem) by adopting a neighborhood search meta-heuristic algorithm based on a VNS framework.
When loading pipelines (such as PVC plastic pipes) and accessories thereof, the invention considers nesting filling, cylindrical combination and three-dimensional cube boxing of the pipelines with different specifications at the same time, applies a multi-stage model and an algorithm in the whole boxing process, quickly solves an approximately optimal plastic pipe boxing scheme, provides reference for boxing personnel, improves the space utilization rate, reduces the cost and accelerates the efficiency.
The invention decomposes the problem into three stages, and respectively establishes an optimal casing pipe model, an optimal plastic pipe packing model and a three-dimensional boxing model. And aiming at the characteristics of each model, respectively designing an efficient constructive or meta-heuristic solving algorithm to quickly obtain a boxing scheme.
The input data comprises pipeline data, accessory data and loading constraints, and the output data comprises a two-dimensional picture of a casing scheme, a three-dimensional animation of a packing scheme and a three-dimensional animation of a boxing scheme. And (3) establishing an integer programming model in the optimal casing model, solving a casing scheme by using an integer programming solver, and taking the result as the input of the optimal plastic pipe packing model in the second stage. In the second stage, an optimal rectangular packaging circular scheme is obtained by establishing a circular packaging model and using a circular packaging algorithm and is used as the input of the third-stage model. In the third stage, a three-dimensional boxing problem model is established, and a solving algorithm based on Maximum space is used. The greedy rule adopted in the algorithm is combined with the actual service scene, so that the convergence speed and the solving quality are improved. And finally, optimizing the scheme by adopting a meta-heuristic algorithm, and vividly displaying a solving result by adopting a 3D animation, so that the solution is vivid and visual.
Claims (8)
1. A multi-stage pipeline and accessory boxing method based on heuristic algorithm is characterized in that: the method comprises the following steps:
a. sleeving a sleeve: establishing and solving an optimal casing model, and performing nested filling on pipelines with different specifications;
b. packaging: establishing an optimal circular pipeline packing model, and performing cylindrical combination on the nested circular pipelines;
c. boxing: solving the three-dimensional boxing problem, establishing a three-dimensional boxing problem model, and solving the boxing scheme of the packed pipelines and the fittings thereof so as to pack the packed pipelines into a cubic box.
2. A heuristic-based multi-stage pipeline and its fitting binning method according to claim 1, characterized in that: in a, the optimal casing model is an integer programming model, and the specific solving process is as follows:
the input of the optimal casing model is the pipeline data comprising the number, the inner diameter, the outer diameter and the length of each type of pipeline, the goal of minimizing the total volume of the pipeline to be installed is set, the decision variable is whether the pipeline A is sleeved in the pipeline B or not, the casing conditions are met, the optimal casing model is constructed, and the optimal casing scheme is obtained by solving through an integer programming solver in the integer programming model.
3. A heuristic-based multi-stage pipeline and its fitting binning method according to claim 1, characterized in that: in the step b, the optimal circular pipeline packing model is that a circular packing algorithm is used for packing the sleeved pipelines into a cuboid, so that an optimal rectangular packing circular scheme is obtained.
4. A heuristic-based multi-stage pipeline and its fitting binning method according to claim 3, characterized in that: the circular packing algorithm is a heterogeneous circular packing algorithm.
5. A heuristic-based multi-stage pipeline and its fitting binning method according to claim 1, characterized in that: and c, carrying out scheme initial selection on the three-dimensional boxing problem model by adopting a construction heuristic algorithm and a greedy rule, then carrying out scheme optimization by using a meta-heuristic algorithm, and finally displaying a solution result.
6. A heuristic-based multi-stage pipeline and its fitting binning method according to claim 5, characterized in that: the three-dimensional boxing problem model comprises the specific processes that data of pipelines after being sleeved and packaged are processed into a cuboid, the cuboid and boxed pipeline accessory data are input into the three-dimensional boxing problem model, an initial solution is generated in the three-dimensional boxing problem model by using a construction heuristic algorithm based on Maximal Space, optimization is carried out according to the problem scale, an approximately optimal scheme is obtained, and scheme files and effect display are output.
7. A heuristic-based multi-stage pipeline and its fitting binning method according to claim 6, characterized in that: and displaying the solution result, namely outputting a two-dimensional picture of a casing scheme, a three-dimensional animation of a packing scheme and a three-dimensional animation of a boxing scheme.
8. A heuristic-based multi-stage pipeline and its fitting binning method according to claim 7, characterized in that: the problem scale refers to the number of total packing number, and the optimization according to the problem scale refers to that the total packing number is larger than 100, a meta-heuristic algorithm based on GRASP is adopted, and the total packing number is smaller than or equal to 100, and a neighborhood search meta-heuristic algorithm based on a VNS framework is selected.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910950018.0A CN110728046B (en) | 2019-10-08 | 2019-10-08 | Multi-stage pipeline based on heuristic algorithm and fitting boxing method thereof |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910950018.0A CN110728046B (en) | 2019-10-08 | 2019-10-08 | Multi-stage pipeline based on heuristic algorithm and fitting boxing method thereof |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110728046A true CN110728046A (en) | 2020-01-24 |
| CN110728046B CN110728046B (en) | 2023-09-01 |
Family
ID=69220745
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910950018.0A Active CN110728046B (en) | 2019-10-08 | 2019-10-08 | Multi-stage pipeline based on heuristic algorithm and fitting boxing method thereof |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110728046B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112132342A (en) * | 2020-09-23 | 2020-12-25 | 厦门锐特信息技术有限公司 | Heuristic packing optimization method |
| CN114841432A (en) * | 2022-04-29 | 2022-08-02 | 广东工业大学 | Pipe casing and encasement optimization method and system |
| CN115180201A (en) * | 2022-07-25 | 2022-10-14 | 北自所(北京)科技发展股份有限公司 | Automatic packaging method and system for silk rolls |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20030110102A1 (en) * | 2001-05-29 | 2003-06-12 | Chen-Fu Chien | Method for goods arrangement and its system |
| US20130289945A1 (en) * | 2012-04-27 | 2013-10-31 | U.S.A. As Represented By The Administrator Of The National Aeronautics And Space Administration | System and Method for Space Utilization Optimization and Visualization |
| CN103455841A (en) * | 2013-07-17 | 2013-12-18 | 大连海事大学 | Container loading method based on improved ant colony algorithm and heuristic algorithm |
| GB201404583D0 (en) * | 2014-03-14 | 2014-04-30 | Nsk Europ Ltd | A method of packaging containers |
| US20150130592A1 (en) * | 2013-11-13 | 2015-05-14 | Symbol Technologies. Inc. | Package-loading system |
| US20170154127A1 (en) * | 2015-11-30 | 2017-06-01 | Maoz Madmony | Efficient packing of objects |
| CN107330214A (en) * | 2017-07-11 | 2017-11-07 | 哈尔滨工业大学（威海） | Spatial configuration optimal method based on discretization Yu heuristic evolution algorithm |
| CN109388848A (en) * | 2018-08-30 | 2019-02-26 | 大连海事大学 | A kind of container ship stowage method based on double 40 feet of gantry cranes |
-
2019
- 2019-10-08 CN CN201910950018.0A patent/CN110728046B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20030110102A1 (en) * | 2001-05-29 | 2003-06-12 | Chen-Fu Chien | Method for goods arrangement and its system |
| US20130289945A1 (en) * | 2012-04-27 | 2013-10-31 | U.S.A. As Represented By The Administrator Of The National Aeronautics And Space Administration | System and Method for Space Utilization Optimization and Visualization |
| CN103455841A (en) * | 2013-07-17 | 2013-12-18 | 大连海事大学 | Container loading method based on improved ant colony algorithm and heuristic algorithm |
| US20150130592A1 (en) * | 2013-11-13 | 2015-05-14 | Symbol Technologies. Inc. | Package-loading system |
| GB201404583D0 (en) * | 2014-03-14 | 2014-04-30 | Nsk Europ Ltd | A method of packaging containers |
| US20170154127A1 (en) * | 2015-11-30 | 2017-06-01 | Maoz Madmony | Efficient packing of objects |
| CN107330214A (en) * | 2017-07-11 | 2017-11-07 | 哈尔滨工业大学（威海） | Spatial configuration optimal method based on discretization Yu heuristic evolution algorithm |
| CN109388848A (en) * | 2018-08-30 | 2019-02-26 | 大连海事大学 | A kind of container ship stowage method based on double 40 feet of gantry cranes |
Non-Patent Citations (6)
| Title |
|---|
| HIFI M，KACEM L，NEGRE S，ET AL.: "A linear programming approach for the three-dimensional bin packing problem.", ELECTRONIC NOTES IN DISCRETE MATHEMATICS. * |
| JOHN A. GEORGE.: "Packing different-sized circles into a rectangular container." * |
| 崔雪莲: "散套装货物混合装载问题优化算法研究" * |
| 李铁克: "单一尺寸圆坯的无缝钢管坯料设计模型与算法" * |
| 李鹏;汤勇;: "三维货物装箱问题的研究进展", 铁道科学与工程学报, no. 05 * |
| 林红: "面向汽车零部件自动化立体仓库的货位优化研究", 中国优秀硕士学位论文全文数据库 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112132342A (en) * | 2020-09-23 | 2020-12-25 | 厦门锐特信息技术有限公司 | Heuristic packing optimization method |
| CN114841432A (en) * | 2022-04-29 | 2022-08-02 | 广东工业大学 | Pipe casing and encasement optimization method and system |
| CN115180201A (en) * | 2022-07-25 | 2022-10-14 | 北自所(北京)科技发展股份有限公司 | Automatic packaging method and system for silk rolls |
| CN115180201B (en) * | 2022-07-25 | 2024-04-30 | 北自所(北京)科技发展股份有限公司 | Automatic packaging method and system for silk roll |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110728046B (en) | 2023-09-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110728046A (en) | Multi-stage pipeline and accessory boxing method thereof based on heuristic algorithm | |
| MX2012008233A (en) | 3d plant modeling systems and methods. | |
| WO2015090327A3 (en) | Liquid natural gas transfer | |
| CN102073467B (en) | Distributed method for displaying vector data, device and system thereof | |
| CN206373437U (en) | A kind of oil spout pipeline cutting equipment | |
| CN103895899B (en) | Large-scale gypsum board production line automatic packaging system | |
| CN204110086U (en) | A kind of steel pipe transmission dolly | |
| CN111861260A (en) | Regional energy economic operation and energy efficiency analysis method and terminal based on energy big data | |
| CN202469244U (en) | Supporting and guiding pipe frame for low-temperature pipelines in space division cold box | |
| CN205381665U (en) | System for realize goods and select, pack integration to people | |
| Greenblatt | Opportunities for efficiency improvements in the US natural gas transmission, storage and distribution system | |
| CN203497234U (en) | Net cover transfer device for net cover packaging machine | |
| CN203018325U (en) | Logistic transferring sorting system controlled by computer | |
| CN204124433U (en) | A kind of flexible conduit loading tail sealing machine | |
| CN202972312U (en) | Wire feed pipeline quick connector | |
| CN208103039U (en) | Assembled architecture built-in fitting products storage circulation system | |
| Kim et al. | A Design and Implementation of a Web-based Ship ERP (SHERP) | |
| CN204489224U (en) | A kind of dual-coil electromagnetic valve grease packaging device | |
| CN202176907U (en) | Filling system of deep cooling storage tank clamping sleeve with buffering effect | |
| CN205327514U (en) | Fishing net packing plant | |
| Eijk et al. | Extensive optimisation analyses of the piping of two large underground gas storage ariel compressors | |
| KR101295965B1 (en) | Pipe monovalent contract and monovalent contracting system | |
| Anioke et al. | Flared Gas Monetization in Nigeria-Status, Challenges & Opportunities | |
| CN205257989U (en) | Milk container | |
| CN202180955U (en) | Claw type guide pipe for pipe plastic packaging |
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 |