2019
DOI: 10.1016/j.ejor.2019.06.008
|View full text |Cite
|
Sign up to set email alerts
|

Raster penetration map applied to the irregular packing problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
15
0
2

Year Published

2019
2019
2023
2023

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 33 publications
(22 citation statements)
references
References 28 publications
0
15
0
2
Order By: Relevance
“…Benchmark instances have been massively tested in the literature, but few articles tested the cases that have been multiplied. Hu et al [27] proposed a fast algorithm and tested that algorithm on 'shirts*4', Elkeran and Ahmed [21] proposed a guided cuckoo search and obtained the best layout of the 'shirt' as 88.96%, Sato et al [41] applied the raster penetration map and achieved the best results for trousers as 90.06%. Moreover, these two algorithms are based on searching over the layout approach, which lacks scalability and efficiency for large-scale packing problems, as described in our introduction.…”
Section: B Test Resultsmentioning
confidence: 99%
See 3 more Smart Citations
“…Benchmark instances have been massively tested in the literature, but few articles tested the cases that have been multiplied. Hu et al [27] proposed a fast algorithm and tested that algorithm on 'shirts*4', Elkeran and Ahmed [21] proposed a guided cuckoo search and obtained the best layout of the 'shirt' as 88.96%, Sato et al [41] applied the raster penetration map and achieved the best results for trousers as 90.06%. Moreover, these two algorithms are based on searching over the layout approach, which lacks scalability and efficiency for large-scale packing problems, as described in our introduction.…”
Section: B Test Resultsmentioning
confidence: 99%
“…As illustrated in [21], the use of meta-heuristics and hybrid algorithms as powerful optimization tools have been applied to this problem. Sato et al [41] summarized that these approaches can be roughly divided into two categories: searching over the sequence [5], [6], [9], [13], [16], [26], [35], [45] and searching over the layout [21], [29], [41]. The main difference resides in the techniques for generating the final solution.…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations
“…The discretization algorithm is an approximate geometric processing technology, which discretizes the material and packing parts into a set of points or pixels to make it convenient to find the adjacent collision for overlapped parts. Sato et al [6] used a graphical description for 2D packing of irregular contours. Gomez and Terashima-Marin [7] applied the visual technology and binary images to find collision parts for overlap, but it can only detect four directions of the collision.…”
Section: Introductionmentioning
confidence: 99%