Аннотация:
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.
