28(5), Cybern. B IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics), Sathyan, A., Boone, N., and Cohen, K. (2015). of Approximate Approaches to “Comparison Solving the Travelling Salesman Problem and its Application to UAV Swarming.” International 3(1), 1–16. Journal of Unmanned Systems Engineering IJUSEng, APPENDIX I: NOMENCLATURE USED NP-hard a question that can be solved in non-deterministic polynomial time – Two-Opt - an algorithm that exchanges a pair of between cities that will stop when a tour is reached that connects all the cities, routes back to the initial point, and when the distance cannot be improved with any further exchanges Genetic Algorithm an algorithm that relies on the mechanisms behind organic evolution to find an – optimal solution MATLAB software for engineers where the testing for this research was completed – Optimization finding the maximum or minimum value of a function – Traveling Salesman Problem a question of finding an optimal route for a salesman to travel that – starts at one city and ends at the same city. The problem is to find the shortest distance to visit all the cities once and has the least cost associated with the trip. D Total distanced travelled by travelling salesman following tour T, whichi, is also the cost function – dij Distance between the ith and jth targets – Ei,j Length of the edge connecting the targets in the ith and jth tour T – n Number of targets – N Set of indices defining the targets – T Vector representing the tour –
Cybern. B IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics), 28(5), Sathyan, A., Boone, N., and Cohen, K. (2015). “Comparison of Approximate Approaches to Solving the Travelling Salesman Problem and its Application to UAV Swarming.” International Journal of Unmanned Systems Engineering IJUSEng, 3(1), 1–16. APPENDIX I: NOMENCLATURE USED NP-hard – a question that can be solved in non-deterministic polynomial time Two-Opt - an algorithm that exchanges a pair of between cities that will stop when a tour is reached that connects all the cities, routes back to the initial point, and when the distance cannot be improved with any further exchanges Genetic Algorithm – an algorithm that relies on the mechanisms behind organic evolution to find an optimal solution MATLAB – software for engineers where the testing for this research was completed Optimization – finding the maximum or minimum value of a function Traveling Salesman Problem – a question of finding an optimal route for a salesman to travel that starts at one city and ends at the same city. The problem is to find the shortest distance to visit all the cities once and has the least cost associated with the trip. D – Total distanced travelled by travelling salesman following tour T, whichi, is also the cost function dij – Distance between the ith and jth targets Ei,j – Length of the edge connecting the targets in the ith and jth tour T n – Number of targets N – Set of indices defining the targets T – Vector representing the tour
TEAM%20PROJECT%203%20REPORT_Final.docx