Results 1 to 10 of about 2,267 (186)
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
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
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
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
Traveling salesman path problems [PDF]
Mathematical Programming, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lam, F., Newman, A.
openaire +3 more sources
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
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
Applying Metaheuristic for Time-Dependent Traveling Salesman Problem in Postdisaster
International Journal of Computational Intelligence Systems, 2021 The Time-Dependent Traveling Salesman Problem (TDTSP) is a generalization of the Traveling Salesman Problem (TSP) and Traveling Repairman Problem (TRP). In the TSP and TRP, the travel time to travel is assumed to be constant.
Ha-Bang Ban
doaj +1 more source
Model Penentuan Rute Terpendek Penjemputan Sampah Menggunakan Metode MTSP dan Algoritma Genetika
Journal of Applied Computer Science and Technology, 2021 Garbage pick-ups performed by two or more people must have a route in their pickup. However, it is not easy to model the route of the pickup that each point must be passed and each point is only passed once.
Aswandi +2 more
doaj +1 more source
Intuitionistic fuzzy rule-base model for the time dependent traveling salesman problem [PDF]
Interdisciplinary Description of Complex Systems, 2020 The Traveling Salesman Problem (TSP) is a well-known combinatorial optimization problem. There are many different extensions and modifications of the original problem, such as The Time Dependent Traveling Salesman Problem (TDTSP), this specific extension
Ruba S. Almahasneh, László T. Kóczy
doaj +1 more source