Chinese Journal of Mechanical Engineering | |
Neighborhood Modularization-based Artificial Bee Colony Algorithm for Disassembly Planning with Operation Attributes | |
Original Article | |
Yaping Ren1  Hongfei Guo1  Linsheng Zhang1  Zhongwei Zhou1  Jianqing Li2  Leilei Meng3  | |
[1] GBA and B&R International Joint Research Center for Smart Logistics, School of Intelligent Systems Science and Engineering, Institute of Physical Internet, Jinan University (Zhuhai Campus), 519070, Zhuhai, China;GBA and B&R International Joint Research Center for Smart Logistics, School of Intelligent Systems Science and Engineering, Institute of Physical Internet, Jinan University (Zhuhai Campus), 519070, Zhuhai, China;Faculty of Information Technology, Macau University of Science and Technology, 999078, Macau, China;School of Computer Science, Liaocheng University, 252059, Liaocheng, China; | |
关键词: End-of-life products; Disassembly planning; Artificial bee colony; Neighborhood modularization; | |
DOI : 10.1186/s10033-022-00812-2 | |
received in 2021-12-24, accepted in 2022-10-21, 发布年份 2022 | |
来源: Springer | |
【 摘 要 】
The recycling and remanufacturing of end-of-life products are significant for environmental protection and resource conservation. Disassembly is an essential process of remanufacturing end-of-life products. Effective disassembly plans help improve disassembly efficiency and reduce disassembly costs. This paper studies a disassembly planning problem with operation attributes, in which an integrated decision of the disassembly sequence, disassembly directions, and disassembly tools are made. Besides, a mathematical model is formulated with the objective of minimizing the penalty cost caused by the changing of operation attributes. Then, a neighborhood modularization-based artificial bee colony algorithm is developed, which contains a modular optimized design. Finally, two case studies with different scales and complexities are used to verify the performance of the proposed approach, and experimental results show that the proposed algorithm outperforms the two existing methods within an acceptable computational time.
【 授权许可】
CC BY
© The Author(s) 2022
【 预 览 】
Files | Size | Format | View |
---|---|---|---|
RO202305067045308ZK.pdf | 2434KB | download | |
Fig. 2 | 1620KB | Image | download |
Fig. 5 | 529KB | Image | download |
Fig. 6 | 395KB | Image | download |
Fig. 1 | 866KB | Image | download |
MediaObjects/13690_2022_1000_MOESM1_ESM.docx | 36KB | Other | download |
Fig. 5 | 2783KB | Image | download |
Fig. 3 | 854KB | Image | download |
Fig. 3 | 535KB | Image | download |
MediaObjects/41016_2022_311_MOESM1_ESM.jpg | 69KB | Other | download |
【 图 表 】
Fig. 3
Fig. 3
Fig. 5
Fig. 1
Fig. 6
Fig. 5
Fig. 2
【 参考文献 】
- [1]
- [2]
- [3]
- [4]
- [5]
- [6]
- [7]
- [8]
- [9]
- [10]
- [11]
- [12]
- [13]
- [14]
- [15]
- [16]
- [17]
- [18]
- [19]
- [20]
- [21]
- [22]
- [23]
- [24]
- [25]
- [26]
- [27]
- [28]
- [29]
- [30]
- [31]
- [32]
- [33]
- [34]
- [35]
- [36]
- [37]
- [38]
- [39]
- [40]
- [41]