Results 31 to 40 of about 21,266 (220)
Hybrid search with neighborhood reduction for the multiple traveling salesman problem
Computers & Operations Research, 2022 We present an e(cid:27)ective hybrid algorithm with neighborhood reduction for solving the multiple traveling salesman problem (mTSP). This problem aims to optimize one of the two objectives: to minimize the total traveling distance (the minsum mTSP) or ...
P. He, Jin‐Kao Hao
semanticscholar +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
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
Reinforcement learning for the traveling salesman problem with refueling
Complex & Intelligent Systems, 2021 The traveling salesman problem (TSP) is one of the best-known combinatorial optimization problems. Many methods derived from TSP have been applied to study autonomous vehicle route planning with fuel constraints.
A. L. Ottoni +3 more
semanticscholar +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
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
Combining Reinforcement Learning with Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problem [PDF]
AAAI Conference on Artificial Intelligence, 2020 We address the Traveling Salesman Problem (TSP), a famous NP-hard combinatorial optimization problem. And we propose a variable strategy reinforced approach, denoted as VSR-LKH, which combines three reinforcement learning methods (Q-learning, Sarsa and ...
Jiongzhi Zheng +4 more
semanticscholar +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