基于多色集合理论和遗传算法的加工中心工步排序研究  

Research on Machining Step Sequencing of Machining Center Based on Polychromatic Sets Theory and Genetic Algorithm

作　　者：刘雪梅[1] 孟飞飞[1] 李爱平[1] 古志勇[1] 

机构地区：[1]同济大学,上海201804

出　　处：《中国机械工程》2013年第18期2437-2442,共6页China Mechanical Engineering

基　　金：国家科技重大专项(2011ZX04015-022)

摘　　要：针对加工中心上一次装夹下复杂的工步排序问题,通过实例介绍一种基于多色集合理论和遗传算法的工步排序优化算法。首先,在分析工步排序原则和典型工艺路线的基础上,根据多色集合理论建立加工中心上工步排序问题的约束模型。然后,以辅助时间最短为优化目标,建立其数学优化模型。最后,将遗传算法应用到工步排序中从而得出最优解。实例证明,在多色集合约束模型约束下的遗传算法能够很好地求解加工中心上的工步排序问题,排序结果接近最优且可以大幅提高加工中心的效率。Aiming at the complex machining step sequencing problem on machining center at one-time clamping,an optimization algorithm for sequencing machining steps was presented via an example,which was based on polychromatic sets theory and genetic algorithm.Firstly,a constraint model which was based on the polychromatic sets theory was established after the analyses of machining step sequencing principles and typical process routes.Then its mathematical optimization model was set up by taking the assistant machining time as the optimization object.Finally,the optimum solution was obtained by applying genetic algorithm to the solving process of machining step sequencing.The example proves that this algorithm can solve the machining step sequencing problem on machining center effectively,the sequencing result is near-optimal solution and can improve the efficiency of the machining center greatly.

关 键 词：工步排序 多色集合理论 数学优化模型 遗传算法 

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