Comparison of Heuristic techniques:A case of TSP

Shruti Gupta, A. Rana, Vineet Kansal
{"title":"Comparison of Heuristic techniques:A case of TSP","authors":"Shruti Gupta, A. Rana, Vineet Kansal","doi":"10.1109/Confluence47617.2020.9058211","DOIUrl":null,"url":null,"abstract":"In the current scenario, heuristic approaches are broadly used in research in interdisciplinary categories. Heuristic Algorithms are used to get better and optimized results. the limitations are occur when we have to do selective and situational use of the algorithms amongst the all. In this paper we compared the results of Genetic Algorithm, Harmony Search and Firefly Algorithm on one of the popular problem Travelling Salesman problem(TSP). On TSP we proposed our own algorithm for the optimized cost of length of the tour.","PeriodicalId":180005,"journal":{"name":"2020 10th International Conference on Cloud Computing, Data Science & Engineering (Confluence)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"28","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 10th International Conference on Cloud Computing, Data Science & Engineering (Confluence)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/Confluence47617.2020.9058211","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 28

Abstract

In the current scenario, heuristic approaches are broadly used in research in interdisciplinary categories. Heuristic Algorithms are used to get better and optimized results. the limitations are occur when we have to do selective and situational use of the algorithms amongst the all. In this paper we compared the results of Genetic Algorithm, Harmony Search and Firefly Algorithm on one of the popular problem Travelling Salesman problem(TSP). On TSP we proposed our own algorithm for the optimized cost of length of the tour.
启发式技术的比较:以TSP为例
在目前的情况下,启发式方法被广泛应用于跨学科范畴的研究。启发式算法用于获得更好的优化结果。当我们必须在所有算法中选择和情境使用时,限制就会出现。本文比较了遗传算法、和谐搜索算法和萤火虫算法对旅行商问题(TSP)的求解结果。在TSP上,我们提出了自己的算法来优化行程长度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信