检索结果-内蒙古大学图书馆

Hybrid arithmetic-rider optimization algorithm as new intelligent model for travelling salesman problem

International Journal of Information Technology (Singapore) 2024年 1-18页

作者： Krishna, Madugula Murali Majhi, Santosh Kumar Panda, Nibedan Department of Computer Science and Engineering Veer Surendra Sai University of Technology Odisha Burla 768018 India Department of Computer Science and Information Technology Guru Ghasidas Viswavidyalaya C.G. Bilaspur India School of Computer Engineering KIIT Deemed to Be University Odisha Bhubaneswar 751024 India

Travelling Salesman Problem (TSP) is one of the significant NP-hard benchmark problems for performing discrete optimization. In recent times, determining the optimal route mechanism has been implemented and ensured as an important mechanism for solving practical applications. In real-time applications, energy-saving, reaching the destination at the assigned time, and identifying the shortest route is very essential. Route determination is researched by different scientists and engineers. Numerous research is done on this problem, and it is still challenging. Therefore, meta-heuristics are involved in this problem as it is inspired by the biological species. This article constitutes the continuation of the work on adapting the TSP using the hybridized algorithm named arithmetic-ROA (A-ROA). The ultimate aim of the proposed TSP is to reduce the distance travelled by the salesman while focusing on the entire city. To attain this optimal solution, the novel hybrid A-ROA optimizes the number of the city to be travelled. The results acquired by the new hybrid heuristic are compared with other heuristic algorithms. The computational results confirm that the developed algorithm obtained better results when compared with existing algorithms. The developed optimization algorithm also provides enhanced performance within a realistic amount of computational time. © The Author(s), under exclusive licence to Bharati Vidyapeeth's Institute of Computer Applications and Management 2024.

关键词： arithmetic optimization algorithm arithmetic-rider optimization algorithm Benchmark Datasets Meta-heuristic algorithms rider optimization algorithm Travelling Salesman Problem

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：