Repository logo
  • English
  • 中文
Log In
Have you forgotten your password?
  1. Home
  2. College of Engineering / 工學院
  3. Mechanical Engineering / 機械工程學系
  4. Multiple-Target selective disassembly sequence planning with disassembly sequence structure graphs
 
  • Details

Multiple-Target selective disassembly sequence planning with disassembly sequence structure graphs

Journal
ASME Design Engineering Technical Conference
Journal Volume
3
Journal Issue
PARTS A AND B
Pages
1305-1314
Date Issued
2012
Author(s)
Smith, S.
Chen, W.-H.
SHANA SMITH  
DOI
10.1115/DETC2012-70154
URI
https://scholars.lib.ntu.edu.tw/handle/123456789/448241
URL
https://www.scopus.com/inward/record.uri?eid=2-s2.0-84884608101&doi=10.1115%2fDETC2012-70154&partnerID=40&md5=44b23ec2965cff3a86d23329b50bef1f
Abstract
Modern green products must be easy to disassemble. Selective disassembly is used to access and remove specific product components for reuse, recycling, or remanufacturing. Early related studies developed various heuristic or graph-based approaches for single-Target selective disassembly. More recent research has progressed from single-Target to multiple-Target disassembly, but disassembly model complexity and multiple constraints, such as fastener constraints and disassembly directions, still have not been considered thoroughly. In this study, a new graph-based method using disassembly sequence structure graphs (DSSGs) was developed for multiple-Target selective disassembly sequence planning. The DSSGs are built using expert rules, which eliminate unrealistic solutions and minimize graph size, which reduces searching time. Two or more DSSGs are combined into one DSSG for accessing and removing multiple target components. In addition, a genetic algorithm is used to decode graphical DSSG information into disassembly sequences and optimize the results. Using a GA to optimize results also reduces searching time and improves overall performance, with respect to finding global optimal solutions. Case studies show that the developed method can efficiently find realistic near-optimal multiple-Target selective disassembly sequences for complex products. © 2012 by ASME.
Subjects
Disassembly sequence structure graph; Genetic algorithms; Multiple-Target components; Selective disassembly sequence planning
SDGs

[SDGs]SDG9

Other Subjects
Disassembly sequence; Disassembly sequence structure graphs; Global optimal solutions; Graph-based methods; Multiple constraint; Multiple-Target components; Selective disassembly sequence planning; Selective-disassembly; Computer aided design; Genetic algorithms; Graphic methods; Optimization
Type
conference paper

臺大位居世界頂尖大學之列,為永久珍藏及向國際展現本校豐碩的研究成果及學術能量,圖書館整合機構典藏(NTUR)與學術庫(AH)不同功能平台,成為臺大學術典藏NTU scholars。期能整合研究能量、促進交流合作、保存學術產出、推廣研究成果。

To permanently archive and promote researcher profiles and scholarly works, Library integrates the services of “NTU Repository” with “Academic Hub” to form NTU Scholars.

總館學科館員 (Main Library)
醫學圖書館學科館員 (Medical Library)
社會科學院辜振甫紀念圖書館學科館員 (Social Sciences Library)

開放取用是從使用者角度提升資訊取用性的社會運動,應用在學術研究上是透過將研究著作公開供使用者自由取閱,以促進學術傳播及因應期刊訂購費用逐年攀升。同時可加速研究發展、提升研究影響力,NTU Scholars即為本校的開放取用典藏(OA Archive)平台。(點選深入了解OA)

  • 請確認所上傳的全文是原創的內容,若該文件包含部分內容的版權非匯入者所有,或由第三方贊助與合作完成,請確認該版權所有者及第三方同意提供此授權。
    Please represent that the submission is your original work, and that you have the right to grant the rights to upload.
  • 若欲上傳已出版的全文電子檔,可使用Open policy finder網站查詢,以確認出版單位之版權政策。
    Please use Open policy finder to find a summary of permissions that are normally given as part of each publisher's copyright transfer agreement.
  • 網站簡介 (Quickstart Guide)
  • 使用手冊 (Instruction Manual)
  • 線上預約服務 (Booking Service)
  • 方案一:臺灣大學計算機中心帳號登入
    (With C&INC Email Account)
  • 方案二:ORCID帳號登入 (With ORCID)
  • 方案一:定期更新ORCID者,以ID匯入 (Search for identifier (ORCID))
  • 方案二:自行建檔 (Default mode Submission)
  • 方案三:學科館員協助匯入 (Email worklist to subject librarians)

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science