CN106169106A - A kind of one-dimensional cutting-stock problem optimized algorithm based on uniform ordered search - Google Patents
A kind of one-dimensional cutting-stock problem optimized algorithm based on uniform ordered search Download PDFInfo
- Publication number
- CN106169106A CN106169106A CN201610514557.6A CN201610514557A CN106169106A CN 106169106 A CN106169106 A CN 106169106A CN 201610514557 A CN201610514557 A CN 201610514557A CN 106169106 A CN106169106 A CN 106169106A
- Authority
- CN
- China
- Prior art keywords
- lath
- sheet material
- typesetting
- demand
- width
- 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
- 239000000463 material Substances 0.000 claims abstract description 106
- 238000000034 method Methods 0.000 claims abstract description 20
- 238000005457 optimization Methods 0.000 claims abstract description 5
- 230000002265 prevention Effects 0.000 claims abstract 2
- 230000008520 organization Effects 0.000 claims description 2
- 238000004519 manufacturing process Methods 0.000 abstract description 3
- 238000005520 cutting process Methods 0.000 description 5
- 230000007812 deficiency Effects 0.000 description 3
- 239000002994 raw material Substances 0.000 description 3
- 239000002699 waste material Substances 0.000 description 2
- 230000003247 decreasing effect Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 239000003814 drug Substances 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000007634 remodeling Methods 0.000 description 1
Classifications
-
- 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
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Strategic Management (AREA)
- Economics (AREA)
- Marketing (AREA)
- Game Theory and Decision Science (AREA)
- Entrepreneurship & Innovation (AREA)
- Development Economics (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Manufacture Or Reproduction Of Printing Formes (AREA)
- Preparing Plates And Mask In Photomechanical Process (AREA)
Abstract
The invention discloses a kind of one-dimensional cutting-stock problem optimized algorithm based on uniform ordered search, for solving the problem that in actual production, one-dimensional cutting-stock problem optimizes.The present invention includes: (1) calculates the average total number needing raw sheet material;(2) calculate lath and be evenly distributed in the quantity in every block of sheet material, the situation that prevention utilization rate is uneven;(3) structure lath demand pair, descending;(4) according to the lath demand constructed to arranging, one group of typesetting combination is obtained;(5) by progressively in order scalping method, current permutation and combination of recombinating on the basis of traversal principle, and preserve that utilization rate is more excellent one group.(6) repeat step (5), until meet set search element condition, obtain optimum combination.The present invention is by being evenly distributed typesetting so that global optimization utilization rate is high, and avoids the uneven phenomenon of utilization rate, and production efficiency is improved.
Description
Technical field
The present invention relates to plate cutting optimized algorithm method, be specifically related to the one-dimensional stock-cutting method of sheet material.
Background technology
The one-dimensional cutting-stock problem of sheet material, refers to when raw material and material requested dimension are all one-dimensional, at known order requirements and
How optimizing incision blanking under raw material data so that raw material is fully used as far as possible, cost obtains the planning saved as far as possible
Problem.Traditional one-dimensional cutting-stock problem algorithm there is also a lot of deficiency, and waste is big, and algorithm performs unreasonable, and algorithm performs process efficiency
Low.
Summary of the invention
The technical problem to be solved is for above-mentioned deficiency of the prior art, it is provided that a kind of based on uniform
The one-dimensional cutting-stock problem optimized algorithm of ordered search, its algorithm is with the obvious advantage, it is possible to efficient and rational typesetting.
In order to achieve the above object, the present invention is achieved by the following technical solutions:
A kind of one-dimensional cutting-stock problem optimized algorithm based on uniform ordered search, it comprises the steps of:
(1) structure lath demand pair: according to width of sheet, descending lath demand is to (Hi,Ni,) queue, from queue
Middle rejecting NiIt is the demand pair of zero, recalculates quantity n of demand pair;If n=0, illustrate that this processing tasks is fully completed, knot
Shu Benci processing tasks goes to step (7), otherwise turns next step (2);
(2) judge that width is WsIf sheet material only put wide lath H1, if can just put down.
First sheet material W is calculatedsIn can put wide lath H1Maximum typesetting quantity
IfThen
Then sheet material surplus material width is sought
IfBetween 0-5mm, then the N of centering of upgrading demand1,Front s block sheet material surplus material width sumPreserve current typesetting data, O [1] .H=H1,
This width is WsSheet material typesetting terminate, the 1st group of data of the Array for structural body O [k] deposited that goes bail for, generate processing
G code program, take off a sheet material (s adds 1), go to step (1);
IfMore than 5mm, that is this typesetting is invalid typesetting, turns next step (3);
(3) the s time processing strip width are WsSheet material time, according to lath demand to (Hi,Ni,) queue, computational theory
On need average total number amount M of sheet materials:
Make sheet material WsResidue widthInitial typesetting number of times k=1, takes first group of lath demand to i.e. i=1, under turning
One step (4);
(4) if i is more than n, then i=1.Calculate lath HiAt sheet material WsOn average typesetting quantity
IfThenUpdate i-th group of lath demand to (Hi,Ni,In)Turn next step (5);
(5) s block sheet materials, when kth time typesetting, take i-th group of lath demand to (Hi,Ni,), calculate
IfAt 0-HnBetween (can be by progressively in order scalping method and ergodic algorithm are searched optimum typesetting and combined), the most more
New i-th group of lath demand is to (Hi,Ni,N in)i,Front s block sheet material surplus material width sumProtect
Deposit current typesetting data, O [k] .H=Hi,This width is WsSheet material typesetting terminate, the structure deposited of going bail for
The front k group data of array O [k], generate the G code program of processing, take off a sheet material (s adds 1), go to step (1);
IfLess than 0 andMore than 1, thenSubtract 1, update i-th group of demand to (Hi,Ni,In)After go to step (5);
IfLess than 0 andLess than or equal to 1, this time typesetting is invalid typesetting, then take off one group of lath i=i+1, go to step
(4);
IfMore than Hn, then i-th group of lath demand is updated to (Hi,Ni,N in)i,Reject from queue
NiIt is the demand pair of zero, recalculates quantity n of demand pair.Preserve current typesetting data, O [k] .H=Hi,Turn
Next step (6);
(6) if n more than 0 andAt 0-HnBetween, then this width is WsSheet material typesetting terminate, front s block sheet material residue material
Material width sumGo bail for the front k group data of the Array for structural body O [k] deposited, generate the G code program of processing, take off one
Sheet material (s adds 1), goes to step (1);
If n more than 0 andMore than Hn, then take off one group of lath i=i+1, k=k+1, go to step (4);
If n is equal to 0, current width is WsSheet material typesetting terminate, and all laths machine.Front s block sheet material remains
Material width sumGo bail for the front k group data of the Array for structural body O [k] deposited, generate the G code program of processing, under turning
One step (7);
(7) terminate.
Further: described sheet material is workblank sheet material, it is known that workblank sheet material mean breadth isAnd
Further: described lath is to meet the sheet material of client's width requirement after processing, and lath thickness is the thickness of lath
Degree is added with the thickness of cutting knife.
Further: lath demand is to (Hi,Ni) expression width is HiLath quantity required be Ni(i=1,2 ...,
n);
During s block sheet material typesetting, theoretical demand sheet material average total number amount is Ms, its computing formula is:
Process a width of W the s timesSheet material time, a width of H of lath can be putiPar be
Value principle be: if Ni/MsThere is decimal, then add 1 after round numbers part, otherwise direct round numbers part;IfMore than Ni, thenEqual to Ni, otherwiseValue is carried out by above-mentioned value principle;
Process a width of W the s timesSheet material when kth time typesetting, put intoThe a width of H of blockiLath after, sheet material WsResidue material
Material width is Being the process successively decreased of a circulation, k is the effective of current sheet material
Typesetting number of times;Often add 1 through once effectively typesetting k value, until sheet material surplus material widthUndressed less than current residual
Lath in minimum width of sheet;
Process a width of W the s timesSheet material when kth time typesetting, the maximum quantity that can put into i-th group of lath is
Value beInteger part, ifMore than Ni, thenEqual to Ni;OtherwiseConstant.
The medicine have the advantages that
Algorithm disclosed by the invention is the most efficient, it is possible to efficient and rational typesetting, greatly reduces waste, it is possible to contribute to automatically
Change the realization of typesetting;Its typesetting scheme also more conforms to needs of production, and according to concrete practice, its effect saving material is non-
Chang Hao.
Accompanying drawing explanation
Fig. 1 is that a kind of one-dimensional cutting-stock problem optimized algorithm based on uniform ordered search of the present invention obtains one group of fundamental optimum combination
Flow chart.
Fig. 2 is the description of flow diagram that progressively rejecting is sent out in order used in the present invention.
Detailed description of the invention
Below in conjunction with embodiment, the present invention is further described, and following embodiment is illustrative, is not determinate,
Protection scope of the present invention can not be limited with following embodiment.
A kind of one-dimensional cutting-stock problem optimized algorithm based on uniform ordered search disclosed by the invention following basic principle of employing:
1. start typesetting from the widest lath every time, ranked second successively, the 3rd wide lath, by that analogy.
2. during typesetting, (the sheet material surplus material width that first considers that wide lath is just arranged downBetween 0~5mm)
Typesetting.
3. secondly, the lath of various different in width is evenly distributed in M as far as possiblesIn block sheet material.
Illustrate that the present invention's is embodied as step below in conjunction with the accompanying drawings.
As it is shown in figure 1, for obtaining the step that one group of fundamental optimum combines, idiographic flow is as follows:
(1) structure lath demand pair: according to width of sheet, descending lath demand is to (Hi,Ni,) queue, from queue
Middle rejecting NiIt is the demand pair of zero, recalculates quantity n of demand pair;If n=0, illustrate that this processing tasks is fully completed, knot
Shu Benci processing tasks goes to step (7), otherwise turns next step (2);
(2) judge that width is WsIf sheet material only put wide lath H1, if can just put down.
First sheet material W is calculatedsIn can put wide lath H1Maximum typesetting quantity
IfThen
Then sheet material surplus material width is sought
IfBetween 0-5mm, then the N of centering of upgrading demand1,Front s block sheet material surplus material width sumPreserve current typesetting data, O [1] .H=H1,
This width is WsSheet material typesetting terminate, the 1st group of data of the Array for structural body O [k] deposited that goes bail for, generate processing
G code program, take off a sheet material (s adds 1), go to step (1);
IfMore than 5mm, that is this typesetting is invalid typesetting, turns next step (3);
(3) the s time processing strip width are WsSheet material time, according to lath demand to (Hi,Ni,) queue, computational theory
On need average total number amount M of sheet materials:
Make sheet material WsResidue widthInitial typesetting number of times k=1, takes first group of lath demand to i.e. i=1, under turning
One step (4);
(4) if i is more than n, then i=1.Calculate lath HiAt sheet material WsOn average typesetting quantity
IfThenUpdate i-th group of lath demand to (Hi,Ni,In)Turn next step (5);
(5) s block sheet materials, when kth time typesetting, take i-th group of lath demand to (Hi,Ni,), calculate
IfAt 0-HnBetween (can on the basis of traversal principle by progressively in order scalping method search optimum typesetting group
Close), then update i-th group of lath demand to (Hi,Ni,N in)i,Front s block sheet material surplus material width sumPreserve current typesetting data, O [k] .H=Hi,This width is WsSheet material typesetting terminate, go bail for and deposit
The front k group data of Array for structural body O [k], generate the G code program of processing, take off a sheet material (s adds 1), go to step (1);
IfLess than 0 andMore than 1, thenSubtract 1, update i-th group of demand to (Hi,Ni,In)After go to step (5);
IfLess than 0 andLess than or equal to 1, that is this time typesetting is invalid typesetting, then take off one group of lath i=i+1, turns
Step (4);
IfMore than Hn, then i-th group of lath demand is updated to (Hi,Ni,N in)i,Reject from queue
NiIt is the demand pair of zero, recalculates quantity n of demand pair.Preserve current typesetting data, O [k] .H=Hi,Turn
Next step (6);
(6) if n more than 0 andAt 0-HnBetween, then this width is WsSheet material typesetting terminate, front s block sheet material residue material
Material width sumGo bail for the front k group data of the Array for structural body O [k] deposited, generate the G code program of processing, take off one
Sheet material (s adds 1), goes to step (1);
If n more than 0 andMore than Hn, then take off one group of lath i=i+1, k=k+1, go to step (4);
If n is equal to 0, current width is WsSheet material typesetting terminate, and all laths machine.Front s block sheet material remains
Material width sumGo bail for the front k group data of the Array for structural body O [k] deposited, generate the G code program of processing, under turning
One step (7);
(7) terminate.
As in figure 2 it is shown, be the algorithm flow of the progressively orderly scalping method arrived used herein, specific implementation process is as follows
Shown in:
A () obtains the permutation and combination that current one-dimensional cutting-stock problem optimizes;
B () current permutation and combination is the most only made up of the widest of lath demand centering and strap, if it is optimize
Terminate, obtain optimum combination, otherwise turn next step;
C () judges whether the minimum lath in current permutation and combination is equal to the minimum lath of lath demand centering, if
Then the minimum lath of current permutation and combination is therefrom rejected, after then the second little lath arrangement quantity being reduced one piece, take lath
Next group lath of demand centering arranges, and turns next step;Otherwise the minimum lath of current permutation and combination is therefrom rejected, so
After take lath demand centering next group lath carry out arrangement turn next step;
D () is according to basic principle, re-optimization typesetting, it is thus achieved that one group of new optimum organization, goes to step (a).
Concrete denotational description in above-mentioned detailed description of the invention and in description such as table 1:
Table 1
Makeup Optimization data variation process of the algorithm of the present invention is as shown in table 2:
Table 2 typesetting data change procedure
The most just to algorithm proposed by the invention, the superiority of the present invention is described for an application example.
Assume sheet material mean breadth:Specifically every piece of former strip width only just knows when feeding that it is concrete
Value, cutting knife thickness is 10mm.Existing lath needs processing, and occurrence is as shown in table 3:
Table 3 lath demand pair
Theory demands sheet material average total number amount is:
According to the average total number amount of required raw sheet material, calculate the average typesetting quantity of lath demand pair, take raw sheet successively
Material is optimized typesetting, obtains final cutting data, as shown in table 4 below:
The final process data of table 4 principle of the invention
By examples detailed above, can verify that the Optimum utilization rate of inventive algorithm is the highest, it is possible to be prevented effectively from excellent
Changing the situation that utilization rate is uneven, above example, after the time getting rid of data input, obtains the deficiency of time 1 second of optimum results,
It is quickly that visible its optimizes efficiency.
Above the preferred embodiment for the present invention is explained in detail, but the invention is not restricted to above-mentioned embodiment,
In the ken that those of ordinary skill in the art are possessed, it is also possible to make various on the premise of without departing from present inventive concept
Change, these changes relate to correlation technique well-known to those skilled in the art, and these both fall within the protection model of patent of the present invention
Enclose.
Many other can be made without departing from the spirit and scope of the present invention to change and remodeling.Should be appreciated that the present invention is not
Being limited to specific embodiment, the scope of the present invention is defined by the following claims.
Claims (6)
1. an one-dimensional cutting-stock problem optimized algorithm based on uniform ordered search, it is characterised in that comprise the steps of:
(1) structure lath demand pair: according to width of sheet, descending lath demand is to (Hi, Ni,) queue, from queue
Reject NiIt is the demand pair of zero, recalculates quantity n of demand pair;If n=0, illustrate that this processing tasks is fully completed, terminate
This processing tasks goes to step (7), otherwise turns next step (2);
(2) judge that width is WsIf sheet material only put wide lath H1, if can just put down:
First sheet material W is calculatedsIn can put wide lath H1Maximum typesetting quantity:
=Ws/H1
If>N1, then= N1;
Then sheet material surplus material width is sought:
=Ws-H1
IfBetween 0-5mm, then the N of centering of upgrading demand1, N1=N1-, front s block sheet material surplus material width sum=+, preserve current typesetting data, O [1] .H=H1, O [1] .N=;
This width is WsSheet material typesetting terminate, the 1st group of data of the Array for structural body O [k] deposited that goes bail for, generate processing G generation
Coded program, takes off a sheet material (s adds 1), goes to step (1);
IfMore than 5mm, that is this typesetting is invalid typesetting, turns next step (3);
(3) the s time processing strip width are WsSheet material time, according to lath demand to (Hi, Ni, ) queue, in computational theory
Need average total number amount M of sheet materials:
Make sheet material WsResidue width=Ws, initial typesetting number of times k=1, take first group of lath demand to i.e. i=1, turn next step (4);
(4) if i is more than n, then i=1, lath H is calculatediAt sheet material WsOn average typesetting quantity:
=Ni/Ms
If>Ni, then=Ni, update i-th group of lath demand to (Hi, Ni, In), turn next step (5);
(5) s block sheet materials, when kth time typesetting, take i-th group of lath demand to (Hi, Ni, ), calculate:
IfAt 0-HnBetween (can on the basis of traversal principle by progressively in order scalping method search optimum typesetting and combine),
Then update i-th group of lath demand to (Hi, Ni, N in)i, Ni=Ni-, front s block sheet material surplus material width sum=+, preserve current typesetting data, O [k] .H=Hi, O [k] .N=, this width is WsSheet material typesetting terminate, the knot deposited of going bail for
The front k group data of structure body array O [k], generate the G code program of processing, take off a sheet material (s adds 1), go to step (1);
IfLess than 0 andMore than 1, thenSubtract 1, update i-th group of demand to (Hi, Ni, In)After go to step (5);
IfLess than 0 andLess than or equal to 1, this time typesetting is invalid typesetting, then take off one group of lath i=i+1, go to step (4);
IfMore than Hn, then i-th group of lath demand is updated to (Hi, Ni, N in)i, Ni=Ni-, from queue, reject NiFor
The demand pair of zero, recalculates quantity n of demand pair, preserves current typesetting data, O [k] .H=Hi, O [k] .N=, turn next step
Suddenly (6);
(6) if n more than 0 andAt 0-HnBetween, then this width is WsSheet material typesetting terminate, front s block sheet material surplus material width
Degree sum=+, the front k group data of the Array for structural body O [k] deposited that goes bail for, generate the G code program of processing, take off a sheet material
(s adds 1), go to step (1);
If n more than 0 andMore than Hn, then take off one group of lath i=i+1, k=k+1, go to step (4);
If n is equal to 0, current width is WsSheet material typesetting terminate, and all laths machine, front s block sheet material surplus material width
Degree sum=+, the front k group data of the Array for structural body O [k] deposited that goes bail for, generate the G code program of processing, turn next step
(7);
(7) terminate.
A kind of one-dimensional cutting-stock problem optimized algorithm based on uniform ordered search, it is characterised in that: it is used for
Optimizing the width of sheet calculated is that actual demand width of sheet adds upper cutter thickness.
A kind of one-dimensional cutting-stock problem optimized algorithm based on uniform ordered search, it is characterised in that: lath
Demand is to (Hi, Ni) expression width is HiLath quantity required be Ni(i=1,2 ..., n);
During s block sheet material typesetting, theoretical demand sheet material average total number amount is Ms, its computing formula is:
Process a width of W the s timesSheet material time, a width of H of lath can be putiPar be:
=Ni/Ms
Value principle be: if Ni/MsThere is decimal, then add 1 after round numbers part, otherwise direct round numbers part;IfGreatly
In Ni, thenEqual to Ni, otherwiseValue is carried out by above-mentioned value principle.
A kind of one-dimensional cutting-stock problem optimized algorithm based on uniform ordered search, it is characterised in that: can put
The a width of H of lathiPar be, lath is evenly distributed in every block of raw sheet material and cuts, prevention utilization rate distribution
Uneven.
A kind of one-dimensional cutting-stock problem optimized algorithm based on uniform ordered search, it is characterised in that: time
Combined by the typesetting that progressively scalping method lookup is optimum in order on the basis of going through principle.
A kind of one-dimensional cutting-stock problem optimized algorithm based on uniform ordered search, it is characterised in that: progressively
In order in scalping method, if the minimum width of sheet in current optimum organization is equal to the minimum lath H in lath demand queuen, then
Last two groups of laths of this permutation and combination are rejected, takes next group of lath demand centering and carry out new one and take turns optimization;Otherwise will
Last 1 group of lath of this permutation and combination is rejected, and takes next group of lath demand centering and carries out new one and take turns optimization.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201610514557.6A CN106169106B (en) | 2016-07-01 | 2016-07-01 | One-dimensional blanking optimization algorithm based on uniform distribution ordered search |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201610514557.6A CN106169106B (en) | 2016-07-01 | 2016-07-01 | One-dimensional blanking optimization algorithm based on uniform distribution ordered search |
Publications (2)
Publication Number | Publication Date |
---|---|
CN106169106A true CN106169106A (en) | 2016-11-30 |
CN106169106B CN106169106B (en) | 2020-04-07 |
Family
ID=58065974
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201610514557.6A Active CN106169106B (en) | 2016-07-01 | 2016-07-01 | One-dimensional blanking optimization algorithm based on uniform distribution ordered search |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN106169106B (en) |
Cited By (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN108764521A (en) * | 2018-04-13 | 2018-11-06 | 云南黑软科技有限公司 | Improve the keyline layout method of paper use rate |
CN111507527A (en) * | 2020-04-17 | 2020-08-07 | 无锡雪浪数制科技有限公司 | Furniture blanking typesetting optimization method considering raw material diversity and uncertainty |
CN114049060A (en) * | 2021-10-15 | 2022-02-15 | 北京首钢自动化信息技术有限公司 | Material management and control method and device for production line |
Citations (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20050012961A1 (en) * | 2003-05-14 | 2005-01-20 | Holt Rohan John | Arranging components on a sheet |
CN1627301A (en) * | 2003-12-13 | 2005-06-15 | 鸿富锦精密工业(深圳)有限公司 | Automatic typesetting system and method |
US7277768B2 (en) * | 2004-11-05 | 2007-10-02 | International Business Machines Corporation | Method for production design and operations scheduling for plate design in the steel industry |
CN102592031A (en) * | 2012-03-02 | 2012-07-18 | 华中科技大学 | Automatic stock layout method of insulated paper board |
CN103500255A (en) * | 2013-10-16 | 2014-01-08 | 南通大学 | Intelligent layout method used for rectangular part |
CN104008145A (en) * | 2014-05-09 | 2014-08-27 | 刘强 | Rectangular part stock layout method based on grouping technology |
CN104820867A (en) * | 2015-04-20 | 2015-08-05 | 广东工业大学 | Multi-specification plate-oriented rectangular part layout method |
-
2016
- 2016-07-01 CN CN201610514557.6A patent/CN106169106B/en active Active
Patent Citations (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20050012961A1 (en) * | 2003-05-14 | 2005-01-20 | Holt Rohan John | Arranging components on a sheet |
CN1627301A (en) * | 2003-12-13 | 2005-06-15 | 鸿富锦精密工业(深圳)有限公司 | Automatic typesetting system and method |
US7277768B2 (en) * | 2004-11-05 | 2007-10-02 | International Business Machines Corporation | Method for production design and operations scheduling for plate design in the steel industry |
CN102592031A (en) * | 2012-03-02 | 2012-07-18 | 华中科技大学 | Automatic stock layout method of insulated paper board |
CN103500255A (en) * | 2013-10-16 | 2014-01-08 | 南通大学 | Intelligent layout method used for rectangular part |
CN104008145A (en) * | 2014-05-09 | 2014-08-27 | 刘强 | Rectangular part stock layout method based on grouping technology |
CN104820867A (en) * | 2015-04-20 | 2015-08-05 | 广东工业大学 | Multi-specification plate-oriented rectangular part layout method |
Cited By (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN108764521A (en) * | 2018-04-13 | 2018-11-06 | 云南黑软科技有限公司 | Improve the keyline layout method of paper use rate |
CN108764521B (en) * | 2018-04-13 | 2022-04-01 | 云南黑软科技有限公司 | Imposition method for improving paper utilization rate |
CN111507527A (en) * | 2020-04-17 | 2020-08-07 | 无锡雪浪数制科技有限公司 | Furniture blanking typesetting optimization method considering raw material diversity and uncertainty |
CN114049060A (en) * | 2021-10-15 | 2022-02-15 | 北京首钢自动化信息技术有限公司 | Material management and control method and device for production line |
Also Published As
Publication number | Publication date |
---|---|
CN106169106B (en) | 2020-04-07 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Accad et al. | S and P states of the helium isoelectronic sequence up to Z= 10 | |
CN106169106A (en) | A kind of one-dimensional cutting-stock problem optimized algorithm based on uniform ordered search | |
CN101739606B (en) | Raw material-saving one-dimensional stock-cutting method | |
CN104977903A (en) | Real time dispatch system-based method and system for wafer batch dispatch under machine set | |
CN108764529B (en) | Cutting type filling method for optimized layout of rectangular part | |
CN104808629B (en) | A kind of dispatching method of flexible robot manufacturing cell | |
CN103336723A (en) | Scheduling method for adapting to shortage of processor cores and based on critical paths | |
CN102799745A (en) | Method for quickly and automatically assembling residual steel plates | |
CN108156617B (en) | Graph theory-based cooperative caching method in fog wireless access network | |
CN110110980A (en) | A kind of wafer discharging measuring method that clout is generated and utilized | |
CN108161247A (en) | For cutting the cutting method of coiled strip | |
JP2023178944A (en) | Method for finding solutions of optimized scheduling model for cascade hydroelectric power plant based on hybrid algorithm | |
CN106326005B (en) | Parameter automatic tuning method for iterative MapReduce operation | |
CN108536824A (en) | A kind of data processing method and device | |
CN106354552B (en) | Parallel computation method for allocating tasks and device | |
CN104898570B (en) | A kind of web machining cell method for automatically constructing based on boundary extension | |
CN103218254A (en) | Multi-queue automatic fare collection data processing method | |
CN104166317B (en) | A kind of light shield automatic job distribution control method and control system | |
Tian et al. | Effectiveness of lead–lag phasing on progression bandwidth | |
CN110069527A (en) | A kind of GPU and CPU isomery accelerated method of data base-oriented | |
CN108984470A (en) | A kind of FPGA mine machine calculates the lifting system and method for power | |
CN104881530A (en) | Hobbing dry-cutting processing method based on optimized technical parameter | |
Shioura et al. | Energy saving computational models with speed scaling via submodular optimization | |
CN107706982A (en) | The charging pile control system of collective and distributive type control | |
CN102253861A (en) | Method for executing stepwise plug-in computation |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
C06 | Publication | ||
PB01 | Publication | ||
C10 | Entry into substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
GR01 | Patent grant | ||
GR01 | Patent grant | ||
EE01 | Entry into force of recordation of patent licensing contract |
Application publication date: 20161130 Assignee: QUANZHOU HUADIAN ELECTRIC Co.,Ltd. Assignor: QUANZHOU-HUST INTELLIGENT MANUFACTURING FUTURE Contract record no.: X2024350000066 Denomination of invention: A one-dimensional cutting optimization algorithm based on uniformly distributed ordered search Granted publication date: 20200407 License type: Common License Record date: 20240507 |
|
EE01 | Entry into force of recordation of patent licensing contract |