A New Hybrid Method Based on Nearest Neighbor Algorithm and 2-Opt Algorithm for Traveling Salesman Problem

D. Nuraiman, F. Ilahi, Yushinta Dewi, E. A. Z. Hamidi
{"title":"A New Hybrid Method Based on Nearest Neighbor Algorithm and 2-Opt Algorithm for Traveling Salesman Problem","authors":"D. Nuraiman, F. Ilahi, Yushinta Dewi, E. A. Z. Hamidi","doi":"10.1109/ICWT.2018.8527878","DOIUrl":null,"url":null,"abstract":"Traveling salesman problem has been one of the mostly studied problems in combinatorial optimization. This paper proposes a new hybrid method combining the nearest neighbor algorithm and the 2-opt algorithm. The performance of this method has been tested to several benchmark problems from TSPLIB involving 11 instances of symmetric problems and three instances of asymmetric problems with various number of nodes from 17 to 783 nodes. The results show that the hybrid method can reduce the relative error significantly compared to the nearest neighbor algorithm only.","PeriodicalId":356888,"journal":{"name":"2018 4th International Conference on Wireless and Telematics (ICWT)","volume":"9 3","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 4th International Conference on Wireless and Telematics (ICWT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICWT.2018.8527878","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Traveling salesman problem has been one of the mostly studied problems in combinatorial optimization. This paper proposes a new hybrid method combining the nearest neighbor algorithm and the 2-opt algorithm. The performance of this method has been tested to several benchmark problems from TSPLIB involving 11 instances of symmetric problems and three instances of asymmetric problems with various number of nodes from 17 to 783 nodes. The results show that the hybrid method can reduce the relative error significantly compared to the nearest neighbor algorithm only.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于最近邻算法和2-Opt算法的旅行商问题混合求解方法
旅行商问题一直是组合优化中研究最多的问题之一。本文提出了一种结合最近邻算法和2-opt算法的混合算法。该方法的性能已经在TSPLIB的几个基准问题中进行了测试,其中包括11个对称问题和3个非对称问题,节点数量从17到783不等。结果表明,与仅采用最近邻算法相比,混合方法能显著降低相对误差。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Quantum Key Distribution (QKD) Protocols: A Survey Designing Electronic Module on Synthetic Polymer Material Based on Green Chemistry Proximity-Coupled Multiband Substrate Integrated Waveguide Antenna with Defected Ground Structure System Design of Controlling and Monitoring on Aquaponic Based on Internet of Things Design and Implementation of SDR-Based GSM Mobile BTS for Remote and Disaster Affected Areas
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1