Generating Optimal Disassembly Process Plans from AND/OR Relationships using a Hierarchical Genetic Algorithm
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Edmunds, R. | - |
| dc.contributor.author | Kobayashi, M. | - |
| dc.contributor.author | Higashi, M. | - |
| dc.date.accessioned | 2011-05-16T02:16:26Z | - |
| dc.date.available | 2011-05-16T02:16:26Z | - |
| dc.date.issued | 2011 | - |
| dc.identifier.citation | 21st CIRP Design Conference | en |
| dc.identifier.uri | http://hdl.handle.net/10203/23645 | - |
| dc.description.abstract | 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. | en |
| dc.language.iso | en_US | en |
| dc.publisher | CIRP | en |
| dc.subject | Disassembly | en |
| dc.subject | AND/OR Graph | en |
| dc.subject | Numerical Optimization | en |
| dc.subject | Hierarchical Structure | en |
| dc.title | Generating Optimal Disassembly Process Plans from AND/OR Relationships using a Hierarchical Genetic Algorithm | en |
| dc.type | Article | en |
- 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
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.