Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 9 of 9 for “"Multiple Traveling Salesmen Problem"”.
-
Design and Application of Genetic Algorithms for the Multiple Traveling Salesperson Assignment Problem
The multiple traveling salesmen problem (MTSP) is an extension of the traveling salesman problem with many production and scheduling applications. The TSP has been well studied including methods of solving the problem with genetic algorithms. The MTSP has also been studied and solved with GAs in …
-
OPTIMIZING ENERGY EFFICIENT UAV ROUTING IN SUPPORT OF MARINE CORPS EXPEDITIONARY ADVANCED BASE OPERATIONS
… lower risk to the force. This work addresses the problem of last-mile resupply using multiple autonomous UAVs. We develop an optimal UAV routing system, which creates the optimal energy-efficient flight paths for the UAVs between resupply nodes, accounting for changing wind conditions. The optimal …
-
Assessment of genetic algorithm based assignment strategies for unmanned systems using the multiple traveling salesman problem with moving targets
… fixed-base defense systems. One solution to this problem is weaponizing friendly unmanned systems to hunt and kill hostile unmanned systems. However, the assignment and path planning of these “Hunter-Killer” systems to incoming hostile unmanned systems, in a multiple friendly versus multiple enemy …
-
Combinatorial Path Planning for a System of Multiple Unmanned Vehicles
In this dissertation, the problem of planning the motion of m Unmanned Vehicles (UVs) (or simply vehicles) through n points in a plane is considered. A motion plan for a vehicle is given by the sequence of points and the corresponding angles at which each point must be visited by the vehicle. We …
-
Heurisic approaches for no-depot k-traveling salesmen problem with a minmax objective
This thesis deals with the no-depot minmax Multiple Traveling Salesmen Problem (MTSP), which can be formulated as follows. Given a set of n cities and k salesmen,find k disjoint tours (one for each salesmen) such that each city belongs to exactly one tour and the length of the longest of k tours is …
-
Routing Vehicles with Motion, Resource and Mission Constraints: Algorithms and Bounds
… etc. This thesis considers the path planning problems for UAVs while satisfying a class of constraints. We consider a multiple depot UAV routing problem, where the vehicles have motion constraints due to bound on their yaw-rate. For a given set of targets, it is required that each target …
-
Enhancing the efficiency of multi-drone missions through strategic deployment and path planning optimizations
… metaheuristic optimization, formulating the problem as a Planar Location Routing Problem. The genetic algorithm implementation devised achieves 97-100\% accuracy, compared to exhaustive search methods, while reducing computational requirements by up to four orders of magnitude. Smart …
-
Algorithms for Routing Unmanned Vehicles with Motions, Resource, and Communication Constraints
Multiple small autonomous or unmanned aerial and ground vehicles are being used together with stationary sensing devices for a wide variety of data gathering, monitoring and surveillance applications in military, civilian, and agricultural applications, to name a few. Even though there are several …
-
Modeling and Analysis of a Feedstock Logistics Problem
… dissertation, we address a feedstock logistics problem associated with the delivery of switchgrass for conversion into biofuel. In order to satisfy the continual demand of biomass at a bioenergy plant, production fields within a 48-km radius of its location are assumed to be attracted into …