The Application of Hybrid Algorithm to the Assembly Sequence Planning
-
摘要: 基于现有复杂产品装配序列的特点,建立了装配体的几何可行性、零件的重新定向次数及装配体稳定性的目标函数。在原有离散粒子群算法的基础上,引入改进的进化方向算子,该算子可较为突出的改进离散粒子群算法的局部搜索能力。提出了一种混合算法,该算法在不牺牲粒子群算法的局部搜索能力和搜索速度的同时,提高其全局搜索能力,减少算法平均迭代的步数。算例表明:该混合算法具有优良的局部搜索特性及全局搜索特性,算法可快速收敛至全局最优解,可有效解决装配序列规划问题。Abstract: Based on the characteristics of the assembly sequence,the geometric feasibility,the number of assembly orientation changes,and the assembly stability are chosen to be the optimization objective. Subsequently,a modified iterative method of evolutionary direction operator(MEDO) algorithm is used to accelerate the convergence rate of discrete particle swarm optimization(DPSO) algorithm. Then,a new hybrid algorithm MEDODPSO is proposed. The present hybrid algorithm improved the global search ability,and reduced the average iteration algorithm efficiency. The present results show that the hybrid algorithm has excellent global convergence properties and a fast convergence rate. The hybrid algorithm based on IDPSO and MEDO is efficient for solving ASP problems.
-
Key words:
- algorithms /
- assembly sequence planning /
- assembly
-
[1] Bourjault A. Contribution a une approche methodologique de l'assemblage automatise:elaboration automatique des sequences operatoires[D]. Besancon:Universite de Franche-Comte,1984 [2] De Fazio T,Whitney D. Simplified generation of all mechanical assembly sequences[J]. IEEE Journal of Robotics and Automatic,1987,3(6): 640-658 [3] Bonneville F,Perrard C,Henrioud M. A genetic algorithm to generate and evaluate assembly plans[C]// IEEE Symposium on Emerging Technology and Factory Automation. Pairs,France,1995: 231-239 [4] De lit P,Latinne P,Rekiek B,et al. Assembly planning with an ordering genetic algorithm[J]. International Journal of production Research,2001,39(16): 3623-3640 [5] Romeo M M,Lee H S L,Kazem A. A genetic algorithm for the optimisation of assembly sequences [J].Computers % Industrial Engineering,2006,50 (4): 503-527 [6] Milner J M,Grave S C,Whitney D E. Using simulated annealing to select least-cost assembly sequences[C]// Proceedings of the IEEE International Conference on Robotics and Automation. San Diego,CA,USA,1994:2058-2063 [7] 赵姗姗,李宗斌.基于多色集合的装配序列规划方法[J].中国机械工程,2008,19(14): 1691-1697 Zhao S S,Li Z B. Research on polychromatic sets-based assembley sequence generation method [J]. China Mechanical Engineering,2008,19(14): 1691-1697 (in Chinese) [8] Failli F,Dini G. Ant colony systems in assembly planning:a new approach to sequence detection and optimization[C]// Proceedings of the 2nd CIRP International Seminal on Intelligent Computation in Manufacturing Engineering. Capri,Italy,2000: 227-232 [9] Wang J F,Liu J H,Zhong Y F. A novel ant colony algorithm for assembly sequence planning[J]. The International Journal of Advanced Manufacturing Technology,2005,25(11): 1137-1143 [10] 叶南海,戚一男,陈凯,等.基于改进 PSO 的可靠性稳健优化计算方法[J].中国机械工程,2012,23(5): 551-555 Ye N H,Qi Y N,Chen K,et al. A computational method on reliability robust optimization based on improved PSO[J]. China Mechanical Engineering,2012,23(5): 551-555 (in Chinese) [11] Kennedy J,Eberhart R C. A discrete binary version of the particle swarm algorithm[C]// Proceedings of the IEEE International Conference on Systems,Man and Cybernetics,1997,5(12 /15): 4104-4108 [12] Wang Y,Liu J H. Chaotic particle swarm optimization for assembly sequence planning[J]. Robotics and Computer-Integrated Manufacturing,2010,26 (2): 212-222 [13] Lü H G,Lu C. An assembly sequence planning approach with a discrete particle swarm optimization algorithm[J].The International Journal of Advanced Manufacturing Technology,2010,50(5/8): 761-770
点击查看大图
计量
- 文章访问数: 122
- HTML全文浏览量: 23
- PDF下载量: 2
- 被引次数: 0