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 +3 more sources
Genetic Algorithm for Traveling Salesman Problem with Modified Cycle Crossover Operator. [PDF]
Comput Intell Neurosci, 2017 Genetic algorithms are evolutionary techniques used for optimization purposes according to survival of the fittest idea. These methods do not ensure optimal solutions; however, they give good approximation usually in time.
Hussain A +5 more
europepmc +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
How Good is Neural Combinatorial Optimization? A Systematic Evaluation on the Traveling Salesman Problem [PDF]
IEEE Computational Intelligence Magazine, 2022 Traditional solvers for tackling combinatorial optimization (CO) problems are usually designed by human experts. Recently, there has been a surge of interest in utilizing deep learning, especially deep reinforcement learning, to automatically learn ...
Shengcai Liu, Yu Zhang, K. Tang, X. Yao
semanticscholar +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
Circular Jaccard distance based multi-solution optimization for traveling salesman problems
Mathematical Biosciences and Engineering, 2022 Traveling salesman problem is a widely studied NP-hard problem in the field of combinatorial optimization. Many and various heuristics and approximation algorithms have been developed to address the problem.
Hui Li, Mengyao Zhang, Chenbo Zeng
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
Exact Methods for the Traveling Salesman Problem with Drone
Transportation Science, 2021 Efficiently handling last-mile deliveries becomes more and more important nowadays. Using drones to support classical vehicles allows improving delivery schedules as long as efficient solution methods to plan last-mile deliveries with drones are ...
R. Roberti, Mario Ruthmair
semanticscholar +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
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