The cutting stock problem (CSP) is one of the significant optimization problems in operations research and has gained a lot of attention for increasing efficiency in industrial engineering, logistics and manufacturing. In this paper, new methodologies for optimally solving the cutting stock problem are presented. A modification is proposed to the existing heuristic methods with a hybrid new 3-D overlapped grouping Genetic Algorithm (GA) for nesting of two-dimensional rectangular shapes. The objective is the minimization of the wastage of the sheet material which leads to maximizing material utilization and the minimization of the setup time. The model and its results are compared with real life case study from a steel workshop in a bus manufacturing factory. The effectiveness of the proposed approach is shown by comparing and shop testing of the optimized cutting schedules. The results reveal its superiority in terms of waste minimization comparing to the current cutting schedules. The whole procedure can be completed in a reasonable amount of time by the developed optimization program.ª 2014 Production and hosting by Elsevier B.V. on behalf
The cutting stock problem (CSP) is a business problem that arises in many areas, particularly in manufacturing industries where a given stock material must be cut into a smaller set of shapes. It has gained a lot of attention for increasing efficiency in industrial engineering, logistics and manufacturing. This paper presents a hybrid new 3-D overlapped grouping Genetic Algorithm (GA) that solves two-dimensional cutting stock problems for nesting the rectangular shapes. The objective is the minimization of the wastage of the sheet material which leads to maximizing material utilization and the minimization of the setup time. The model and its results are compared with real life case study from a steel workshop in a bus manufacturing factory. The effectiveness of the proposed approach is shown by comparing and shop testing of the optimized cutting schedules. The results reveal its superiority in terms of waste minimization comparing to the current cutting schedules and show that our approach outperforms existing heuristic algorithms. The whole procedure can be completed in a reasonable amount of time by the developed optimization program.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.