CN113222212A - Method for improving glass cutting utilization rate - Google Patents

Method for improving glass cutting utilization rate Download PDF

Info

Publication number
CN113222212A
CN113222212A CN202110370750.8A CN202110370750A CN113222212A CN 113222212 A CN113222212 A CN 113222212A CN 202110370750 A CN202110370750 A CN 202110370750A CN 113222212 A CN113222212 A CN 113222212A
Authority
CN
China
Prior art keywords
glass
scheme
cut
cutting
item
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
Application number
CN202110370750.8A
Other languages
Chinese (zh)
Other versions
CN113222212B (en
Inventor
蔡鑫
韩倩倩
刘兆娜
易康
谢浩
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Hangzhou Jiuxin Internet Of Things Science & Technology Co ltd
Original Assignee
Hangzhou Jiuxin Internet Of Things Science & Technology Co ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Hangzhou Jiuxin Internet Of Things Science & Technology Co ltd filed Critical Hangzhou Jiuxin Internet Of Things Science & Technology Co ltd
Priority to CN202110370750.8A priority Critical patent/CN113222212B/en
Publication of CN113222212A publication Critical patent/CN113222212A/en
Application granted granted Critical
Publication of CN113222212B publication Critical patent/CN113222212B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00Administration; Management
    • G06Q10/04Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • G06Q10/043Optimisation of two dimensional placement, e.g. cutting of clothes or wood
    • CCHEMISTRY; METALLURGY
    • C03GLASS; MINERAL OR SLAG WOOL
    • C03BMANUFACTURE, SHAPING, OR SUPPLEMENTARY PROCESSES
    • C03B33/00Severing cooled glass
    • C03B33/02Cutting or splitting sheet glass or ribbons; Apparatus or machines therefor
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/04Manufacturing
    • YGENERAL 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
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02PCLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
    • Y02P90/00Enabling technologies with a potential contribution to greenhouse gas [GHG] emissions mitigation
    • Y02P90/30Computing systems specially adapted for manufacturing

Landscapes

  • Engineering & Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Strategic Management (AREA)
  • Economics (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • Chemical & Material Sciences (AREA)
  • Marketing (AREA)
  • Theoretical Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Tourism & Hospitality (AREA)
  • Quality & Reliability (AREA)
  • Development Economics (AREA)
  • Game Theory and Decision Science (AREA)
  • Operations Research (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Materials Engineering (AREA)
  • Organic Chemistry (AREA)
  • Manufacturing & Machinery (AREA)
  • Health & Medical Sciences (AREA)
  • General Health & Medical Sciences (AREA)
  • Primary Health Care (AREA)
  • Re-Forming, After-Treatment, Cutting And Transporting Of Glass Products (AREA)

Abstract

The invention relates to a method for improving the glass cutting utilization rate, which is realized based on the size data of a target glass block and the size and defect data of a glass original sheet, and comprises the following steps of: the data of the target glass sheet and the data of the glass original sheet are processed and converted, and a heuristic glass cutting optimization algorithm is constructed, the algorithm fully considers constraints from customers, physical characteristics of glass, insufficient production of float glass and the like, a cutting mode based on decision tree representation is created, 1-cut, 1-plate and 1-solution are sequentially generated, optimization targets are continuously changed through multiple circulation iterations, and finally an optimal cutting scheme is found, so that the method is accurate and efficient.

Description

Method for improving glass cutting utilization rate
[ technical field ] A method for producing a semiconductor device
The invention relates to the technical field of glass manufacturing, in particular to a method for improving the glass cutting utilization rate.
[ background of the invention ]
Most flat glass is produced by a process known as the "float process". In this process, various powders (sand, soda, …) are melted in a large furnace to form liquid glass, which is then spread over a tin bath, cooled to solidify, and cut into large glass sheets. The large glass sheets are then stacked on a pallet at the bottom of the pallet and transported to a conveyor. Generally, it is desirable to cut large glass sheets into smaller rectangular glass sheets to suit the needs of the customer. The large glass sheet, when cut into smaller glass sheets, satisfies both the customer-related constraints (order …) and the physical characteristics of the glass. In addition, the quality of large glass sheets is not perfect and there are inherent defects that arise during the "float" process. During the cutting process, when a defect is on the cut glass sheet, it is likely to be rejected because of a loss of quality. Under the circumstances, the glass sheet with the same size needs to be cut again, the production rate of the production line is reduced, and a method for improving the glass cutting utilization rate is provided.
[ summary of the invention ]
The invention aims to solve the problems in the prior art, and provides a method for improving the glass cutting utilization rate, which can find an optimal cutting scheme, is accurate and efficient, and improves the quality of finished products.
In order to achieve the purpose, the invention provides a method for improving the glass cutting utilization rate, which specifically comprises the following steps:
s1, acquiring glass information, including data of a target glass sheet and data of an original glass sheet, wherein the target glass sheet is recorded as item, a stack (collection of the target glass sheets) to which the target glass sheet belongs is recorded as stack, and the original glass sheet is recorded as plate;
s2, processing and converting the glass information to facilitate algorithm processing;
s3, enumerating a possible typesetting scheme of the next item on the basis of the existing cutting typesetting under the condition of meeting the constraint condition;
s4, randomly and sequentially selecting data composition item combinations in different stacks (stacks) to which the target glass sheet belongs, and constructing a typesetting scheme in the small glass after longitudinal cutting on the glass sheet, wherein the typesetting scheme is marked as 1-cut;
s5, for each item combination, generating a plurality of 1-cuts according to the rule of S3, and evaluating the advantages and disadvantages of the 1-cuts;
s6, sequentially generating 1-cut according to the rule of S5 to form a glass original sheet typesetting scheme, recording the glass original sheet typesetting scheme as 1-plate, and optimizing the last two 1-cut;
s7, evaluating the quality of the 1-packet scheme, and selecting optimal 1-plate schemes;
s8, sequentially generating new 1-plate schemes according to rules of S3, S4, S5 and S6 to form a complete solution, recording the solution as a 1-solution scheme, evaluating the advantages and disadvantages of the 1-solution, and selecting the 1-plate corresponding to the 1-solution with the highest score; repeating the process, selecting the 1-packet scheme with the highest score in each step, and combining all the 1-packet schemes into the optimal 1-solution scheme;
s9, generating a solution by utilizing S3, S4, S5, S6, S7 and S8 for adjusting parameters;
and S10, outputting an optimal 1-solution scheme, and drawing a visual display diagram of the cutting scheme.
Preferably, the data collected in step S1 includes dimensional data of the target glass sheet, dimensions of the glass original sheet, and defect data.
Preferably, the constraint conditions to be satisfied in step S3 include a defect, an original glass sheet, a minimum height, a minimum width, and a sequence of target glass sheets in the stack, the layout of the item is generated according to the constraint conditions, and a cutting mode based on a decision tree is adopted, so as to improve the usability and efficiency of the algorithm.
Preferably, in the step S5, typesetting of item is continuously carried out until the item cannot be continued, so as to generate a 1-cut scheme, and the quality of 1-cut is evaluated by adopting the proportion of the total area of item in the 1-cut scheme to the area of the used glass original sheet.
Preferably, the 1-cut schemes are sequentially generated in the step S6 until the 1-cut cannot be generated, so that the 1-plate scheme is generated, and the last two 1-cut schemes are optimized by adopting the proportion of the total area of items used in the last two 1-cut schemes to the total area from the left section to the right end of the glass original sheet in the 1-cut scheme.
Preferably, step S8 sequentially generates 1-plate schemes, selects the optimal 1-plate scheme for each step with the smallest total area of the items in the 1-plate until all the items are typeset, generates the 1-solution scheme, evaluates the quality of the scheme by using the ratio of the total area of the items in the 1-solution scheme to the area of the used glass original, and selects the optimal 1-solution scheme.
The invention constructs a heuristic glass cutting optimization algorithm based on the size data of a target glass sheet and the size and defect data of an original glass sheet, the algorithm fully considers constraints from customers, physical characteristics of glass, insufficient production of float glass and the like, a cutting mode based on decision tree representation is adopted, 1-cut, 1-plate and 1-solution are sequentially generated, and an optimal cutting scheme is finally found out accurately and efficiently through multiple cycle iterations and continuous change of an optimization target.
The invention has the beneficial effects that:
1. the method considers the problem that the defects are inevitably generated in the production process of float glass, excludes the defects from the small glass, ensures that the cut small glass does not contain the defects, improves the quality of finished products, and does not account for the total utilization rate of the defect part.
2. A large rectangular glass sheet is cut into two smaller rectangular glass sheets using Guillotine cut (from one edge of the glass sheet to the other, parallel to the remaining edges). The method creatively adopts the decision tree to represent the cutting mode of the glass, and improves the usability and efficiency of the algorithm.
3. The method fully considers the practical constraints, such as the fact that Guillotine cut is adopted and the cutting times are limited, the order requirement of glass sheets in a stack, the size requirements of 1-cut and 2-cut, the minimum size requirement of defects and the like.
4. The method can generate a solution according to new data, adjust parameters in real time, realize self-optimization and ensure better quality.
5. The method sequentially generates the 1-cut, the 1-plate and the 1-solution through a heuristic algorithm, and finally finds the optimal cutting scheme through multiple cycles and continuous change of the optimization target, so that the method is accurate and efficient.
The features and advantages of the present invention will be described in detail by embodiments in conjunction with the accompanying drawings.
[ description of the drawings ]
FIG. 1 is a flow chart of a method of enhancing glass cutting utilization according to the present invention;
FIG. 2 is a schematic diagram of glass cutting in actual production, wherein FIG. 2- (a) depicts a Guillotine cut pattern and FIG. 2- (b) depicts a non-Guillotine cut pattern;
FIG. 3 is a schematic illustration of the manner in which a glass sheet having a defect is cut;
fig. 4 is a tree representation of the cutting pattern of fig. 3.
[ detailed description ] embodiments
Referring to fig. 1, the method for improving the glass cutting utilization rate provided by the invention includes acquiring glass information; the glass information comprises size information of a target glass sheet and glass original sheet data, and the glass original sheet data comprises original sheet size, defect position and size information; designing a cutting typesetting mode for the glass original sheet by a heuristic cutting algorithm according to the glass information; and cutting the glass sheet according to the cutting typesetting mode to obtain the target glass sheet.
The method is described in detail below:
s11, collecting information of a glass original sheet (plate), such as: length, width, size of defect, position of defect, etc., length, width, stack (stack) of the target glass sheet (item), and order in stack (i)1,i2,i3…) for two items i1And i2Meaning that it must be at i2Front shear i1This ordering comes from some practical constraints in delivery and glass cutting transport.
And S12, initializing the acquired data to facilitate the processing of c + + language and cutting algorithm. A list of plates (original glass sheets), items (target glass sheets), defects (defects of original glass sheets), stacks (sets to which target glass sheets belong), batch (sets of stacks), item _ area (area of item), item2stack (stack corresponding to target glass sheets), plates _ x (x coordinate after sorting defects in original glass sheets), and plates _ y (y coordinate after sorting defects in original glass sheets) is generated.
S13, in actual production, the glass cutting adopts Guillotine cut (cutting from one side of the glass sheet to the other side, and being parallel to the rest side), otherwise, the glass cutting can generate cracks. Referring to FIG. 2, wherein FIG. 2- (a) depicts a Guillotine cut pattern and FIG. 2- (b) depicts a non-Guillotine cut pattern.
The cutting locations and directions are arranged for a given glass sheet in terms of defect location and target glass sheet (item), where each cut is a Guillotine cut. Referring to fig. 3, a specific cutting mode of a glass original sheet (plate) having a defect is depicted, wherein 1-cut, 2-cut, 3-cut, 4-cut respectively represent one of first, second, third, and fourth stage cuts (one stage cut represents a longitudinal or transverse cut on the glass sheet after the previous stage cut, and particularly the first stage cut is performed on the glass original sheet).
The cutting pattern may be represented by a decision tree. Since Guillotine cut always divides a rectangular plate into two smaller rectangular plates. The root of the decision tree corresponds to the original plate, its leaves are item or waste or the rest. The children of a given node are children obtained after cutting at a depth level starting from the root node, each depth (depth) level representing a stage (stage). A tree representation of the cut pattern of fig. 3 is depicted in fig. 4.
Due to technical limitations, the number of Guillotine cuts that can be used to cut an article is limited. For a glass sheet, a maximum of 4 stages of cutting can be performed, and the last stage can only perform 2 Guillotine cuts at most.
The Item typesetting is represented by tree nodes (TreeNode), which contain the following parameters depth, plate, Item, c1cpl (left boundary of current 1-cut), c1cpr (right boundary of current 1-cut), c2cpb (lower boundary of current 2-cut), c2cpu (upper boundary of current 2-cut), c3cp (left boundary of current 3-cut), c4cp (upper boundary of current 4-cut), etc., wherein the specific information of a node is described.
When treenode. c2cpu ═ 0, item is placed on the new 1-cut.
When treenode.c2cpb ═ 0& & treenode.c1cpr ═ treenode (old). c3cp, c1cpr is extended or item is put on a new 2-cut.
Under other conditions, item is placed on the current 2-cut, and if the size of item exceeds c1cpr of the current tree node too much, it is placed on the new 2-cut.
When arranging the typesetting of the item, the following constraints are also satisfied:
1) item is only allowed to rotate 90.
2) The minimum width between the two 1-cuts should be greater than 100mm, with the exception of scrap.
3) The maximum width between the two 1-cuts should be less than 3500 mm.
4) The minimum height between the two 2-cuts should be greater than 100mm, except for waste.
5) The minimum size of the waste is (20mm ).
S14, creating a temporary stack combination (temp _ batch) for constructing a 1-cut scheme. Because the cutting process of the glass, the items in the stack (stack) must be cut out in sequence. Under the condition, the first item is selected from each stack and inserted into temp _ batch, then a stack is randomly selected, and the next item is extracted and inserted into the stack in temp _ batch. And repeating the process to generate a plurality of different temp _ batchs so as to construct different 1-cut schemes, and selecting preferentially.
S15, for a temp _ batch, randomly selecting a stack, extracting a first item, and generating the typesetting of the current item according to the rule of S13. And repeating the process until a complete 1-cut scheme is generated when the new item typesetting cannot be generated. In addition, the items are extracted randomly, and one item can have multiple typesetting modes, and can be typeset by multiple items, so that a plurality of 1-cut schemes are generated finally.
Evaluating the quality of the generated 1-cut scheme by adopting a formula (1):
Cut_score=Used_item_area/(Lastnode.c1cpr-Fristnode.c1cpl)*Plateheight)
formula (1)
Wherein, Cut _ score represents the score of 1-Cut, Used _ item _ area represents the sum of the areas of items in a 1-Cut scheme, Lastnode.c1cpr represents the size of c1cpr of the last node in the 1-Cut scheme, Firstnode.c1cpl represents the size of c1cpl of the first node in the 1-Cut scheme, and Plateheight represents the height of a glass original (place).
And S16, sequentially generating the optimal 1-cut scheme according to the rule of S15 until the 1-cut scheme cannot be generated, and combining all the 1-cut schemes into a 1-plate scheme. For the last two 1-cut schemes, re-optimization is performed by using formula (2).
Tail_usage_rate=Tail_item_area/(Platewidth-Lastnode.c1cpr)*Plateheight
Formula (2)
Wherein, Tail _ use _ rate represents the utilization rate of the last two 1-cuts, Tail _ item _ area represents the sum of the areas of the items of the last two 1-cuts, Platewidth represents the width of a glass original (plate), Lastnode.c1cpr represents the size of the last node c1cpr in the last 1-cut scheme, and Plateheight represents the height of the glass original (plate).
S17, each temp _ batch generates a 1-plate scheme according to the rules of S15 and S16, the total area of the item of each 1-plate scheme is calculated, and a plurality of 1-plate schemes with the largest total area are selected.
S18, for a 1-plate scheme, sequentially generating new 1-plate schemes according to rules of S13, S14, S15, S16 and S17, and selecting the optimal 1-plate scheme of each step on the principle that the total area of items is the minimum until all the items are typeset and are combined into a complete 1-solution. The multiple 1-plate schemes correspond to the multiple 1-solution schemes, and the optimal 1-solution scheme corresponding to the 1-solution scheme is selected by using a formula (3).
Usage_rate=Total_item_area/((Plateheight*((Platenum-1)*Platewidth+
Sol. back. c1cpr)) formula (3)
Wherein, Total _ item _ area represents the sum of all item areas, plate height represents the height of the glass original (plate), plate represents the Total number of the plates, plate width represents the width of the glass original (plate), and sol.
And repeating the process, and selecting the 1-packet scheme with the highest Usage _ rate in each step until all the items are typeset, so as to obtain the optimal 1-solution scheme.
And S19, generating a solution by utilizing S13, S14, S15, S16, S17 and S18, calculating time consumption, the number of 1-cut average typesetting items and the like, and adjusting parameters.
And S20, adjusting the output of the optimal 1-solution result, facilitating the processing of cutting software, and drawing a visual display diagram of a cutting scheme.
The above embodiments are illustrative of the present invention, and are not intended to limit the present invention, and any simple modifications of the present invention are within the scope of the present invention.

Claims (6)

1. A method for improving the glass cutting utilization rate is characterized in that: the method specifically comprises the following steps:
s1, acquiring glass information which comprises data of a target glass sheet and data of an original glass sheet, wherein the target glass sheet is marked as item, a stack to which the target glass sheet belongs is marked as stack, and the original glass sheet is marked as plate;
s2, processing and converting the glass information to facilitate algorithm processing;
s3, enumerating a possible typesetting scheme of the next item on the basis of the existing cutting typesetting under the condition of meeting the constraint condition;
s4, randomly and sequentially selecting data composition item combinations in different stacks to which the target glass sheet belongs, and constructing a typesetting scheme in the small glass after longitudinal cutting on the glass sheet, wherein the typesetting scheme is marked as 1-cut;
s5, for each item combination, generating a plurality of 1-cuts according to the rule of S3, and evaluating the advantages and disadvantages of the 1-cuts;
s6, sequentially generating 1-cut according to the rule of S5 to form a glass original sheet typesetting scheme, recording the glass original sheet typesetting scheme as 1-plate, and optimizing the last two 1-cut;
s7, evaluating the quality of the 1-packet scheme, and selecting optimal 1-plate schemes;
s8, sequentially generating new 1-plate schemes according to rules of S3, S4, S5 and S6 to form a complete solution, recording the solution as a 1-solution scheme, evaluating the advantages and disadvantages of the 1-solution, and selecting the 1-plate corresponding to the 1-solution with the highest score; repeating the process, selecting the 1-packet scheme with the highest score in each step, and combining all the 1-packet schemes into the optimal 1-solution scheme;
s9, generating a solution by utilizing S3, S4, S5, S6, S7 and S8 for adjusting parameters;
and S10, outputting an optimal 1-solution scheme, and drawing a visual display diagram of the cutting scheme.
2. The method for improving the glass cutting utilization rate according to claim 1, wherein the method comprises the following steps: the data collected in step S1 includes the dimensional data of the target glass sheet, the dimensions of the glass original sheet, and the defect data.
3. The method for improving the glass cutting utilization rate according to claim 1, wherein the method comprises the following steps: the constraint conditions to be met in the step S3 include defects, glass original sheets, minimum height, minimum width and the sequence of target glass sheets in the stack, the typesetting of the item is generated according to the constraint conditions, and a cutting mode based on a decision tree is adopted, so that the usability and the efficiency of the algorithm are improved.
4. The method for improving the glass cutting utilization rate according to claim 1, wherein the method comprises the following steps: and in the step S5, typesetting the item continuously until the item cannot be continued, generating a 1-cut scheme, and evaluating the quality of the 1-cut by adopting the ratio of the total area of the item in the 1-cut scheme to the area of the used glass original sheet.
5. The method for improving the glass cutting utilization rate according to claim 1, wherein the method comprises the following steps: and S6, sequentially generating 1-cut schemes until the 1-cut cannot be generated, generating the 1-plate scheme, and optimizing the last two 1-cut schemes by adopting the proportion of the total area of items used in the last two 1-cut schemes to the total area from the left section to the right end of the glass original sheet in the 1-cut scheme.
6. The method for improving the glass cutting utilization rate according to claim 1, wherein the method comprises the following steps: and step S8, sequentially generating 1-plate schemes, selecting the optimal 1-plate scheme of each step according to the minimum total area of the items in the 1-plate until all the items are typeset, generating the 1-solution scheme, evaluating the quality of the scheme by adopting the ratio of the total area of the items in the 1-solution scheme to the area of the used glass original sheet, and selecting the optimal 1-solution scheme.
CN202110370750.8A 2021-04-07 2021-04-07 Method for improving glass cutting utilization rate Active CN113222212B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110370750.8A CN113222212B (en) 2021-04-07 2021-04-07 Method for improving glass cutting utilization rate

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110370750.8A CN113222212B (en) 2021-04-07 2021-04-07 Method for improving glass cutting utilization rate

Publications (2)

Publication Number Publication Date
CN113222212A true CN113222212A (en) 2021-08-06
CN113222212B CN113222212B (en) 2023-04-07

Family

ID=77086470

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110370750.8A Active CN113222212B (en) 2021-04-07 2021-04-07 Method for improving glass cutting utilization rate

Country Status (1)

Country Link
CN (1) CN113222212B (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114133135A (en) * 2021-12-08 2022-03-04 中国建材国际工程集团有限公司 Online glass cutting production line

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20140094948A1 (en) * 2011-05-27 2014-04-03 Saint-Gobain Glass France Process for cutting one or more glazings
CN104995572A (en) * 2013-02-22 2015-10-21 法国圣戈班玻璃厂 Method for cutting one or more glass sheets
CN111311004A (en) * 2020-02-21 2020-06-19 广东工业大学 Layered iterative layout optimization method considering cutting efficiency and utilization rate
CN111410414A (en) * 2020-04-27 2020-07-14 江西财经大学 Implementation method of glass cutting optimization technology
US20210053861A1 (en) * 2017-12-21 2021-02-25 Saint-Gobain Glass France A method and a device for generating a sequence of cutting plans for cutting out a sequence of glass pieces in a sequence of glass sheets

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20140094948A1 (en) * 2011-05-27 2014-04-03 Saint-Gobain Glass France Process for cutting one or more glazings
CN104995572A (en) * 2013-02-22 2015-10-21 法国圣戈班玻璃厂 Method for cutting one or more glass sheets
US20210053861A1 (en) * 2017-12-21 2021-02-25 Saint-Gobain Glass France A method and a device for generating a sequence of cutting plans for cutting out a sequence of glass pieces in a sequence of glass sheets
CN111311004A (en) * 2020-02-21 2020-06-19 广东工业大学 Layered iterative layout optimization method considering cutting efficiency and utilization rate
CN111410414A (en) * 2020-04-27 2020-07-14 江西财经大学 Implementation method of glass cutting optimization technology

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
熊慧等: "基于贪心启发式算法的多目标二维切割问题", 《电子技术与软件工程》 *
王聪聪等: "基于改进遗传算法的浮法玻璃优化切割", 《计算机工程与应用》 *

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114133135A (en) * 2021-12-08 2022-03-04 中国建材国际工程集团有限公司 Online glass cutting production line

Also Published As

Publication number Publication date
CN113222212B (en) 2023-04-07

Similar Documents

Publication Publication Date Title
CN107590603B (en) Based on the dispatching method and system for improving change neighborhood search and differential evolution algorithm
CN102592031B (en) Automatic stock layout method of insulated paper board
CN105389713A (en) Mobile data traffic package recommendation algorithm based on user historical data
CN113222212B (en) Method for improving glass cutting utilization rate
CN109765862B (en) Mixed flow workshop sustainable scheduling control method based on adaptive genetic algorithm
CN111410414B (en) Implementation method of glass cutting optimization technology
CN111311004B (en) Layered iterative layout optimization method considering cutting efficiency and utilization rate
CN103823928B (en) 3 D-printing part based on scanning biasing supports automatic generation method
CN108803621A (en) A kind of steel rail welding line reconditioning robot path planning method
Yu et al. A practical computer-aided approach to mould design for axisymmetric forging die cavities
CN111710022B (en) Rapid forming slice processing method for avoiding contour intersection
CN102663128B (en) Recommending system of large-scale collaborative filtering
CN103353916B (en) Composite Laminated Panel based on engineering optimizes post-processing approach
CN106662858A (en) PCB drilling path configuration method
Jia et al. A decomposition-based hierarchical optimization algorithm for hot rolling batch scheduling problem
CN111290283A (en) Additive manufacturing single machine scheduling method for selective laser melting process
CN111462119B (en) Wide-thick plate shearing and layout method based on machine vision
CN105427374A (en) 3D (Three-dimensional) printing-oriented model decomposition and arrangement method
CN106156803A (en) A kind of lazy traditional decision-tree based on Hellinger distance
CN116933932A (en) Two-dimensional rectangular plate layout optimization method
CN105808840A (en) Integrated optimization method giving consideration to cutting rate of raw glass sheets and loading rate of tempered furnace
CN115796972B (en) BIM technology-based quantitative price fusion implementation method
CN108629509B (en) Production scheduling method and system for steel parallel continuous casting machine for high-speed rail axle
CN114936706A (en) Two-dimensional stock layout method for metal plates
JP3039348B2 (en) Production planning method and board removal method

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