Sökning: "Ant Colony optimering"

Hittade 4 uppsatser innehållade orden Ant Colony optimering.

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

  4. 3. Bayesian Parameter Tuning of the Ant Colony Optimization Algorithm : Applied to the Asymmetric Traveling Salesman Problem

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

    Författare :Emmy Yin; Klas Wijk; [2021]
    Nyckelord :;

    Sammanfattning : The parameter settings are vital for meta-heuristics to be able to approximate the problems they are applied to. Good parameter settings are difficult to find as there are no general rules for finding them. Hence, they are often manually selected, which is seldom feasible and can give results far from optimal. LÄS MER

  5. 4. Ant Colony Optimization - Optimal Number of Ants

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

    Författare :Lars Pettersson; Christoffer Lundell Johansson; [2018]
    Nyckelord :;

    Sammanfattning : The focus of this thesis paper is to study the impact the number of ants has on the found solution of the Ant Colony Optimization (ACO) metaheuristic when solving the Traveling Salesman Problem. The goal was to find out how the length of the computed tours change for different amounts of ants within a limited number of iterations. LÄS MER