An Adaptive No Fit Polygon (NFP) Using Modified SFLA for the Irregular shapes to solve the Cutting and Packing problem
The cutting and packing problem is an important issue in many manufacturing industries such as leather, sheet metal fabrication, and the garment which are highly competitive; consequently, the entrepreneurs try to minimize production costs by reducing the time and materials used. For this reason, such industries need appropriate tools that can help solve problems and develop the production process for maximum efficiency. The garment industry has been used as a case study because this industry involves speed, accuracy with restrictive cutting time, and fast fashion products. Also, there is always a need for more modern technology. Moreover, the fabric pieces are two-dimensional irregular shapes which are diverse and complex. There are many related algorithms to solve this problem, but we focus on the algorithm in which the sequence is the influential factor that affects the arrangement efficiency. This research presents a new approach algorithm, which combines two modified algorithms, the No Fit Polygon (NFP) and the Shuffled Leaping Algorithm (SFLA). The NFP is an efficiency tool for calculating complex geometry, while SFLA is a meta-heuristic optimization method that is applied to find the optimum solution over several possibilities. The proposed method aims to raise the efficiency of cutting and packing problem involving two-dimensional irregular shapes in a finite space. The experiment results show that the proposed algorithm helps to increase the arrangement efficiency when compared with other algorithms.