Results 11 to 20 of about 3,935 (225)

The Traveling Salesman Problem (TSP): A Spatial Navigation Task for Rats [PDF]

BIO-PROTOCOL, 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.
openaire   +5 more sources

Harnessing Time‐Dependent Magnetic Texture Dynamics via Spin‐Orbit Torque for Physics‐Enhanced Neuromorphic Computing [PDF]

Advanced Science, Volume 13, Issue 12, 27 February 2026.
A neuromorphic computing platform using spin‐orbit torque‐controlled magnetic textures is reported. The device implements bio‐inspired synaptic functions and achieves high performance in both pattern recognition (>93%) and combinatorial optimization (>95%), enabling unified processing of cognitive and optimization tasks.
Yifan Zhang, Yu Li, Huai Lin, Xinying Wang, Long Liu, Guoliang Xing, Di Wang, Zhihao Zhao, Zhipeng Guo, Junbo Yang, Jiebin Niu, Yan Sun, Tom Wu, Guozhong Xing   +13 more
wiley   +2 more sources

TSP – Infrastructure for the Traveling Salesperson Problem

Journal of Statistical Software, 2007
The traveling salesperson (or, salesman) problem (TSP) is a well known and important combinatorial optimization problem. The goal is to find the shortest tour that visits each city in a given list exactly once and then returns to the starting city ...
Michael Hahsler, Kurt Hornik
doaj   +1 more source

Efficient bit labeling in factorization machines with annealing for traveling salesman problem [PDF]

Scientific Reports
To 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, Aruto Hosaka, Tsuyoshi Yoshida   +2 more
doaj   +2 more sources

A three-phase algorithm for the pollution traveling Salesman problem [PDF]

Heliyon
This 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, Rodrigo Linfati, John Willmer Escobar   +2 more
doaj   +2 more sources

Ant colony optimization with direct communication for the traveling salesman problem [PDF]

, 2010
This article is posted here with permission from IEEE - Copyright @ 2010 IEEEAnts in conventional ant colony optimization (ACO) algorithms use pheromone to communicate.
Yang, S, Shengxiang Yang, Mavrovouniotis, M, Michalis Mavrovouniotis, Mavrovouniotis, Michalis, Yang, Shengxiang   +5 more
core   +5 more sources

Parallel DNA Algorithms of Generalized Traveling Salesman Problem-Based Bioinspired Computing Model

International Journal of Computational Intelligence Systems, 2020
Generalized traveling salesman problem (GTSP) is a classical combinatorial optimization problem, in which the optimization goal is the minimum route combination. Since the GTSP is a more complex problem than the traveling salesman problem (TSP), the GTSP
Xiaomin Ren, Xiaoming Wang, Zhaocai Wang, Tunhua Wu   +3 more
doaj   +1 more source

Exact Minimum Lower Bound Algorithm for Traveling Salesman Problem [PDF]

International Journal of Industry and Sustainable Development, 2020
The Traveling Salesman Problem (TSP) is defined by a given finite number of (n) cities along with the cost of travel between each pair of them. It is required to find the tour with least cost to visit all of the cities and returning to the starting point.
Mohamed Eleiche
doaj   +1 more source

Solving the Clustered Traveling Salesman Problem via TSP methods

CoRR, 2020
The Clustered Traveling Salesman Problem (CTSP) is a variant of the popular Traveling Salesman Problem (TSP) arising from a number of real-life applications. In this work, we explore a transformation approach that solves the CTSP by converting it to the well-studied TSP. For this purpose, we first investigate a technique to convert a CTSP instance to a
Yongliang Lu, Jin-Kao Hao, Qinghua Wu 0002   +2 more
openaire   +2 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   +1 more source