相关论文: The Centred Traveling Salesman at Finite Temperatu…
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…
The Traveling Salesman Problem (often called TSP) is a classic algorithmic problem in the field of computer science and operations research. It is an NP-Hard problem focused on optimization. TSP has several applications even in its purest…
The Colored Points Traveling Salesman Problem (Colored Points TSP) is introduced in this work as a novel variation of the traditional Traveling Salesman Problem (TSP) in which the set of points is partitioned into multiple classes, each of…
In this research, we discuss the intermittent traveling salesman problem (ITSP), which extends the traditional traveling salesman problem (TSP) by imposing temperature restrictions on each node. These additional constraints limit the…
In the Traveling Salesman Problem (TSP), a list of cities and the distances between them are given. The goal is to find the shortest possible route that visits each city exactly once and returns to the original city. The TSP has a wide…
In this work we revisit the Hopfield-Tank algorithm for the traveling salesman problem (TSP) and report encouraging results, with a different dynamics, that makes the algorithm more efficient finding better solutions in much less…
The traveling salesman (or salesperson) problem, short TSP, is a problem of strong interest to many researchers from mathematics, economics, and computer science. Manifold TSP variants occur in nearly every scientific field and application…
We describe a hybrid procedure for solving the traveling salesman problem (TSP) to provable optimality. We first sparsify the instance, and then use a hybrid algorithm that combines a branch-and-cut TSP solver with a Hamiltonian cycle…
We study a travelling salesman problem where the path is optimized with a cost function that includes its length $L$ as well as a certain measure $C$ of its distance from the geometrical center of the graph. Using simulated annealing (SA)…
This work presents a tensor-network formulation of the Traveling Salesman Problem (TSP) and several of its variants. The approach represents candidate tours with tensor-network layers, weights them by Boltzmann factors, and enforces…
We show that the traveling salesman problem (TSP) and its many variants may be modeled as functional optimization problems over a graph. In this formulation, all vertices and arcs of the graph are functionals; i.e., a mapping from a space…
This paper describes TSP exact solution of polynomial complexity. It is considered properties of proposed method. Effectiveness of proposed solution is illustrated by outcomes of computer modeling.
An important variant of the classic Traveling Salesman Problem (TSP) is the Dynamic TSP, in which a system with dynamic constraints is tasked with visiting a set of n target locations (in any order) in the shortest amount of time. Such…
Traveling Salesman Problem (TSP) is a decision-making problem that is essential for a number of practical applications. Today, this problem is solved on digital computers exploiting Boolean-type architecture by checking one by one a number…
This paper explores a variation of the Traveling Salesperson Problem, where the agent places a circular obstacle next to each node once it visits it. Referred to as the Traveling Salesperson Problem with Circle Placement (TSP-CP), the aim…
We study the finite temperature statistical mechanics of Hamiltonian paths between a set of N quenched randomly distributed points in a finite domain D. The energy of the path is a function of the distance between neighboring points on the…
This paper proposes an algorithmic method to heuristically solve the famous Travelling Salesman Problem (TSP) when the salesman's path evolves in continuous state space and discrete time but with otherwise arbitrary (nonlinear) dynamics.…
The Traveling Salesman Problem (TSP) is among the most famous NP-hard optimization problems. We design for this problem a randomized polynomial-time algorithm that computes a (1+eps)-approximation to the optimal tour, for any fixed eps>0,…
The Travelling Salesman Problem (TSP) is a classical combinatorial optimisation problem. Deep learning has been successfully extended to meta-learning, where previous solving efforts assist in learning how to optimise future optimisation…
We extend a previous statistical mechanical treatment of the traveling salesman problem by defining a discrete "site disordered'' problem in which fluctuations about saddle points can be computed. The results clarify the basis of our…