Raster penetration map applied to the irregular packing problem

Sato, Ayami; Martins, Thiago de Castro; Gomes, António Alberto; Tsuzuki, Marcos de Sales Guerra

doi:10.1016/j.ejor.2019.06.008

Cited by 30 publications

(17 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Unclassified

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%

“…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%

“…Some algorithms also allow the holefilling strategy, i.e., the part is placed in the holes formed by previously placed parts [19], [24]. The most popular placement rule is the bottom-left policy [41]. In addition, Bennell and Song [8] proposed several attributes considering mutual fitness under the bottom-left policy.…”

Section: Introductionmentioning

confidence: 99%

“…In large-scale cases, the searching over the layout approaches has a large continuous search space, which becomes an obstacle for constructing efficient solvers [41]. Therefore, it is important to design an efficient searching over the sequence algorithm to generate a high-utilization solution in time limits.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Greedy Adaptive Search: A New Approach for Large-Scale Irregular Packing Problems in the Fabric Industry

Cui

2020

IEEE Access

View full text Add to dashboard Cite

The 2-dimensional irregular packing problems are important in the fabric industry. Under several restrictions, fabric packing problems require placing a given set of parts within a fixed-width rectangular sheet, aiming at a minimum length use. In textile industry production, the fabric packing problems are usually large-scale with time limits, where the total number of parts is large, and a highutilization solution should be computed in several minutes. However, there are few existing works on largescale packing problems. In this paper, we propose a greedy adaptive search algorithm by constructing a new evaluation function and introducing a new restricted local search strategy. In our algorithm, with a given initial sequence of parts, we iteratively search the best-fit part in succeeding several parts and place it on sheet. Moreover, we employ a two-stage heuristic searching algorithm to search over all the possible sequences for a good initial sequence with high utilization. Numerical examples involve some large-scale industrial instances, together with some large-scale instances generated from benchmarks. Numerical tests show that our algorithm outperforms existing state-of-the-art solvers in large-scale packing problems. The results show the potential of our algorithm to large-scale packing problems in industrial production.

show abstract

Section: B Test Resultsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Greedy Adaptive Search: A New Approach for Large-Scale Irregular Packing Problems in the Fabric Industry

Cui

2020

IEEE Access

View full text Add to dashboard Cite

show abstract

“…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%

Dental Restorations Packing Based on the Contour Similar Features Matching and Collision Strategy

Guo

Peng

et al. 2019

IEEE Access

View full text Add to dashboard Cite

Dental restoration is a complex process to recover patients' teeth using artificial materials. It is important to improve the utilization of the expensive material for cost saving. The tooth side surface is projected as a two-dimensional (2D) contour in the actual processing, which forms a packing problem of irregular contours. The 2D irregular packing has received a lot of attention in research to solve this NP-hard problem. Contours of the dental restoration are more complicated than those in traditional 2D irregular packing problems. The existing packing methods cannot obtain good results for these complex contours. In order to solve the contour packing problem of restoration models using the NC machining technology, a dental restoration contour packing algorithm is proposed based on the contour similar feature matching and collision. The algorithm uses dynamic programming for the longest common subsequence to search the solution of 2D free contour packing. Comparing with the existing packing methods, our proposed method can significantly reduce the processing time and improve the filling rate.INDEX TERMS Computer-aided prosthodontics, similar feature matching, nesting, free-form contour packing, freeman chain code, geometric invariant description.

show abstract

Framework for Electrical Impedance Tomography Forward Problem with Non-uniform Electrodes Distribution

Duran

Sato

Tanabi

et al. 2020

Advances in Intelligent Systems and Computing

View full text Add to dashboard Cite

Raster penetration map applied to the irregular packing problem

Cited by 30 publications

References 28 publications

Greedy Adaptive Search: A New Approach for Large-Scale Irregular Packing Problems in the Fabric Industry

Greedy Adaptive Search: A New Approach for Large-Scale Irregular Packing Problems in the Fabric Industry

Dental Restorations Packing Based on the Contour Similar Features Matching and Collision Strategy

Framework for Electrical Impedance Tomography Forward Problem with Non-uniform Electrodes Distribution

Contact Info

Product

Resources

About