{"title":"Comparison of algorithms based on lightweight frame problems","authors":"Jian Zhang, Wei Ran, Xuemei Qi","doi":"10.1117/12.2671851","DOIUrl":null,"url":null,"abstract":"The weight reduction of the frame longitudinal beam directly affects the weight reduction of the frame. The intelligent algorithm is applied to the lightweight problem of the frame, and aimed to the area of the longitudinal beam section is optimized. The genetic algorithm, simulated annealing algorithm, particle swarm optimization algorithm and ant colony optimization are compared. The static working condition of the optimized frame is analyzed. The results show that all four algorithms can get the solution satisfying the constraint conditions, and the particle swarm optimization algorithm is the fastest, the simulated annealing algorithm is the slowest, and the other two algorithms are moderate. All four algorithms reduced the weight of the frame, the ant colony optimization reduced by 4.1%, and the other three ways reduced by 6.8%.","PeriodicalId":290902,"journal":{"name":"International Conference on Mechatronics Engineering and Artificial Intelligence","volume":"144 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Mechatronics Engineering and Artificial Intelligence","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1117/12.2671851","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
The weight reduction of the frame longitudinal beam directly affects the weight reduction of the frame. The intelligent algorithm is applied to the lightweight problem of the frame, and aimed to the area of the longitudinal beam section is optimized. The genetic algorithm, simulated annealing algorithm, particle swarm optimization algorithm and ant colony optimization are compared. The static working condition of the optimized frame is analyzed. The results show that all four algorithms can get the solution satisfying the constraint conditions, and the particle swarm optimization algorithm is the fastest, the simulated annealing algorithm is the slowest, and the other two algorithms are moderate. All four algorithms reduced the weight of the frame, the ant colony optimization reduced by 4.1%, and the other three ways reduced by 6.8%.