Model of megalopolises in the tool path optimisation for CNC plate cutting machines
针对数控板材切割机床的刀具路径优化问题，提出大都市模型，将问题离散化并考虑访问顺序约束和成本函数，在动态规划框架下设计启发式算法以解决高维实际问题。
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.