Models and algorithms for U-shaped assembly line balancing problem with collaborative robots

摘要

Abstract The collaborative robots (cobots) are increasingly being utilized in industries due to the advancement in the field of robotic technology and also due to the increase in labor costs. The cobots on the assembly line can be utilized to complete the tasks independently or assist the workers to complete the tasks. This study considers the U-shaped assembly line balancing problem with cobots, where several cobots with different purchasing costs are selected under the budget constraint. Three mixed-integer programming models are formulated to optimize the cycle time, and the built models are capable of solving the small-sized instances optimally. Two algorithms, artificial bee colony algorithm and migrating bird optimization algorithm, are developed and improved to tackle the large-sized instances, where new encoding scheme and decoding procedure are developed for this new problem. The computational tests demonstrate that the utilization of collaborative robots reduces the cycle time effectively in the assembly line. The comparative study on a set of instances shows that the proposed methodologies obtain competing performance in comparison with other 12 implemented algorithms.