ITM Web of Conferences
Volume 6, 20166th Seminar on Industrial Control Systems: Analysis, Modeling and Computation
|Number of page(s)||5|
|Published online||25 March 2016|
Use of genetic algorithms for solving problems of optimal cutting
1 National Research Nuclear University MEPhI (Moscow Engineering Physics Institute), 115409, Moscow, Russia
2 Moscow Technological Institute, 119334 Moscow, Russia
a Corresponding author: email@example.com
Cutting and packing problem is one of the most common optimization problem. Even a small space or material savings allow obtaining substantial advantages on an industrial scale. This paper proposes the genetic algorithm to solve this problem. It includes multipoint operators of crossing, mutation and selection. To use these operators, the special encoding of cutting card is applied, that can be transformed to the real coordinates by using decoder. This is a block typed decoder, which substitution strategy is “first-fit”. Efficiency of the solutions, obtained by the algorithm, depends on its parameters and on dimension of a task, but on average it decreases under the logarithmic law from dimension of a task. Temporary complexity of algorithm shows square dependence on the task dimension.
© Owned by the authors, published by EDP Sciences, 2016
This is an Open Access article distributed under the terms of the Creative Commons Attribution License 4.0, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.