Disassembly sequence planning using a Simplified Teaching-Learning-Based Optimization algorithm

K. Xia, L. Gao, Weidong Li, Kuo-Ming Chao

    Research output: Contribution to journalArticle

    37 Citations (Scopus)

    Abstract

    Disassembly Sequence Planning (DSP) is a challenging NP-hard combinatorial optimization problem. As a new and promising population-based evolutional algorithm, the Teaching-Learning-Based Optimization (TLBO) algorithm has been successfully applied to various research problems. However, TLBO is not capable or effective in DSP optimization problems with discrete solution spaces and complex disassembly precedence constraints. This paper presents a Simplified Teaching-Learning-Based Optimization (STLBO) algorithm for solving DSP problems effectively. The STLBO algorithm inherits the main idea of the teaching-learning-based evolutionary mechanism from the TLBO algorithm, while the realization method for the evolutionary mechanism and the adaptation methods for the algorithm parameters are different. Three new operators are developed and incorporated in the STLBO algorithm to ensure its applicability to DSP problems with complex disassembly precedence constraints: i.e., a Feasible Solution Generator (FSG) used to generate a feasible disassembly sequence, a Teaching Phase Operator (TPO) and a Learning Phase Operator (LPO) used to learn and evolve the solutions towards better ones by applying the method of precedence preservation crossover operation. Numerical experiments with case studies on waste product disassembly planning have been carried out to demonstrate the effectiveness of the designed operators and the results exhibited that the developed algorithm performs better than other relevant algorithms under a set of public benchmarks.
    Original languageEnglish
    Pages (from-to)518–527
    JournalAdvanced Engineering Informatics
    Volume28
    Issue number4
    Early online date11 Aug 2014
    DOIs
    Publication statusPublished - Oct 2014

    Fingerprint

    Teaching
    Planning
    Mathematical operators
    Combinatorial optimization
    Experiments

    Bibliographical note

    The full text of this item is not available from the repository.

    Keywords

    • disassembly
    • disassembly sequence planning
    • meta-heuristics
    • simplified teaching-learning-based optimization
    • teaching-learning-based optimization

    Cite this

    Disassembly sequence planning using a Simplified Teaching-Learning-Based Optimization algorithm. / Xia, K.; Gao, L.; Li, Weidong; Chao, Kuo-Ming.

    In: Advanced Engineering Informatics, Vol. 28, No. 4, 10.2014, p. 518–527.

    Research output: Contribution to journalArticle

    @article{e04af2508ee84b919910f8153b859791,
    title = "Disassembly sequence planning using a Simplified Teaching-Learning-Based Optimization algorithm",
    abstract = "Disassembly Sequence Planning (DSP) is a challenging NP-hard combinatorial optimization problem. As a new and promising population-based evolutional algorithm, the Teaching-Learning-Based Optimization (TLBO) algorithm has been successfully applied to various research problems. However, TLBO is not capable or effective in DSP optimization problems with discrete solution spaces and complex disassembly precedence constraints. This paper presents a Simplified Teaching-Learning-Based Optimization (STLBO) algorithm for solving DSP problems effectively. The STLBO algorithm inherits the main idea of the teaching-learning-based evolutionary mechanism from the TLBO algorithm, while the realization method for the evolutionary mechanism and the adaptation methods for the algorithm parameters are different. Three new operators are developed and incorporated in the STLBO algorithm to ensure its applicability to DSP problems with complex disassembly precedence constraints: i.e., a Feasible Solution Generator (FSG) used to generate a feasible disassembly sequence, a Teaching Phase Operator (TPO) and a Learning Phase Operator (LPO) used to learn and evolve the solutions towards better ones by applying the method of precedence preservation crossover operation. Numerical experiments with case studies on waste product disassembly planning have been carried out to demonstrate the effectiveness of the designed operators and the results exhibited that the developed algorithm performs better than other relevant algorithms under a set of public benchmarks.",
    keywords = "disassembly, disassembly sequence planning, meta-heuristics, simplified teaching-learning-based optimization, teaching-learning-based optimization",
    author = "K. Xia and L. Gao and Weidong Li and Kuo-Ming Chao",
    note = "The full text of this item is not available from the repository.",
    year = "2014",
    month = "10",
    doi = "10.1016/j.aei.2014.07.006",
    language = "English",
    volume = "28",
    pages = "518–527",
    journal = "Advanced Engineering Informatics",
    issn = "1474-0346",
    publisher = "Elsevier",
    number = "4",

    }

    TY - JOUR

    T1 - Disassembly sequence planning using a Simplified Teaching-Learning-Based Optimization algorithm

    AU - Xia, K.

    AU - Gao, L.

    AU - Li, Weidong

    AU - Chao, Kuo-Ming

    N1 - The full text of this item is not available from the repository.

    PY - 2014/10

    Y1 - 2014/10

    N2 - Disassembly Sequence Planning (DSP) is a challenging NP-hard combinatorial optimization problem. As a new and promising population-based evolutional algorithm, the Teaching-Learning-Based Optimization (TLBO) algorithm has been successfully applied to various research problems. However, TLBO is not capable or effective in DSP optimization problems with discrete solution spaces and complex disassembly precedence constraints. This paper presents a Simplified Teaching-Learning-Based Optimization (STLBO) algorithm for solving DSP problems effectively. The STLBO algorithm inherits the main idea of the teaching-learning-based evolutionary mechanism from the TLBO algorithm, while the realization method for the evolutionary mechanism and the adaptation methods for the algorithm parameters are different. Three new operators are developed and incorporated in the STLBO algorithm to ensure its applicability to DSP problems with complex disassembly precedence constraints: i.e., a Feasible Solution Generator (FSG) used to generate a feasible disassembly sequence, a Teaching Phase Operator (TPO) and a Learning Phase Operator (LPO) used to learn and evolve the solutions towards better ones by applying the method of precedence preservation crossover operation. Numerical experiments with case studies on waste product disassembly planning have been carried out to demonstrate the effectiveness of the designed operators and the results exhibited that the developed algorithm performs better than other relevant algorithms under a set of public benchmarks.

    AB - Disassembly Sequence Planning (DSP) is a challenging NP-hard combinatorial optimization problem. As a new and promising population-based evolutional algorithm, the Teaching-Learning-Based Optimization (TLBO) algorithm has been successfully applied to various research problems. However, TLBO is not capable or effective in DSP optimization problems with discrete solution spaces and complex disassembly precedence constraints. This paper presents a Simplified Teaching-Learning-Based Optimization (STLBO) algorithm for solving DSP problems effectively. The STLBO algorithm inherits the main idea of the teaching-learning-based evolutionary mechanism from the TLBO algorithm, while the realization method for the evolutionary mechanism and the adaptation methods for the algorithm parameters are different. Three new operators are developed and incorporated in the STLBO algorithm to ensure its applicability to DSP problems with complex disassembly precedence constraints: i.e., a Feasible Solution Generator (FSG) used to generate a feasible disassembly sequence, a Teaching Phase Operator (TPO) and a Learning Phase Operator (LPO) used to learn and evolve the solutions towards better ones by applying the method of precedence preservation crossover operation. Numerical experiments with case studies on waste product disassembly planning have been carried out to demonstrate the effectiveness of the designed operators and the results exhibited that the developed algorithm performs better than other relevant algorithms under a set of public benchmarks.

    KW - disassembly

    KW - disassembly sequence planning

    KW - meta-heuristics

    KW - simplified teaching-learning-based optimization

    KW - teaching-learning-based optimization

    U2 - 10.1016/j.aei.2014.07.006

    DO - 10.1016/j.aei.2014.07.006

    M3 - Article

    VL - 28

    SP - 518

    EP - 527

    JO - Advanced Engineering Informatics

    JF - Advanced Engineering Informatics

    SN - 1474-0346

    IS - 4

    ER -