Пожалуйста, используйте этот идентификатор, чтобы цитировать или ссылаться на этот ресурс:
http://elar.urfu.ru/handle/10995/92741
Полная запись метаданных
Поле DC | Значение | Язык |
---|---|---|
dc.contributor.author | Chentsov, P. A. | en |
dc.contributor.author | Petunin, A. A. | en |
dc.date.accessioned | 2020-10-20T16:37:00Z | - |
dc.date.available | 2020-10-20T16:37:00Z | - |
dc.date.issued | 2016 | - |
dc.identifier.citation | Chentsov P. A. Tool Routing Problem for CNC Plate Cutting Machines / P. A. Chentsov, A. A. Petunin. — DOI 10.1016/j.ifacol.2016.07.762 // IFAC-PapersOnLine. — 2016. — Vol. 12. — Iss. 49. — P. 645-650. | en |
dc.identifier.issn | 2405-8963 | - |
dc.identifier.other | https://doi.org/10.1016/j.ifacol.2016.07.762 | |
dc.identifier.other | 1 | good_DOI |
dc.identifier.other | 6dd8ecdd-d739-4b5a-b53b-1f6b65faf95a | pure_uuid |
dc.identifier.other | http://www.scopus.com/inward/record.url?partnerID=8YFLogxK&scp=84992388200 | m |
dc.identifier.uri | http://elar.urfu.ru/handle/10995/92741 | - |
dc.description.abstract | The problem of sheet cutting optimization for CNC (Computer Numerical Control) plate cutting machines is considered. This problem includes restriction with engineering specifics. The heuristic method of the problem solving is offered. This is the algorithm of the generalized salesman problem solving with additional restrictions in form of precedence constraints and based on previous part of the route restrictions. The iterative method of algorithm using is given. © 2016 | en |
dc.description.sponsorship | The work was supported by Act 211 Government of the Russian Federation, contract № 02.A03.21.0006. | en |
dc.format.mimetype | application/pdf | en |
dc.language.iso | en | en |
dc.publisher | Elsevier B.V. | en |
dc.rights | info:eu-repo/semantics/openAccess | en |
dc.source | IFAC-PapersOnLine | en |
dc.subject | CNC CUTTING MACHINES | en |
dc.subject | ROUTE OPTIMIZATION | en |
dc.subject | ROUTING (TOOL PATH) PROBLEM | en |
dc.subject | COMPUTER CONTROL SYSTEMS | en |
dc.subject | HEURISTIC METHODS | en |
dc.subject | ITERATIVE METHODS | en |
dc.subject | MACHINERY | en |
dc.subject | OPTIMIZATION | en |
dc.subject | CNC CUTTING MACHINES | en |
dc.subject | COMPUTER NUMERICAL CONTROL | en |
dc.subject | PLATE CUTTING | en |
dc.subject | PRECEDENCE CONSTRAINTS | en |
dc.subject | ROUTE OPTIMIZATION | en |
dc.subject | ROUTING PROBLEMS | en |
dc.subject | SALESMAN PROBLEM | en |
dc.subject | TOOLPATHS | en |
dc.subject | PROBLEM SOLVING | en |
dc.title | Tool Routing Problem for CNC Plate Cutting Machines | en |
dc.type | Article | en |
dc.type | info:eu-repo/semantics/article | en |
dc.type | info:eu-repo/semantics/publishedVersion | en |
dc.identifier.doi | 10.1016/j.ifacol.2016.07.762 | - |
dc.identifier.scopus | 84992388200 | - |
local.affiliation | Institute of Mechanics and Machine Building, Ural Federal University, Institute of mathematics and mechanics UrB RAS, Yekaterinburg, Russian Federation | |
local.affiliation | Institute of Mechanics and Machine Building, Ural Federal University, Yekaterinburg, Russian Federation | |
local.contributor.employee | Chentsov, P.A., Institute of Mechanics and Machine Building, Ural Federal University, Institute of mathematics and mechanics UrB RAS, Yekaterinburg, Russian Federation | |
local.contributor.employee | Petunin, A.A., Institute of Mechanics and Machine Building, Ural Federal University, Yekaterinburg, Russian Federation | |
local.description.firstpage | 645 | - |
local.description.lastpage | 650 | - |
local.issue | 49 | - |
local.volume | 12 | - |
dc.identifier.wos | 000383468400111 | - |
local.identifier.pure | 1189545 | - |
local.identifier.eid | 2-s2.0-84992388200 | - |
local.identifier.wos | WOS:000383468400111 | - |
Располагается в коллекциях: | Научные публикации ученых УрФУ, проиндексированные в SCOPUS и WoS CC |
Файлы этого ресурса:
Файл | Описание | Размер | Формат | |
---|---|---|---|---|
10.1016-j.ifacol.2016.07.762.pdf | 962,05 kB | Adobe PDF | Просмотреть/Открыть |
Все ресурсы в архиве электронных ресурсов защищены авторским правом, все права сохранены.