Sökning: "Ant colony optimization"

Visar resultat 1 - 5 av 23 uppsatser innehållade orden Ant colony optimization.

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

    Författare :Aarati Medehal; [2023]
    Nyckelord :Internet of Things; Industry 4.0; Smart Cities; Artificial Intelligence; Travelling Salesman problem; Vehicle Routing Problems; Digital Twins; Waste collection; Optimization; Metaheuristics algorithms; Ant Colony Optimization; Simulated Annealing; Particle Swarm; Tabu Search; Genetic Algorithm; Ontology; Digital Twin Definition Language; Internet of Things; Industri 4.0; Smarta städer; Artificiell intelligens; Travelling Salesman problem; Vehicle Routing Problems; Digitala tvillingar; Sophämtning; Optimering; Metaheuristika algoritmer; Ant Colony optimering; Simulerad glödgning; Partikelsvärm; Tabu-sökning; Genetisk algoritm; Ontologi; Digitala tvillingar defintitionsspråk;

    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

  3. 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)

    Författare :Ola Johansson; [2022]
    Nyckelord :UAV; path planning; route planning; drone; combinatorial optimization; Ruttplanering; banplanering; vägplanering drönare; kombinatorisk optimisering;

    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

  4. 3. Multi-objective optimization for placing airspace surveillance observers

    Master-uppsats, Göteborgs universitet/Institutionen för data- och informationsteknik

    Författare :Amanda Anderson; [2021-08-13]
    Nyckelord :Facility location; multi-objective optimization; ant colony algorithm; genetic algorithm; pareto optimal; observer placement; 3D viewshed;

    Sammanfattning : 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

  5. 4. On Embarrassingly Parallel Max- Min Ant Colony Optimization for Traveling Salesperson Problem

    Kandidat-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Författare :Mohamed Mohsin; Ajanth Thangavelu; [2021]
    Nyckelord :;

    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

  7. 5. Comparative Analysis of Ant Colony Optimization and Genetic Algorithm in Solving the Traveling Salesman Problem

    M1-uppsats, Blekinge Tekniska Högskola

    Författare :Hatem Mohi El Din; [2021]
    Nyckelord :Ant colony optimization; genetic algorithm; metaheuristics; javascript; python; C#;

    Sammanfattning : 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