Sökning: "Simulerad glödgning"

Hittade 5 uppsatser innehållade orden Simulerad glödgning.

  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. Shift Design and Driver Scheduling Problem

    Master-uppsats, KTH/Optimeringslära och systemteori

    Författare :Criss Alvianto Priyanto; [2018]
    Nyckelord :Integer Linear Programming; Scheduling Problem; Shift-design problem; Genetic Algorithm; Simulated Annealing; Integer Linjar Programmering; Schemaläggning Problem; Skift Design;

    Sammanfattning : Scheduling problem and shift design problems are well known NP-hard problems within the optimization area. Often time, the two problems are studied individually. In this thesis however, we are looking at the combination of both problems. LÄS MER

  4. 3. A Comparative Study between Genetic Algorithm, Simulated Annealing and a Hybrid Algorithm for solving a University Course Timetabling Problem

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

    Författare :Alzahraa Salman; Rouwayd Hanna; [2018]
    Nyckelord :;

    Sammanfattning : Every year, universities are faced with the problem of having to schedule events to various resources such as lecturers, classrooms and time slots while considering different constraints. The University Course Timetabling Problem is a NP-complete combinatorial optimization problem that, if solved manually, requires great investment in time and money. LÄS MER

  5. 4. A comparative study between a simulated annealing and a genetic algorithm for solving a university timetabling problem

    Kandidat-uppsats, KTH/Skolan för datavetenskap och kommunikation (CSC)

    Författare :Rasmus Fredrikson; Jonas Dahl; [2016]
    Nyckelord :Simulated annealing; Genetic algorithm; University timetabling problem;

    Sammanfattning : The university timetabling problem is an NP-complete problem which schools all over the world face every semester. The aim of the problem is to schedule sets of events such as lectures and seminars into certain time slots without violating numerous specified constraints. LÄS MER

  7. 5. Parallel algorithms of timetable generation

    Master-uppsats, Blekinge Tekniska Högskola/Sektionen för datavetenskap och kommunikation

    Författare :Łukasz Antkowiak; [2013]
    Nyckelord :school timetable; branch and bound simulated annealing; parallel algorithms;

    Sammanfattning : Context: Most of the problem of generating timetable for a school belongs to the class of NP-hard problems. Complexity and practical value makes this kind of problem interesting for parallel computing. Objectives: This paper focuses on Class-Teacher problem with weighted time slots and proofs that it is NP-complete problem. LÄS MER