面向装配序列规划的新型装配序列设计机制

2020 IEEE 7th International Conference on Industrial Engineering and Applications (ICIEA) Pub Date : 2020-04-01 DOI:10.1109/ICIEA49774.2020.9102101

Nan Zhang, Zhen-yu Liu, Chan Qiu, Jianrong Tan

{"title":"面向装配序列规划的新型装配序列设计机制","authors":"Nan Zhang, Zhen-yu Liu, Chan Qiu, Jianrong Tan","doi":"10.1109/ICIEA49774.2020.9102101","DOIUrl":null,"url":null,"abstract":"Assembly sequence planning is a combinatorial optimization problem and plays a vital role in assembly process. In this article, a novel and simple sequence design mechanism is proposed to deal with assembly sequence planning problem. The proposed method combines assembly subset detection method with the characteristic of assembly sequence and uses precedence constraints to guarantee the feasibility of the assembly sequence. The method is compared with different popular metaheuristic algorithms and is verified to be successful in obtaining the optimal assembly sequence for complex assembly products.","PeriodicalId":306461,"journal":{"name":"2020 IEEE 7th International Conference on Industrial Engineering and Applications (ICIEA)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"A Novel Assembly Sequence Design Mechanism for Assembly Sequence Planning\",\"authors\":\"Nan Zhang, Zhen-yu Liu, Chan Qiu, Jianrong Tan\",\"doi\":\"10.1109/ICIEA49774.2020.9102101\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Assembly sequence planning is a combinatorial optimization problem and plays a vital role in assembly process. In this article, a novel and simple sequence design mechanism is proposed to deal with assembly sequence planning problem. The proposed method combines assembly subset detection method with the characteristic of assembly sequence and uses precedence constraints to guarantee the feasibility of the assembly sequence. The method is compared with different popular metaheuristic algorithms and is verified to be successful in obtaining the optimal assembly sequence for complex assembly products.\",\"PeriodicalId\":306461,\"journal\":{\"name\":\"2020 IEEE 7th International Conference on Industrial Engineering and Applications (ICIEA)\",\"volume\":\"10 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 IEEE 7th International Conference on Industrial Engineering and Applications (ICIEA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICIEA49774.2020.9102101\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE 7th International Conference on Industrial Engineering and Applications (ICIEA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIEA49774.2020.9102101","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 4

摘要

装配顺序规划是一个组合优化问题，在装配过程中起着至关重要的作用。本文提出了一种新的、简单的序列设计机制来解决装配序列规划问题。该方法将装配子集检测方法与装配序列的特性相结合，利用优先约束来保证装配序列的可行性。将该方法与各种常用的元启发式算法进行了比较，验证了该方法能够成功地求解复杂装配产品的最优装配序列。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A Novel Assembly Sequence Design Mechanism for Assembly Sequence Planning

Assembly sequence planning is a combinatorial optimization problem and plays a vital role in assembly process. In this article, a novel and simple sequence design mechanism is proposed to deal with assembly sequence planning problem. The proposed method combines assembly subset detection method with the characteristic of assembly sequence and uses precedence constraints to guarantee the feasibility of the assembly sequence. The method is compared with different popular metaheuristic algorithms and is verified to be successful in obtaining the optimal assembly sequence for complex assembly products.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2020 IEEE 7th International Conference on Industrial Engineering and Applications (ICIEA)

自引率

0.00%

发文量