摘要
针对装配线平衡问题(ALBP),文中提出了一种禁忌搜索遗传混合算法。在混合算法中,遗传算法部分采用特殊的遗传变异操作算子(双点交叉和移位插入变异),使算法只在可行作业序列子空间中进行搜索,有效减小了搜索范围,提高了算法运行效率;禁忌搜索部分是在每代遗传操作完成以后,随机选择一些个体进行禁忌搜索操作,来增强算法的搜索能力。最后以经典问题的求解验证了禁忌搜索遗传算法在收敛性能和计算效率上较使用单纯的遗传算法高。
A tabu search and genetic hybrid algorithm is presented to solve assembly line balancing problem（ALBP）.In its genetic algorithm part, special genetic operators（two point crossover and insert mutation） is adopted to scan only in the subspace of those feasible task sequences,which reduces search area and improves algorithm efficiency.In its tabu search part,after evolution of each generation,some random selected individuals execute tabu search,which can improve algorithm search ability.In the end of this paper,the calculating results of several classic problems prove that the tabu search and genetic hybrid algorithm is better than the genetic algorithm in search ability and convergence performance.
出处
《计算机技术与发展》
2010年第5期5-8,12,共5页
Computer Technology and Development
基金
国家863计划资助项目(2007AA04Z112)
国家自然科学基金资助项目(50875046
60934008)
关键词
装配线平衡
遗传算法
禁忌搜索
混合算法
assembly line balancing
genetic algorithm
tabu search
hybrid algorithm
