arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2303.16908cs.NEcs.AI
收藏

求解梁设计问题的混合ACO-CI算法

Hybrid ACO-CI Algorithm for Beam Design problems

Institute of Artificial Intelligence, Dr Vishwanath Karad MIT World Peace University(维什瓦纳特·卡拉德博士 MIT 世界和平大学人工智能研究所);Symbiosis Institute of Technology, Symbiosis International (Deemed University)(共生国际(视为大学)共生技术学院)

Ishaan R Kale, Mandar S Sapre, Ayush Khedkar, Kaustubh Dhamankar, Abhinav Anand, Aayushi Singh

摘要:

一系列复杂的现实问题激发了几种优化方法的发展。在这里,一种新的混合版本的蚁群优化(ACO)方法开发使用的队列智能(CI)算法的样本空间减少技术。开发了该算法,并通过求解35个标准基准测试函数来测试其准确性。此外,约束版本的算法被用来解决两个机械设计问题,包括阶梯悬臂梁和工字形截面梁。所提出的解决方案的技术的有效性进行评估相对于当代算法的方法,已经在使用中。结果表明,我们提出的混合ACO-CI算法将采取更少的迭代次数,以产生所需的输出,这意味着更少的计算时间。与现有算法相比,本文提出的混合ACO-CI算法在阶梯悬臂梁重量最小化和工字形截面梁挠度最小化方面取得了最好的结果。拟议的工作可以调查多样化的现实世界中的应用,包括工程领域,组合和医疗保健问题。

英文摘要:

A range of complicated real-world problems have inspired the development of several optimization methods. Here, a novel hybrid version of the Ant colony optimization (ACO) method is developed using the sample space reduction technique of the Cohort Intelligence (CI) Algorithm. The algorithm is developed, and accuracy is tested by solving 35 standard benchmark test functions. Furthermore, the constrained version of the algorithm is used to solve two mechanical design problems involving stepped cantilever beams and I-section beams. The effectiveness of the proposed technique of solution is evaluated relative to contemporary algorithmic approaches that are already in use. The results show that our proposed hybrid ACO-CI algorithm will take lesser number of iterations to produce the desired output which means lesser computational time. For the minimization of weight of stepped cantilever beam and deflection in I-section beam a proposed hybrid ACO-CI algorithm yielded best results when compared to other existing algorithms. The proposed work could be investigate for variegated real world applications encompassing domains of engineering, combinatorial and health care problems.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑