基于殖民竞争算法的多约束双边装配线平衡

发布时间：2018-07-28 20:32

【摘要】：针对实际生产中双边装配线平衡问题(Two-sided assembly line balancing problem,TALBP)所特有的操作方位约束、优先顺序约束、位置约束、区域约束、同步约束,介绍各个约束的特点及其对任务分配的要求,建立相应的数学模型。根据数学模型,设计相应的殖民竞争算法。在该算法中,对于不符合优先顺序约束的任务系列,提出二叉树调整方法,使任务分配仅在可行解空间内进行,提高了优化效率。将殖民竞争算法(Colonial competitive algorithm,CCA)的全局搜索能力与延迟接受爬山(Late acceptance hill-climbing,LAHC)算法的局部搜索能力有机结合,提出一种新型的混合殖民竞争算法,求解第I类平衡问题。通过多个算例测试验证了算法的有效性。
[Abstract]:In view of the operational orientation constraints, priority constraints, location constraints, region constraints, synchronization constraints, the characteristics of each constraint and the requirements for task assignment are introduced. The special operational orientation constraints, priority constraints, location constraints, and synchronization constraints of Two-sided assembly line balancing problem TALBP in practical production are introduced. Establish the corresponding mathematical model. According to the mathematical model, the corresponding colonial competition algorithm is designed. In this algorithm, a binary tree adjustment method is proposed for the tasks which do not conform to the priority constraints, so that the task allocation is only carried out in the feasible solution space, and the optimization efficiency is improved. Combining the global search ability of (Colonial competitive algorithm with the local search ability of (Late acceptance hill-climbing LAHC algorithm, a new hybrid colonial competition algorithm is proposed to solve the class I equilibrium problem. The validity of the algorithm is verified by several examples.
【作者单位】：华中科技大学数字制造装备与技术国家重点实验室;上海交通大学工业工程与物流工程系;武汉科技大学机械自动化学院;
【基金】：国家自然科学基金重点(51035001)和国家自然科学基金(51275190)资助项目
【分类号】：TG95

【共引文献】