Sökning: "Travelling Salesman Problem"

Visar resultat 1 - 5 av 15 uppsatser innehållade orden Travelling Salesman Problem.

  1. 1. Optimization Methods for Snow Removal of Bus Stops

    L3-uppsats, Linköpings universitet/Tillämpad matematik; Linköpings universitet/Tekniska fakulteten

    Författare :Corina Hüni; [2023]
    Nyckelord :Snow removal; Travelling Salseman Problem with Time Windows; Heuristic; Local search; Tabu search; Snöröjning; Handelsresandeproblemet med Tidsfönster; Heuristik; Lokalsökning; Tabusökning;

    Sammanfattning : Snow removal is an important optimization problem in countries with snowfall. Bus stops can only be cleared after the adjacent street is cleared. LÄS MER

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

  4. 3. D-Wave Systems Quantum Computing : State-of-the-Art and Performance Comparison with Classical Computing

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

    Författare :Jaime Vallejo Benítez Cano; [2021]
    Nyckelord :;

    Sammanfattning : The aim of this project is to study Quantum Computing state-of-art and to compare it with classical computing methods. The research is focused on D-Wave Systems’ Quantum Computing approach, exploring its architectures: Chimera and Pegasus; tools, and its Quantum Annealing process. LÄS MER

  5. 4. Tillämpning av en heuristisk algoritm på ett verkligt Period Traveling Salesman Problem och dess effekter på en verksamhet

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

    Författare :Melker Duberg; Filip Sandström; [2021]
    Nyckelord :;

    Sammanfattning : In the Period Travelling Salesman Problem, a salesman must visit a series of stores in a given amount of periods, starting and ending each day in the same home point. In this paper a heuristic algorithm is implemented and tested on a real data set. LÄS MER

  7. 5. Route Planning and Design of Autonomous Underwater Mine Reconnaissance Through Multi-Vehicle Cooperation

    Master-uppsats, Linköpings universitet/Fordonssystem

    Författare :Jakob Hanskov Palm; [2020]
    Nyckelord :autonomous underwater vehicle; AUV; multi-vehicle cooperation; route planning; mine reconnaissance; travelling salesman problem; TSP; genetic algorithm; simulated annealing; dubins path;

    Sammanfattning : Autonomous underwater vehicles have become a popular countermeasure to naval mines. Saab’s AUV62-MR detects, locates and identifies mine-like objects through three phases. By extracting functionality from the AUV62-MR and placing it on a second vehicle, it is suggested that the second and third phases can be performed in parallel. LÄS MER