English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

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.

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