irregular stock cutting with guillotine cuts han wei, julia bennell nanjing,china
DESCRIPTION
Problem description Problem arises in the glass cutting industry, in this instance, specifically for conservatories (glass houses)TRANSCRIPT
![Page 1: Irregular stock cutting with guillotine cuts Han Wei, Julia Bennell NanJing,China](https://reader037.vdocument.in/reader037/viewer/2022100301/5a4d1ace7f8b9ab059970af3/html5/thumbnails/1.jpg)
Irregular stock cutting with guillotine cutsHan Wei, Julia Bennell
NanJing ,China
![Page 2: Irregular stock cutting with guillotine cuts Han Wei, Julia Bennell NanJing,China](https://reader037.vdocument.in/reader037/viewer/2022100301/5a4d1ace7f8b9ab059970af3/html5/thumbnails/2.jpg)
Summary• Problem definition
• Current practice
• Direct packing approach
– Generate candidate combinations– Evaluate candidate combinations– Evolve layouts in a self adaptive forest
• Example solutions/demo
• Future work
![Page 3: Irregular stock cutting with guillotine cuts Han Wei, Julia Bennell NanJing,China](https://reader037.vdocument.in/reader037/viewer/2022100301/5a4d1ace7f8b9ab059970af3/html5/thumbnails/3.jpg)
Problem description• Problem arises in the glass cutting industry, in this
instance, specifically for conservatories (glass houses)
![Page 4: Irregular stock cutting with guillotine cuts Han Wei, Julia Bennell NanJing,China](https://reader037.vdocument.in/reader037/viewer/2022100301/5a4d1ace7f8b9ab059970af3/html5/thumbnails/4.jpg)
Problem description• All pieces are convex
• Single size stock sheet (multiple sizes and off-cuts will be considered in the future)
• Pieces are broken out using guillotine cuts (orthogonal and non-orthogonal)
• No limit to the number of stages/cuts
• Pieces can be continuously rotated
• Demand met exactly
![Page 5: Irregular stock cutting with guillotine cuts Han Wei, Julia Bennell NanJing,China](https://reader037.vdocument.in/reader037/viewer/2022100301/5a4d1ace7f8b9ab059970af3/html5/thumbnails/5.jpg)
Current practice• Nest pairs of all non-rectangular pieces into a
rectangle
• Select best pairs according to following ratio
• Use standard rectangle bin packing with guillotine constraints
2,1 of rectangle enclosing of Area
rectanglenest of Area
i
Pi
![Page 6: Irregular stock cutting with guillotine cuts Han Wei, Julia Bennell NanJing,China](https://reader037.vdocument.in/reader037/viewer/2022100301/5a4d1ace7f8b9ab059970af3/html5/thumbnails/6.jpg)
![Page 7: Irregular stock cutting with guillotine cuts Han Wei, Julia Bennell NanJing,China](https://reader037.vdocument.in/reader037/viewer/2022100301/5a4d1ace7f8b9ab059970af3/html5/thumbnails/7.jpg)
![Page 8: Irregular stock cutting with guillotine cuts Han Wei, Julia Bennell NanJing,China](https://reader037.vdocument.in/reader037/viewer/2022100301/5a4d1ace7f8b9ab059970af3/html5/thumbnails/8.jpg)
![Page 9: Irregular stock cutting with guillotine cuts Han Wei, Julia Bennell NanJing,China](https://reader037.vdocument.in/reader037/viewer/2022100301/5a4d1ace7f8b9ab059970af3/html5/thumbnails/9.jpg)
Research aimCurrent software encloses two pieces into rectangles
then packs the rectangles to be guillotine cut-able.
Our aim
1. Investigate nesting more than two pieces into rectangles
2. Removing the requirement to nest into rectangles while meeting guillotine constraint.
![Page 10: Irregular stock cutting with guillotine cuts Han Wei, Julia Bennell NanJing,China](https://reader037.vdocument.in/reader037/viewer/2022100301/5a4d1ace7f8b9ab059970af3/html5/thumbnails/10.jpg)
Direct packing approach overviewIn words …..
Evolve many layouts by recursively combining pieces, or configurations of subsets of pieces, together.
Layouts evolve via a forest structure, where the size is controlled by an acceptance threshold
An accepted combination of pieces becomes a single piece defined by the convex hull of the combination
Pieces must be combined in such a way to result in a feasible layout
![Page 11: Irregular stock cutting with guillotine cuts Han Wei, Julia Bennell NanJing,China](https://reader037.vdocument.in/reader037/viewer/2022100301/5a4d1ace7f8b9ab059970af3/html5/thumbnails/11.jpg)
Direct packing approach overview1. Generate candidate combinations of two (sets of)
pieces
1. Non overlapping2. Guillotine cut-able
2. Evaluate candidate configurations
3. Evolve solutions in self adaptive forest search
![Page 12: Irregular stock cutting with guillotine cuts Han Wei, Julia Bennell NanJing,China](https://reader037.vdocument.in/reader037/viewer/2022100301/5a4d1ace7f8b9ab059970af3/html5/thumbnails/12.jpg)
Generating candidate combinationsFor each i in P1, and j in P2, and sliding distance d,
Attach
Slide
i j
)}(length)(length,0max{,0 of incrementsin distance Slide
ji eedd
![Page 13: Irregular stock cutting with guillotine cuts Han Wei, Julia Bennell NanJing,China](https://reader037.vdocument.in/reader037/viewer/2022100301/5a4d1ace7f8b9ab059970af3/html5/thumbnails/13.jpg)
Evaluating candidate configurations
)),(()()(
21
21),( 21
PPfOPAreaPAreaU PPf
O
)),(( 21 PPfO
)),(()()(
21
21),( 21
PPfRPAreaPAreaU PPf
R
)),(( 21 PPfR
]1,0[ where,)1( ),(),(),( 212121 wUwwUU PPfO
PPfR
PPfw
![Page 14: Irregular stock cutting with guillotine cuts Han Wei, Julia Bennell NanJing,China](https://reader037.vdocument.in/reader037/viewer/2022100301/5a4d1ace7f8b9ab059970af3/html5/thumbnails/14.jpg)
Match algorithm1. Initialise best_i, best_j, best_d, max_U
2. For each i in P1, and j in P2, Attach(P1,P2,i,j)
If
do d = 0, max{0,length(ei)-length(ej)} Slide(d)If Uwf(P1,P2)> max_U
set best_i, best_j, best_d, max_U
3. Attach(P1,P2,best_i,best_j) , Slide(best_d)
dji
ji
ee
eejimd
)}(length),(lengthmax{
)(length)(length1),(
![Page 15: Irregular stock cutting with guillotine cuts Han Wei, Julia Bennell NanJing,China](https://reader037.vdocument.in/reader037/viewer/2022100301/5a4d1ace7f8b9ab059970af3/html5/thumbnails/15.jpg)
Feasibility1. Given all pieces are
convex and the described attach procedure, the no-overlap and guillotine constraints are clearly met for two original pieces.
2. Once the best match is found the combination is defined by its convex hull, hence combining sets of pieces, defined by their convex hull is the same as 1.
Guillotine cut
![Page 16: Irregular stock cutting with guillotine cuts Han Wei, Julia Bennell NanJing,China](https://reader037.vdocument.in/reader037/viewer/2022100301/5a4d1ace7f8b9ab059970af3/html5/thumbnails/16.jpg)
More assumptions and definitions
)(
21
)()()(
)()(
22211
21
21 ifmatch acceptedan is
)(*match weightedoptimal the, valuecritical aGiven
)1(
)))(((
)( and
)))(((
)(
)()...()()(, ofation transform theis },..,{, ofsubset a is
TTfw
TfO
TfR
tfw
TPj
TfR
TPj
TfO
t
t
U
TTf
UwwUU
TfRArea
PAreaU
TfOArea
PAreaU
PfPfPfTfTfPPPTDT
jj
![Page 17: Irregular stock cutting with guillotine cuts Han Wei, Julia Bennell NanJing,China](https://reader037.vdocument.in/reader037/viewer/2022100301/5a4d1ace7f8b9ab059970af3/html5/thumbnails/17.jpg)
Evolve layout in self adaptive forestm = 1 m = 2 m = 3 m = 4 m = 5
![Page 18: Irregular stock cutting with guillotine cuts Han Wei, Julia Bennell NanJing,China](https://reader037.vdocument.in/reader037/viewer/2022100301/5a4d1ace7f8b9ab059970af3/html5/thumbnails/18.jpg)
gmm
mjiji
Tfwjjiiji
wm
Tfw
mw
gDForrest
mmm
TTUgTgTTTfGg
mTUTfG
max,..1
)*(
0
)(,
)(
210
},,,),(*{
}and )({
The maximum population of D given θ and maxg:
At level m, the candidate set of configurations are:
The mth generation of the population is described by:
![Page 19: Irregular stock cutting with guillotine cuts Han Wei, Julia Bennell NanJing,China](https://reader037.vdocument.in/reader037/viewer/2022100301/5a4d1ace7f8b9ab059970af3/html5/thumbnails/19.jpg)
Example results
![Page 20: Irregular stock cutting with guillotine cuts Han Wei, Julia Bennell NanJing,China](https://reader037.vdocument.in/reader037/viewer/2022100301/5a4d1ace7f8b9ab059970af3/html5/thumbnails/20.jpg)
Example results
![Page 21: Irregular stock cutting with guillotine cuts Han Wei, Julia Bennell NanJing,China](https://reader037.vdocument.in/reader037/viewer/2022100301/5a4d1ace7f8b9ab059970af3/html5/thumbnails/21.jpg)
Software demo
![Page 22: Irregular stock cutting with guillotine cuts Han Wei, Julia Bennell NanJing,China](https://reader037.vdocument.in/reader037/viewer/2022100301/5a4d1ace7f8b9ab059970af3/html5/thumbnails/22.jpg)
Future workExplore the following
• How scalable is the approach
• Sensitivity to parameters; w, θd and θ
• Incorporate full constraints
![Page 23: Irregular stock cutting with guillotine cuts Han Wei, Julia Bennell NanJing,China](https://reader037.vdocument.in/reader037/viewer/2022100301/5a4d1ace7f8b9ab059970af3/html5/thumbnails/23.jpg)
Additional constraints• Minimum angle of 30°for cuts intersecting an edge
• No more than two cuts can intersect
• Both are permitted if a 20mil gap is added
![Page 24: Irregular stock cutting with guillotine cuts Han Wei, Julia Bennell NanJing,China](https://reader037.vdocument.in/reader037/viewer/2022100301/5a4d1ace7f8b9ab059970af3/html5/thumbnails/24.jpg)
Thank youQuestions