The Traveling Salesman Problem (TSP): A Spatial Navigation Task for Rats. [PDF]
Bio Protoc, 2018 The Traveling Salesman Problem (TSP) is a behavioral test used to measure the efficiency of spatial navigation. It is an optimization problem, in which a number of baited targets are placed in an arena, and as the subject travels between the targets, the route is recorded and compared to chance and optimal routes.
Blaser RE.
europepmc +5 more sources
Comparative Study of Variations in Quantum Approximate Optimization Algorithms for the Traveling Salesman Problem. [PDF]
Entropy (Basel), 2023 The traveling salesman problem (TSP) is one of the most often-used NP-hard problems in computer science to study the effectiveness of computing models and hardware platforms.
Qian W +5 more
europepmc +3 more sources
Penyelesaian Travelling Salesman Problem (TSP) Menggunakan Algoritma Hill Climbing dan MATLAB
Matematika, 2018 Abstrak. Travelling Salesman Problem (TSP) adalah permasalahan dimana seorang salesman harus mengunjungi semua kota yang mana tiap kota hanya dikunjungi sekali, dan harus kembali ke kota asal.
Muhammad Irfan
doaj +3 more sources
A three-phase algorithm for the pollution traveling Salesman problem [PDF]
HeliyonThis paper studies a variant of the Pollution Traveling Salesman Problem (PTSP) focused on fuel consumption and pollution emissions (PTSPC). The PTSPC generalizes the well-known Traveling Salesman Problem (TSP), classified as NP-Hard.
Karen García-Vasquez +2 more
doaj +2 more sources
Efficient bit labeling in factorization machines with annealing for traveling salesman problem [PDF]
Scientific ReportsTo efficiently determine an optimum parameter combination in a large-scale problem, it is essential to convert the parameters into available variables in actual machines. Specifically, quadratic unconstrained binary optimization problems are solved using
Shota Koshikawa +2 more
doaj +2 more sources
Analisis Hibridisasi Pencarian Lokal Dengan Populasi Dalam Travelling Salesman Problem (TSP)
Jurnal Serambi Engineering, 2018 Traveling Salesman Problem (TSP) merupakan sebuah permasalah optimasi yang dapat diterapkan pada berbagai kegiatan seperti pendistribusian barang, pengambilan tagihan listirk dan pedagang keliling.
Erdiwansyah Erdiwansyah* +3 more
doaj +2 more sources
JOIN: Jurnal Online Informatika, 2018 Traveling salesman problem (TSP) is the problem of a salesman to visit the city of each city connected to each other and there is the weight of travel between the cities so as to form a complete weighted graph.
Rio Guntur Utomo +2 more
doaj +3 more sources
Approximating the Euclidean traveling salesman problem (TSP)
, 2011 Sariel Har-Peled
openaire +2 more sources
Solving the clustered traveling salesman problem via traveling salesman problem methods [PDF]
PeerJ Computer Science, 2022 The Clustered Traveling Salesman Problem (CTSP) is a variant of the popular Traveling Salesman Problem (TSP) arising from a number of real-life applications.
Yongliang Lu, Jin-Kao Hao, Qinghua Wu
doaj +2 more sources
Pointerformer: Deep Reinforced Multi-Pointer Transformer for the Traveling Salesman Problem [PDF]
AAAI Conference on Artificial Intelligence, 2023 Traveling Salesman Problem (TSP), as a classic routing optimization problem originally arising in the domain of transportation and logistics, has become a critical task in broader domains, such as manufacturing and biology.
Yan Jin +7 more
semanticscholar +1 more source