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 2 of 2 for “"multiple traveling salesman problem"”.

  1. 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 …

    umkc Repository record for Assessment of genetic algorithm based assignment strategies for unmanned systems using the multiple traveling salesman problem with moving targets (opens in a new tab)

  2. Scalable Autonomous Operations of Unmanned Assets

    … and cooperative tactics for the operations of multiple UAVs using GA based multiple Traveling Salesman Problem (mTSP) which is solved by dividing into $m$ number of Traveling Salesman Problems (TSP) using two region division methods such as Uniform Region Division (URD) and K-means Voronoi …

    purdue-thes Repository record for Scalable Autonomous Operations of Unmanned Assets (opens in a new tab)