Genetic Bat Algorithm-Based Multi-Objective Selective Disassembly Sequence Planning

Zhi Gang Xu
{"title":"Genetic Bat Algorithm-Based Multi-Objective Selective Disassembly Sequence Planning","authors":"Zhi Gang Xu","doi":"10.4028/p-pw66ig","DOIUrl":null,"url":null,"abstract":"The genetic bat algorithm is being actively investigated for its application in the complex multi-objective product selective disassembly sequence planning problem. To broaden the scope of the search space and enhance the overall search efficiency, the traditional bat algorithm has undergone discretization, incorporating a cross-mutation mechanism into the construction of the fitness function model. To assess the efficacy of this novel approach, an industrial mechanical arm is utilized as a representative case study. Upon comparison with the traditional bat algorithm, the proposed method exhibits shorter convergence times across a range of population sizes, thus validating its effectiveness.","PeriodicalId":512976,"journal":{"name":"Engineering Headway","volume":"32 17","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Engineering Headway","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4028/p-pw66ig","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The genetic bat algorithm is being actively investigated for its application in the complex multi-objective product selective disassembly sequence planning problem. To broaden the scope of the search space and enhance the overall search efficiency, the traditional bat algorithm has undergone discretization, incorporating a cross-mutation mechanism into the construction of the fitness function model. To assess the efficacy of this novel approach, an industrial mechanical arm is utilized as a representative case study. Upon comparison with the traditional bat algorithm, the proposed method exhibits shorter convergence times across a range of population sizes, thus validating its effectiveness.
基于遗传蝙蝠算法的多目标选择性拆卸序列规划
遗传蝙蝠算法在复杂的多目标产品选择性拆卸序列规划问题中的应用正受到积极研究。为了扩大搜索空间范围并提高整体搜索效率,传统的蝙蝠算法进行了离散化处理,在构建适应度函数模型时加入了交叉突变机制。为了评估这种新方法的有效性,我们利用一个工业机械臂作为代表性案例进行了研究。与传统的蝙蝠算法相比,所提出的方法在不同种群规模下的收敛时间更短,从而验证了其有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信