Results 1 to 10 of about 72,947 (187)
Solving the clustered traveling salesman problem via traveling salesman problem methods [PDF]
PeerJ Computer Science, 2022 The Clustered Traveling Salesman Problem (CTSP) is a variant of the popular Traveling Salesman Problem (TSP) arising from a number of real-life applications.
Yongliang Lu, Jin-Kao Hao, Qinghua Wu
doaj +5 more sources
Colored Traveling Salesman Problem
IEEE Transactions on Cybernetics, 2015 The multiple traveling salesman problem (MTSP) is an important combinatorial optimization problem. It has been widely and successfully applied to the practical cases in which multiple traveling individuals (salesmen) share the common workspace (city set).
Jun Li, MengChu Zhou
exaly +3 more sources
A three-phase algorithm for the pollution traveling Salesman problem [PDF]
HeliyonThis 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 +2 more
doaj +2 more sources
A one-commodity pickup-and-delivery traveling salesman problem solved by a two-stage method: A sensor relocation application. [PDF]
PLoS ONE, 2019 In the carrier-based coverage repair problem, a single mobile robot replaces damaged sensors by picking up spare ones in the region of interest or carrying them from a base station in wireless sensor and robot networks.
Kun Miao +3 more
doaj +2 more sources
Review of Multiple Traveling Salesman Model and Its Application [PDF]
Jisuanji kexue yu tansuo, 2022 As a generalization of the classical traveling salesman problem (TSP), the multiple traveling salesman problem (MTSP) is one of the well-known combinatorial optimization problems.
ZHANG Shuohang, GUO Gaizhi
doaj +1 more source
Freakonometrics, 2017 International audience ; The traveling salesman problem is the task of determining an optimal path through several points and return to the starting point.
Lihoreau, Mathieu +2 more
openaire +4 more sources
A Natural Approach to Solving the Traveling Salesman Problem
Кібернетика та комп'ютерні технології, 2023 Introduction. The traveling salesman problem is a transport-type problem. It is natural to use a method based on the technology for solving transport problems to solve it.
Dmitri Terzi
doaj +1 more source
Population-Based Algorithm for Solving the Traveling Salesman Problem
Современные информационные технологии и IT-образование, 2021 This article covers the population-based hybrid algorithm for solving the traveling salesman problem. The algorithm is built on two algorithms: the genetic algorithm and the particle swarm algorithm.
Elena Polupanova, Aleksey Polyakov
doaj +1 more source
Synchronized Traveling Salesman Problem
Journal of Graph Algorithms and Applications, 2021 We consider a variation of the well-known traveling salesman problem in which there are multiple agents who all have to tour the whole set of nodes of the same graph, while obeying node- and edge-capacity constraints require that agents must not "crash".
Pap, Gyula, Varnyú, József
openaire +3 more sources
Tabu Search Method for Solving the Traveling salesman Problem [PDF]
Al-Rafidain Journal of Computer Sciences and Mathematics, 2008 This research presents the fundamental concepts of tabu search for optimization problem as symmetric traveling salesman problem. The purpose of this research is to solve the traveling salesman problem with tabu search method, to find an optimal ...
Isra Alkallak, Ruqaya Sha’ban
doaj +1 more source