The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Disassembly sequence planning using discrete Bees algorithm for human-robot collaboration in remanufacturing
Abstract
Abstract Remanufacturing helps to improve the resource utilization rate and reduce the manufacturing cost. Disassembly is a key step of remanufacturing and is always finished by either manual labor or robots. Manual disassembly has low efficiency and high labor cost while robotic disassembly is not flexible enough to handle complex disassembly tasks. Therefore, human-robot collaboration for disassembly (HRCD) is proposed to flexibly and efficiently finish the disassembly process in remanufacturing. Before the execution of the disassembly process, disassembly sequence planning (DSP), which is to find the optimal disassembly sequence, helps to improve the disassembly efficiency. In this paper, DSP for human-robot collaboration (HRC) is solved by the modified discrete Bees algorithm based on Pareto (MDBA-Pareto). Firstly, the disassembly model is built to generate feasible disassembly sequences. Then, the disassembly tasks are classified according to the disassembly difficulty. Afterward, the solutions of DSP for HRC are generated and evaluated. To minimize the disassembly time, disassembly cost and disassembly difficulty, MDBA-Pareto is proposed to search the optimal solutions. Based on a simplified computer case, case studies are conducted to verify the proposed method. The results show the proposed method can solve DSP for HRC in remanufacturing and outperforms the other three optimization algorithms in solution quality.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A fast and elitist multiobjective genetic algorithm: NSGA-II
Deb, K., Pratap, A., Agarwal, S., & Meyarivan, T. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.996017 · Cited by 50,053
Cited by
Towards new-generation human-centric smart manufacturing in Industry 5.0: A systematic review
Zhang, C., Wang, Z., Zhou, G., Chang, F., Ma, D., Jing, Y., Cheng, W., Ding, K., & Zhao, D. (2023) · Advanced Engineering Informatics · doi:10.1016/j.aei.2023.102121 · Cited by 366
Lou, S., Zhang, Y., Tan, R., & Lv, C. (2024) · Robotics and Computer-Integrated Manufacturing · doi:10.1016/j.rcim.2023.102706 · Cited by 84
Zhao, R., Tao, S., & Li, P. (2025) · Robotics and Computer-Integrated Manufacturing · doi:10.1016/j.rcim.2024.102942 · Cited by 22
Metadata
- Authors
- Xu, W., Tang, Q., Liu, J., Liu, Z., Zhou, Z., & Pham, D. T.
- Venue
- Robotics and Computer-Integrated Manufacturing
- Publisher
- Elsevier BV
- Published
- 2020-04
- Volume
- 62
- Pages
- 101860
- ISSN
- 0736-5845 (ISSN-L)
- OpenAlex
- W2981458859
- Cited by
- 182
- References
- 1
- FWCI
- 11.34
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Disassembly sequence planning using discrete Bees algorithm for human-robot collaboration in remanufacturing. https://app.cochat.ai/papers/10.1016/j.rcim.2019.101860
- The paper
- Xu, W., Tang, Q., Liu, J., Liu, Z., Zhou, Z., & Pham, D. T. (2020). Disassembly sequence planning using discrete Bees algorithm for human-robot collaboration in remanufacturing. Robotics and Computer-Integrated Manufacturing. https://doi.org/10.1016/j.rcim.2019.101860
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.