EP3510502A1 - Procede et dispositif d'optimisation d'un plan de decoupe par guillotine de pieces de verre - Google Patents
Procede et dispositif d'optimisation d'un plan de decoupe par guillotine de pieces de verreInfo
- Publication number
- EP3510502A1 EP3510502A1 EP17771817.8A EP17771817A EP3510502A1 EP 3510502 A1 EP3510502 A1 EP 3510502A1 EP 17771817 A EP17771817 A EP 17771817A EP 3510502 A1 EP3510502 A1 EP 3510502A1
- Authority
- EP
- European Patent Office
- Prior art keywords
- cutting
- node
- tree
- cutting plane
- pieces
- 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.)
- Pending
Links
- 238000005520 cutting process Methods 0.000 title claims abstract description 222
- 238000000034 method Methods 0.000 title claims abstract description 74
- 239000011521 glass Substances 0.000 title claims abstract description 35
- 239000004148 curcumin Substances 0.000 claims abstract description 3
- 238000005457 optimization Methods 0.000 claims description 23
- 238000004590 computer program Methods 0.000 claims description 6
- GZPBVLUEICLBOA-UHFFFAOYSA-N 4-(dimethylamino)-3,5-dimethylphenol Chemical compound CN(C)C1=C(C)C=C(O)C=C1C GZPBVLUEICLBOA-UHFFFAOYSA-N 0.000 claims description 4
- 101001126226 Homo sapiens Polyisoprenoid diphosphate/phosphate phosphohydrolase PLPP6 Proteins 0.000 description 18
- 101000609849 Homo sapiens [Pyruvate dehydrogenase [acetyl-transferring]]-phosphatase 1, mitochondrial Proteins 0.000 description 18
- 102100039169 [Pyruvate dehydrogenase [acetyl-transferring]]-phosphatase 1, mitochondrial Human genes 0.000 description 18
- 101100409157 Mus musculus Prl2c2 gene Proteins 0.000 description 10
- 101100189635 Arabidopsis thaliana PDP4 gene Proteins 0.000 description 6
- 101100409158 Mus musculus Prl2c3 gene Proteins 0.000 description 6
- 101000609860 Homo sapiens [Pyruvate dehydrogenase [acetyl-transferring]]-phosphatase 2, mitochondrial Proteins 0.000 description 5
- 102100039167 [Pyruvate dehydrogenase [acetyl-transferring]]-phosphatase 2, mitochondrial Human genes 0.000 description 5
- 101000600772 Homo sapiens Pyruvate dehydrogenase phosphatase regulatory subunit, mitochondrial Proteins 0.000 description 3
- 102100037284 Pyruvate dehydrogenase phosphatase regulatory subunit, mitochondrial Human genes 0.000 description 3
- 230000006870 function Effects 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 230000000717 retained effect Effects 0.000 description 2
- 230000003247 decreasing effect Effects 0.000 description 1
- 230000012447 hatching Effects 0.000 description 1
- 238000004377 microelectronic Methods 0.000 description 1
- 229920001510 poly[2-(diisopropylamino)ethyl methacrylate] polymer Polymers 0.000 description 1
- 239000004323 potassium nitrate Substances 0.000 description 1
- 230000001902 propagating effect Effects 0.000 description 1
- 238000013138 pruning Methods 0.000 description 1
- 239000004317 sodium nitrate Substances 0.000 description 1
- 238000011144 upstream manufacturing Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G05—CONTROLLING; REGULATING
- G05B—CONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS
- G05B19/00—Programme-control systems
- G05B19/02—Programme-control systems electric
- G05B19/18—Numerical control [NC], i.e. automatically operating machines, in particular machine tools, e.g. in a manufacturing environment, so as to execute positioning, movement or co-ordinated operations by means of programme data in numerical form
- G05B19/182—Numerical control [NC], i.e. automatically operating machines, in particular machine tools, e.g. in a manufacturing environment, so as to execute positioning, movement or co-ordinated operations by means of programme data in numerical form characterised by the machine tool function, e.g. thread cutting, cam making, tool direction control
-
- C—CHEMISTRY; METALLURGY
- C03—GLASS; MINERAL OR SLAG WOOL
- C03B—MANUFACTURE, SHAPING, OR SUPPLEMENTARY PROCESSES
- C03B33/00—Severing cooled glass
- C03B33/02—Cutting or splitting sheet glass or ribbons; Apparatus or machines therefor
- C03B33/023—Cutting or splitting sheet glass or ribbons; Apparatus or machines therefor the sheet or ribbon being in a horizontal position
- C03B33/037—Controlling or regulating
-
- C—CHEMISTRY; METALLURGY
- C03—GLASS; MINERAL OR SLAG WOOL
- C03B—MANUFACTURE, SHAPING, OR SUPPLEMENTARY PROCESSES
- C03B33/00—Severing cooled glass
- C03B33/10—Glass-cutting tools, e.g. scoring tools
-
- G—PHYSICS
- G05—CONTROLLING; REGULATING
- G05B—CONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS
- G05B19/00—Programme-control systems
- G05B19/02—Programme-control systems electric
- G05B19/18—Numerical control [NC], i.e. automatically operating machines, in particular machine tools, e.g. in a manufacturing environment, so as to execute positioning, movement or co-ordinated operations by means of programme data in numerical form
- G05B19/402—Numerical control [NC], i.e. automatically operating machines, in particular machine tools, e.g. in a manufacturing environment, so as to execute positioning, movement or co-ordinated operations by means of programme data in numerical form characterised by control arrangements for positioning, e.g. centring a tool relative to a hole in the workpiece, additional detection means to correct position
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION 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/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
- G06Q10/043—Optimisation of two dimensional placement, e.g. cutting of clothes or wood
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION 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/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
- G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION 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/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/04—Manufacturing
-
- G—PHYSICS
- G05—CONTROLLING; REGULATING
- G05B—CONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS
- G05B2219/00—Program-control systems
- G05B2219/30—Nc systems
- G05B2219/36—Nc in input of data, input key till input tape
- G05B2219/36086—Select, modify machining, cutting conditions
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2119/00—Details relating to the type or aim of the analysis or the optimisation
- G06F2119/18—Manufacturability analysis or optimisation for manufacturability
-
- 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/02—Total factory control, e.g. smart factories, flexible manufacturing systems [FMS] or integrated manufacturing systems [IMS]
-
- 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
Definitions
- the present invention is in the field of glass cutting processes and is more specifically a method and a device for optimizing such cuts.
- the method and the method according to the invention make it possible in particular to reduce the glass losses during the creation of cutting lots in the factory.
- a guillotine cutting plane of a batch of rectangular glass pieces must take into account the fact that the pieces are intended to be stacked on one or more trestles, in a predetermined sequence specific to each bridge.
- the invention relates to a method and a device for determining a cutting plane that does not have the aforementioned drawbacks. More specifically, and according to a first aspect, the invention relates to a computer implemented method for determining an optimized plan for guillotine cutting of a batch of rectangular glass pieces in at least one glass tray, the parts being intended , after cutting, to be stacked on one or more trestles, the pieces of an easel to be placed on a cutting tray in a predetermined sequence for this trestle, said method comprising:
- the invention finds a preferred application when the parts are intended to be stacked on at least two trestles, with a predefined sequence for each bridge.
- the invention also finds a preferred application when at least two glass trays are used.
- the invention is a method for designing a large number of complete cutting plans, including for complex batches.
- the method is remarkable in that it progressively builds a tree of the partial cutting planes by placing the pieces one by one in compliance with the constraints.
- the parts of the partial and complete cutting planes have the dimensions of the parts intended to be effectively stacked on the trestles; each complete cutting plan includes exactly the number of pieces intended for all the trestles.
- the root is the 1st level of the tree, the son of the root the 2nd level of the tree, the son of the son the 3rd level of the tree, etc.
- This method has the further advantage that it can easily be parallelized.
- the method greatly facilitates the task of the operator consisting essentially of entering the constraints and the optimization criterion.
- This optimization criterion may aim at minimizing a total area of loss generated by cutting.
- the operator can define another optimization criterion, for example to minimize the number of glass trays used.
- the cutting constraints can be chosen from:
- a minimum width of the falls for example greater than twice the thickness of the plate
- a direction of the first break for example in the direction of the width of the tray, or the maximum width of a cutting level for example three meters, due to handling constraints.
- the positioning constraints can be chosen from the orientation of the pieces in a plate, the relative position of the pieces of the same plate according to their level, the maximum number of said at least one glass plate. .
- a node of the tree has a maximum of 9 m son, where m is the number of trestles.
- the creation of the tree comprises:
- each iteration comprising:
- a step of creating at least one child node of said current node the cutting plane associated with said child node being obtained by adding to the partial cutting plane associated with said current node, and subject to the constraints, the next piece of a bridge taken according to the predetermined sequence of this bridge.
- This variant is remarkable in that it comprises, at each iteration, a step of selecting the current node whose son are created according to the characteristics of the partial cutting plane represented by this node.
- the method includes a step of stopping the iterations if the duration of execution of the method is greater than a predefined duration so as to allow the operator to take cognizance of the an optimized solution or a good solution within a reasonable time.
- the method allows the user to know the best solution at any time while letting the process run to possibly discover better solutions.
- the current node is selected:
- a first criterion called “minimum drop criterion” of selecting the node associated with the cutting plane for which the ratio of loss area / useful area is minimal; or - according to a second criterion called “maximum surface criterion” of selecting the node associated with the cutting plane for which the useful surface is the largest.
- This strategy of exploration of the tree in other words the selection of the current node consists in alternating between the two criteria “minimum fall” and “maximum area”.
- the criterion "minimum drop criterion" can be used during a defined period of time or during a predetermined number of iterations or until reaching a computer RAM occupancy rate (about 2 million open nodes).
- the sheet associated with the complete cutting plane maximizing the optimization criterion is stored, the other sheets being deleted.
- the first sheet obtained is stored, and when a new sheet is obtained, only the sheet associated with the best complete cutting plane is stored in memory.
- the method comprises a step of removing the nodes of the tree associated with partial cutting planes for which the area of the acquired falls is greater than the area of loss of a complete cutting plane associated with a said sheet.
- This embodiment can advantageously be combined with the previously described embodiment in which the "minimum fall criterion" and “maximum surface criterion” are alternated.
- a pruning operation is done on all the current nodes in order to try to remove non-promising nodes which will not lead to a better complete cutting plan. This is done by comparing the geometric loss of a node not yet explored to that of the best solution obtained so far; in other words if the loss of a node is greater than the loss of the best solution, we delete this node). This reduces the number of remaining nodes to explore and thus free up memory.
- This criterion is also applied for a certain time or during a number of predefined iterations, then the "minimum fall" criterion is reapplied again in order to create new promising nodes.
- the procedure consists of alternating between these two criteria, that is to say alternating between the creation of promising new nodes and the obtaining of new and improved solutions that allow the removal of the least promising nodes.
- This notion of "acquired falls" is recalled with other notions with reference to FIG. 7 representing a partial cutting plan PDP.
- This particular embodiment makes it possible to prune the tree and to considerably reduce the duration of execution of the process.
- the optimization method according to the invention avoids or minimizes the creation in the tree of nodes corresponding to isomorphous partial cutting planes, namely cutting planes comprising the same parts and presenting the same surface of acquired falls.
- the partial cutting planes PDPA and PDBP of FIG. 9 are isomorphous.
- said positioning constraints comprise at least one lexicographic constraint on a number of said easels to avoid or minimize the creation of nodes corresponding to isomorphous partial cutting planes.
- the positioning constraints may include two lexicographic rules according to which:
- the easel number of this last piece must be less than the easel number of the previous piece; - If you place the last piece to the right of the previous one, the easel number of this last piece must be greater than or equal to the easel number of the previous piece.
- the node is classified according to at least one characteristic of the cutting plane represented by this node, this or these characteristic (s) being sufficient to select the complete cutting plane. optimized.
- This characteristic is preferably the characteristic used during said step of selecting the current node of the shaft in the optimized variant embodiment.
- This embodiment avoids having to re-browse the entire shaft to select the optimized complete cutting plane and to select the current node in the optimized embodiment variant.
- the other nodes of the tree are represented in memory by the bridge number of the last piece placed, and the direction in which it was laid.
- This embodiment allows a minimum memory footprint.
- the invention also relates to a device for determining an optimized plan for guillotine cutting of a batch of rectangular glass pieces in at least one glass plate, the parts being intended, after cutting, to be stacked on at least one easel, the pieces of an easel to be placed on a cutting tray in a predetermined sequence for this bridge, said device comprising:
- a module for creating a tree comprising a root, sheets each representing a complete cutting plane for cutting all the pieces of the batch, each other node of the tree representing a partial cutting plane, the associated cutting plane; at a node of the tree being obtained by adding to the partial cutting plane associated with the father node of this node, under the respect of the constraints, the next piece of an easel determined according to the predetermined sequence of this easel; and
- a module for selecting a complete cutting plane associated with a leaf of the tree according to said optimization criterion a module for selecting a complete cutting plane associated with a leaf of the tree according to said optimization criterion.
- the cutting planes obtained by the process according to the invention can in particular be used:
- the cut when cutting itself, the cut consisting mainly of propagating cracks on the glass, in an order respecting the cutting plane;
- the invention is also directed to a method of guillotine cutting of a batch of rectangular glass pieces in at least one glass tray, characterized in that it comprises:
- the batch is itself determined by the implementation of a method of determining an optimized cutting plane as described above.
- the various steps of the method for determining an optimized cutting plane according to the invention are determined by computer program instructions.
- the invention also relates to a computer program, on an information medium, this program including instructions adapted to the implementation of the steps of a method for determining an optimized cutting plane according to the invention. invention.
- This program can use any programming language, and be in the form of source code, object code, or intermediate code between source code and object code, such as in a partially compiled form, or in any other form desirable shape.
- the invention also relates to a computer-readable information medium, comprising instructions of a computer program as mentioned above.
- the information carrier may be any entity or device capable of storing the program.
- the medium may comprise storage means, such as a ROM, for example a CD ROM or a microelectronic circuit ROM, or a magnetic recording means, for example a hard disk.
- the information medium may be a transmissible medium such as an electrical or optical signal, which may be conveyed via an electrical or optical cable, by radio or by other means.
- the program according to the invention can be downloaded in particular on an Internet type network.
- the information carrier may be an integrated circuit in which the program is incorporated, the circuit being adapted to execute or to be used in the execution of the method in question.
- FIGS. 2A and 2B show complete cutting planes for cutting all the pieces of the trestles of FIG.
- FIG. 3 represents, in flowchart form, the main steps of a determination method according to a first particular embodiment of the invention.
- FIG. 4 shows partial cutting planes obtainable by the invention
- FIG. 5 represents, in flowchart form, the main steps of a determination method according to a second particular embodiment of the invention.
- FIG. 6 represents, in flowchart form, the main steps of an optimization function implemented by the determination method of FIG. 5;
- FIG. 8 represents a buffer memory for storing the nodes associated with the partial cutting planes in a particular embodiment of the invention
- FIG. 9 already described represents isomorphous partial cutting planes.
- Figure 10 schematically shows the hardware architecture of a determination device according to a particular embodiment of the invention.
- This method can be implemented by the determination device 100 according to the invention shown in FIG. 10.
- This device presents the hardware architecture of a computer. It comprises, in particular, a processor 101, a ROM-type ROM 102, a RAM-type random access memory 103, a keyboard 104, a screen 105 and a hard disk 106.
- the ROM-type memory 102 constitutes a medium within the meaning of the invention. It comprises a PG computer program comprising instructions for carrying out the steps of the method for determining an optimized cutting plane according to the invention.
- the program PG contains instructions to allow the execution of the steps shown in FIG. This program makes it possible to determine an optimized plan for guillotine cutting of pieces P22 to P22 in at least one glass plate.
- This program includes a module enabling the operator to provide the device 100 with the keyboard or by any other means the cutting constraints and positioning constraints of the parts and an optimization criterion.
- This data can be stored on the hard disk 106.
- This program also includes a module for creating a tree comprising a root, sheets each representing a complete cutting plane for cutting all the pieces of the batch, each other node of the tree representing a partial cutting plane, the plan cutter associated with a node of the tree being obtained by adding to the partial cutting plane associated with the father node of this node, under the respect of said constraints, the next piece of a said bridge determined according to the predetermined sequence of this bridge.
- the nodes of the tree are stored in the random access memory 103.
- the program PG also includes a module for selecting a complete cutting plane associated with a leaf of the tree according to the optimization criterion stored in the hard disk 106.
- the open nodes otherwise known as the nodes representing the partial cutting planes whose extension has not been studied by a part, are stored in a RAM buffer.
- the buffer memory is organized in the form of a two-input array T in which:
- the lines make it possible to classify the nodes according to the percentage of loss area of the associated cutting plane
- the columns make it possible to classify the nodes according to the percentage of useful area of the associated cutting plane.
- the table has 20 rows and 20 columns, in other words a step of 5%.
- the value of this step is configurable and can be different for rows and columns.
- a node associated with a partial cutting plane having 91% of useful area and 6% of loss area will be stored in the box T1.
- This table is updated each time a node is created.
- each open node is characterized by:
- a closed node is represented in memory by the easel number of the last piece placed, and the direction in which it was laid.
- FIGS. 2A and 2B show two permissible cutting planes PD1, PD2, namely (FIG.2A) a first cutting plane PD1 in which all the parts are placed on the same plate PLF1, and a second cutting plane PD2 in which the pieces are placed on two trays PLF2, PLF3.
- FIGS. 2A and 2B show two permissible cutting planes PD1, PD2, namely (FIG.2A) a first cutting plane PD1 in which all the parts are placed on the same plate PLF1, and a second cutting plane PD2 in which the pieces are placed on two trays PLF2, PLF3.
- the cutting plane PD1 of FIG. 2A is preferred to the cutting plane PD2 of FIG. 2B because it minimizes the area of the generated falls represented in hatched lines.
- FIG. 3 represents the main steps of a glass cutting optimization method according to a first embodiment of the invention.
- the method comprises a step E5 for defining cutting constraints and positioning constraints of said parts and an optimization criterion. This step is used to initialize the process with:
- the initialization step E10 is followed by a step E10 of creating the first stage L1 of the tree T of the cutting planes.
- the complete cutting planes are represented by the leaves of the tree, the fathers nodes of a sheet representing a complete cutting plane representing the partial cutting planes PDP making it possible to reach this plane complete cutting.
- each node (son) is obtained from the previous node (father) by adding to the partial cutting plane represented by this father, an additional piece in the respect of the positioning and cutting constraints.
- the set of partial plans eligible for the first stage L1 of the shaft T is constituted by the set of partial planes that can be obtained by placing the first piece of each of the trestles Cl, or C2, namely the piece Ply or the piece P21, in a corner of a glass tray.
- four partial cutting planes PDP1 to PDP4 are thus obtained according to whether the Piece Piece or the Piece Piece Piece is placed and whether this piece is placed horizontally or vertically.
- each of these partial cutting planes (shown in dashed lines) comprises only a glass plate PLF1 (shown in solid line).
- step E35 the wires of each of the nodes of the stage L1 are created, these nodes constituting a stage L2 of the tree T.
- the PDPl / i partial cutting planes are obtained from the PDPl partial cutting plane:
- the pieces lying above the easels C1 and C2 at the end of the partial cutting plane PDP1 are the piece 12 for the bridge C1 and the piece 21 for the bridge C2.
- the admissible cutting planes that can be obtained from the partial plan PDP1 by placing part 12 or part 21 are:
- the PDP1 / 12 cutting plane obtained by creating a new PLF2 plate comprising the piece 21 in the vertical position.
- the stage L2 also comprises:
- the method according to this first embodiment comprises a step E100 during which is selected from all the sheets of the shaft T the complete cutting plane which minimizes the area of falls.
- This cutting plane optimizes the cutting of glass trays to form the easels Cl and C2.
- the computation time required to create the complete T-tree according to the first embodiment of the invention may be excessively long.
- the total duration of execution of the method is limited and the creation of all the nodes of the tree is omitted by selecting at each iteration, among the nodes of the tree already created, a current node representing a promising partial cutting plane whose son are created.
- This method can be implemented by the determination device 100 according to the invention shown in FIG. 10, but in this example, the program PG contains instructions for enabling the steps shown in FIG.
- each open node is further characterized by:
- the method comprises two selection criteria for selecting this promising partial cutting plan, namely:
- minimum drop criterion of selecting among all partial cutting planes already created one for which the ratio of loss area / useful area is minimal;
- maximum surface criterion of selecting among all partial cutting planes already created one for which the useful surface is the largest.
- the selection criterion is initialized to the "minimum fall criterion".
- a time counter is initialized to 0.
- each iteration comprises a general step E25 during which it is checked whether it is necessary to change selection criteria.
- This step is described with reference to FIG. 6 in a particular embodiment of the invention.
- a value TMAX is initialized according to the current selection criterion.
- TMAX is equal to 10s
- TMAX is "maximum surface criterion”
- step E252 it is checked whether the time counter t initialized in step E20 is greater than this duration TMAX. If this is not the case, the general step E25 ends without changing the selection criteria or resetting the time counter t.
- step E253 If the time counter is greater than the duration TMAX, it is determined in step E253 which selection criterion to use for the selection of the next node whose son will be created. In the embodiment described here:
- the criterion "maximum area criterion” is retained (step E254) if the current criterion is the criterion "minimum fall criterion” or if the number of nodes of the tree T is greater than an NMAX value predefined.
- an overall variable nb_noeuds is used which stores, in the random access memory 103, the number of nodes of the tree T, this variable having, in this example, the value 4 at the end of the step E10 of creating the first stage L1;
- step E255 the criterion "minimum fall criterion" is retained (step E255) in the other cases.
- the time counter t is reset to 0 during a step E256 and the general criterion change step E25 ends.
- step E30 one of the nodes of the tree already created is selected from a current node according to the selection criterion selected in step E25:
- the selection criterion is "minimum fall criterion"
- the node of the tree representing the cutting plane for which the loss area / useful area ratio is minimal is selected.
- the selection criterion is "maximum surface criterion"
- the node of the tree representing the cutting plane for which the useful surface area is the largest is selected. In the particular embodiment of FIG. 8, this amounts to selecting a node stored in a box on the far right of the table. If several possibilities exist, one chooses a node in a highest box (percentage of minimum loss area).
- the threads of the current node are created. This step is identical to the step E35 described with reference to FIG. 3. During this same step, the attributes of each of the nodes created are calculated and stored and the variable nb_noeuds representative of the number of nodes of the node is updated. the tree.
- step E40 the current node is deleted.
- step E45 it is checked whether one or more nodes created in step E35 are leaves of the tree, that is to say if they contain all the pieces of the trestles.
- step E50 the sheet associated with the complete cutting plane corresponding to the best solution obtained so far, that is to say in this example minimizing the area of falls .
- Other sheets can be deleted. When a first sheet is obtained, this sheet is kept in memory.
- step E55 it is checked whether a sheet obtained in step E35 corresponds to an improved solution, and if this is the case, during step E60, all the elements nodes whose area of acquired falls is greater than the area of loss of this sheet.
- the optimization method comprises a step E65 during which it is verified that the total execution time of the method does not exceed a predefined DMAX duration, for example one hour.
- a predefined DMAX duration for example one hour.
- step E65 If it is determined in step E65 that the duration DMAX has not been reached, the method continues by looping on the step E25 of determining the selection criterion of the next node.
- the optimization method according to the invention avoids or minimizes the creation in the tree T of nodes corresponding to isomorphic partial cutting planes, namely cutting planes comprising the same parts, presenting the same area of acquired falls and the same values for xll, x3, xlr, y2f, y4 and y2c.
- lexicographic rules are added to the positioning constraints. For example, we can add two rules according to which:
- the easel number of this last piece must be greater than or equal to the easel number of the previous piece.
- the preceding K levels 1 comprise less a piece to be arranged on the same easel.
- the pieces of the two preceding levels 1 are respectively ⁇ P1, P21, P22 ⁇ and ⁇ P12, P13 ⁇ ; each of these levels 1 therefore comprises at least one piece of the bridge C1 so that the condition 1 is met;
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Physics & Mathematics (AREA)
- Human Resources & Organizations (AREA)
- Chemical & Material Sciences (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Strategic Management (AREA)
- Economics (AREA)
- Organic Chemistry (AREA)
- Materials Engineering (AREA)
- Manufacturing & Machinery (AREA)
- Tourism & Hospitality (AREA)
- Marketing (AREA)
- General Business, Economics & Management (AREA)
- Human Computer Interaction (AREA)
- Automation & Control Theory (AREA)
- Game Theory and Decision Science (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Entrepreneurship & Innovation (AREA)
- Development Economics (AREA)
- Computer Hardware Design (AREA)
- Evolutionary Computation (AREA)
- Geometry (AREA)
- General Engineering & Computer Science (AREA)
- Primary Health Care (AREA)
- General Health & Medical Sciences (AREA)
- Health & Medical Sciences (AREA)
- Re-Forming, After-Treatment, Cutting And Transporting Of Glass Products (AREA)
- General Factory Administration (AREA)
- Control Of Cutting Processes (AREA)
- Architecture (AREA)
- Software Systems (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
Description
Claims
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
FR1658315A FR3055718A1 (fr) | 2016-09-07 | 2016-09-07 | Procede et dispositif d'optimisation d'un plan de decoupe par guillotine de pieces de verre |
PCT/FR2017/052382 WO2018046861A1 (fr) | 2016-09-07 | 2017-09-07 | Procede et dispositif d'optimisation d'un plan de decoupe par guillotine de pieces de verre |
Publications (1)
Publication Number | Publication Date |
---|---|
EP3510502A1 true EP3510502A1 (fr) | 2019-07-17 |
Family
ID=58162675
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
EP17771817.8A Pending EP3510502A1 (fr) | 2016-09-07 | 2017-09-07 | Procede et dispositif d'optimisation d'un plan de decoupe par guillotine de pieces de verre |
Country Status (10)
Country | Link |
---|---|
US (1) | US11156980B2 (fr) |
EP (1) | EP3510502A1 (fr) |
JP (1) | JP7011648B2 (fr) |
KR (1) | KR102526394B1 (fr) |
CN (1) | CN109891412B (fr) |
BR (1) | BR112019003517A2 (fr) |
FR (1) | FR3055718A1 (fr) |
MX (1) | MX2019002329A (fr) |
RU (1) | RU2752134C2 (fr) |
WO (1) | WO2018046861A1 (fr) |
Families Citing this family (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
FR3075782B1 (fr) * | 2017-12-21 | 2022-07-22 | Saint Gobain | Procede et dispositif de generation d'une sequence de plans de decoupe d'une sequence de pieces de verre dans une sequence de feuilles de verre |
CN109472081B (zh) * | 2018-11-02 | 2021-10-01 | 山东大学 | 基于多约束条件的矩形预制构件的自动排板方法 |
CN111062146B (zh) * | 2019-12-31 | 2023-09-12 | 吴江南玻华东工程玻璃有限公司 | 一种玻璃切割线可掰片验证方法及玻璃切割掰片方法 |
CN112939436A (zh) * | 2021-03-08 | 2021-06-11 | 深圳市瑞驰信息技术有限公司 | 一种浮法玻璃高效切割方法 |
CN113070587B (zh) * | 2021-04-14 | 2021-11-09 | 广东工业大学 | 一种基于2d视觉的激光切割预处理板材废料的方法及系统 |
CN113886982B (zh) * | 2021-09-23 | 2022-09-02 | 中国航空工业集团公司西安飞机设计研究所 | 一种基于Isight优化平台的超静定约束方案寻优方法及装置 |
KR102653903B1 (ko) * | 2024-01-10 | 2024-04-01 | 이지연 | 커팅 머신 및 그 동작 방법 |
Family Cites Families (13)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
GB8721824D0 (en) * | 1987-09-16 | 1987-10-21 | Metal Plant Ltd | Sheet material handling |
FR2648382B1 (fr) * | 1989-06-19 | 1991-09-27 | Albadecor Sa | Unite compacte et ergonomique d'encadrement d'images |
JP3079189B2 (ja) * | 1991-02-06 | 2000-08-21 | 株式会社安川電機 | 板ガラス切断機の板取り方式 |
FR2809512A1 (fr) * | 2000-05-25 | 2001-11-30 | Usinor | Procede pour elaborer un plan de decoupe de produits semi- finis pour obtenir des lots affectes aux commandes d'un carnet de commandes |
AU2003902362A0 (en) * | 2003-05-14 | 2003-05-29 | Outback Software Pty Limited | Arranging components on a sheet |
PL1900695T3 (pl) * | 2006-08-17 | 2012-05-31 | Albat Wirsam Software Ag | Sposób i urządzenie do przycinania płyt ze szkła surowego |
US8151236B2 (en) * | 2008-01-19 | 2012-04-03 | Synopsys, Inc. | Steiner tree based approach for polygon fracturing |
EP2156914A1 (fr) * | 2008-08-19 | 2010-02-24 | Arnout De Lille | Système de contrôle et son procédé de découpage |
JP5828953B2 (ja) * | 2011-04-07 | 2015-12-09 | トモロジック アーベー | カッティングするための制御ルールおよび変数を使用して1つの材料からいくつかの部材をマシンカッティングするための方法、システムおよびコンピュータプログラム |
FR2975687A1 (fr) * | 2011-05-27 | 2012-11-30 | Saint Gobain | Procede de decoupe d'un ou plusieurs vitrages |
EP2621074A1 (fr) * | 2012-01-24 | 2013-07-31 | ABB Research Ltd. | Contrôle prédictive d'un convertisseur électrique avec fonction de coût pour les processeur multicoeurs |
FR3002529B1 (fr) * | 2013-02-22 | 2015-02-20 | Saint Gobain | Procede de decoupe d'un ou plusieurs vitrages |
CN104876429A (zh) * | 2015-04-20 | 2015-09-02 | 广东工业大学 | 一种兼顾玻璃原片下料率与钢化炉装载率的集成优化方法 |
-
2016
- 2016-09-07 FR FR1658315A patent/FR3055718A1/fr active Pending
-
2017
- 2017-09-07 US US16/327,568 patent/US11156980B2/en active Active
- 2017-09-07 BR BR112019003517-6A patent/BR112019003517A2/pt unknown
- 2017-09-07 KR KR1020197009004A patent/KR102526394B1/ko active IP Right Grant
- 2017-09-07 MX MX2019002329A patent/MX2019002329A/es unknown
- 2017-09-07 RU RU2019108785A patent/RU2752134C2/ru active
- 2017-09-07 EP EP17771817.8A patent/EP3510502A1/fr active Pending
- 2017-09-07 JP JP2019510921A patent/JP7011648B2/ja active Active
- 2017-09-07 WO PCT/FR2017/052382 patent/WO2018046861A1/fr unknown
- 2017-09-07 CN CN201780066631.5A patent/CN109891412B/zh active Active
Also Published As
Publication number | Publication date |
---|---|
KR102526394B1 (ko) | 2023-04-28 |
CN109891412B (zh) | 2023-11-28 |
US11156980B2 (en) | 2021-10-26 |
RU2019108785A3 (fr) | 2021-01-26 |
JP2019535053A (ja) | 2019-12-05 |
CN109891412A (zh) | 2019-06-14 |
JP7011648B2 (ja) | 2022-01-26 |
KR20190050796A (ko) | 2019-05-13 |
RU2752134C2 (ru) | 2021-07-23 |
BR112019003517A2 (pt) | 2019-05-21 |
MX2019002329A (es) | 2019-09-26 |
WO2018046861A1 (fr) | 2018-03-15 |
FR3055718A1 (fr) | 2018-03-09 |
US20190227514A1 (en) | 2019-07-25 |
RU2019108785A (ru) | 2020-10-08 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
EP3510502A1 (fr) | Procede et dispositif d'optimisation d'un plan de decoupe par guillotine de pieces de verre | |
EP3471028B1 (fr) | Optimisation d'un circuit quantique par insertion de portes swap | |
WO2014128424A1 (fr) | Procede de decoupe d'un ou plusieurs vitrages | |
FR2658930A1 (fr) | Optimisation de la distribution de puissance reactive dans un reseau d'electricite industriel. | |
FR3076384A1 (fr) | Detection d'anomalies par une approche combinant apprentissage supervise et non-supervise | |
EP2884495B1 (fr) | Procédé de détermination de paramètres électriques servant à programmer une mémoire vive résistive | |
EP2109979B1 (fr) | Procédé et dispositif de gestion de connexions dans un réseau de télécommunications | |
EP3727769A1 (fr) | Procédé et dispositif de génération d'une séquence de plans de découpe d'une séquence de pièces de verre dans une séquence de feuilles de verre | |
FR2958470A1 (fr) | Procede d'estimation de la fiabilite d'un circuit electronique, systeme informatique et produit programme d'ordinateur correspondants | |
WO2014001694A1 (fr) | Procédé et système de simplification d'un maillage d'une scène en trois dimensions | |
EP0855038B1 (fr) | Diagnostic de réseaux de composants, avec modélisation par bandes | |
EP2834761B1 (fr) | Procede de simulation d'auto assemblage de copolymeres a blocs pour la conception d'un circuit imprime, procede de conception, systeme de conception et programme d'ordinateur correspondants | |
EP1272914B1 (fr) | Procede et installation de localisation optimale automatique d'une operation sur un circuit integre | |
WO2002073459A1 (fr) | Procede pour rechercher un objet au sein d'un espace, procede et systeme de cartographie vectorielle integrant ce procede de cartographie vectorielle, et appareil electronique mettant en oeuvre ce procede de cartographie vectorielle | |
EP3857810A1 (fr) | Procédé cryptographique de comparaison sécurisée de deux données secrètes x et y | |
FR3040906B1 (fr) | Procede de realisation d'un plateau en planches | |
WO2022018140A1 (fr) | Procédés d'allocation de qubits logiques d'un algorithme quantique dans un processeur quantique | |
FR3045857A1 (fr) | Procede et dispositif de classement d'un ensemble d'elements informatiques | |
FR3065099A1 (fr) | Dispositif de placement ameliore | |
EP2153359A1 (fr) | Procede de classification d'un ensemble de documents electroniques | |
FR3049213A1 (fr) | Dispositif de traitement de donnees pour la generation de microstructures a elasticite variable par fabrication additive | |
FR3083631A1 (fr) | Procede et dispositif de traitement cryptographique sur une courbe elliptique | |
FR2765367A1 (fr) | Procede de modelisation d'un objet | |
FR3101712A1 (fr) | Procédé et dispositif de contrôle de conformité d’une pièce | |
FR3115906A1 (fr) | Procédé de traitement de données par un réseau de neurones artificiels avec exécutions groupées d’opérations individuelles pour éviter les attaques par canal auxiliaire, et système correspondant |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: UNKNOWN |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: THE INTERNATIONAL PUBLICATION HAS BEEN MADE |
|
PUAI | Public reference made under article 153(3) epc to a published international application that has entered the european phase |
Free format text: ORIGINAL CODE: 0009012 |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: REQUEST FOR EXAMINATION WAS MADE |
|
17P | Request for examination filed |
Effective date: 20190408 |
|
AK | Designated contracting states |
Kind code of ref document: A1 Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR |
|
AX | Request for extension of the european patent |
Extension state: BA ME |
|
DAV | Request for validation of the european patent (deleted) | ||
DAX | Request for extension of the european patent (deleted) | ||
RAP1 | Party data changed (applicant data changed or rights of an application transferred) |
Owner name: SAINT-GOBAIN GLASS FRANCE |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: EXAMINATION IS IN PROGRESS |
|
17Q | First examination report despatched |
Effective date: 20201217 |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: EXAMINATION IS IN PROGRESS |