Essays about: "Handelsresandeproblemet"

Showing result 1 - 5 of 10 essays containing the word Handelsresandeproblemet.

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

    University essay from Linköpings universitet/Tillämpad matematik; Linköpings universitet/Tekniska fakulteten

    Author : Corina Hüni; [2023]
    Keywords : 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;

    Abstract : Snow removal is an important optimization problem in countries with snowfall. Bus stops can only be cleared after the adjacent street is cleared. READ MORE

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

    University essay from KTH/Skolan för industriell teknik och management (ITM)

    Author : Emilia Haltorp; [2023]
    Keywords : 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;

    Abstract : 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. READ MORE

  4. 3. Randomized heuristic scheduling of electrical distribution network maintenance in spatially clustered balanced zones

    University essay from KTH/Geoinformatik

    Author : Carolina Offenbacher; Ellen Thornström; [2022]
    Keywords : Capacitated Vehicle Routing Problem; Electrical distribution network; Heuristic algorithm; Scheduling; Handelsresandeproblemet; Eldistributionsnätverk; Heurustik algortim; Schemaläggning;

    Abstract : Reliable electricity distribution systems are crucial; hence, the maintenance of such systems is highly important, and in Sweden strictly regulated. Poorly planned maintenance scheduling leads unnecessary driving which contributes to increased emissions and costs. READ MORE

  5. 4. On Embarrassingly Parallel Max- Min Ant Colony Optimization for Traveling Salesperson Problem

    University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Author : Mohamed Mohsin; Ajanth Thangavelu; [2021]
    Keywords : ;

    Abstract : Ant Colony Optimization (ACO) is a technique which can be used to find approximate Hamilton cycles for the Traveling Salesperson Problem (TSP). OpenMP is a framework which suites well for building multithreaded applications. READ MORE

  6. 5. Bayesian Parameter Tuning of the Ant Colony Optimization Algorithm : Applied to the Asymmetric Traveling Salesman Problem

    University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Author : Emmy Yin; Klas Wijk; [2021]
    Keywords : ;

    Abstract : The parameter settings are vital for meta-heuristics to be able to approximate the problems they are applied to. Good parameter settings are difficult to find as there are no general rules for finding them. Hence, they are often manually selected, which is seldom feasible and can give results far from optimal. READ MORE