Model of megalopolises in the tool path optimisation for CNC plate cutting machines

被引：24
作者：
Chentsov, Alexander G. [1 ,2 ]
Chentsov, Pavel A. [1 ,2 ]
Petunin, Alexander A. [2 ]
Sesekin, Alexander N. [1 ,2 ]
机构：
[1] Inst Math & Mech UB RAS, Ekaterinburg, Russia
[2] Ural Fed Univ, Inst New Mat & Technol, Ekaterinburg, Russia
来源：
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH | 2018年 / 56卷 / 14期
基金：
俄罗斯基础研究基金会;
关键词：
CNC cutting machines; nesting; tool path; travelling salesman problem; precedence constraints; CAD; CAM; dynamic programming; heuristics; TRAVELING SALESMAN PROBLEM; ROUTING-PROBLEMS; LASER CUTTERS; CONSTRAINTS; HEURISTICS; ALGORITHMS;
D O I：
10.1080/00207543.2017.1421784
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
We consider the issues of tool path optimisation under constraints and formulate a mathematical problem of visiting megalopolises. The megalopolises model is the result of the discretisation of the tool path problem for CNC plate cutting machines. The order of visits is subject to precedence constraints. In addition, the cost functions depend on the set of pending tasks. The quality criterion is a variety of the additive criterion. The problem is established within the dynamic programming framework, however, a heuristic is proposed and implemented to solve practical problems of large dimensionality.
引用
收藏
页码：4819 / 4830
页数：12
相关论文
共 41 条
  • [1] Combining and solving sequence dependent traveling salesman and quadratic assignment problems in PCB assembly
    Alkaya, Ali Fuat
    Duman, Ekrem
    [J]. DISCRETE APPLIED MATHEMATICS, 2015, 192 : 2 - 16
  • [2] [Anonymous], 2008, Extreme tasks of routing and distribution of tasks: theory questions
  • [3] [Anonymous], 1979, Computers and Intractablity: A Guide to the Theory of NP-Completeness
  • [4] [Anonymous], 1958, On a Routing Problem Quarterly of Applied Mathematics
  • [5] [Anonymous], 2009, INT J MECHATRON MANU, DOI DOI 10.1504/IJMMS.2009.028081
  • [6] Adaptive nonlinear tool path optimization for five-axis machining
    Bohez, E
    Makhanov, SS
    Sonthipermpoon, K
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2000, 38 (17) : 4329 - 4343
  • [7] Elements of dynamic programming in extremal routing problems
    Chentsov, A. A.
    Chentsov, A. G.
    Chentsov, P. A.
    [J]. AUTOMATION AND REMOTE CONTROL, 2014, 75 (03) : 537 - 550
  • [8] Extremal Bottleneck Routing Problem with Constraints in the Form of Precedence Conditions
    Chentsov, A. A.
    Chentsov, A. G.
    [J]. PROCEEDINGS OF THE STEKLOV INSTITUTE OF MATHEMATICS, 2008, 263 (Suppl 2) : S23 - S36
  • [9] Routing under constraints: Problem of visit to megalopolises
    Chentsov, A. G.
    Chentsov, P. A.
    [J]. AUTOMATION AND REMOTE CONTROL, 2016, 77 (11) : 1957 - 1974
  • [10] Chentsov A. G., 2016, Journal of Automation and Information Sciences, V48, P11
12345