| Autor: |
E. N. Shipacheva, I. M. Berezin, A. A. Petunin |
| Rok vydání: |
2017 |
| Předmět: |
|
| Zdroj: |
AIP Conference Proceedings |
| ISSN: |
0094-243X |
| DOI: |
10.1063/1.5017400 |
| Popis: |
A problem of minimizing the length of the blank run for a cutting tool during cutting of sheet materials into shaped blanks is discussed. This problem arises during the preparation of control programs for computerized numerical control (CNC) machines. A discrete model of the problem is analogous in setting to the generalized travelling salesman problem with limitations in the form of precursor conditions determined by the technological features of cutting. A certain variant of a genetic algorithm for solving this problem is described. The effect of the parameters of the developed algorithm on the solution result for the problem with limitations is investigated. |
| Databáze: |
OpenAIRE |
| Externí odkaz: |
|
