书目名称 | Optimisation of Robotic Disassembly for Remanufacturing |
编辑 | Yuanjun Laili,Yongjing Wang,Duc Truong Pham |
视频video | |
概述 | Explores the issues and optimisation requirements related to the use of robotics in disassembly processes.Offers a blueprint for modelling problems in robotic disassembly and remanufacturing.Explains |
丛书名称 | Springer Series in Advanced Manufacturing |
图书封面 |  |
描述 | .This book illustrates the main characteristics, challenges and optimisation requirements of robotic disassembly. It provides a comprehensive insight on two crucial optimisation problems in the areas of robotic disassembly through a group of unified mathematical models. The online and offline optimisation of the operational sequence to dismantle a product, for example, is represented with a list of conflicting objectives and constraints. It allows the decision maker and the robots to match the situation automatically and efficiently..To identify a generic solution under different circumstances, classical metaheuristics that can be used for the optimisation of robotic disassembly are introduced in detail. A flexible framework is then presented to implement existing metaheuristics for sequence planning and line balancing in the circumstance of robotic disassembly. ..Optimisation of Robotic Disassembly for Remanufacturing. provides practical case studies on typicalproduct instances to help practitioners design efficient robotic disassembly with minimal manual operation, and offers comparisons of the state-of-the-art metaheuristics on solving the key optimisation problems. Therefore, i |
出版日期 | Book 2022 |
关键词 | Remanufacturing; Robotic Disassembly; Metaheuristics; Sequence Planning; Line Balancing; Optimization Pro |
版次 | 1 |
doi | https://doi.org/10.1007/978-3-030-81799-2 |
isbn_softcover | 978-3-030-81801-2 |
isbn_ebook | 978-3-030-81799-2Series ISSN 1860-5168 Series E-ISSN 2196-1735 |
issn_series | 1860-5168 |
copyright | The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerl |