Sökning: "Traveling Salesman Problem"

Visar resultat 1 - 5 av 25 uppsatser innehållade orden Traveling Salesman Problem.

  1. 1. Velocity Control of a Mobile Charger in a Wireless Rechargeable Sensor Network

    Master-uppsats, KTH/Skolan för industriell teknik och management (ITM)

    Författare :Emilia Haltorp; [2023]
    Nyckelord :Wireless Sensor Networks; Mobile Charger; Wireless Energy Transfer; Traveling Salesman Problem; Trådlösa Sensornätverk; Mobil laddare; Trådlös strömöverföring; Handelsresandeprobleme;

    Sammanfattning : Wireless sensor networks (WSN) are one of the most rapidly evolving technical areas right now. They can be used in a lot of different applications, environmental monitoring and health applications being two examples. The sensors can be placed in hazardous and remote environments since there is no need for cabling or manual maintenance. LÄS MER

  3. 2. Optimization of Transport, Storage and Allocation of Production at Norra Timber

    Uppsats för yrkesexamina på avancerad nivå, Umeå universitet/Institutionen för fysik

    Författare :Jonatan Behndig; [2022]
    Nyckelord :;

    Sammanfattning : Optimization is a method that is, as the name suggests, used to find the    optimal solution for different problems. In practice the method is used for    many different purposes, everything from minimizing the distance traveled by a traveling salesman, to maximizing the storage capacity of a warehouse. LÄS MER

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

  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. A BINARY SPACE PARTITIONED ANT COLONY OPTIMIZATION ALGORITHM FOR THE TRAVELING SALESMAN PROBLEM

    Kandidat-uppsats, Mälardalens högskola/Akademin för innovation, design och teknik

    Författare :Niclas Ståhlbom; [2021]
    Nyckelord :ant colony optimization; ACO; aco; binary space partitioning; BSP; bsp; algorithm; optimization;

    Sammanfattning : A common type of problems that exist in both industrial and scientific spaces are optimization problems. These problems can be found in among other things manufacturing, pathfinding, network routing and more. Because of the wide area of application, optimization is well a studied area. LÄS MER