“虚工件”中刀具排列优化算法

An Optimization Algorithm for Tool Ordering in "Virtual Part" Approach

针对柔性制造系统中一块托板上装夹几个相同或不同工件组成的一个实体——“虚工件”的工艺安排中的刀具排序问题,提出了一个新的算法.利用这一算法,可以很方便地从“虚工件”工艺安排的相同刀具中找出一个共用刀具数最多的序列,从而实现刀具排序最优化的目的.

The virtual part is defined as a combination of identical or different workpieces to be clamped on one pallet and to be machined simultaneously. Advantages of this bpproach are to reduce auxiliary tool changing time and to improve productivity as well as production flexibility. The key for process planning of virtual part is to find a series of the largest number of commonly used tools from the whole tool set of the real parts. A new algorithm is presented using the graph theory to convert the tool ordering into directed graphs and directed graphical matrices. The optimal solution can be found by operating the directed graphs or the directed graphical matrices.