面向工艺分工规划的多目标蚁群算法  

Multi-objective Ant Colony Algorithm for Process Allocation

作　　者：琚龙[1] 张振明[1] 田锡天[1] 黄利江[1] 

机构地区：[1]西北工业大学机电学院,西安710072

出　　处：《科学技术与工程》2012年第11期2747-2751,共5页Science Technology and Engineering

摘　　要：为解决计算机辅助工艺规划中工艺分工的优化问题,提出一种基于多目标蚁群算法的工艺分工路线优化算法。在引入逻辑加工路线、逻辑制造单元、物理制造单元、可执行加工路线等概念基础上建立工艺分工规划过程模型。在过程模型中,运用多目标蚁群算法对物理制造单元集合实现优化。在求解过程中,以加工时间和所耗成本为目标函数,在求解空间中对物理制造单元进行遍历,最终寻找到最优化的可执行加工路线。通过实例验证了该方法的可行性和有效性。To solve the optimization problem of process allocation,a method using multi-objective ant colony algorithm was proposed.The planning process model was built based on the concepts such as logical manufacturing process,logical manufacturing unit,physical manufacturing unit,executive manufacturing process.In the process model,multi-objective ant colony algorithm was used to optimize the set of physical manufacturing unit.In the solution process,the consumption of time and cost were taken as the objective function.An executive manufacturing process is generated and optimized from the solution space of physical manufacturing unit.Experiments results reveale that this method is feasible and effective.

关 键 词：工艺分工 多目标蚁群算法 可执行工艺路线 

分 类 号：TP83[自动化与计算机技术—检测技术与自动化装置]