Results 91 to 100 of about 59,482 (207)

The 2-period balanced traveling salesman problem [PDF]

In the 2-period Balanced Traveling Salesman Problem (2B-TSP), the customers must be visited over a period of two days: some must be visited daily, and the others on alternate days (even or odd days); moreover, the number of customers visited in every ...
Francesco Mason, Tatiana Bassetto
core  

New Heuristic Algorithms for Solving Single-Vehicle and Multi-Vehicle Generalized Traveling Salesman Problems (GTSP) [PDF]

Journal of Optimization in Industrial Engineering, 2010
Among numerous NP-hard problems, the Traveling Salesman Problem (TSP) has been one of the most explored, yet unknown one. Even a minor modification changes the problem’s status, calling for a different solution.
Ellips Masehian
doaj  

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

Multi-UAV Formation Path Planning Based on Compensation Look-Ahead Algorithm

Drones
This 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, Wei Sun, Changhao Sun, Ruofei He   +3 more
doaj   +1 more source

Heuristic methods using variable neighborhood random local search for the clustered traveling salesman problem

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

Approximating 1-dimensional TSP Requires Omega(n log n) Comparisons

, 2013
We give a short proof that any comparison-based n^(1-epsilon)-approximation algorithm for the 1-dimensional Traveling Salesman Problem (TSP) requires Omega(n log n) comparisons.Comment: Superseded by "On the complexity of approximating Euclidean ...
Young, Neal E.
core  

Advanced Trajectory Planning for Unmanned Aerial Vehicles in the Context of Data Collection from Spatially Distributed Wireless Sensor Networks

Cybernetics and Information Technologies
Wireless 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, Utegenov Akhmet, Davlatyor Mengliyev, Matkurbonov Dilshod   +3 more
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

The Symmetric Traveling Salesman Problem

, 2005
Let M be an nXn symetric matrix, n, even, T, an upper bound for T_OPT, an optimal tour, sigma_T, the smaller-valued perfect matching obtained from alternate edges of T expressed as a product of 2-cycles. Applying the modified Floyd-Warshall algorithm to (sigma_T)^-1M^-, we construct acceptable and 2-circuit cycles some sets of which may yield circuits ...
openaire   +3 more sources