Stochastic Hybrid Discrete Grey Wolf Optimizer for Multi-Objective Disassembly Sequencing and Line Balancing Planning in Disassembling Multiple Products
The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Abstract
Recycling, reusing, and remanufacturing of end-of-life (EOL) products have been receiving increasing attention. They effectively preserve the ecological environment and promote the development of economy. Disassembly sequencing and line balancing problems are indispensable to recycling and remanufacturing EOL products. A set of subassemblies can be obtained by disassembling an EOL product. In practice, there are many different types of EOL products that can be disassembled on a disassembly line, and a high-level uncertainty exists in the disassembly process of those EOL products. Hence, this paper proposes a stochastic multi-product multi-objective disassembly-sequencing-line-balancing problem aiming at maximizing disassembly profit and minimizing energy consumption and carbon emission. A simulated annealing and multi-objective discrete grey wolf optimizer with a stochastic simulation approach is proposed. Furthermore, real cases are used to examine the efficiency and feasibility of the proposed algorithm. Comparisons with multi-objective discrete grey wolf optimization, non-dominated sorting genetic algorithm II, Multi-population multi-objective evolutionary algorithm, and multi-objective evolutionary algorithm demonstrate the superiority of the proposed approach.Note to Practitioners—Disassembly line balancing has been widely recognized as the most ecological way of retrieving EOL products. Through in-depth research, we present a Stochastic Multi-product Multi-objective Disassembly-sequencing-line-balancing Problem. Furthermore, we consider that the uncertainty of products might cause disassembly failure. To solve this problem effectively and quickly, we combine the simulated annealing algorithm with the Grey Wolf Optimizer. The results show that the algorithm can effectively solve the proposed problem. The disassembly scheme provided by the obtained solution set offers a variety of options for decision-makers.
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 7×
“In addition, from experimental results and comparing with MDGWO [31], nondominated sorting genetic algorithm II (NSGAII) [32], Multi-population multiobjective evolutionary algorithm (MPMOEA) [33] and multi-”
InfluentialMOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition
Zhang, Q., & Li, H. (2007) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2007.892759 · Cited by 10,069 · cited 1×
“objective evolutionary algorithm based on decomposition (MOEA/D) [34], the effectiveness and feasibility of the”
MethodPhylogeographic history of grey wolves in Europe
Pilot, M., Branicki, W., Jędrzejewski, W., Goszczyński, J., Jędrzejewska, B., Dykyy, I., Shkvyrya, M., & Tsingarska, E. (2010) · BMC Evolutionary Biology · doi:10.1186/1471-2148-10-104 · Cited by 158
Biobjective Task Scheduling for Distributed Green Data Centers
Yuan, H., Bi, J., Zhou, M., Liu, Q., & Ammari, A. C. (2021) · IEEE Transactions on Automation Science and Engineering · doi:10.1109/tase.2019.2958979 · Cited by 138 · cited 1×
“directions: 1) we will develop more powerful intelligent optimization algorithms [51]–[61] and machine learning”
Background
Metadata
- Authors
- Guo, X., Zhang, Z., Qi, L., Liu, S., Tang, Y., & Zhao, Z.
- Venue
- IEEE Transactions on Automation Science and Engineering
- Published
- 2022-07
- Volume
- 19
- Issue
- 3
- Pages
- 1744-1756
- ISSN
- 1545-5955 (ISSN-L)
- 1558-3783
- OpenAlex
- W4205286934
- Cited by
- 169
- References
- 4
- FWCI
- 17.43
- 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
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.