Essays about: "aco"
Showing result 1 - 5 of 15 essays containing the word aco.
-
1. A Comparative Study on Optimization Algorithms and its efficiency
University essay from Blekinge Tekniska Högskola/Institutionen för datavetenskapAbstract : Background: In computer science, optimization can be defined as finding the most cost-effective or notable achievable performance under certain circumstances, maximizing desired factors, and minimizing undesirable results. Many problems in the real world are continuous, and it isn't easy to find global solutions. READ MORE
-
2. Path and Route Planning for Indoor Monitoring with UAV : An Evaluation of Algorithms for Time-constrained Path and Route Planning in an Indoor Environment with Several Waypoints and Limited Battery Time
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : Unmanned flying vehicles (UAVs) are tools that can be used in a variety of scenarios. The most common areas of application are outdoors, where there are not many obstacles to take into consideration when planning a route. READ MORE
-
3. On Embarrassingly Parallel Max- Min Ant Colony Optimization for Traveling Salesperson Problem
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : Ant Colony Optimization (ACO) is a technique which can be used to find approximate Hamilton cycles for the Traveling Salesperson Problem (TSP). OpenMP is a framework which suites well for building multithreaded applications. READ MORE
-
4. Comparative Analysis of Ant Colony Optimization and Genetic Algorithm in Solving the Traveling Salesman Problem
University essay from Blekinge Tekniska HögskolaAbstract : Metaheuristics is a term for optimization procedures/algorithms that can be applied to a wide range of problems. These problems for which metaheuristics are used usually fall in the NP-hard category, meaning that they cannot be solved in polynomial time. This means that as the input dataset gets larger the time to solve increases exponentially. READ MORE
-
5. A BINARY SPACE PARTITIONED ANT COLONY OPTIMIZATION ALGORITHM FOR THE TRAVELING SALESMAN PROBLEM
University essay from Mälardalens högskola/Akademin för innovation, design och teknikAbstract : A common type of problems that exist in both industrial and scientific spaces are optimization problems. These problems can be found in among other things manufacturing, pathfinding, network routing and more. Because of the wide area of application, optimization is well a studied area. READ MORE