Saltar al contenido principal

ETHNOS_APP

Inicio • Búsqueda • Revistas • Lista 0

Improved SAC Algorithm for Solving the Interactive Hybrid Disassembly Line Balancing Problem Considering Multiskilled Workers

Datos Bibliográficos

ID22106914
AutoresQingbo Meng (0000-0002-3378-4337, Hebei University of Technology), Xiwang Guo (0000-0002-9142-1251, Liaoning Shihua University), Zhiwei Zhang (0000-0002-0891-0389, Liaoning Shihua University), Jiacun Wang (0000-0003-4176-3947, Monmouth University), Shujin Qin (0000-0002-4578-2726, Shangqiu Normal University), GuiPeng Xi (0009-0009-7131-6145, Northwestern Polytechnical University), Liang Qi (0000-0002-2155-2061, Shandong University of Science and Technology)
Año2026
Páginas1-15
Fecha de publicación2026-01-01
Peer ReviewedSí
Open AccessSí
TipoARTICLE
RevistaIEEE Transactions on Computational Social Systems (JOURNAL)
Identificadores de la revistaISSN: 2329-924X • E-ISSN: 2373-7476
EditorialInstitute of Electrical and Electronics Engineers (IEEE) (PUBLISHER)
DOI10.1109/tcss.2026.3675008
OpenAlexW7154949181
IdiomaEN

With the advancement of manufacturing and the progression towards intelligent production, more and more production enterprises are focusing on the hybrid disassembly line balancing problem to enhance efficiency and reduce costs. This work presents an interactive hybrid disassembly line balancing problem considering multiskilled workers and its corresponding mathematical model. Additionally, we incorporated the concept of carbon emissions into the problem to ensure the green sustainability of the production process. We employ an improved soft actor-critic (SAC) algorithm for solving the problem to achieve the goals of maximizing profit, minimizing idle time, and minimizing carbon emissions. The experimental results demonstrate that the improved SAC algorithm performs well on six different experimental scale cases. Specifically, multiobjective soft actor-critic (MO-SAC) produces solutions that are closer to the Pareto front than those obtained by deep deterministic policy gradient and nondominated sorting genetic algorithm II. This advantage is particularly pronounced in medium and large-scale problem instances. Statistical comparisons using nondominated solution metrics (spread, epsilon, and IGD+), Pareto front distributions, and computational time show that MO-SAC achieves better convergence and maintains comparable computational efficiency, highlighting its performance benefits in complex scenarios. The results verify the effectiveness of our proposed approach, highlighting the superiority of the improved SAC algorithm in addressing the multiobjective interactive hybrid disassembly line balancing problem

Algorithm design · Approximation algorithm · Optimization algorithm · Assembly Line Balancing Optimization · Manufacturing Process and Optimization · Optimization and Packing Problems

Velocidad de citaciónhistorical
Altamente citadoNo
Ethnos_APP • Proyecto Open Source • Licencia MIT • Frontend v2.0.0 • Privacidad y Cookies • Documentación de la API: api.ethnos.app/docs • Código de la API: GitHub • DOI: 10.5281/zenodo.17049435 • Código del Frontend: GitHub • DOI: 10.5281/zenodo.17050053 • cruz.rio.br • Expectantes Misericordiae