A New Crab Shell Search Algorithm for Optimal Assembly Sequence Generation

G. B. Murali, B. Biswal, B. Deepak, A. Rout, Golak Bihari Mohanta
{"title":"A New Crab Shell Search Algorithm for Optimal Assembly Sequence Generation","authors":"G. B. Murali, B. Biswal, B. Deepak, A. Rout, Golak Bihari Mohanta","doi":"10.1109/IEMECONX.2019.8877041","DOIUrl":null,"url":null,"abstract":"Assembly Sequence Planning (ASP) problem is one of the multi-objective optimization problems, where more than one objective function has to optimize to obtain quality optimal sequence. Initially, for ASP problem researchers applied mathematical models to obtain optimal sequences. Later, soft computing techniques are developed to obtain the optimal assembly sequences due to its ease ness in implementation. At the same time, some of the researchers developed CAD based and knowledge-based methods to obtain the optimal sequences, which consumes more search space during execution of the algorithm. Keeping the above considerations in mind and the advantages with artificial intelligence techniques, in this paper a new algorithm namely Crab Shell Search (CSS) algorithm has been proposed to obtain the optimal assembly sequences. This algorithm is developed mainly based on how the crab will search for a suitable shell in the shore to survive from the foreign bodies. The proposed methodology is applied to the different industrial products, the results obtained from the algorithm are compared with different well-known algorithms like Genetic Algorithm (GA), Ant Colony optimization (ACO) Algorithm, Enhanced Genetic Algorithm (EGA) and Memetic Algorithm (MA) to test the performance of the algorithm.","PeriodicalId":358845,"journal":{"name":"2019 9th Annual Information Technology, Electromechanical Engineering and Microelectronics Conference (IEMECON)","volume":"93 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 9th Annual Information Technology, Electromechanical Engineering and Microelectronics Conference (IEMECON)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IEMECONX.2019.8877041","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Assembly Sequence Planning (ASP) problem is one of the multi-objective optimization problems, where more than one objective function has to optimize to obtain quality optimal sequence. Initially, for ASP problem researchers applied mathematical models to obtain optimal sequences. Later, soft computing techniques are developed to obtain the optimal assembly sequences due to its ease ness in implementation. At the same time, some of the researchers developed CAD based and knowledge-based methods to obtain the optimal sequences, which consumes more search space during execution of the algorithm. Keeping the above considerations in mind and the advantages with artificial intelligence techniques, in this paper a new algorithm namely Crab Shell Search (CSS) algorithm has been proposed to obtain the optimal assembly sequences. This algorithm is developed mainly based on how the crab will search for a suitable shell in the shore to survive from the foreign bodies. The proposed methodology is applied to the different industrial products, the results obtained from the algorithm are compared with different well-known algorithms like Genetic Algorithm (GA), Ant Colony optimization (ACO) Algorithm, Enhanced Genetic Algorithm (EGA) and Memetic Algorithm (MA) to test the performance of the algorithm.
装配序列最优生成的蟹壳搜索算法
装配序列规划问题是一种多目标优化问题,需要对多个目标函数进行优化才能得到质量最优的装配序列。最初,对于ASP问题,研究人员采用数学模型来获得最优序列。后来,由于易于实现,人们发展了软计算技术来获得最优装配序列。同时,一些研究人员开发了基于CAD和基于知识的方法来获得最优序列,这在算法执行过程中消耗了更多的搜索空间。基于以上考虑,结合人工智能技术的优势,本文提出了一种求解最优装配序列的新算法——蟹壳搜索(CSS)算法。该算法主要是基于螃蟹如何在岸上寻找合适的外壳以从异物中生存而开发的。将所提出的方法应用于不同的工业产品,并与遗传算法(GA)、蚁群优化算法(ACO)、增强型遗传算法(EGA)和模因算法(MA)等不同的知名算法进行了比较,以检验算法的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信