Results 11 to 20 of about 5,666,790 (163)
Exploiting planarity in separation routines for the symmetric traveling salesman problem [PDF]
, 2008 At present, the most successful approach for solving large-scale instances of the Symmetric Traveling Salesman Problem to optimality is branch-and-cut.
Adam N. Letchford +5 more
core +5 more sources
Good triangulations yield good tours [PDF]
, 2008 Consider the following heuristic for planar Euclidean instances of the traveling salesman problem (TSP): select a subset of the edges which induces a planar graph, and solve either the TSP or its graphical relaxation on that graph. In this paper, we give
Pearson, N +3 more
core +5 more sources
Computing compatible tours for the traveling salesman problem [PDF]
, 2011 We consider the following natural heuristic for the Symmetric Traveling Salesman Problem: solve the subtour relaxation, yielding a solution x*, and then find the best tour x-bar that is 'compatible' with x*, where compatible means that every subtour ...
Lodi, A +3 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 +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
TSP - Infrastructure for the Traveling Salesperson Problem [PDF]
, 2006 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.
Kurt Hornik +3 more
core +1 more source
Variants of the Traveling Salesman Problem
Studies in Business and Economics, 2019 This paper includes an introduction to the concept of spreadsheet optimization and modeling as it specifically applies to combinatorial problems. One of the best known of the classic combinatorial problems is the “Traveling Salesman Problem” (TSP).
Patterson Mike, Friesen Daniel
doaj +1 more source
Stability Analysis for the Modification Method Under the a Priori Strategy of the PTSP
IEEE Access, 2020 We propose in this paper a new formulation for the stability of the Traveling Salesman Problem (TSP) compared with its probabilistic version, the Probabilistic Traveling Salesman Problem (PTSP).
Mohamed Abdellahi Amar, Walid Khaznaji
doaj +1 more source
OPTIMAL TOUR CONSTRUCTIONS FOR MULTIPLE MOBILE ROBOTS [PDF]
Journal of Engineering Science and Technology, 2011 The attempts to use mobile robots in a variety of environments are currently being limited by their navigational capability, thus a set of robots must be configured for one specific environment. The problem of navigating an environment is the fundamental
AMIR A. SHAFIE
doaj
Tạp chí Khoa học Đại học Đà Lạt, 2017 The Traveling Salesman Problem (TSP) is the most prominent of the combinatorial optimization problems that belongs to NP-Hard. The best algorithm for solving TSP is the branch-bound algorithm with exponential-time complexity.
Đỗ Như An
doaj +1 more source