Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

An Improved Nesting Algorithm for Irregular Patterns

Version 1 : Received: 21 October 2021 / Approved: 22 October 2021 / Online: 22 October 2021 (15:41:54 CEST)

How to cite: Martinez-Martinez, G.; Sanchez-Romero, J.; Jimeno-Morenilla, A.; Mora-Mora, H. An Improved Nesting Algorithm for Irregular Patterns. Preprints 2021, 2021100334 (doi: 10.20944/preprints202110.0334.v1). Martinez-Martinez, G.; Sanchez-Romero, J.; Jimeno-Morenilla, A.; Mora-Mora, H. An Improved Nesting Algorithm for Irregular Patterns. Preprints 2021, 2021100334 (doi: 10.20944/preprints202110.0334.v1).

Abstract

In industrial environments, nesting consists in cutting or extracting pieces from a material sheet, with the purpose of minimizing the surface of the sheet used. This problem is present in different types of industries, such as shipping, aeronautics, woodworking, footwear, and so on. In this work, the aim is to find an acceptable solution to solve complex nesting problems. The research developed is oriented to sacrifice accuracy for speed so as to obtain robust solutions in less computational time. To achieve this, a greedy method and a genetic algorithm have been implemented, being the latter responsible for generating a sequence for the placement of the pieces, where each piece is placed in its current optimal position with the help of a representation system for both the pieces and the material sheet.

Keywords

Nesting; cutting; irregular pattern; genetic algorithm; smart manufacturing

Subject

MATHEMATICS & COMPUTER SCIENCE, Information Technology & Data Management

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our diversity statement.

Leave a public comment
Send a private comment to the author(s)
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.