{"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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
