首页|期刊导航|复杂系统建模与仿真（英文）|Multi-Objective Variable Neighborhood Search Algorithm to Optimize the Multi-Product U-Shaped Disassembly Line Balancing Problem with a Fixed Number of Stations

Multi-Objective Variable Neighborhood Search Algorithm to Optimize the Multi-Product U-Shaped Disassembly Line Balancing Problem with a Fixed Number of Stations

Xingyu Zhang Xiuli Wu

复杂系统建模与仿真（英文）2025，Vol.5Issue(4)：354-369,16.

复杂系统建模与仿真（英文）2025，Vol.5Issue(4)：354-369,16.DOI:10.23919/CSMS.2024.0033

Multi-Objective Variable Neighborhood Search Algorithm to Optimize the Multi-Product U-Shaped Disassembly Line Balancing Problem with a Fixed Number of Stations

Xingyu Zhang ¹Xiuli Wu¹

作者信息

1. School of Mechanical Engineering,University of Science and Technology Beijing,Beijing 100083,China
折叠

摘要

关键词

disassembly line balancing problem/multi-product/fixed number of stations/U-shaped disassembly line/variable neighborhood search algorithm

Key words

disassembly line balancing problem/multi-product/fixed number of stations/U-shaped disassembly line/variable neighborhood search algorithm

引用本文复制引用

Xingyu Zhang,Xiuli Wu..Multi-Objective Variable Neighborhood Search Algorithm to Optimize the Multi-Product U-Shaped Disassembly Line Balancing Problem with a Fixed Number of Stations[J].复杂系统建模与仿真（英文）,2025,5(4):354-369,16.

基金项目

This work was supported by the National Natural Science Foundation of China(No.52175449). （No.52175449）

复杂系统建模与仿真（英文）

访问量2

下载量0

段落导航