Implementation of a polygonal algorithm for surface-surface intersections
Computers and Industrial Engineering
A genetic algorithm for a 2D industrial packing problem
Computers and Industrial Engineering
Determining the minimum-area encasing rectangle for an arbitrary closed curve
Communications of the ACM
A Cutting Plane Approach to Solving Quadratic Infinite Programs on Measure Spaces
Journal of Global Optimization
An approximation algorithm for cutting out convex polygons
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Lift-and-project for mixed 0-1 programming: recent progress
Discrete Applied Mathematics
FAFNER-Accelerating Nesting Problems with FPGAs
FCCM '99 Proceedings of the Seventh Annual IEEE Symposium on Field-Programmable Custom Computing Machines
On finding an empty staircase polygon of largest area (width) in a planar point-set
Computational Geometry: Theory and Applications
Newsvendor Bounds and Heuristic for Optimal Policies in Serial Supply Chains
Management Science
Putting the crowd to work in a knowledge-based factory
Advanced Engineering Informatics
Efficient parts nesting schemes for improving stereolithography utilization
Computer-Aided Design
Hi-index | 0.00 |
The present paper reports an intelligent computer-aided nesting (CAN) system for optimal nesting of two-dimensional parts, especially parts with complicated shapes, with the objective of effectively improving the utilization ratio of sheet materials. This paper also systemically reviews the nesting algorithms that were developed to perform various nesting tasks, and attacks the irregular part nesting problem by efficiently integrating and improving the performance of nesting algorithms such as the rectangular enclosure method, bottom-left nesting algorithms, heuristic algorithms and genetic algorithms. The CAN system has also been developed as a nesting algorithm test platform for researching and developing new nesting algorithms. Through this test platform, the limitations of existing nesting algorithms are investigated and problems such as nesting parts in spaces within a single part or between parts are also studied. Efforts have been devoted to improving the nesting efficiency of the existing algorithms and developing new nesting algorithms. Case studies are carried out in a sheet metal cutting company. The results show that the intelligent CAN system can effectively nest both regular and irregular parts, and greatly improve the utilization ratio of raw sheet material.