Generating Optimal Disassembly Process Plans from AND/OR Relationships using a Hierarchical Genetic Algorithm

A Hierarchical Genetic Algorithm (HGA) is presented which, not only successfully finds the optimal disassembly sequence – under a set of given criteria – using information derived from AND/OR relationships, but also reduces the problem size. Whilst many authors agree that AND/OR graphs are the most complete representation of Disassembly Process Plans (DPPs), few have generated optimal sequences from AND/OR information due to the rapid increase of solution paths. For complex systems having a natural hierarchical structure often the optimal solution can be missed, HGA overcomes this and has been proven to be faster and more accurate than traditional Genetic Algorithms.
Publisher
CIRP
Issue Date
2011
Keywords

Disassembly; AND/OR Graph; Numerical Optimization; Hierarchical Structure

Citation

21st CIRP Design Conference

URI
http://hdl.handle.net/10203/23645
Appears in Collection
Proceedings of the 21st CIRP Design Conference
Files in This Item
CIRP-Design-2011-Paper3-Edmunds-et-al.pdf(827.93 kB)Download
  • Hit : 207
  • Download : 154
  • Cited 0 times in thomson ci

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0