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

Journal of Mechanical Engineering ›› 2015, Vol. 51 ›› Issue (2): 183-189.doi: 10.3901/JME.2015.02.183

Previous Articles     Next Articles

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

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

CLC Number: