首页 | 官方网站   微博 | 高级检索  
     

基于蚁群算法的选择装配
引用本文:徐知行,刘向勇,周晓勤.基于蚁群算法的选择装配[J].现代制造工程,2007(9):83-85.
作者姓名:徐知行  刘向勇  周晓勤
作者单位:吉林大学机械科学与工程学院,长春,130022
摘    要:选择装配是一种由低加工精度零件获得高精度装配件的方法,可归纳为一个组合优化问题,蚁群算法是解决这类问题的有效方法.综合考虑选择装配中的匹配率和匹配精度,提出以综合装配质量指标为选择装配的目标函数.为了求解选择装配的组合优化问题,在蚁群算法的框架内提出一个考虑信息素分布为节点模式的蚁群算法解构造图模型,并详细讨论蚁群算法的实现过程.通过对实例的仿真计算,考证该方法的实效性.

关 键 词:选择装配  蚁群算法  组合优化  蚁群算法  选择装配  ant  colony  algorithm  assembly  selective  实效性  仿真计算  过程  图模型  解构造  点模式  分布  信息素  框架  求解  目标函数  质量指标  合装  匹配精度  匹配率
文章编号:1671-3133(2007)09-0083-04
修稿时间:2007年7月18日

A new approach to selective assembly with ant colony algorithm
Xu Zhi-xing,Liu Xiang-yong,Zhou Xiao-qin.A new approach to selective assembly with ant colony algorithm[J].Modern Manufacturing Engineering,2007(9):83-85.
Authors:Xu Zhi-xing  Liu Xiang-yong  Zhou Xiao-qin
Abstract:Selective assembly is a method of obtaining high-precision assemblies from relatively low-precision components.It can be solved as a combinational optimization problem using ant colony algorithm.The mating accuracy and the mating rate are considered to construct a synthesizing index of assembly quality which is proposed as objective function of optimization problem in selective assembly.From ant colony algorithm,a construction graph is presented by considering information elements as nodes.Solving procedure of the combinational optimization problem in selective assembly is detailed.The numerical simulation of case examples verified that selective assembly can be effectively implemented using ant colony algorithm.
Keywords:Selective assembly  Ant colony algorithm  Combinational optimization
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号