• Balancing U-shaped assembly li...

Treffer: Balancing U-shaped assembly lines with collaborative robots: constraint programming approaches and Benders' decomposition algorithms.

Title:
Balancing U-shaped assembly lines with collaborative robots: constraint programming approaches and Benders' decomposition algorithms.
Authors:
Zheng, Chenyu, Li, Zixiang, Ponnambalam, S. G.
Source:
International Journal of Production Research; Dec2025, Vol. 63 Issue 24, p10468-10489, 22p
Subject Terms:
CONSTRAINT programming, ASSEMBLY line methods, MATHEMATICAL optimization, PROBLEM solving, INDUSTRIAL robots, DECOMPOSITION method, MIXED integer linear programming
Database:
Complementary Index

Weitere Informationen

Collaborative robots are progressively employed to support human workers in assembly tasks or independently assigned to one station to complete assembly tasks in U-shaped assembly lines. This study develops two exact methods, based on constraint programming (CP) model and Combinatorial Benders' decomposition algorithm (CBDA), to tackle the U-shaped assembly line balancing problem with collaborative robots. The CBDA is based on distinct decomposition strategies that address the master problem and the subproblem, formulated by a mixed integer linear programming (MILP) model and a CP model, which is designed to obtain a real objective value and generate cuts that refine the master problem. Additionally, MILP-based and CP-based local search techniques are proposed to improve the algorithm's performance. The computational study demonstrates that both the proposed methods, namely CP and CBDA, outperform the current state-of-the-art methods (the MILP model and simulated annealing algorithm). Furthermore, the CP outperforms the CBDA in terms of the number of optimal solutions, achieving the optimal solutions for 574 out of 1500 test instances, and might be regarded as the new state-of-the-art methodology. [ABSTRACT FROM AUTHOR]

Copyright of International Journal of Production Research is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Volltext ist im Gastzugang nicht verfügbar.