Sökning: "Metaheuristics algorithms"

Visar resultat 1 - 5 av 9 uppsatser innehållade orden Metaheuristics algorithms.

  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. Automatic text placement on maps using deep learning keypoint detection models

    Master-uppsats, Lunds universitet/Institutionen för naturgeografi och ekosystemvetenskap

    Författare :Azin Khosravi Khorashad; [2022]
    Nyckelord :machine learning; Stacked hourglass networks; attention mechanism; CNN; geomatics; Earth and Environmental Sciences;

    Sammanfattning : Labeling the map is one of the most essential parts of the cartographic process that requires a huge time and energy. It is proven that the automation of map labeling is an NP-hard problem. There have been many research studies that tried to solve it such as rule-based methods, metaheuristics, and integer programming. LÄS MER

  4. 3. Evaluation of bus networks designed by a metaheuristic algorithm : A case study in Södertälje, Sweden

    Master-uppsats, KTH/Transportplanering

    Författare :Manuel Chala Penagos; Anastasios Skoufas; [2022]
    Nyckelord :;

    Sammanfattning : This thesis evaluates the feasibility of bus networks’ implementation in a real life scenario designed by a metaheuristics algorithm called “Multi Objective Discrete Cuckoo Search (MODCS)”. The research focuses on evaluating the generated bus networks from two points of view: the first concerns a comparative analysis (quantitative part) of the algorithm’s results with the current bus network in Södertälje in terms of the operation and passenger costs. LÄS MER

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

  7. 5. Local search hybridization of a genetic algorithm for solving the University Course Timetabling Problem

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

    Författare :Mikael Forsberg; [2018]
    Nyckelord :Timetabling; University Course Timetabling Problem; Metaheuristics; Hybridization; Genetic Algorithm; Tabu Search; Schemaläggning; University Course Timetabling Problem; Metaheuristik; Hybridisering; Genetisk Algoritm; Tabusökning;

    Sammanfattning : The University Course Timetabling Problem (UCTP) is the problem of assigning locations (lecture halls, computer rooms) and time slots (time and date) to a set of events (lectures, labs) while satisfying a number of constraints such as avoiding double-bookings. Many variants of problem formulations exist, and most realistic variants are thought to be NP-hard. LÄS MER