The Mathematical Model of Optimal Cutting of Plastic Window Profiles

The paper presents the development of a specialized mathematical model and a onedimensional cutting program for production of doubleglazed windows. The solution is based on the branch and boundary method, which uses a matrix simplex method at each step. Simultaneous modification of the objective function and simplification of the system of constraints, i.e. elimination of inappropriate cutting options, help improve the developed solution. At the same time, the problem dimension and the time required to solve it reduce significantly. Authors have automated the stages of model engineering (based on the „cutting matrix“ generation) and searching for an initial reference plan. The existence of a valid basic solution helps save the consumed time. The practical significance of the obtained results lies in improving the efficiency of production design. This leads to lowering the costs of purchase, processing, transportation, storage, and disposal of materials. The developed methods and algorithms are easily adaptable and applicable to other production processes with one-dimensional cutting when considering additional technological limitations.

Authors

Publication Details

Journal
Izvestiya of Altai State University
Published
2025-04-03
DOI
https://doi.org/10.14258/izvasu(2025)1-13
Primary Topic
Optimization and Packing Problems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

The Mathematical Model of Optimal Cutting of Plastic Window Profiles

Vera V. Zhuravleva, A. S. Manicheva, Artem V. Kozhevnikov
2 links
Izvestiya of Altai State University
Optimization and Packing Problems
article

The Mathematical Model of Optimal Cutting of Plastic Window Profiles

Vera V. Zhuravleva, A. S. Manicheva, Artem V. Kozhevnikov
article en

Abstract

The paper presents the development of a specialized mathematical model and a onedimensional cutting program for production of doubleglazed windows. The solution is based on the branch and boundary method, which uses a matrix simplex method at each step. Simultaneous modification of the objective function and simplification of the system of constraints, i.e. elimination of inappropriate cutting options, help improve the developed solution. At the same time, the problem dimension and the time required to solve it reduce significantly. Authors have automated the stages of model engineering (based on the „cutting matrix“ generation) and searching for an initial reference plan. The existence of a valid basic solution helps save the consumed time. The practical significance of the obtained results lies in improving the efficiency of production design. This leads to lowering the costs of purchase, processing, transportation, storage, and disposal of materials. The developed methods and algorithms are easily adaptable and applicable to other production processes with one-dimensional cutting when considering additional technological limitations.

Izvestiya of Altai State University(1(141))
Openalex Percentile: Top 91%
Optimization and Packing Problems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.