Results 1 to 10 of about 981 (135)
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).
Mengchu Zhou, Xianzhong Dai
exaly +3 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
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 +2 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
Traveling salesman games [PDF]
Mathematical Programming, 1992 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Potters, J.A.M., Curiel, I., Tijs, S.H.
openaire +6 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
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
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
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
An ant colony genetic fusion routing algorithm based on soft define network
IET Networks, EarlyView., 2022 Abstract Aiming at the problem that there are many paths in data forwarding in soft define network (SDN) network, and the optimal path is difficult to find, combined with the advantages of ant colony algorithm and Genetic algorithm (GA), a routing control strategy based on the ant colony genetic fusion algorithm is proposed.
Kaixin Zhao, Yong Wei, Yang Zhang
wiley +1 more source