Sökning: "Simulated annealing algorithm"

Visar resultat 1 - 5 av 55 uppsatser innehållade orden Simulated annealing algorithm.

  1. 1. Simulated annealing for Vehicular Ad-hoc Networks

    Master-uppsats, Linnéuniversitetet/Institutionen för fysik och elektroteknik (IFE)

    Författare :ETHISH VENUMBAKKA; [2023]
    Nyckelord :Simulated Annealing; Vehicle Ad Hoc Networks;

    Sammanfattning : In this thesis, we tackle a significant optimization challenge within Vehicular Ad Hoc Networks (VANETs) by employing a simulated annealing approach. We focus on developing an efficient Vehicle Routing Problem (VRP) algorithm to sift through numerous potential solutions and identify the best one. 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. A GPU Implementation of Kinodynamic Path Planning in Large Continuous Costmap Environments : Using Dijkstra's Algorithm and Simulated Annealing

    Master-uppsats, Karlstads universitet/Institutionen för ingenjörsvetenskap och fysik (from 2013)

    Författare :Robin Larsson; [2023]
    Nyckelord :;

    Sammanfattning : Path planning that takes kinodynamic constraints into account is a crucial part of critical missions where autonomous vehicles must function independently without communication from an operator as this ensures that the vehicle will be able to follow the planned path. In this thesis, an algorithm is presented that can plan kinodynamically feasible paths through large scale continuous costmap environments for different constraints on the maximum allowed acceleration and jerk along the path. LÄS MER

  5. 4. Coverage Motion Planning for Search and Rescue Missions : A Costmap Based Approach for fixed wing UAVs using Simulated Annealing &Cubic Splines

    Master-uppsats, Karlstads universitet/Institutionen för ingenjörsvetenskap och fysik (from 2013)

    Författare :Fredrik Rönnkvist; [2023]
    Nyckelord :Motion planning; Path planning; Cubic splines; Coverage path planning.;

    Sammanfattning : The present study proposes a novel approach to Coverage Path Planning for unmanned aerial vehicle (UAV) inspired by the Orienteering Problem. The main goal is to develop an algorithm suitable for Search and Rescue Missions, which can produce a search pattern with dynamical constrains, that is not limited to the traditional back-and-forth motion or spiral patterns. LÄS MER

  7. 5. Optimization and Bayesian Modeling of Road Distance for Inventory of Potholes in Gävle Municipality

    Kandidat-uppsats, Stockholms universitet/Statistiska institutionen

    Författare :Timothy Rafael Lindblom; Oskar Tollin; [2022]
    Nyckelord :Traveling salesman problem; Bayesian inference; Simulated annealing; Nearest neighbour algorithm; Markov Chain Monte Carlo; MCMC; Potholes; Haversine formula; Metropolis-Hastings; Posterior predictive distribution; Handelsresande problemet; bayesiansk inferens; simulerad anlöpning; nearest neighbour algorithm; Markov Chain Monte Carlo; MCMC; potthål; storcirkelavstånd; Metropolis-Hastings; posterior predictive distribution;

    Sammanfattning : Time management and distance evaluation have long been a difficult task for workers and companies. This thesis studies 6712 pothole coordinates in Gävle municipality, and evaluates the minimal total road distance needed to visit each pothole once, and return to an initial pothole. LÄS MER