发布求助
文献互助 智能选刊 最新文献

Novel Trends in the Traveling Salesman Problem最新文献

筛选
英文 中文
CUDA Accelerated 2-OPT Local Search for the Traveling Salesman Problem 旅行商问题的CUDA加速2-OPT局部搜索
Novel Trends in the Traveling Salesman Problem Pub Date : 2020-09-03 DOI: 10.5772/intechopen.93125
D. Davendra, Magdalena Metlicka, M. Bialic-Davendra
{"title":"CUDA Accelerated 2-OPT Local Search for the Traveling Salesman Problem","authors":"D. Davendra, Magdalena Metlicka, M. Bialic-Davendra","doi":"10.5772/intechopen.93125","DOIUrl":"https://doi.org/10.5772/intechopen.93125","url":null,"abstract":"This research involves the development of a compute unified device architecture (CUDA) accelerated 2-opt local search algorithm for the traveling salesman problem (TSP). As one of the fundamental mathematical approaches to solving the TSP problem, the time complexity has generally reduced its efficiency, especially for large problem instances. Graphic processing unit (GPU) programming, especially CUDA has become more mainstream in high-performance computing (HPC) approaches and has made many intractable problems at least reasonably solvable in acceptable time. This chapter describes two CUDA accelerated 2-opt algorithms developed to solve the asymmetric TSP problem. Three separate hardware configurations were used to test the developed algorithms, and the results validate that the execution time decreased significantly, especially for the large problem instances when deployed on the GPU.","PeriodicalId":194549,"journal":{"name":"Novel Trends in the Traveling Salesman Problem","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127655505","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Comparative Study of Algorithms Metaheuristics Based Applied to the Solution of the Capacitated Vehicle Routing Problem 基于元启发式算法在有能力车辆路径问题求解中的比较研究
Novel Trends in the Traveling Salesman Problem Pub Date : 2020-05-12 DOI: 10.5772/intechopen.91972
Fernando Francisco Sandoya Sánchez, Carmen Andrea Letamendi Lazo, Fanny Yamel Sanabria Quiñónez
{"title":"Comparative Study of Algorithms Metaheuristics Based Applied to the Solution of the Capacitated Vehicle Routing Problem","authors":"Fernando Francisco Sandoya Sánchez, Carmen Andrea Letamendi Lazo, Fanny Yamel Sanabria Quiñónez","doi":"10.5772/intechopen.91972","DOIUrl":"https://doi.org/10.5772/intechopen.91972","url":null,"abstract":"This chapter presents the best-known heuristics and metaheuristics that are applied to solve the capacitated vehicle routing problem (CVRP), which is the generalization of the TSP, in which the nodes are visited by more than one route. To find out which algorithm obtains better results, there are 30 test instances used, which are grouped into 3 sets of problems according to the position of the nodes. The study begins with an economic impact analysis of the transportation sector in companies, which represents up to 20% of the final cost of the product. This case study focuses on the CVRP for its acronym capacitated vehicle routing problem, analyzing the best-known heuristics such as Clarke & Wright and sweep, and the algorithms GRASP and simulated annealing metaheuristics based.","PeriodicalId":194549,"journal":{"name":"Novel Trends in the Traveling Salesman Problem","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114792354","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Accelerating DNA Computing via PLP-qPCR Answer Read out to Solve Traveling Salesman Problems 通过PLP-qPCR答案读出加速DNA计算解决旅行商问题
Novel Trends in the Traveling Salesman Problem Pub Date : 2020-03-19 DOI: 10.5772/intechopen.91663
F. Xiong, M. Kuby, W. Frasch
{"title":"Accelerating DNA Computing via PLP-qPCR Answer Read out to Solve Traveling Salesman Problems","authors":"F. Xiong, M. Kuby, W. Frasch","doi":"10.5772/intechopen.91663","DOIUrl":"https://doi.org/10.5772/intechopen.91663","url":null,"abstract":"An asymmetric, fully-connected 8-city traveling salesman problem (TSP) was solved by DNA computing using the ordered node pair abundance (ONPA) approach through the use of pair ligation probe quantitative real time polymerase chain reaction (PLP-qPCR). The validity of using ONPA to derive the optimal answer was confirmed by in silico computing using a reverse-engineering method to reconstruct the complete tours in the feasible answer set from the measured ONPA. The high specificity of the sequence-tagged hybridization, and ligation that results from the use of PLPs significantly increased the accuracy of answer determination in DNA computing. When combined with the high throughput efficiency of qPCR, the time required to identify the optimal answer to the TSP was reduced from days to 25 min.","PeriodicalId":194549,"journal":{"name":"Novel Trends in the Traveling Salesman Problem","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114352605","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信