面向产品装配序列规划的智能优化算法库  

Intelligent Optimization Algorithm Library for Assembly Sequence Planning of Products

作　　者：敬石开[1] 李连升[1] 曾森[1] 刘继红[1] 

机构地区：[1]北京航空航天大学机械工程及自动化学院,北京100191

出　　处：《计算机辅助设计与图形学学报》2010年第9期1593-1599,共7页Journal of Computer-Aided Design & Computer Graphics

基　　金：国家"八六三"高技术研究发展计划(2006AA04Z138)

摘　　要：针对复杂产品装配规划的组合爆炸和盲目搜索难题,以及单个智能优化算法各自存在的缺点,提出一种用装配序列智能优化算法库解决装配序列规划问题的方法.装配序列规划智能优化算法库主要由算法顾问和算法池构成,算法顾问依据装配规划问题的描述、算法可量化性能的主要参考指标和经验公式,向装配规划人员推荐解决规划任务的最合适算法;算法池包括改进的遗传算法、蚁群算法和模拟退火算法等3种智能优化算法.建立了统一的装配序列规划优化模型和智能算法评价指标体系,并给出了装配序列规划智能优化算法库的具体操作流程.最后结合瓶塞开启机实例,验证了该算法库为装配规划人员推荐的智能优化算法是合理的.In order to tackle the hard problems of ＂combinatorial explosion＂ and ＂blind search＂,considering the disadvantages of single intelligent optimization algorithm for assembly sequence planning,an approach to resolve the problem of assembly sequence planning with intelligent optimization algorithm library（IAL） is proposed.The IAL is composed of an algorithm advisor and an algorithm pool.The most suitable algorithm will be provided to assembly planners by the algorithm advisor according to the description of the assembly planning problems,the quantified reference indices of algorithm performance and the empirical formulas.The improved genetic algorithm（GA）,ant colony algorithm（AC） and simulated annealing algorithm（SA） have been implemented and stored in the algorithm pool.The evaluation index system of optimization algorithms and the optimization model of assembly sequence planning are also established.The operational procedure of the IAL is described.Finally,an illustrative example（cork-driver） is given to verify the rationality of the algorithms suggested by the IAL.

关 键 词：产品装配 装配序列规划 智能优化算法库 

分 类 号：TP391.7[自动化与计算机技术—计算机应用技术]