Results 111 to 120 of about 166,209 (267)

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

Dataset for the electric capacitated traveling salesman problem. [PDF]

Data Brief, 2023
Gialos A, Zeimpekis V.
europepmc   +1 more source

Route Design in Sheepdog System--Traveling Salesman Problem Formulation and Evolutionary Computation Solution-- [PDF]

, 2023
Wataru Imahayashi, Yusuke Tsunoda, Masaki Ogura   +2 more
openalex   +1 more source

Heuristic methods for routing and scheduling [PDF]

, 2001
A locomotive assignment is one of the subproblems in railway scheduling domain. In this report present general mathematical model of this specific subproblem and describe how methods known from other problems domain like traveling salesman problem ...
Kocjan, Waldemar
core   +2 more sources

Phase Transitions and Backbones of the Asymmetric Traveling Salesman Problem

, 2011
In recent years, there has been much interest in phase transitions of combinatorial problems. Phase transitions have been successfully used to analyze combinatorial optimization problems, characterize their typical-case features and locate the hardest ...
Zhang, W.
core   +1 more source

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

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

Traveling salesman problem solution using magnonic combinatorial device. [PDF]

Sci Rep, 2023
Balinskyy M, Khitun A.
europepmc   +1 more source

The Extended k-opt Algorithm for Traveling Salesman Problem [PDF]

, 2012
Sang-Un Lee
openalex   +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