Essays about: "Traveling Salesman Problem"
Showing result 11 - 15 of 21 essays containing the words Traveling Salesman Problem.
-
11. Optimal Control of Heat Transfer Rates in Turbochargers
University essay from Linköpings universitet/FordonssystemAbstract : The turbocharger is an important component of competitive environmentally friendly vehicles. Mathematical models are needed for controlling turbochargers in modern vehicles. READ MORE
-
12. Ant Colony Optimization Algorithms : Pheromone Techniques for TSP
University essay from KTH/Skolan för datavetenskap och kommunikation (CSC)Abstract : Ant Colony Optimization (ACO) uses behaviour observed in real-life ant colonies in order to solve shortest path problems. Short paths are found with the use of pheromones, which allow ants to communicate indirectly. READ MORE
-
13. Planning semi-autonomous drone photo missions in Google Earth
University essay from Mittuniversitetet/Avdelningen för data- och systemvetenskapAbstract : This report covers an investigation of the methods and algorithms required to plan and perform semi-autonomous photo missions on Apple iPad devices using data exported from Google Earth. Flight time was to be minimized, taking wind velocity and aircraft performance into account. READ MORE
-
14. Spatial runner : environmental and musical exposure effects on runners through an idealized routing network
University essay from Lunds universitet/Institutionen för naturgeografi och ekosystemvetenskapAbstract : Physical activities such as running have previously been proven to be positive on the health of individuals who partake in such activities. Further studies have separately analyzed the positive benefits of natural environments, such as forests, and positive effects of music on runners. READ MORE
-
15. Evaluating pheromone intensities and 2-opt local search for the Ant System applied to the Dynamic Travelling Salesman Problem
University essay from KTH/Skolan för datavetenskap och kommunikation (CSC)Abstract : Ant Colony Optimization (ACO) algorithms have been successful in solving a wide variety of NPhard optimization problems. The Traveling Salesman Problem (TSP) has served as a benchmarking problem for many novel ACO algorithms. READ MORE