基于蚁群算法的复合材料结构件的返修计划问题  

Repair Scheduling for Composite Structural Parts Based on Ant Colony Algorithm

作　　者：姚智骞[1] 

机构地区：[1]东南大学机械工程学院,江苏南京211189

出　　处：《电子机械工程》2017年第2期48-55,64,共9页Electro-Mechanical Engineering

摘　　要：为解决目前生产中出现的复合材料结构件的质量缺陷问题,G公司设立了复合材料结构件返修工序。针对结构件返修计划问题,以最大化返修计划中的结构件数量为目标,同时兼顾公司出货计划延迟和WIP成本(在制品成本)增加的情况,建立了0-1整数规划模型,进而以蚁群算法为基础提出了2种伪随机选择规则。根据实际情况采用不同参数设计算例来验证算法的性能。结果表明在最大化返修结构件数量方面,算法一优于算法二,而在减小公司出货延迟和控制WIP成本方面,算法二优于算法一。In order to solve the quality defects problem of composite structural parts in manufacturing, G Company sets up a repair process. For the scheduling problem in the repair process, a 0-1 integer programming model is developed with the objective of maximizing the number of repair parts. The shipping delay and high WIP cost are considered at the same time. Two pseudo-random selection mechanism are proposed based on ant colony algorithm. Problem instances with different parameter combinations are used to test the performance of the proposed algorithms. Computation results show that algorithm one is better in aspect of repair parts number, but algorithm two outperforms algorithm one in terms of reducing shipping delay and WIP cost.

关 键 词：返修计划 整数规划 蚁群算法 伪随机选择机制 

分 类 号：TH166[机械工程—机械制造及自动化] TH18