Year: 2025
Type: article
Abstract: Cutting stock into several parts with specific lengths requested by customers is crucial for a company. Often, during the stock-cutting process, waste known as *trim loss* occurs due to inaccurate selection of cutting patterns. This process of determining the stock cutting pattern is referred to as the Cutting Stock Problem (CSP). In the context of advancements in computer science to address problem-solving, alternative solutions can be achieved through a metaheuristic approach, specifically the Genetic Algorithm (GA). This algorithm is inspired by the genetic processes in living organisms, where generations in a population naturally evolve over time following the principle of natural selection—survival of the fittest. This article presents a one-dimensional CSP aiming to find an optimal cutting pattern by minimizing trim loss, which is equivalent to minimizing the amount of stock used. Subsequently, the GA approach is applied using MATLAB R2021a to solve the one-dimensional CSP. The research results show a solution with the minimum use of standard-size stock to meet customer demands. After 20 trials, the best fitness value achieved was 1.000000, with a trim loss percentage of 0%.
Authors: Lisa Harianto, M. Imran, M. D. H. Gamal
Institution: Riau University
Language: English
Subfield: Industrial and Manufacturing Engineering
Field: Engineering
Domain: Physical Sciences
Open Access status: hybrid
OpenAlex ID: W4415323807
