Optimal disassembly sequence using genetic algorithms considering economic and environmental aspects

K. K. Seo, J. H. Park, D. S. Jang

Research output: Contribution to journalArticlepeer-review

74 Citations (Scopus)


In this paper, a genetic algorithm (GA)-based approach for an optimal disassembly sequence considering economic and environmental aspects is presented. All feasible disassembly sequences are generated by a disassembly tree or an AND/OR graph. Using the disassembly precedence and the disassembly value matrix, a disassembly sequence is optimised. The precedence of disassembly is determined through a disassembly tree or an AND/OR graph and the value of disassembly is induced by considering both economic and environmental aspects in the disassembly, recycling, and disposal phases. Economic and environmental factors can be compared by the same measure through converting environmental factors into economic cost. To solve the disassembly sequence problem, a heuristic algorithm based on GAs is developed. The proposed GA can search for and dynamically explore the disassembly node through the highest disassembly value, keeping their precedence in order to identify an optimal disassembly sequence. It can also help to explore the search space, and an optimal solution can be obtained by applying the optimisation criteria. A refrigerator is used as an example to illustrate the procedure.

Original languageEnglish
Pages (from-to)371-380
Number of pages10
JournalInternational Journal of Advanced Manufacturing Technology
Issue number5
Publication statusPublished - 2001


  • Environment
  • Genetic algorithms
  • Optimal disassembly sequence
  • Recycling

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Software
  • Mechanical Engineering
  • Computer Science Applications
  • Industrial and Manufacturing Engineering


Dive into the research topics of 'Optimal disassembly sequence using genetic algorithms considering economic and environmental aspects'. Together they form a unique fingerprint.

Cite this