Searching for the Optimal Arrangement of Mistuned Blades Based on Solving the Traveling Salesman Problem for Simple Mass-Spring Linear System

N. Serebriakov, A. Selivanov
{"title":"Searching for the Optimal Arrangement of Mistuned Blades Based on Solving the Traveling Salesman Problem for Simple Mass-Spring Linear System","authors":"N. Serebriakov, A. Selivanov","doi":"10.1115/gt2021-59927","DOIUrl":null,"url":null,"abstract":"\n The article presents an approach to finding the optimal arrangement of blades in a bladed disk based on solving the traveling salesman problem using the ant colony algorithm. The solution to the problem is presented for an equivalent model of the bladed disk. The mistuning parameters are assumed as known — for example, from the data of geometric measurements for each blade from the set used for assembling the bladed disk — considering the influence of the rotation on the investigated resonance mode.\n Approaches have already been published for the construction of equivalent models and the use of combinatorial optimization methods, including solving the traveling salesman problem, to find the optimal arrangement of the blades. Therefore, this article focuses on demonstrating a simple program implementation of this method.\n This approach allows a quick assessment of the effect of the blade assembly in the bladed disk on the amplitudes of alternating stresses. It even considers several restarts of the algorithm to determine other possible configurations of the system.","PeriodicalId":143309,"journal":{"name":"Volume 9B: Structures and Dynamics — Fatigue, Fracture, and Life Prediction; Probabilistic Methods; Rotordynamics; Structural Mechanics and Vibration","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Volume 9B: Structures and Dynamics — Fatigue, Fracture, and Life Prediction; Probabilistic Methods; Rotordynamics; Structural Mechanics and Vibration","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1115/gt2021-59927","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The article presents an approach to finding the optimal arrangement of blades in a bladed disk based on solving the traveling salesman problem using the ant colony algorithm. The solution to the problem is presented for an equivalent model of the bladed disk. The mistuning parameters are assumed as known — for example, from the data of geometric measurements for each blade from the set used for assembling the bladed disk — considering the influence of the rotation on the investigated resonance mode. Approaches have already been published for the construction of equivalent models and the use of combinatorial optimization methods, including solving the traveling salesman problem, to find the optimal arrangement of the blades. Therefore, this article focuses on demonstrating a simple program implementation of this method. This approach allows a quick assessment of the effect of the blade assembly in the bladed disk on the amplitudes of alternating stresses. It even considers several restarts of the algorithm to determine other possible configurations of the system.
基于求解简单质量-弹簧线性系统旅行商问题的失谐叶片优化布置
本文在求解旅行商问题的基础上,提出了一种利用蚁群算法求解叶片圆盘最优排列的方法。给出了叶片盘等效模型的求解方法。考虑到旋转对所研究的共振模式的影响,假设失谐参数是已知的-例如,从用于组装叶片盘的集合中每个叶片的几何测量数据。已经发表了建立等效模型和使用组合优化方法的方法,包括解决旅行推销员问题,以找到叶片的最佳布置。因此,本文将重点演示该方法的一个简单程序实现。这种方法可以快速评估叶片组合在叶片盘上对交变应力幅值的影响。它甚至考虑多次重新启动算法,以确定系统的其他可能配置。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信