• CN:11-2187/TH
  • ISSN:0577-6686

机械工程学报 ›› 2015, Vol. 51 ›› Issue (2): 183-189.doi: 10.3901/JME.2015.02.183

• 交叉与前沿 • 上一篇    下一篇

扫码分享

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

李大双1张超勇1邵新宇1袁 彪2唐秋华3   

  1. 1.华中科技大学数字制造装备与技术国家重点实验室
    2.上海交通大学工业工程与物流工程系
    3.武汉科技大学机械自动化学院
  • 出版日期:2015-01-20 发布日期:2015-01-20
  • 基金资助:
    国家自然科学基金重点(51035001)和国家自然科学基金 (51275190)资助项目。

Hybrid Colonial Competitive Algorithm for the Two-sided Assembly Line Balancing Problem with Multiple Constraints

LI Dashuang1ZHANG Chaoyong1SHAO Xinyu1YUAN Biao2TANG Qiuhua3   

  1. State Key Laboratory of Digital Manufacturing Equipment and Technology, Huazhong University of Science and Technology, Wuhan 430074;Department of Industrial Engineering and Logistics Management, Shanghai Jiao Tong University, Shanghai 200240;College of Mechanical Automation, Wuhan University of Science and Technology, Wuhan 430081
  • Online:2015-01-20 Published:2015-01-20

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

关键词: 多约束, 双边装配线, 延迟接受爬山算法, 殖民竞争算法

Abstract: 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.

Key words: colonial competitive algorithm, late acceptance hill-climbing, multiple constraints, two-sided assembly line

中图分类号: