Genetic algorithms application to decide the issue of single-dimensional cutting optimization
Journal: Automation of technological and business processes (Vol.8, No. 2)Publication Date: 2016-06-01
Authors : Belova N.A.; Lisiuk G.P.;
Page : 4-8
Keywords : Optimization; single-dimensional cutting; genetic algorithm;
Abstract
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.
Other Latest Articles
- Computer-integrated system control reshuffle fuel assemblies AKZ the VVER-1000 taking into account the damage fuel cladding
- Definition of time of transition process by means of the modified gomokhronnosti's number on the example of heating of bodies
- Partial renovating - the innovative tool of efficiency control of functioning of the equipment which has spent a resource
- A simple pi-similar controller with continuous logic for non-stationary objects
- Efficient reconstruction of engineering buildings in conditions of organizational constraints
Last modified: 2017-06-15 09:07:10