Results 81 to 90 of about 5,636,127 (168)
TSP--Infrastructure for the Traveling Salesperson Problem [PDF]
The traveling salesperson (or, salesman) problem (TSP) is a well known and important combinatorial optimization problem. The goal is to find the shortest tour that visits each city in a given list exactly once and then returns to the starting city ...
Kurt Hornik, Michael Hahsler
core
Cybernetics and Information TechnologiesWireless Sensor Networks (WSNs) are extensively used for monitoring large-scale areas with sensors having different coverage zones. Unmanned Aerial Vehicles (UAVs) are deployed to efficiently collect data from these distributed nodes.
Matkurbanov Tulkin +3 more
doaj +1 more source
Multi-UAV Formation Path Planning Based on Compensation Look-Ahead Algorithm
DronesThis study primarily studies the shortest-path planning problem for unmanned aerial vehicle (UAV) formations under uncertain target sequences. In order to enhance the efficiency of collaborative search in drone clusters, a compensation look-ahead ...
Tianye Sun +3 more
doaj +1 more source
Revista Produção Online, 2014 In this paper, we propose new heuristic methods for solver the Clustered Traveling Salesman Problem (CTSP). The CTSP is a generalization of the Traveling Salesman Problem (TSP) in which the set of vertices is partitioned into disjoint clusters and ...
Mário Mestria
doaj +1 more source
THE DUBINS TRAVELING SALESMAN PROBLEM WITH CONSTRAINED COLLECTING MANEUVERS
Acta Polytechnica CTU Proceedings, 2016 In this paper, we introduce a variant of the Dubins traveling salesman problem (DTSP) that is called the Dubins traveling salesman problem with constrained collecting maneuvers (DTSP-CM).
Petr Váňa, Jan Faigl
doaj +1 more source
Dataset for the electric capacitated traveling salesman problem. [PDF]
Data Brief, 2023 Gialos A, Zeimpekis V.
europepmc +1 more source
Traveling salesman problem solution using magnonic combinatorial device. [PDF]
Sci Rep, 2023 Balinskyy M, Khitun A.
europepmc +1 more source
Heuristics and Learning Models for Dubins MinMax Traveling Salesman Problem. [PDF]
Sensors (Basel), 2023 Nayak A, Rathinam S.
europepmc +1 more source
A review of the Tabu Search Literature on Traveling Salesman Problems [PDF]
The Traveling Salesman Problem (TSP) is one of the most widely studied problems inrncombinatorial optimization. It has long been known to be NP-hard and hence research onrndeveloping algorithms for the TSP has focused on approximate methods in addition ...
Sumanta Basu, Ghosh, Diptesh
core
Comparative Study of Variations in Quantum Approximate Optimization Algorithms for the Traveling Salesman Problem. [PDF]
Entropy (Basel), 2023 Qian W +5 more
europepmc +1 more source