针对实际生产中双边装配线平衡问题(Two-sided assembly line balancing problem, TALBP) 所特有的操作方位约束、优先顺序约束、位置约束、区域约束、同步约束，介绍各个约束的特点及其对任务分配的要求，建立相应的数学模型。根据数学模型，设计相应的殖民竞争算法。在该算法中，对于不符合优先顺序约束的任务系列，提出二叉树调整方法，使任务分配仅在可行解空间内进行，提高了优化效率。将殖民竞争算法(Colonial competitive algorithm, CCA)的全局搜索能力与延迟接受爬山(Late acceptance hill-climbing, LAHC )算法的局部搜索能力有机结合，提出一种新型的混合殖民竞争算法，求解第 I 类平衡问题。通过多个算例测试验证了算法的有效性。

In view of the special constraints such as operational direction constraint, precedence constraint, positional constraint, zoning constraint and synchronous constraint in the two-sided assembly line balancing problem, the characteristics of every constraint and the special requirements of task assignment are analyzed, and the corresponding mathematical model is built. A colonial competitive algorithm is proposed according to the model. To make every task sequence meet the precedence constraint, the binary tree adjustment algorithm is proposed. The efficiency of assigning the task only in the feasible solution space is improved. The LAHC algorithm is added in the algorithm as a local search algorithm, to improve the global search of the algorithm. Experiments are carried out to demonstrate the performance of the proposed method.