基于蚁群算法的3D打印批次规划

Batch scheduling of 3D printing with ant colony algorithm

针对3D打印批次规划问题,提出一种基于蚁群算法的3D打印批次规划方法。结合3D打印工艺特点,将批次规划目标设定为总打印批次及各批次内打印件高度差值最小化。采用顺序编码方式对打印件进行编号,由全部打印件编号组成的整数序列构成问题的可行解集。解码时按照编码顺序将打印件排布于打印机工作台面,当前台面再无法排入时排入下一打印批次,最终得到3D打印批次方案。将打印件水平面投影形状简化为矩形,采用布排点法进行矩形布排。使用蚁群算法搜索问题的最优解,通过算例验证了所提方法的有效性。

For the problem of batch planning of 3D printing,a method based on ant colony algorithm was proposed.According to the features of 3D printing process,the objective of batch planning was set to minimize the total printing batches and the height difference of the printing parts in each batch. The printed parts were coded with integer numbers in sequence and the permutations of the sequence number formed the feasible solution set of the problem. In decoding stage,the printed parts were laid into the machine＇s printing table orderly according to the sequence of solution. If the machine＇s printing table was not with enough space to accommodate the printed parts further more,the next printing batch was arranged. This finally reached the printing batch scheme. For simplification,the horizontal projection shape of the printed part was presented with rectangular and the feasible position algorithm was applied in the rectangular layout. Ant colony algorithm was adopted to search the optimum solution and the proposed method was verified by example.