Disassembly sequence planning using a Simplified Teaching-Learning-Based Optimization algorithm
- Submitting institution
-
Coventry University
- Unit of assessment
- 12 - Engineering
- Output identifier
- 11564601
- Type
- D - Journal article
- DOI
-
10.1016/j.aei.2014.07.006
- Title of journal
- Advanced Engineering Informatics
- Article number
- -
- First page
- 518
- Volume
- 28
- Issue
- 4
- ISSN
- 1474-0346
- Open access status
- Out of scope for open access requirements
- Month of publication
- August
- Year of publication
- 2014
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
3
- Research group(s)
-
-
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This research is based on an EU funded project to address complex Disassembly Sequence Planning (DSP) cases which are considered as an NP-hard combinatorial optimization problem. We solve this by developing a new Simplified Teaching–Learning-Based Optimization (STLBO) algorithm to ensure its improvement to DSP problems with complex disassembly precedence constraints. The first of its kind. The method was evaluated by two waste product disassembly cases to prove the effectiveness of the designed operators, it outperforms other relevant algorithms under a set of benchmarks. It changes the way of planning disassembly sequences in recycle and applying TLBO method. https://doi.org/10.1016/j.resconrec.2018.04.025m; https://doi.org/10.1016/j.amc.2015.05.012
https://doi.org/10.1016/j.amc.2015.05.012
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -