Powered by OpenAIRE graph
Found an issue? Give us feedback
addClaim

This Research product is the result of merged Research products in OpenAIRE.

You have already added 0 works in your ORCID record related to the merged Research product.

Оптимизация раскроя гофрокартона

выпускная квалификационная работа бакалавра

Оптимизация раскроя гофрокартона

Abstract

Наиболее важной проблемой в сфере промышленности является оптимальное использование промышленного материала, вследствие чего возникает задача определения взаимного расположения штампуемых изделий на заготовке некоторого размера таким образом, чтобы суммарный отход составлял как можно меньшее значение. По комбинаторике возникает большое количество вариантов, которые невозможно перебрать вручную за небольшое количество времени. Поэтому, в целях автоматизации производства, возникает потребность в использовании программных средств, позволяющих получать оптимальное решение в течение небольшого промежутка времени. В рамках данной работы предложен подход к решению данной проблемы - использование алгоритма Приоритетной эвристики в совокупности с разработанным оптимизационным алгоритмом. Данный алгоритм относится к классу эвристических алгоритмов и, несмотря на свою скорость, не всегда дает оптимальный результат. Разработанный оптимизационный алгоритм позволяет улучшить полученный результат и при этом не терять временной показатель алгоритма Приоритетной эвристики.

The most important problem in the industry is an optimal use of the industrial material and hereupon it arises the task for determination of relative position of stamped products on the workpiece for some size in the way that the total waste will compile as little possible weight. On combinatorics, there will be a lot of variants unable to iterate over manually for a small amount of time. Therefore, in order to automate production there is a need to use software tools capable to get an optimal solution for a short period of time. Within the framework of this work I have an approach to solving this problem, the use of Priority Heuristics algorithm combined by the developed optimization algorithm. This algorithm is related to the group of heuristic algorithms and despite its speed cannot always get an optimal result. The developed optimization algorithm may improve the result obtained and at the same time not to lose the time indicator of Priority Heuristics algorithm.

Keywords

np-трудная задача, оптимизация, np-hard problem, cutting tape, priority heuristic, приоритетная эвристика, тестирование, optimization, testing, раскрой

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    0
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
0
Average
Average
Average
Related to Research communities
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!