A Block Corner-Occupying Heuristic Algorithm for Constrained Two-Dimensional Guillotine Cutting Problem of Rectangular Items
Aiming at the constrained two-dimensional guillotine cutting problem of rectangular items, a heuristic algorithm with block corner-occupying pattern is presented in this paper. It can maximize the pattern value for the totally included items, but the occurring frequency of each item type doesn&#...
| Հիմնական հեղինակ: | |
|---|---|
| Ձևաչափ: | Հոդված |
| Լեզու: | English |
| Հրապարակվել է: |
IEEE
2019-01-01
|
| Շարք: | IEEE Access |
| Խորագրեր: | |
| Առցանց հասանելիություն: | https://ieeexplore.ieee.org/document/8845593/ |