Sökning: "handelsresandeproblemet"

Visar resultat 1 - 5 av 13 uppsatser innehållade ordet handelsresandeproblemet.

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

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

    Master-uppsats, KTH/Geoinformatik

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

    Sammanfattning : 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. LÄS MER

  5. 4. Optimering av varutransport med Mixed integer Linear Programming : En effektivisering av körsträckor när två tidigare separata transporter med olika produker kombineras.

    Kandidat-uppsats, Mittuniversitetet/Institutionen för informationssystem och –teknologi

    Författare :Felix Nordling; Simon Sandberg; [2022]
    Nyckelord :Mixed integer linear programming; multi-commodity network flow; transport logistics; goods transport; closed-loop logistic network; multi-period problem; traveling salesperson problem; Mixad heltalslinjärprogrammering; multivaru nätverksflöde; transportlogistik; varutransport; slutna logistiknätverk; flerperiodsproblem; handelsresandeproblemet;

    Sammanfattning : The purpose of this paper is to increase the routing efficiency of two previously separate commodity transports. By combining them in a common, multi-commodity network flow (MCNF). A Mixed Integer Linear Programming (MILP) model is used to minimize the mileage that is needed to fulfill demand in the different destinations of the transport network. LÄS MER

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

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

    Författare :Mohamed Mohsin; Ajanth Thangavelu; [2021]
    Nyckelord :;

    Sammanfattning : 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. LÄS MER