Results 21 to 30 of about 15,296 (207)
Lin-Kernighan Heuristic Adaptations for the Generalized Traveling Salesman Problem [PDF]
, 2010 The Lin-Kernighan heuristic is known to be one of the most successful heuristics for the Traveling Salesman Problem (TSP). It has also proven its efficiency in application to some other problems.
Balas +24 more
core +3 more sources
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
IMPLEMENTASI ALGORITMA I-SOS DALAM PENYELESAIAN TRAVELING SALESMAN PROBLEM (TSP)
TEKNIMEDIA: Teknologi Informasi dan Multimedia, 2021 The problem with TSP is an attempt to find the shortest distance traveled by a salesman in visiting each city without having to visit the same city more than once. The purpose of implementing the I-SOS algorithm in this case is to find the minimum distance traveled, a solution can be obtained after going through the calculation of the mutualism phase ...
null Zulkarnaen Zulkarnaen +1 more
openaire +2 more sources
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
Solving Travelling Salesman Problem (TSP) by Hybrid Genetic Algorithm (HGA) [PDF]
International Journal of Advanced Computer Science and Applications, 2020 The Traveling Salesman Problem (TSP) is easy to qualify and describe but difficult and very hard to be solved. There is known algorithm that can solve it and find the ideal outcome in polynomial time, so it is NP-Complete problem. The Traveling Salesman Problem (TSP) is related to many others problems because the techniques used to solve it can be ...
openaire +1 more source
Solving the Clustered Traveling Salesman Problem via TSP methods
, 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
Lu, Yongliang, Hao, Jin-Kao, Wu, Qinghua
openaire +2 more sources
Computing with Domino-Parity Inequalities for the Traveling Salesman Problem (TSP) [PDF]
INFORMS Journal on Computing, 2007 We describe methods for implementing separation algorithms for domino-parity inequalities for the symmetric traveling salesman problem. These inequalities were introduced by Letchford (2000), who showed that the separation problem can be solved in polynomial time when the support graph of the LP solution is planar.
William Cook +2 more
openaire +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
The embedding of the traveling salesman problem in a Markov Decision Process [PDF]
, 1987 In this paper we derive a new LP-relaxation of the Traveling Salesman Problem (TSP, for short). This formulation comes from first embedding the TSP in a Markov Decision Process (MDP: for short), and from perturbing this MDP ...
Filar, Jerzy A, Krass, Dmitry
core +1 more source
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