Sökning: "Vehicle Routing Problems"

Visar resultat 1 - 5 av 23 uppsatser innehållade orden Vehicle Routing Problems.

  1. 1. Transport logistics for a biogas plant : an approach for an optimal collection of manure from local farms by the planned biogas plant Biogas Väst Skaraborg AB

    Master-uppsats, SLU/Dept. of Economics

    Författare :Adam Landelius; William Wejsfelt; [2023]
    Nyckelord :VRP; IRP; VRPB; IRPB; logistics; optimising; biogas;

    Sammanfattning : Vehicle routing problems (VRPs) are a prevalent concern for businesses that rely on effective logistics to collect and transport items. Biogas Väst, a company that collects liquid manure from local farms and returns residue, is facing a VRP that includes both linehaul and backhaul operations. LÄS MER

  3. 2. Heuristic Clustering Methods for Solving Vehicle Routing Problems

    Kandidat-uppsats, KTH/Skolan för teknikvetenskap (SCI)

    Författare :Georgios Nordqvist; Erik Forsberg; [2023]
    Nyckelord :optimization; vehicle routing problem; sweep clustering; k-means clustering; hierarchical clustering;

    Sammanfattning : Vehicle Routing Problems are optimization problems centered around determining optimal travel routes for a fleet of vehicles to visit a set of nodes. Optimality is evaluated with regard to some desired quality of the solution, such as time-minimizing or cost-minimizing. LÄS MER

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

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

  7. 5. Grid-based Energy Aware Mobility Model for FANETs

    Master-uppsats, Luleå tekniska universitet/Institutionen för system- och rymdteknik

    Författare :Mohammad Messbah Uddin; [2022]
    Nyckelord :FANET; Clustering algorithm; Unmanned Aerial Vehicle UAV ; Grid-based clustering; Mobility model; energy consumption; sustainability;

    Sammanfattning : Drones flying in squad formation while interconnected in an ad-hoc fashion are called Flying Ad hoc Networks (FANETs). These FANETs are gathering special interests in the networking community in their deployment for different vital missions. LÄS MER