Sökning: "Metaheuristics"

Visar resultat 6 - 10 av 17 uppsatser innehållade ordet Metaheuristics.

  1. 6. Finding Locally Unique IDs in Enormous IoT systems

    Uppsats för yrkesexamina på avancerad nivå, Luleå tekniska universitet/Institutionen för system- och rymdteknik

    Författare :Sebastian Yngman; [2022]
    Nyckelord :IoT; Internet of Things; Graph Coloring; Optimization;

    Sammanfattning : The Internet of Things (IoT) is an important and expanding technology used for a large variety of applications to monitor and automate processes. The aim of this thesis is to present a way to find and assign locally unique IDs to access points (APs) in enormous wireless IoT systems where mobile tags are traversing the network and communicating with multiple APs simultaneously. LÄS MER

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

  4. 8. Comparing Two-Phase Hybrid Metaheuristics for the University Course Timetabling Problem (UCTP)

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

    Författare :Isabella Andersson; Carl Petter Svensson; [2019]
    Nyckelord :;

    Sammanfattning : Timetabling is a time consuming and difficult task for large organizations. One popular research field is the university course timetabling problem (UCTP). UCTP is the NP-hard combinatorial problem of scheduling courses at a university while satisfying some constraints. LÄS MER

  5. 9. Using machine learning for resource provisioning to run workflow applications in IaaS Cloud

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

    Författare :William Våge; [2019]
    Nyckelord :;

    Sammanfattning : The rapid advancements of cloud computing has made it possible to execute large computations such as scientific workflow applications faster than ever before. Executing workflow applications in cloud computing consists of choosing instances (resource provisioning) and then scheduling (resource scheduling) the tasks to execute on the chosen instances. LÄS MER

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