桂林电子科技大学学报2017，Vol.37Issue(6)：463-467,5.
基于加权约束求解技术的装配序列优化算法
An assembly sequence optimization algorithm based on weighted constraint solving
摘要
Abstract
In order to solve the problem that the assembly sequence optimization can not be solved by technique of symbol constraints,an assembly sequence optimization algorithm is proposed.In the algorithm,the assembly evaluation function is building by screening the appropriate assembly evaluation index.Taking the assembly diagram and the weighted motion vec-tor function as the assembly model,the ADD is proposed to represent the assembly liaison graph.The weight translational function is represented as algebraic decision diagram.The weighted constraint satisfaction problem (WCSP)is established to solve the problem of assembly sequence planning.The DFBB algorithm and the symbol ADD technique are used to solve the WCSP.The simulation result shows that the assembly sequence optimization algorithm can effectively solve the optimal as-sembly sequence and enhance optimization ability of the assembly sequence.关键词
装配序列规划/加权约束满足问题/代数决策图/评价Key words
assembly sequence planning/weighted constraint satisfaction problem/ADD/evaluation分类
信息技术与安全科学引用本文复制引用
唐浩,刘桂珍,徐周波..基于加权约束求解技术的装配序列优化算法[J].桂林电子科技大学学报,2017,37(6):463-467,5.基金项目
广西自然科学基金(2015GXNSFAA139285,2014GXNSFAA118354) （2015GXNSFAA139285,2014GXNSFAA118354）
桂林电子科技大学研究生教育创新计划(2016YJCX62) （2016YJCX62）
