• 论文 •    

装配序列规划问题求解的一种混合算法

宁黎华, 古天龙   

  1. 桂林电子科技大学 计算机系, 广西桂林541004
  • 出版日期:2007-04-15 发布日期:2007-04-25

Hybrid algorithm for assembly sequence planning

NING Li-hua, GU Tian-long   

  1. Sch. of Computer Sci., Guilin Univ. of Electronic Tech., Guilin541004, China
  • Online:2007-04-15 Published:2007-04-25

摘要: 基于蚂蚁算法和的遗传算法特点,给出了一种解决装配序列规划问题的遗传和蚂蚁混合算法。混合算法中利用蚂蚁的每一次周游,快速生成问题的一组可行解,用遗传算法对得到的可行解进行快速优化,并根据优化解的质量,生成路径上的信息素分布,以加速蚂蚁最优路径上信息素的积累,从而引导蚂蚁更快地搜索到问题的最优解。实验结果表明,混合算法在装配序列规划问题求解上具有更好的性能。

关键词: 装配序列规划, 遗传算法, 蚂蚁算法, 混合算法

Abstract: Combining characteristics of ant colony algorithm and genetic algorithm, a novel hybrid algorithm was developed for the assembly sequence planning problems. In this hybrid algorithm, each ant colony computation was implemented to generate a group of feasible solutions, and the genetic computation was run to obtain the optimal one rapidly. Experimental results showed that the hybrid algorithm outperformed either genetic algorithm or ant colony algorithm in handling assembly sequence planning problems.

Key words: assembly sequence planning, genetic algorithm, ant colony algorithm, hybrid algorithm

中图分类号: