GENETIC ALGORITHMS APPLICATION TO DECIDE THE ISSUE OF SINGLE-DIMENSIONAL CUTTING OPTIMIZATION

This paper considers an example of solving the problem of  single-dimensional cutting optimization. It is  shown that  elements of the theory of genetic algorithms can be used successfully for its solution. A distinctive feature of this task is the next: a set of parts and profiles, which the parts...

Full description

Bibliographic Details
Main Authors: N. A. Belova, G. P. Lisiuk
Format: Article
Language:English
Published: Odessa National Academy of Food Technologies 2016-08-01
Series:Автоматизация технологических и бизнес-процессов
Subjects:
Online Access:http://journals.gsjp.eu/index.php/atbp/article/view/161
_version_ 1818477193901113344
author N. A. Belova
G. P. Lisiuk
author_facet N. A. Belova
G. P. Lisiuk
author_sort N. A. Belova
collection DOAJ
description This paper considers an example of solving the problem of  single-dimensional cutting optimization. It is  shown that  elements of the theory of genetic algorithms can be used successfully for its solution. A distinctive feature of this task is the next: a set of parts and profiles, which the parts are cut from, does not change in the search for solutions but their  sequence order  changes.  Results  of  the  solution  were  used  to  write  the  ‘dll’-library  easily  integrable  into  various  application software.
first_indexed 2024-12-10T09:35:02Z
format Article
id doaj.art-b910d7e931e94aa2a0c8bd175b328d60
institution Directory Open Access Journal
issn 2312-3125
2312-931X
language English
last_indexed 2024-12-10T09:35:02Z
publishDate 2016-08-01
publisher Odessa National Academy of Food Technologies
record_format Article
series Автоматизация технологических и бизнес-процессов
spelling doaj.art-b910d7e931e94aa2a0c8bd175b328d602022-12-22T01:54:12ZengOdessa National Academy of Food TechnologiesАвтоматизация технологических и бизнес-процессов2312-31252312-931X2016-08-018210.15673/atbp.v8i2.161153GENETIC ALGORITHMS APPLICATION TO DECIDE THE ISSUE OF SINGLE-DIMENSIONAL CUTTING OPTIMIZATIONN. A. Belova0G. P. Lisiuk1Odessa National Polytechnic UniversityOdessa National Polytechnic UniversityThis paper considers an example of solving the problem of  single-dimensional cutting optimization. It is  shown that  elements of the theory of genetic algorithms can be used successfully for its solution. A distinctive feature of this task is the next: a set of parts and profiles, which the parts are cut from, does not change in the search for solutions but their  sequence order  changes.  Results  of  the  solution  were  used  to  write  the  ‘dll’-library  easily  integrable  into  various  application software.http://journals.gsjp.eu/index.php/atbp/article/view/161Optimizationsingle-dimensional cuttinggenetic algorithm
spellingShingle N. A. Belova
G. P. Lisiuk
GENETIC ALGORITHMS APPLICATION TO DECIDE THE ISSUE OF SINGLE-DIMENSIONAL CUTTING OPTIMIZATION
Автоматизация технологических и бизнес-процессов
Optimization
single-dimensional cutting
genetic algorithm
title GENETIC ALGORITHMS APPLICATION TO DECIDE THE ISSUE OF SINGLE-DIMENSIONAL CUTTING OPTIMIZATION
title_full GENETIC ALGORITHMS APPLICATION TO DECIDE THE ISSUE OF SINGLE-DIMENSIONAL CUTTING OPTIMIZATION
title_fullStr GENETIC ALGORITHMS APPLICATION TO DECIDE THE ISSUE OF SINGLE-DIMENSIONAL CUTTING OPTIMIZATION
title_full_unstemmed GENETIC ALGORITHMS APPLICATION TO DECIDE THE ISSUE OF SINGLE-DIMENSIONAL CUTTING OPTIMIZATION
title_short GENETIC ALGORITHMS APPLICATION TO DECIDE THE ISSUE OF SINGLE-DIMENSIONAL CUTTING OPTIMIZATION
title_sort genetic algorithms application to decide the issue of single dimensional cutting optimization
topic Optimization
single-dimensional cutting
genetic algorithm
url http://journals.gsjp.eu/index.php/atbp/article/view/161
work_keys_str_mv AT nabelova geneticalgorithmsapplicationtodecidetheissueofsingledimensionalcuttingoptimization
AT gplisiuk geneticalgorithmsapplicationtodecidetheissueofsingledimensionalcuttingoptimization