Sökning: "ant colony optimization"
Visar resultat 1 - 5 av 23 uppsatser innehållade orden ant colony optimization.
1. Investigating the Use of Digital Twins to Optimize Waste Collection Routes : A holistic approach towards unlocking the potential of IoT and AI in waste management
Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)Sammanfattning : Solid waste management is a global issue that affects everyone. The management of waste collection routes is a critical challenge in urban environments, primarily due to inefficient routing. This thesis investigates the use of real-time virtual replicas, namely Digital Twins to optimize waste collection routes. LÄS MER
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
Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)Sammanfattning : 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. LÄS MER
3. Multi-objective optimization for placing airspace surveillance observers
Master-uppsats, Göteborgs universitet/Institutionen för data- och informationsteknikSammanfattning : Reconnaissance is an important aspect of military planning. Tools that help an alysts monitor and make informed choices are vital for avoiding costly situations. The use of ground-based radar sensors is a common method for monitoring for both land-based and airborne threats. LÄS MER
4. On Embarrassingly Parallel Max- Min Ant Colony Optimization for Traveling Salesperson Problem
Kandidat-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)Sammanfattning : 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. LÄS MER
5. Comparative Analysis of Ant Colony Optimization and Genetic Algorithm in Solving the Traveling Salesman Problem
M1-uppsats, Blekinge Tekniska HögskolaSammanfattning : 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. LÄS MER